{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s963136958", "group_id": "codeNet:p02536", "input_text": "module union_find_mod\n use,intrinsic :: iso_fortran_env\n private\n type,public:: union_find\n integer(int32),allocatable:: parent(:)\n contains\n procedure:: unite => uf_unite\n procedure:: root => uf_root\n end type\n\n interface union_find\n module procedure:: uf_init\n end interface\ncontains\n function uf_init(n) result(uf)\n type(union_find):: uf\n integer(int32):: n\n allocate(uf%parent, source=[(i,i=1,n)])\n end function\n\n\n function uf_root(uf,x) result(ret)\n class(union_find):: uf\n integer(int32):: x,ret\n\n ret = x\n do while(ret /= uf%parent(ret))\n ret = uf%parent(ret)\n end do\n end function\n\n\n subroutine uf_unite(uf,a,b)\n class(union_find):: uf\n integer(int32),intent(in):: a,b\n integer(int32):: ra, rb\n\n ra = uf%root(a); rb = uf%root(b)\n if (ra == rb) return\n uf%parent(ra) = rb\n end subroutine\nend module\n\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use union_find_mod\n implicit none\n integer(int32):: n,m,i,a,b,ans\n type(union_find):: uf\n integer(int32), allocatable:: cnt(:)\n\n\n read*, n,m\n uf = union_find(n)\n allocate(cnt(n),source=0)\n\n do i=1,m\n read*, a,b\n call uf%unite(a,b)\n end do\n\n do i=1,n\n cnt(uf%root(i)) = cnt(uf%root(i)) + 1\n end do\n ans=0\n do i=1,n\n if (cnt(i) > 0) ans=ans+1\n end do\n print'(i0)',ans-1\nend program main", "language": "Fortran", "metadata": {"date": 1601179949, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02536.html", "problem_id": "p02536", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02536/input.txt", "sample_output_relpath": "derived/input_output/data/p02536/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02536/Fortran/s963136958.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s963136958", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module union_find_mod\n use,intrinsic :: iso_fortran_env\n private\n type,public:: union_find\n integer(int32),allocatable:: parent(:)\n contains\n procedure:: unite => uf_unite\n procedure:: root => uf_root\n end type\n\n interface union_find\n module procedure:: uf_init\n end interface\ncontains\n function uf_init(n) result(uf)\n type(union_find):: uf\n integer(int32):: n\n allocate(uf%parent, source=[(i,i=1,n)])\n end function\n\n\n function uf_root(uf,x) result(ret)\n class(union_find):: uf\n integer(int32):: x,ret\n\n ret = x\n do while(ret /= uf%parent(ret))\n ret = uf%parent(ret)\n end do\n end function\n\n\n subroutine uf_unite(uf,a,b)\n class(union_find):: uf\n integer(int32),intent(in):: a,b\n integer(int32):: ra, rb\n\n ra = uf%root(a); rb = uf%root(b)\n if (ra == rb) return\n uf%parent(ra) = rb\n end subroutine\nend module\n\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use union_find_mod\n implicit none\n integer(int32):: n,m,i,a,b,ans\n type(union_find):: uf\n integer(int32), allocatable:: cnt(:)\n\n\n read*, n,m\n uf = union_find(n)\n allocate(cnt(n),source=0)\n\n do i=1,m\n read*, a,b\n call uf%unite(a,b)\n end do\n\n do i=1,n\n cnt(uf%root(i)) = cnt(uf%root(i)) + 1\n end do\n ans=0\n do i=1,n\n if (cnt(i) > 0) ans=ans+1\n end do\n print'(i0)',ans-1\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "sample_input": "3 1\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02536", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 3544}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s328900856", "group_id": "codeNet:p02536", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,m,i,a,b,cnt=0\n integer(int32), allocatable:: ar(:)\n\n\n read*, n,m\n allocate(ar, source=[(i,i=1,n)])\n\n do i=1,m\n read*, a,b\n ar(b) = p(a)\n end do\n do i=1,n\n ar(i) = p(ar(i))\n end do\n\n do i=2,n\n if (ar(i-1) /= ar(i)) cnt=cnt+1\n end do\n print'(i0)', cnt\ncontains\nrecursive function p(a) result(ret)\n integer(int32):: a,ret\n\n if (ar(a) == a) then\n ret = a\n else\n ret = p(ar(a))\n end if\nend function\nend program main", "language": "Fortran", "metadata": {"date": 1601169967, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02536.html", "problem_id": "p02536", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02536/input.txt", "sample_output_relpath": "derived/input_output/data/p02536/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02536/Fortran/s328900856.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s328900856", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,m,i,a,b,cnt=0\n integer(int32), allocatable:: ar(:)\n\n\n read*, n,m\n allocate(ar, source=[(i,i=1,n)])\n\n do i=1,m\n read*, a,b\n ar(b) = p(a)\n end do\n do i=1,n\n ar(i) = p(ar(i))\n end do\n\n do i=2,n\n if (ar(i-1) /= ar(i)) cnt=cnt+1\n end do\n print'(i0)', cnt\ncontains\nrecursive function p(a) result(ret)\n integer(int32):: a,ret\n\n if (ar(a) == a) then\n ret = a\n else\n ret = p(ar(a))\n end if\nend function\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "sample_input": "3 1\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02536", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 63, "memory_kb": 3536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s107495320", "group_id": "codeNet:p02536", "input_text": "program main\n\timplicit none\n\tinteger(8):: X,Y,C,N,M,i,j,t,k,D,E\n integer(8),dimension(1:100000):: A,B\n\tread *, N,M\n do i=1,M\n read *, A(i),B(i)\n end do\n write(*,*)N-M-1\n \n\nend program main", "language": "Fortran", "metadata": {"date": 1601169607, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02536.html", "problem_id": "p02536", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02536/input.txt", "sample_output_relpath": "derived/input_output/data/p02536/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02536/Fortran/s107495320.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s107495320", "user_id": "u970637660"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger(8):: X,Y,C,N,M,i,j,t,k,D,E\n integer(8),dimension(1:100000):: A,B\n\tread *, N,M\n do i=1,M\n read *, A(i),B(i)\n end do\n write(*,*)N-M-1\n \n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "sample_input": "3 1\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02536", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 59, "memory_kb": 4360}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s574437762", "group_id": "codeNet:p02537", "input_text": "program answer\n implicit none\n integer(8) :: i, j, N, K, ans, f, tmp, b, c\n integer(8), allocatable :: A(:), han(:), se(:)\n read(*,*) N, K\n allocate(A(N),han(N),se(N))\n do i = 1, N\n read(*,*) A(i)\n end do\n ans=1\n do i = 1, N-1\n if(abs(A(i)-A(i+1))<=K) then\n f=i\n exit\n end if\n end do\n\n ans=1\n han=0\n do i = 1, N-1\n se=0\n if(han(i)/=0) then\n cycle\n end if\n tmp=1\n b=A(i)\n j=1\n do\n if(i+j>=N+1) then\n exit\n end if\n if(han(i+j)/=0) then\n tmp=max(tmp,tmp+han(i+j))\n exit\n else\n if(abs(A(i+j)-b)<=K) then\n se(i)=tmp\n tmp=tmp+1\n b=A(i+j)\n j=j+1\n else\n j=j+1\n end if\n end if\n end do\n han(i)=tmp-se(i)\n ans=max(ans,tmp)\n end do\n \n write(*,*) ans\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1601173673, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02537.html", "problem_id": "p02537", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02537/input.txt", "sample_output_relpath": "derived/input_output/data/p02537/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02537/Fortran/s574437762.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s574437762", "user_id": "u873780029"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program answer\n implicit none\n integer(8) :: i, j, N, K, ans, f, tmp, b, c\n integer(8), allocatable :: A(:), han(:), se(:)\n read(*,*) N, K\n allocate(A(N),han(N),se(N))\n do i = 1, N\n read(*,*) A(i)\n end do\n ans=1\n do i = 1, N-1\n if(abs(A(i)-A(i+1))<=K) then\n f=i\n exit\n end if\n end do\n\n ans=1\n han=0\n do i = 1, N-1\n se=0\n if(han(i)/=0) then\n cycle\n end if\n tmp=1\n b=A(i)\n j=1\n do\n if(i+j>=N+1) then\n exit\n end if\n if(han(i+j)/=0) then\n tmp=max(tmp,tmp+han(i+j))\n exit\n else\n if(abs(A(i+j)-b)<=K) then\n se(i)=tmp\n tmp=tmp+1\n b=A(i+j)\n j=j+1\n else\n j=j+1\n end if\n end if\n end do\n han(i)=tmp-se(i)\n ans=max(ans,tmp)\n end do\n \n write(*,*) ans\n stop\n end program answer", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a sequence A_1, A_2, ..., A_N and an integer K.\n\nPrint the maximum possible length of a sequence B that satisfies the following conditions:\n\nB is a (not necessarily continuous) subsequence of A.\n\nFor each pair of adjacents elements of B, the absolute difference of the elements is at most K.\n\nConstraints\n\n1 \\leq N \\leq 300,000\n\n0 \\leq A_i \\leq 300,000\n\n0 \\leq K \\leq 300,000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1\nA_2\n:\nA_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n10 3\n1\n5\n4\n3\n8\n6\n9\n7\n2\n4\n\nSample Output 1\n\n7\n\nFor example, B = (1, 4, 3, 6, 9, 7, 4) satisfies the conditions.\n\nIt is a subsequence of A = (1, 5, 4, 3, 8, 6, 9, 7, 2, 4).\n\nAll of the absolute differences between two adjacent elements (|1-4|, |4-3|, |3-6|, |6-9|, |9-7|, |7-4|) are at most K = 3.", "sample_input": "10 3\n1\n5\n4\n3\n8\n6\n9\n7\n2\n4\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02537", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a sequence A_1, A_2, ..., A_N and an integer K.\n\nPrint the maximum possible length of a sequence B that satisfies the following conditions:\n\nB is a (not necessarily continuous) subsequence of A.\n\nFor each pair of adjacents elements of B, the absolute difference of the elements is at most K.\n\nConstraints\n\n1 \\leq N \\leq 300,000\n\n0 \\leq A_i \\leq 300,000\n\n0 \\leq K \\leq 300,000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1\nA_2\n:\nA_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n10 3\n1\n5\n4\n3\n8\n6\n9\n7\n2\n4\n\nSample Output 1\n\n7\n\nFor example, B = (1, 4, 3, 6, 9, 7, 4) satisfies the conditions.\n\nIt is a subsequence of A = (1, 5, 4, 3, 8, 6, 9, 7, 2, 4).\n\nAll of the absolute differences between two adjacent elements (|1-4|, |4-3|, |3-6|, |6-9|, |9-7|, |7-4|) are at most K = 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 913, "cpu_time_ms": 2206, "memory_kb": 9644}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s653670008", "group_id": "codeNet:p02538", "input_text": "module mint_mod\n use, intrinsic :: iso_fortran_env\n implicit none\n integer(int64) :: md = 998244353\n type,public:: mint\n integer(int64), private :: val = 0_8\n contains\n procedure:: to_int => mint_to_int64\n end type\n\n interface mint\n module procedure:: mi_init\n end interface\n interface operator( + )\n module procedure :: mi_add\n end interface\n interface operator( - )\n module procedure :: mi_sub\n end interface\n interface operator( * )\n module procedure :: mi_mul\n end interface\n interface operator( / )\n module procedure :: mi_div\n end interface\n interface operator( ** )\n module procedure :: mi_pow\n end interface\n interface assignment( = )\n module procedure:: mi_asgn\n end interface\n interface dot_product\n module procedure :: dot_prod\n end interface dot_product\n interface matmul\n module procedure :: matmul1, matmul2, matmul3\n end interface matmul\ncontains\n pure elemental function mi_init(num) result(ret)\n class(*),intent(in):: num\n type(mint):: ret\n ret = to_modint(num)\n end function\n\n\n\n pure elemental function to_int64(num) result(ret)\n class(*), intent(in) :: num\n integer(int64):: ret\n\n select type (num)\n type is (mint)\n ret = num%val\n type is (integer(int64))\n ret = num\n type is (integer(int32))\n ret = int(num, int64)\n type is (integer(int16))\n ret = int(num, int64)\n type is (integer(int8))\n ret = int(num, int64)\n class default\n ret = 0_8\n ret = 1_8/ret\n end select\n ret=modulo(ret,md)\n end function\n\n\n pure elemental function mint_to_int64(mx) result(ret)\n class(mint),intent(in):: mx\n integer(int64):: ret\n\n ret = to_int64(mx)\n end function\n\n pure elemental function to_modint(num) result(ret)\n class(*), intent(in):: num\n type(mint):: ret\n\n ret%val = to_int64(num)\n end function\n\n\n pure elemental subroutine mi_asgn(xm,y)\n type(mint), intent(inout) :: xm\n class(*), intent(in) :: y\n \n xm%val = to_int64(y)\n end subroutine\n\n\n pure elemental function mi_add(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n\n ret%val = modulo(xm%val + to_int64(y), md)\n end function\n\n\n pure elemental function mi_sub(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n\n ret%val = modulo(xm%val - to_int64(y), md)\n end function\n\n\n\n pure elemental function mi_mul(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint) ret\n\n ret%val = modulo(xm%val * to_int64(y), md)\n end function\n\n\n pure elemental function mi_div(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n\n ret%val = xm%val * to_int64(inv(to_modint(y)))\n end function\n\n \n pure elemental function inv(xm) result(ret)\n class(mint), intent(in) :: xm\n type(mint):: ret\n integer(int64) :: a, b, c, n\n integer(int64) :: x, y, z, m\n\n a = xm%val\n b = md\n c = 0_8\n n = 1_8\n do while (b /= 0_8)\n x = b\n y = mod(a,b)\n z = n-a/b*c\n m = c\n a = x\n b = y\n c = z\n n = m\n end do\n ret%val = n\n end function\n\n\n pure elemental function mi_pow(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n integer(int64) :: n\n type(mint) :: i\n\n ret%val = 1_8\n i%val = xm%val\n n = to_int64(y)\n do while (n > 0_8)\n if (btest(n,0)) ret%val = to_int64(mi_mul(ret,i))\n i%val = to_int64(mi_mul(i,i))\n n = rshift(n,1)\n end do\n end function\n\n pure type(mint) function dot_prod(x,y) result(ret)\n type(mint), intent(in) :: x(:), y(:)\n integer(int64):: i\n if (size(x,1) /= size(y,1)) i = to_int64('')\n do i = 1, size(x,1)\n call mi_asgn(ret,mi_add(ret,mi_mul(x(i),y(i))))\n end do\n end function\n\n\n pure function matmul1(x,y) result(ret)\n type(mint), intent(in) :: x(:,:), y(:)\n type(mint) :: ret(size(x,1))\n integer :: i\n do i = 1, size(x,1)\n call mi_asgn(ret(i),dot_prod(x(i,:),y))\n end do\n end function\n\n\n pure function matmul2(x,y) result(ret)\n type(mint), intent(in) :: x(:), y(:,:)\n type(mint) :: ret(size(y,2))\n integer :: i\n do i = 1, size(y,2)\n call mi_asgn(ret(i),dot_prod(x,y(:,i)))\n end do\n end function\n\n\n pure function matmul3(x,y) result(ret)\n type(mint), intent(in) :: x(:,:), y(:,:)\n type(mint) :: ret(size(x,1),size(y,2))\n integer :: i\n do i = 1, size(x,1)\n call mi_asgn(ret(i,:),matmul2(x(i,:),y))\n end do\n end function\nend module mint_mod\n\n\nmodule lazy_segtree_operators\n use mint_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n type s_elem\n type(mint):: v,k\n end type\n type f_elem\n type(mint):: v\n end type\ncontains\n function f_same(f1,f2)\n type(f_elem),intent(in):: f1,f2\n logical:: f_same\n\n f_same = (f1%v%to_int() == f2%v%to_int())\n end function\n\n function e()\n type(s_elem):: e\n\n e = s_elem(mint(0),mint(1))\n end function\n\n\n function id()\n type(f_elem):: id\n\n id = f_elem(mint(0))\n end function\n\n\n function op(a,b)\n type(s_elem),intent(in):: a,b\n type(s_elem):: op\n \n op%v = a%v*a%k + b%v\n op%k = a%k*b%k\n end function\n\n\n function mapping(s,f) result(new_s)\n type(s_elem),intent(in):: s\n type(f_elem),intent(in):: f\n type(s_elem):: new_s\n type(mint):: inv9\n inv9 = inv(mint(9))\n\n ! print*, \"mp\"\n if (f_same(f,id())) then\n new_s%v = s%v\n new_s%k = s%k\n else\n new_s%v = ((s%k-1)*inv9)*f%v\n new_s%k = s%k\n ! print'(*(i0,1x))', new_s%v%to_int()\n end if\n end function\n\n\n function composition(old_f,f) result(new_f)\n type(f_elem),intent(in):: old_f,f\n type(f_elem):: new_f\n ! print*, \"cps\"\n if (f_same(f,id())) then\n new_f = old_f\n else\n new_f = f\n end if\n end function\nend module\n\nmodule lazy_segtree_mod\n use,intrinsic :: iso_fortran_env\n use lazy_segtree_operators\n implicit none\n\n type,public:: lazy_segtree\n type(s_elem),allocatable:: d(:)\n type(f_elem),allocatable:: lz(:)\n integer(int32):: len\n contains\n procedure:: leaf => lst_leaf\n procedure:: update => lst_update, lst_update_one\n procedure:: query => lst_query, lst_query_one\n procedure:: to_array => lst_to_array\n procedure:: set => lst_set\n end type\n interface lazy_segtree\n module procedure:: lst_init\n end interface\ncontains\n function lst_init(n) result(lst)\n type(lazy_segtree):: lst\n integer(int32),intent(in):: n\n integer(int32):: x\n\n lst%len = n\n\n x=1\n do while(n > x)\n x = 2*x\n end do\n allocate(lst%d(2*x-1), source=e())\n allocate(lst%lz(2*x-1),source=id())\n end function\n\n function lst_leaf(lst)\n class(lazy_segtree):: lst\n integer(int32):: lst_leaf\n\n lst_leaf = size(lst%d)/2+1\n end function\n\n\n subroutine lst_set(lst,i,s)\n class(lazy_segtree),intent(inout):: lst\n type(s_elem),intent(in):: s\n integer(int32),value:: i\n\n i=i+lst%leaf()-1\n lst%d(i) = s\n i=rshift(i,1)\n do while(i > 0)\n lst%d(i) = op(lst%d(i*2), lst%d(i*2+1))\n i=rshift(i,1)\n end do\n end subroutine\n\n\n subroutine lst_update_one(lst,i,f)\n class(lazy_segtree),intent(inout):: lst\n type(f_elem),intent(in):: f\n integer(int32),intent(in):: i\n\n call lst_update(lst,i,i,f)\n end subroutine\n\n\n subroutine lst_update(lst, l,r,f)\n class(lazy_segtree),intent(inout):: lst\n type(f_elem),intent(in):: f\n integer(int32),intent(in):: l,r\n \n call lst_update_sub(lst,l,r,f,1,lst%leaf(),1)\n end subroutine\n\n\n recursive subroutine lst_update_sub(lst,ql,qr,f,nl,nr,i)\n class(lazy_segtree),intent(inout):: lst\n integer(int32),intent(in):: ql,qr,nl,nr,i\n type(f_elem),intent(in):: f\n integer(int32):: nm\n \n ! print'(*(i0,1x))', ql,qr,nl,nr\n ! print'(*(i0,1x))', f%v%to_int()\n call eval(lst,i)\n ! if (ql <= nl .and. nr <= qr) then\n ! ! print*, \"u\",1\n ! lst%lz(i) = composition(lst%lz(i), f)\n ! call eval(lst,i)\n ! else if (ql <= nr .and. nl <= qr) then\n ! ! print*, \"u\",2\n ! nm = (nl+nr)/2\n ! call lst_update_sub(lst,ql,qr,f,nl, nm,i*2 )\n ! call lst_update_sub(lst,ql,qr,f,nm+1,nr,i*2+1)\n ! lst%d(i) = op(lst%d(i*2), lst%d(i*2+1))\n ! end if\n end subroutine\n\n\n subroutine eval(lst,i)\n class(lazy_segtree):: lst\n integer(int32):: i\n\n ! print*, \"ev\", i\n if (f_same(lst%lz(i),id())) return\n if (i < lst%leaf()) then\n ! print*, \"comp\",i\n lst%lz(i*2) = composition(lst%lz(i*2), lst%lz(i))\n lst%lz(i*2+1) = composition(lst%lz(i*2+1), lst%lz(i))\n end if\n ! print'(a)', \"mp\"\n lst%d(i) = mapping(lst%d(i),lst%lz(i))\n ! print'(a)', \"id\"\n lst%lz(i) = id()\n end subroutine\n\n\n subroutine correct_laziness(lst)\n class(lazy_segtree):: lst\n integer(int32):: i\n \n do i=1,size(lst%d)\n call eval(lst,i)\n end do\n end subroutine\n\n\n function lst_query_one(lst,i) result(ret)\n class(lazy_segtree),intent(inout):: lst\n integer(int32),intent(in):: i\n type(s_elem):: ret\n\n ret = lst_query(lst,i,i)\n end function\n\n\n function lst_query(lst,l,r) result(ret)\n class(lazy_segtree),intent(inout):: lst\n integer(int32), intent(in):: l,r\n type(s_elem):: ret\n\n ret = lst_query_sub(lst,l,r,1,lst%leaf(),1)\n end function\n\n\n recursive function lst_query_sub(lst,ql,qr,nl,nr,i) result(ret)\n class(lazy_segtree),intent(inout):: lst\n integer(int32),intent(in):: ql,qr,nl,nr,i\n integer(int32):: nm\n type(s_elem):: ret,r1,r2\n \n call eval(lst,i)\n if (nr < ql .or. qr < nl) then\n ret = e()\n else if (ql <= nl .and. nr <= qr) then\n ret = lst%d(i)\n else\n nm = (nl+nr)/2\n r1 = lst_query_sub(lst,ql,qr,nl, nm,i*2 )\n r2 = lst_query_sub(lst,ql,qr,nm+1,nr,i*2+1)\n ret = op(r1,r2)\n end if\n end function\n\n function lst_to_array(lst) result(ret)\n class(lazy_segtree):: lst\n type(s_elem):: ret(lst%len)\n\n call correct_laziness(lst)\n ret(:) = lst%d(lst%leaf():lst%leaf()+lst%len-1)\n end function\n\n\n subroutine debug_print(lst)\n class(lazy_segtree):: lst\n integer(int32):: l,r\n\n print'(a)', \"datav\"\n l=1; r=1\n do while(r <= size(lst%d))\n print'(*(i0,1x))', lst%d(l:r)%v%to_int()\n l=l*2; r=r*2+1\n end do\n\n print'(a)', \"datak\"\n l=1; r=1\n do while(r <= size(lst%d))\n print'(*(i0,1x))', lst%d(l:r)%k%to_int()\n l=l*2; r=r*2+1\n end do\n\n print'(a)', \"lz\"\n l=1; r=1\n do while(r <= size(lst%lz))\n print'(*(i0,1x))', lst%lz(l:r)%v%to_int()\n l=l*2; r=r*2+1\n end do\n \n\n end subroutine\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use lazy_segtree_mod\n use lazy_segtree_operators\n implicit none\n integer(int32):: n,q,i\n integer(int32):: l,r,d\n type(lazy_segtree)::lst\n type(s_elem):: ans\n\n read*, n,q\n lst = lazy_segtree(n)\n do i=1,n\n ! print'(i0)', i\n call lst%set(i,s_elem(mint(1),mint(10)))\n end do\n\n do i=1,q\n read*, l,r,d\n print'(a)', \"update\"\n call lst%update(l,r,f_elem(mint(d)))\n ! call debug_print(lst)\n print'(a)', \"query\"\n ! ans = lst%query(1,n)\n ! print'(i0)', ans%v%to_int()\n end do\nend program main", "language": "Fortran", "metadata": {"date": 1601398318, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02538.html", "problem_id": "p02538", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02538/input.txt", "sample_output_relpath": "derived/input_output/data/p02538/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02538/Fortran/s653670008.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s653670008", "user_id": "u234636620"}, "prompt_components": {"gold_output": "11222211\n77772211\n77333333\n72333333\n72311333\n", "input_to_evaluate": "module mint_mod\n use, intrinsic :: iso_fortran_env\n implicit none\n integer(int64) :: md = 998244353\n type,public:: mint\n integer(int64), private :: val = 0_8\n contains\n procedure:: to_int => mint_to_int64\n end type\n\n interface mint\n module procedure:: mi_init\n end interface\n interface operator( + )\n module procedure :: mi_add\n end interface\n interface operator( - )\n module procedure :: mi_sub\n end interface\n interface operator( * )\n module procedure :: mi_mul\n end interface\n interface operator( / )\n module procedure :: mi_div\n end interface\n interface operator( ** )\n module procedure :: mi_pow\n end interface\n interface assignment( = )\n module procedure:: mi_asgn\n end interface\n interface dot_product\n module procedure :: dot_prod\n end interface dot_product\n interface matmul\n module procedure :: matmul1, matmul2, matmul3\n end interface matmul\ncontains\n pure elemental function mi_init(num) result(ret)\n class(*),intent(in):: num\n type(mint):: ret\n ret = to_modint(num)\n end function\n\n\n\n pure elemental function to_int64(num) result(ret)\n class(*), intent(in) :: num\n integer(int64):: ret\n\n select type (num)\n type is (mint)\n ret = num%val\n type is (integer(int64))\n ret = num\n type is (integer(int32))\n ret = int(num, int64)\n type is (integer(int16))\n ret = int(num, int64)\n type is (integer(int8))\n ret = int(num, int64)\n class default\n ret = 0_8\n ret = 1_8/ret\n end select\n ret=modulo(ret,md)\n end function\n\n\n pure elemental function mint_to_int64(mx) result(ret)\n class(mint),intent(in):: mx\n integer(int64):: ret\n\n ret = to_int64(mx)\n end function\n\n pure elemental function to_modint(num) result(ret)\n class(*), intent(in):: num\n type(mint):: ret\n\n ret%val = to_int64(num)\n end function\n\n\n pure elemental subroutine mi_asgn(xm,y)\n type(mint), intent(inout) :: xm\n class(*), intent(in) :: y\n \n xm%val = to_int64(y)\n end subroutine\n\n\n pure elemental function mi_add(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n\n ret%val = modulo(xm%val + to_int64(y), md)\n end function\n\n\n pure elemental function mi_sub(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n\n ret%val = modulo(xm%val - to_int64(y), md)\n end function\n\n\n\n pure elemental function mi_mul(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint) ret\n\n ret%val = modulo(xm%val * to_int64(y), md)\n end function\n\n\n pure elemental function mi_div(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n\n ret%val = xm%val * to_int64(inv(to_modint(y)))\n end function\n\n \n pure elemental function inv(xm) result(ret)\n class(mint), intent(in) :: xm\n type(mint):: ret\n integer(int64) :: a, b, c, n\n integer(int64) :: x, y, z, m\n\n a = xm%val\n b = md\n c = 0_8\n n = 1_8\n do while (b /= 0_8)\n x = b\n y = mod(a,b)\n z = n-a/b*c\n m = c\n a = x\n b = y\n c = z\n n = m\n end do\n ret%val = n\n end function\n\n\n pure elemental function mi_pow(xm,y) result(ret)\n class(mint), intent(in) :: xm\n class(*), intent(in) :: y\n type(mint):: ret\n integer(int64) :: n\n type(mint) :: i\n\n ret%val = 1_8\n i%val = xm%val\n n = to_int64(y)\n do while (n > 0_8)\n if (btest(n,0)) ret%val = to_int64(mi_mul(ret,i))\n i%val = to_int64(mi_mul(i,i))\n n = rshift(n,1)\n end do\n end function\n\n pure type(mint) function dot_prod(x,y) result(ret)\n type(mint), intent(in) :: x(:), y(:)\n integer(int64):: i\n if (size(x,1) /= size(y,1)) i = to_int64('')\n do i = 1, size(x,1)\n call mi_asgn(ret,mi_add(ret,mi_mul(x(i),y(i))))\n end do\n end function\n\n\n pure function matmul1(x,y) result(ret)\n type(mint), intent(in) :: x(:,:), y(:)\n type(mint) :: ret(size(x,1))\n integer :: i\n do i = 1, size(x,1)\n call mi_asgn(ret(i),dot_prod(x(i,:),y))\n end do\n end function\n\n\n pure function matmul2(x,y) result(ret)\n type(mint), intent(in) :: x(:), y(:,:)\n type(mint) :: ret(size(y,2))\n integer :: i\n do i = 1, size(y,2)\n call mi_asgn(ret(i),dot_prod(x,y(:,i)))\n end do\n end function\n\n\n pure function matmul3(x,y) result(ret)\n type(mint), intent(in) :: x(:,:), y(:,:)\n type(mint) :: ret(size(x,1),size(y,2))\n integer :: i\n do i = 1, size(x,1)\n call mi_asgn(ret(i,:),matmul2(x(i,:),y))\n end do\n end function\nend module mint_mod\n\n\nmodule lazy_segtree_operators\n use mint_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n type s_elem\n type(mint):: v,k\n end type\n type f_elem\n type(mint):: v\n end type\ncontains\n function f_same(f1,f2)\n type(f_elem),intent(in):: f1,f2\n logical:: f_same\n\n f_same = (f1%v%to_int() == f2%v%to_int())\n end function\n\n function e()\n type(s_elem):: e\n\n e = s_elem(mint(0),mint(1))\n end function\n\n\n function id()\n type(f_elem):: id\n\n id = f_elem(mint(0))\n end function\n\n\n function op(a,b)\n type(s_elem),intent(in):: a,b\n type(s_elem):: op\n \n op%v = a%v*a%k + b%v\n op%k = a%k*b%k\n end function\n\n\n function mapping(s,f) result(new_s)\n type(s_elem),intent(in):: s\n type(f_elem),intent(in):: f\n type(s_elem):: new_s\n type(mint):: inv9\n inv9 = inv(mint(9))\n\n ! print*, \"mp\"\n if (f_same(f,id())) then\n new_s%v = s%v\n new_s%k = s%k\n else\n new_s%v = ((s%k-1)*inv9)*f%v\n new_s%k = s%k\n ! print'(*(i0,1x))', new_s%v%to_int()\n end if\n end function\n\n\n function composition(old_f,f) result(new_f)\n type(f_elem),intent(in):: old_f,f\n type(f_elem):: new_f\n ! print*, \"cps\"\n if (f_same(f,id())) then\n new_f = old_f\n else\n new_f = f\n end if\n end function\nend module\n\nmodule lazy_segtree_mod\n use,intrinsic :: iso_fortran_env\n use lazy_segtree_operators\n implicit none\n\n type,public:: lazy_segtree\n type(s_elem),allocatable:: d(:)\n type(f_elem),allocatable:: lz(:)\n integer(int32):: len\n contains\n procedure:: leaf => lst_leaf\n procedure:: update => lst_update, lst_update_one\n procedure:: query => lst_query, lst_query_one\n procedure:: to_array => lst_to_array\n procedure:: set => lst_set\n end type\n interface lazy_segtree\n module procedure:: lst_init\n end interface\ncontains\n function lst_init(n) result(lst)\n type(lazy_segtree):: lst\n integer(int32),intent(in):: n\n integer(int32):: x\n\n lst%len = n\n\n x=1\n do while(n > x)\n x = 2*x\n end do\n allocate(lst%d(2*x-1), source=e())\n allocate(lst%lz(2*x-1),source=id())\n end function\n\n function lst_leaf(lst)\n class(lazy_segtree):: lst\n integer(int32):: lst_leaf\n\n lst_leaf = size(lst%d)/2+1\n end function\n\n\n subroutine lst_set(lst,i,s)\n class(lazy_segtree),intent(inout):: lst\n type(s_elem),intent(in):: s\n integer(int32),value:: i\n\n i=i+lst%leaf()-1\n lst%d(i) = s\n i=rshift(i,1)\n do while(i > 0)\n lst%d(i) = op(lst%d(i*2), lst%d(i*2+1))\n i=rshift(i,1)\n end do\n end subroutine\n\n\n subroutine lst_update_one(lst,i,f)\n class(lazy_segtree),intent(inout):: lst\n type(f_elem),intent(in):: f\n integer(int32),intent(in):: i\n\n call lst_update(lst,i,i,f)\n end subroutine\n\n\n subroutine lst_update(lst, l,r,f)\n class(lazy_segtree),intent(inout):: lst\n type(f_elem),intent(in):: f\n integer(int32),intent(in):: l,r\n \n call lst_update_sub(lst,l,r,f,1,lst%leaf(),1)\n end subroutine\n\n\n recursive subroutine lst_update_sub(lst,ql,qr,f,nl,nr,i)\n class(lazy_segtree),intent(inout):: lst\n integer(int32),intent(in):: ql,qr,nl,nr,i\n type(f_elem),intent(in):: f\n integer(int32):: nm\n \n ! print'(*(i0,1x))', ql,qr,nl,nr\n ! print'(*(i0,1x))', f%v%to_int()\n call eval(lst,i)\n ! if (ql <= nl .and. nr <= qr) then\n ! ! print*, \"u\",1\n ! lst%lz(i) = composition(lst%lz(i), f)\n ! call eval(lst,i)\n ! else if (ql <= nr .and. nl <= qr) then\n ! ! print*, \"u\",2\n ! nm = (nl+nr)/2\n ! call lst_update_sub(lst,ql,qr,f,nl, nm,i*2 )\n ! call lst_update_sub(lst,ql,qr,f,nm+1,nr,i*2+1)\n ! lst%d(i) = op(lst%d(i*2), lst%d(i*2+1))\n ! end if\n end subroutine\n\n\n subroutine eval(lst,i)\n class(lazy_segtree):: lst\n integer(int32):: i\n\n ! print*, \"ev\", i\n if (f_same(lst%lz(i),id())) return\n if (i < lst%leaf()) then\n ! print*, \"comp\",i\n lst%lz(i*2) = composition(lst%lz(i*2), lst%lz(i))\n lst%lz(i*2+1) = composition(lst%lz(i*2+1), lst%lz(i))\n end if\n ! print'(a)', \"mp\"\n lst%d(i) = mapping(lst%d(i),lst%lz(i))\n ! print'(a)', \"id\"\n lst%lz(i) = id()\n end subroutine\n\n\n subroutine correct_laziness(lst)\n class(lazy_segtree):: lst\n integer(int32):: i\n \n do i=1,size(lst%d)\n call eval(lst,i)\n end do\n end subroutine\n\n\n function lst_query_one(lst,i) result(ret)\n class(lazy_segtree),intent(inout):: lst\n integer(int32),intent(in):: i\n type(s_elem):: ret\n\n ret = lst_query(lst,i,i)\n end function\n\n\n function lst_query(lst,l,r) result(ret)\n class(lazy_segtree),intent(inout):: lst\n integer(int32), intent(in):: l,r\n type(s_elem):: ret\n\n ret = lst_query_sub(lst,l,r,1,lst%leaf(),1)\n end function\n\n\n recursive function lst_query_sub(lst,ql,qr,nl,nr,i) result(ret)\n class(lazy_segtree),intent(inout):: lst\n integer(int32),intent(in):: ql,qr,nl,nr,i\n integer(int32):: nm\n type(s_elem):: ret,r1,r2\n \n call eval(lst,i)\n if (nr < ql .or. qr < nl) then\n ret = e()\n else if (ql <= nl .and. nr <= qr) then\n ret = lst%d(i)\n else\n nm = (nl+nr)/2\n r1 = lst_query_sub(lst,ql,qr,nl, nm,i*2 )\n r2 = lst_query_sub(lst,ql,qr,nm+1,nr,i*2+1)\n ret = op(r1,r2)\n end if\n end function\n\n function lst_to_array(lst) result(ret)\n class(lazy_segtree):: lst\n type(s_elem):: ret(lst%len)\n\n call correct_laziness(lst)\n ret(:) = lst%d(lst%leaf():lst%leaf()+lst%len-1)\n end function\n\n\n subroutine debug_print(lst)\n class(lazy_segtree):: lst\n integer(int32):: l,r\n\n print'(a)', \"datav\"\n l=1; r=1\n do while(r <= size(lst%d))\n print'(*(i0,1x))', lst%d(l:r)%v%to_int()\n l=l*2; r=r*2+1\n end do\n\n print'(a)', \"datak\"\n l=1; r=1\n do while(r <= size(lst%d))\n print'(*(i0,1x))', lst%d(l:r)%k%to_int()\n l=l*2; r=r*2+1\n end do\n\n print'(a)', \"lz\"\n l=1; r=1\n do while(r <= size(lst%lz))\n print'(*(i0,1x))', lst%lz(l:r)%v%to_int()\n l=l*2; r=r*2+1\n end do\n \n\n end subroutine\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use lazy_segtree_mod\n use lazy_segtree_operators\n implicit none\n integer(int32):: n,q,i\n integer(int32):: l,r,d\n type(lazy_segtree)::lst\n type(s_elem):: ans\n\n read*, n,q\n lst = lazy_segtree(n)\n do i=1,n\n ! print'(i0)', i\n call lst%set(i,s_elem(mint(1),mint(10)))\n end do\n\n do i=1,q\n read*, l,r,d\n print'(a)', \"update\"\n call lst%update(l,r,f_elem(mint(d)))\n ! call debug_print(lst)\n print'(a)', \"query\"\n ! ans = lst%query(1,n)\n ! print'(i0)', ans%v%to_int()\n end do\nend program main", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou have a string S of length N.\nInitially, all characters in S are 1s.\n\nYou will perform queries Q times.\nIn the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).\nThen, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.\n\nAfter each query, read the string S as a decimal integer, and print its value modulo 998,244,353.\n\nConstraints\n\n1 \\leq N, Q \\leq 200,000\n\n1 \\leq L_i \\leq R_i \\leq N\n\n1 \\leq D_i \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nL_1 R_1 D_1\n:\nL_Q R_Q D_Q\n\nOutput\n\nPrint Q lines.\nIn the i-th line print the value of S after the i-th query, modulo 998,244,353.\n\nSample Input 1\n\n8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n\nSample Output 1\n\n11222211\n77772211\n77333333\n72333333\n72311333\n\nSample Input 2\n\n200000 1\n123 456 7\n\nSample Output 2\n\n641437905\n\nDon't forget to take the modulo.", "sample_input": "8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n"}, "reference_outputs": ["11222211\n77772211\n77333333\n72333333\n72311333\n"], "source_document_id": "p02538", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou have a string S of length N.\nInitially, all characters in S are 1s.\n\nYou will perform queries Q times.\nIn the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).\nThen, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.\n\nAfter each query, read the string S as a decimal integer, and print its value modulo 998,244,353.\n\nConstraints\n\n1 \\leq N, Q \\leq 200,000\n\n1 \\leq L_i \\leq R_i \\leq N\n\n1 \\leq D_i \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nL_1 R_1 D_1\n:\nL_Q R_Q D_Q\n\nOutput\n\nPrint Q lines.\nIn the i-th line print the value of S after the i-th query, modulo 998,244,353.\n\nSample Input 1\n\n8 5\n3 6 2\n1 4 7\n3 8 3\n2 2 2\n4 5 1\n\nSample Output 1\n\n11222211\n77772211\n77333333\n72333333\n72311333\n\nSample Input 2\n\n200000 1\n123 456 7\n\nSample Output 2\n\n641437905\n\nDon't forget to take the modulo.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 12775, "cpu_time_ms": 573, "memory_kb": 16032}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s802282369", "group_id": "codeNet:p02546", "input_text": "program abc67\n implicit none\n integer(8)::length\n character(len=1000)::S\n read(*,*)S\n length=len_trim(S)\n if(S(length:length)==\"s\")then\n S(length+1:length+2)=\"es\"\n else\n S(length+1:length+1)=\"s\"\n end if\n print'(a)',trim(S)\n end program abc67", "language": "Fortran", "metadata": {"date": 1600542425, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02546.html", "problem_id": "p02546", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02546/input.txt", "sample_output_relpath": "derived/input_output/data/p02546/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02546/Fortran/s802282369.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s802282369", "user_id": "u897889420"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "program abc67\n implicit none\n integer(8)::length\n character(len=1000)::S\n read(*,*)S\n length=len_trim(S)\n if(S(length:length)==\"s\")then\n S(length+1:length+2)=\"es\"\n else\n S(length+1:length+1)=\"s\"\n end if\n print'(a)',trim(S)\n end program abc67", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "sample_input": "apple\n"}, "reference_outputs": ["apples\n"], "source_document_id": "p02546", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 243, "cpu_time_ms": 14, "memory_kb": 2800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s691914369", "group_id": "codeNet:p02547", "input_text": " PROGRAM piyo\n IMPLICIT NONE\n integer :: n,i\n integer,allocatable :: d1(:),d2(:)\n character(3) :: ans = 'No '\n \n read*,n\n allocate( d1(n),d2(n) )\n do i = 1,n\n read*,d1(i),d2(i)\n end do\n \n \n do i = 2,n-1\n \n if( d1(i-1)/=d2(i-1) )cycle\n if( d1(i)/=d2(i) )cycle\n if( d1(i+1)/=d2(i+1) )cycle\n \n ans = 'Yes'\n \n end do\n \n \n print*,ans\n \n \n stop\n !debugg\n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1600542475, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02547.html", "problem_id": "p02547", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02547/input.txt", "sample_output_relpath": "derived/input_output/data/p02547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02547/Fortran/s691914369.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s691914369", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " PROGRAM piyo\n IMPLICIT NONE\n integer :: n,i\n integer,allocatable :: d1(:),d2(:)\n character(3) :: ans = 'No '\n \n read*,n\n allocate( d1(n),d2(n) )\n do i = 1,n\n read*,d1(i),d2(i)\n end do\n \n \n do i = 2,n-1\n \n if( d1(i-1)/=d2(i-1) )cycle\n if( d1(i)/=d2(i) )cycle\n if( d1(i+1)/=d2(i+1) )cycle\n \n ans = 'Yes'\n \n end do\n \n \n print*,ans\n \n \n stop\n !debugg\n \n \n \n END PROGRAM", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n\nSample Output 3\n\nYes", "sample_input": "5\n1 2\n6 6\n4 4\n3 3\n3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02547", "source_text": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 547, "cpu_time_ms": 10, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s845568016", "group_id": "codeNet:p02548", "input_text": " program CCC\n!\n implicit none\n integer :: A,N,M\n!\n read(*,*) N\n!\n A = 0\n!\n do A=1,N-1\n M = N/A + M\n if(mod(N,A) == 0) M = M-1\n end do\n!\n write(*,*) M\n!\n end program CCC", "language": "Fortran", "metadata": {"date": 1600543670, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02548.html", "problem_id": "p02548", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02548/input.txt", "sample_output_relpath": "derived/input_output/data/p02548/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02548/Fortran/s845568016.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845568016", "user_id": "u954587078"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": " program CCC\n!\n implicit none\n integer :: A,N,M\n!\n read(*,*) N\n!\n A = 0\n!\n do A=1,N-1\n M = N/A + M\n if(mod(N,A) == 0) M = M-1\n end do\n!\n write(*,*) M\n!\n end program CCC", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "sample_input": "3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02548", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s053200222", "group_id": "codeNet:p02548", "input_text": "program a_times_b_plus_c\n implicit none\n integer :: n, m = 0, i\n read(*,*) n\n do i = 1, n - 1\n m = m + (n - 1) / i\n end do\n write(*,'(i0)') m\nend program a_times_b_plus_c", "language": "Fortran", "metadata": {"date": 1600542524, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02548.html", "problem_id": "p02548", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02548/input.txt", "sample_output_relpath": "derived/input_output/data/p02548/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02548/Fortran/s053200222.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053200222", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program a_times_b_plus_c\n implicit none\n integer :: n, m = 0, i\n read(*,*) n\n do i = 1, n - 1\n m = m + (n - 1) / i\n end do\n write(*,'(i0)') m\nend program a_times_b_plus_c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "sample_input": "3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02548", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2928}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s478869657", "group_id": "codeNet:p02549", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,k,i,j, ans=0\n integer(int64):: md = 998244353\n integer(int64), allocatable:: dp(:),dpsum(:),l(:),r(:)\n\n read*, n,k\n allocate(dp,source=[(merge(1_8,0_8,i==1),i=1,n)])\n allocate(dpsum(0:n),source=[(merge(1_8,0_8,i==1),i=0,n)])\n allocate(l(k),r(k))\n\n do i=1,k\n read*, l(i),r(i)\n end do\n\n do i=2,n\n do j=1,k; block; integer(int64):: ll,rr\n ll = i-r(j); rr=i-l(j)\n if (rr < 1) cycle\n ll = max(ll,1_8)\n dp(i)=mod(dp(i)+dpsum(rr)-dpsum(ll-1),md)\n end block; end do\n ! print'(*(i0,1x))', dp(:)\n dpsum(i)=dpsum(i-1)+dp(i)\n end do\n print'(i0)', dp(n)\nend program main", "language": "Fortran", "metadata": {"date": 1600560411, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02549.html", "problem_id": "p02549", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02549/input.txt", "sample_output_relpath": "derived/input_output/data/p02549/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02549/Fortran/s478869657.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s478869657", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,k,i,j, ans=0\n integer(int64):: md = 998244353\n integer(int64), allocatable:: dp(:),dpsum(:),l(:),r(:)\n\n read*, n,k\n allocate(dp,source=[(merge(1_8,0_8,i==1),i=1,n)])\n allocate(dpsum(0:n),source=[(merge(1_8,0_8,i==1),i=0,n)])\n allocate(l(k),r(k))\n\n do i=1,k\n read*, l(i),r(i)\n end do\n\n do i=2,n\n do j=1,k; block; integer(int64):: ll,rr\n ll = i-r(j); rr=i-l(j)\n if (rr < 1) cycle\n ll = max(ll,1_8)\n dp(i)=mod(dp(i)+dpsum(rr)-dpsum(ll-1),md)\n end block; end do\n ! print'(*(i0,1x))', dp(:)\n dpsum(i)=dpsum(i-1)+dp(i)\n end do\n print'(i0)', dp(n)\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cells arranged in a row, numbered 1, 2, \\ldots, N from left to right.\n\nTak lives in these cells and is currently on Cell 1. He is trying to reach Cell N by using the procedure described below.\n\nYou are given an integer K that is less than or equal to 10, and K non-intersecting segments [L_1, R_1], [L_2, R_2], \\ldots, [L_K, R_K].\nLet S be the union of these K segments.\nHere, the segment [l, r] denotes the set consisting of all integers i that satisfy l \\leq i \\leq r.\n\n\bWhen you are on Cell i, pick an integer d from S and move to Cell i + d. You cannot move out of the cells.\n\nTo help Tak, find the number of ways to go to Cell N, modulo 998244353.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\min(N, 10)\n\n1 \\leq L_i \\leq R_i \\leq N\n\n[L_i, R_i] and [L_j, R_j] do not intersect (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nL_1 R_1\nL_2 R_2\n:\nL_K R_K\n\nOutput\n\nPrint the number of ways for Tak to go from Cell 1 to Cell N, modulo 998244353.\n\nSample Input 1\n\n5 2\n1 1\n3 4\n\nSample Output 1\n\n4\n\nThe set S is the union of the segment [1, 1] and the segment [3, 4], therefore S = \\{ 1, 3, 4 \\} holds.\n\nThere are 4 possible ways to get to Cell 5:\n\n1 \\to 2 \\to 3 \\to 4 \\to 5,\n\n1 \\to 2 \\to 5,\n\n1 \\to 4 \\to 5 and\n\n1 \\to 5.\n\nSample Input 2\n\n5 2\n3 3\n5 5\n\nSample Output 2\n\n0\n\nBecause S = \\{ 3, 5 \\} holds, you cannot reach to Cell 5.\nPrint 0.\n\nSample Input 3\n\n5 1\n1 2\n\nSample Output 3\n\n5\n\nSample Input 4\n\n60 3\n5 8\n1 3\n10 15\n\nSample Output 4\n\n221823067\n\nNote that you have to print the answer modulo 998244353.", "sample_input": "5 2\n1 1\n3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02549", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cells arranged in a row, numbered 1, 2, \\ldots, N from left to right.\n\nTak lives in these cells and is currently on Cell 1. He is trying to reach Cell N by using the procedure described below.\n\nYou are given an integer K that is less than or equal to 10, and K non-intersecting segments [L_1, R_1], [L_2, R_2], \\ldots, [L_K, R_K].\nLet S be the union of these K segments.\nHere, the segment [l, r] denotes the set consisting of all integers i that satisfy l \\leq i \\leq r.\n\n\bWhen you are on Cell i, pick an integer d from S and move to Cell i + d. You cannot move out of the cells.\n\nTo help Tak, find the number of ways to go to Cell N, modulo 998244353.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\min(N, 10)\n\n1 \\leq L_i \\leq R_i \\leq N\n\n[L_i, R_i] and [L_j, R_j] do not intersect (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nL_1 R_1\nL_2 R_2\n:\nL_K R_K\n\nOutput\n\nPrint the number of ways for Tak to go from Cell 1 to Cell N, modulo 998244353.\n\nSample Input 1\n\n5 2\n1 1\n3 4\n\nSample Output 1\n\n4\n\nThe set S is the union of the segment [1, 1] and the segment [3, 4], therefore S = \\{ 1, 3, 4 \\} holds.\n\nThere are 4 possible ways to get to Cell 5:\n\n1 \\to 2 \\to 3 \\to 4 \\to 5,\n\n1 \\to 2 \\to 5,\n\n1 \\to 4 \\to 5 and\n\n1 \\to 5.\n\nSample Input 2\n\n5 2\n3 3\n5 5\n\nSample Output 2\n\n0\n\nBecause S = \\{ 3, 5 \\} holds, you cannot reach to Cell 5.\nPrint 0.\n\nSample Input 3\n\n5 1\n1 2\n\nSample Output 3\n\n5\n\nSample Input 4\n\n60 3\n5 8\n1 3\n10 15\n\nSample Output 4\n\n221823067\n\nNote that you have to print the answer modulo 998244353.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 760, "cpu_time_ms": 19, "memory_kb": 9108}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s461304951", "group_id": "codeNet:p02549", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,i,j,l,ns\n integer(int32):: md = 998244353\n integer(int32), allocatable:: lr(:,:), s(:),dp(:)\n\n\n read*, n, k\n allocate(lr(2,k))\n do i=1,k\n read*, lr(:,i)\n end do\n ns = sum(lr(2,:)-lr(1,:))+k\n allocate(s(ns))\n j=1\n do i=1,k\n s(j:j+(lr(2,i)-lr(1,i))) = [(l,l=lr(1,i),lr(2,i))]\n j=j+lr(2,i)-lr(1,i)+1\n end do\n\n allocate(dp(n),source=0)\n dp(1) = 1\n do i=1,n-1\n if (dp(i)==0) cycle\n do j=1,ns\n if (i+s(j) > n) cycle\n dp(i+s(j))=mod(dp(i+s(j))+dp(i),md)\n end do\n dp(i) = 0\n ! print'(*(i0,1x))', dp(:)\n end do\n print'(i0)', dp(n)\nend program main", "language": "Fortran", "metadata": {"date": 1600544607, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02549.html", "problem_id": "p02549", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02549/input.txt", "sample_output_relpath": "derived/input_output/data/p02549/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02549/Fortran/s461304951.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s461304951", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,i,j,l,ns\n integer(int32):: md = 998244353\n integer(int32), allocatable:: lr(:,:), s(:),dp(:)\n\n\n read*, n, k\n allocate(lr(2,k))\n do i=1,k\n read*, lr(:,i)\n end do\n ns = sum(lr(2,:)-lr(1,:))+k\n allocate(s(ns))\n j=1\n do i=1,k\n s(j:j+(lr(2,i)-lr(1,i))) = [(l,l=lr(1,i),lr(2,i))]\n j=j+lr(2,i)-lr(1,i)+1\n end do\n\n allocate(dp(n),source=0)\n dp(1) = 1\n do i=1,n-1\n if (dp(i)==0) cycle\n do j=1,ns\n if (i+s(j) > n) cycle\n dp(i+s(j))=mod(dp(i+s(j))+dp(i),md)\n end do\n dp(i) = 0\n ! print'(*(i0,1x))', dp(:)\n end do\n print'(i0)', dp(n)\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cells arranged in a row, numbered 1, 2, \\ldots, N from left to right.\n\nTak lives in these cells and is currently on Cell 1. He is trying to reach Cell N by using the procedure described below.\n\nYou are given an integer K that is less than or equal to 10, and K non-intersecting segments [L_1, R_1], [L_2, R_2], \\ldots, [L_K, R_K].\nLet S be the union of these K segments.\nHere, the segment [l, r] denotes the set consisting of all integers i that satisfy l \\leq i \\leq r.\n\n\bWhen you are on Cell i, pick an integer d from S and move to Cell i + d. You cannot move out of the cells.\n\nTo help Tak, find the number of ways to go to Cell N, modulo 998244353.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\min(N, 10)\n\n1 \\leq L_i \\leq R_i \\leq N\n\n[L_i, R_i] and [L_j, R_j] do not intersect (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nL_1 R_1\nL_2 R_2\n:\nL_K R_K\n\nOutput\n\nPrint the number of ways for Tak to go from Cell 1 to Cell N, modulo 998244353.\n\nSample Input 1\n\n5 2\n1 1\n3 4\n\nSample Output 1\n\n4\n\nThe set S is the union of the segment [1, 1] and the segment [3, 4], therefore S = \\{ 1, 3, 4 \\} holds.\n\nThere are 4 possible ways to get to Cell 5:\n\n1 \\to 2 \\to 3 \\to 4 \\to 5,\n\n1 \\to 2 \\to 5,\n\n1 \\to 4 \\to 5 and\n\n1 \\to 5.\n\nSample Input 2\n\n5 2\n3 3\n5 5\n\nSample Output 2\n\n0\n\nBecause S = \\{ 3, 5 \\} holds, you cannot reach to Cell 5.\nPrint 0.\n\nSample Input 3\n\n5 1\n1 2\n\nSample Output 3\n\n5\n\nSample Input 4\n\n60 3\n5 8\n1 3\n10 15\n\nSample Output 4\n\n221823067\n\nNote that you have to print the answer modulo 998244353.", "sample_input": "5 2\n1 1\n3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02549", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cells arranged in a row, numbered 1, 2, \\ldots, N from left to right.\n\nTak lives in these cells and is currently on Cell 1. He is trying to reach Cell N by using the procedure described below.\n\nYou are given an integer K that is less than or equal to 10, and K non-intersecting segments [L_1, R_1], [L_2, R_2], \\ldots, [L_K, R_K].\nLet S be the union of these K segments.\nHere, the segment [l, r] denotes the set consisting of all integers i that satisfy l \\leq i \\leq r.\n\n\bWhen you are on Cell i, pick an integer d from S and move to Cell i + d. You cannot move out of the cells.\n\nTo help Tak, find the number of ways to go to Cell N, modulo 998244353.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq \\min(N, 10)\n\n1 \\leq L_i \\leq R_i \\leq N\n\n[L_i, R_i] and [L_j, R_j] do not intersect (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nL_1 R_1\nL_2 R_2\n:\nL_K R_K\n\nOutput\n\nPrint the number of ways for Tak to go from Cell 1 to Cell N, modulo 998244353.\n\nSample Input 1\n\n5 2\n1 1\n3 4\n\nSample Output 1\n\n4\n\nThe set S is the union of the segment [1, 1] and the segment [3, 4], therefore S = \\{ 1, 3, 4 \\} holds.\n\nThere are 4 possible ways to get to Cell 5:\n\n1 \\to 2 \\to 3 \\to 4 \\to 5,\n\n1 \\to 2 \\to 5,\n\n1 \\to 4 \\to 5 and\n\n1 \\to 5.\n\nSample Input 2\n\n5 2\n3 3\n5 5\n\nSample Output 2\n\n0\n\nBecause S = \\{ 3, 5 \\} holds, you cannot reach to Cell 5.\nPrint 0.\n\nSample Input 3\n\n5 1\n1 2\n\nSample Output 3\n\n5\n\nSample Input 4\n\n60 3\n5 8\n1 3\n10 15\n\nSample Output 4\n\n221823067\n\nNote that you have to print the answer modulo 998244353.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 757, "cpu_time_ms": 2205, "memory_kb": 4076}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s192358027", "group_id": "codeNet:p02550", "input_text": "program sequence_sum\n implicit none\n integer(8) :: n, x, m, num, a(0:100000) = 0\n integer :: b(0:100000) = 0, period, offset, rem, i, j\n read(*,*) n, x, m\n if (n == 1) then\n write(*,'(i0)') x\n stop\n end if\n a(1) = x\n b(int(x, 4)) = 1\n do i = 2, int(m) + 1\n x = mod(x * x, m)\n a(i) = a(i - 1) + x\n if (i == n) then\n write(*,'(i0)') a(i)\n stop\n end if\n j = int(x, 4)\n if (b(j) > 0) then\n offset = b(j) - 1\n period = i - offset - 1\n exit\n end if\n b(j) = i\n end do\n num = (n - offset) / period\n rem = int(n - offset - num * period, 4)\n write(*,'(i0)') (a(offset + period) - a(offset)) * num + a(offset + rem)\nend program sequence_sum", "language": "Fortran", "metadata": {"date": 1600567605, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02550.html", "problem_id": "p02550", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02550/input.txt", "sample_output_relpath": "derived/input_output/data/p02550/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02550/Fortran/s192358027.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s192358027", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1369\n", "input_to_evaluate": "program sequence_sum\n implicit none\n integer(8) :: n, x, m, num, a(0:100000) = 0\n integer :: b(0:100000) = 0, period, offset, rem, i, j\n read(*,*) n, x, m\n if (n == 1) then\n write(*,'(i0)') x\n stop\n end if\n a(1) = x\n b(int(x, 4)) = 1\n do i = 2, int(m) + 1\n x = mod(x * x, m)\n a(i) = a(i - 1) + x\n if (i == n) then\n write(*,'(i0)') a(i)\n stop\n end if\n j = int(x, 4)\n if (b(j) > 0) then\n offset = b(j) - 1\n period = i - offset - 1\n exit\n end if\n b(j) = i\n end do\n num = (n - offset) / period\n rem = int(n - offset - num * period, 4)\n write(*,'(i0)') (a(offset + period) - a(offset)) * num + a(offset + rem)\nend program sequence_sum", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet us denote by f(x, m) the remainder of the Euclidean division of x by m.\n\nLet A be the sequence that is defined by the initial value A_1=X and the recurrence relation A_{n+1} = f(A_n^2, M).\nFind \\displaystyle{\\sum_{i=1}^N A_i}.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\n0 \\leq X < M \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X M\n\nOutput\n\nPrint \\displaystyle{\\sum_{i=1}^N A_i}.\n\nSample Input 1\n\n6 2 1001\n\nSample Output 1\n\n1369\n\nThe sequence A begins 2,4,16,256,471,620,\\ldots Therefore, the answer is 2+4+16+256+471+620=1369.\n\nSample Input 2\n\n1000 2 16\n\nSample Output 2\n\n6\n\nThe sequence A begins 2,4,0,0,\\ldots Therefore, the answer is 6.\n\nSample Input 3\n\n10000000000 10 99959\n\nSample Output 3\n\n492443256176507", "sample_input": "6 2 1001\n"}, "reference_outputs": ["1369\n"], "source_document_id": "p02550", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet us denote by f(x, m) the remainder of the Euclidean division of x by m.\n\nLet A be the sequence that is defined by the initial value A_1=X and the recurrence relation A_{n+1} = f(A_n^2, M).\nFind \\displaystyle{\\sum_{i=1}^N A_i}.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\n0 \\leq X < M \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X M\n\nOutput\n\nPrint \\displaystyle{\\sum_{i=1}^N A_i}.\n\nSample Input 1\n\n6 2 1001\n\nSample Output 1\n\n1369\n\nThe sequence A begins 2,4,16,256,471,620,\\ldots Therefore, the answer is 2+4+16+256+471+620=1369.\n\nSample Input 2\n\n1000 2 16\n\nSample Output 2\n\n6\n\nThe sequence A begins 2,4,0,0,\\ldots Therefore, the answer is 6.\n\nSample Input 3\n\n10000000000 10 99959\n\nSample Output 3\n\n492443256176507", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 697, "cpu_time_ms": 5, "memory_kb": 3488}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s486852467", "group_id": "codeNet:p02550", "input_text": "module vector_int64_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n private\n public:: vec_to_array, vec_size\n type,public:: vector_int64\n integer(int64),allocatable:: array(:)\n integer(int64),private:: l=0\n contains\n procedure:: push_back=>vec_push_back, insert=>vec_insert\n procedure:: pop_back=>vec_pop_back, pop=>vec_pop, erase => vec_erase\n procedure:: at=>vec_at, back=>vec_back, head=>vec_head\n end type\ncontains\n function vec_size(vec) result(ret)\n type(vector_int64),intent(in):: vec\n integer(int64):: ret\n\n ret = vec%l\n end function\n\n\n subroutine check_array_allocation(vec)\n type(vector_int64),intent(inout):: vec\n\n if (.not. allocated(vec%array)) allocate(vec%array(1))\n end subroutine\n\n\n function vec_at(vec,i) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: i,ret\n\n call check_array_allocation(vec)\n ret = vec%array(i)\n end function\n\n\n function vec_back(vec) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: ret\n \n ret = vec%at(vec%l)\n end function\n\n\n function vec_head(vec) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: ret\n \n ret = vec%at(1_8)\n end function\n\n\n subroutine vec_append_array(vec,l,r)\n type(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: l,r\n integer(int64),allocatable:: tmp(:)\n \n allocate(tmp(l:2*r))\n tmp(l:r) = vec%array(l:r)\n call move_alloc(tmp, vec%array)\n end subroutine\n\n\n subroutine vec_reduce_array(vec,l,r)\n type(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: l,r\n integer(int64),allocatable:: tmp(:)\n \n allocate(tmp(l:r/2))\n tmp(l:r/2) = vec%array(l:r/2)\n call move_alloc(tmp, vec%array)\n end subroutine\n\n\n subroutine check_allocation_size(vec)\n type(vector_int64),intent(inout):: vec\n integer(int64):: len_alloc\n\n call check_array_allocation(vec)\n len_alloc = size(vec%array)\n if (vec%l >= len_alloc) then\n call vec_append_array(vec,1_8,len_alloc)\n else if (vec%l <= len_alloc/2) then\n call vec_reduce_array(vec,1_8,len_alloc)\n end if\n end subroutine\n\n\n subroutine vec_push_back(vec, v)\n class(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: v\n\n vec%l=vec%l+1\n call check_allocation_size(vec)\n vec%array(vec%l) = v\n end subroutine\n\n\n subroutine vec_insert(vec,i,v)\n class(vector_int64),intent(inout):: vec\n integer(int64),intent(in)::i, v\n\n vec%l=vec%l+1\n call check_allocation_size(vec)\n vec%array(i+1:vec%l+1) = vec%array(i:vec%l)\n vec%array(i) = v\n end subroutine\n\n\n function vec_pop_back(vec) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: ret\n\n ret = vec%back()\n vec%l=vec%l-1\n call check_allocation_size(vec)\n end function\n\n\n function vec_pop(vec,i) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: i\n integer(int64):: ret\n\n ret = vec%at(i)\n vec%l=vec%l-1\n vec%array(i:vec%l) = vec%array(i+1:vec%l+1)\n call check_allocation_size(vec)\n end function\n\n\n subroutine vec_erase(vec,i)\n class(vector_int64):: vec\n integer(int64),intent(in):: i\n integer(int64):: dmp\n\n dmp = vec%pop(i)\n end subroutine\n\n\n function vec_to_array(vec) result(ret)\n type(vector_int64),intent(inout):: vec\n integer(int64):: ret(1:vec%l)\n\n call check_array_allocation(vec)\n ret = vec%array(1:vec%l)\n end function\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use vector_int64_mod\n implicit none\n integer(int64):: n,x,m\n integer(int64):: i,j,l,ln,tot=0,s=0,ans=0\n integer(int64), allocatable:: id(:)\n type(vector_int64):: a\n\n read*, n,x,m\n allocate(id(0:m),source=-1_8)\n\n j=1\n do while(id(x) == -1_8)\n print'(*(i0,1x))', j,x,id(x)\n call a%push_back(x)\n tot=tot+x\n id(x)=j\n x=mod(x*x,m)\n j=j+1\n end do\n l = j-id(x)\n do i=id(x),j-1\n s=s+a%at(i)\n end do\n \n if (nvec_push_back, insert=>vec_insert\n procedure:: pop_back=>vec_pop_back, pop=>vec_pop, erase => vec_erase\n procedure:: at=>vec_at, back=>vec_back, head=>vec_head\n end type\ncontains\n function vec_size(vec) result(ret)\n type(vector_int64),intent(in):: vec\n integer(int64):: ret\n\n ret = vec%l\n end function\n\n\n subroutine check_array_allocation(vec)\n type(vector_int64),intent(inout):: vec\n\n if (.not. allocated(vec%array)) allocate(vec%array(1))\n end subroutine\n\n\n function vec_at(vec,i) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: i,ret\n\n call check_array_allocation(vec)\n ret = vec%array(i)\n end function\n\n\n function vec_back(vec) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: ret\n \n ret = vec%at(vec%l)\n end function\n\n\n function vec_head(vec) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: ret\n \n ret = vec%at(1_8)\n end function\n\n\n subroutine vec_append_array(vec,l,r)\n type(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: l,r\n integer(int64),allocatable:: tmp(:)\n \n allocate(tmp(l:2*r))\n tmp(l:r) = vec%array(l:r)\n call move_alloc(tmp, vec%array)\n end subroutine\n\n\n subroutine vec_reduce_array(vec,l,r)\n type(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: l,r\n integer(int64),allocatable:: tmp(:)\n \n allocate(tmp(l:r/2))\n tmp(l:r/2) = vec%array(l:r/2)\n call move_alloc(tmp, vec%array)\n end subroutine\n\n\n subroutine check_allocation_size(vec)\n type(vector_int64),intent(inout):: vec\n integer(int64):: len_alloc\n\n call check_array_allocation(vec)\n len_alloc = size(vec%array)\n if (vec%l >= len_alloc) then\n call vec_append_array(vec,1_8,len_alloc)\n else if (vec%l <= len_alloc/2) then\n call vec_reduce_array(vec,1_8,len_alloc)\n end if\n end subroutine\n\n\n subroutine vec_push_back(vec, v)\n class(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: v\n\n vec%l=vec%l+1\n call check_allocation_size(vec)\n vec%array(vec%l) = v\n end subroutine\n\n\n subroutine vec_insert(vec,i,v)\n class(vector_int64),intent(inout):: vec\n integer(int64),intent(in)::i, v\n\n vec%l=vec%l+1\n call check_allocation_size(vec)\n vec%array(i+1:vec%l+1) = vec%array(i:vec%l)\n vec%array(i) = v\n end subroutine\n\n\n function vec_pop_back(vec) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64):: ret\n\n ret = vec%back()\n vec%l=vec%l-1\n call check_allocation_size(vec)\n end function\n\n\n function vec_pop(vec,i) result(ret)\n class(vector_int64),intent(inout):: vec\n integer(int64),intent(in):: i\n integer(int64):: ret\n\n ret = vec%at(i)\n vec%l=vec%l-1\n vec%array(i:vec%l) = vec%array(i+1:vec%l+1)\n call check_allocation_size(vec)\n end function\n\n\n subroutine vec_erase(vec,i)\n class(vector_int64):: vec\n integer(int64),intent(in):: i\n integer(int64):: dmp\n\n dmp = vec%pop(i)\n end subroutine\n\n\n function vec_to_array(vec) result(ret)\n type(vector_int64),intent(inout):: vec\n integer(int64):: ret(1:vec%l)\n\n call check_array_allocation(vec)\n ret = vec%array(1:vec%l)\n end function\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use vector_int64_mod\n implicit none\n integer(int64):: n,x,m\n integer(int64):: i,j,l,ln,tot=0,s=0,ans=0\n integer(int64), allocatable:: id(:)\n type(vector_int64):: a\n\n read*, n,x,m\n allocate(id(0:m),source=-1_8)\n\n j=1\n do while(id(x) == -1_8)\n print'(*(i0,1x))', j,x,id(x)\n call a%push_back(x)\n tot=tot+x\n id(x)=j\n x=mod(x*x,m)\n j=j+1\n end do\n l = j-id(x)\n do i=id(x),j-1\n s=s+a%at(i)\n end do\n \n if (n st_init\n procedure:: update => st_update\n procedure:: query => st_query\n procedure:: at => st_at\n end type\ncontains\n function f(a,b) result(ret)\n integer(int64):: a,b,ret\n ret = min(a,b)\n end function\n\n subroutine st_init(st, n)\n class(seg_tree):: st\n integer(int64),intent(in):: n\n integer(int64):: x\n x=1\n do while(n > x)\n x = 2*x\n end do\n st%n = x\n st%n2 = 2*x-1\n allocate(st%v(st%n2), source=10_int64**16)\n end subroutine\n\n subroutine st_update(st, i, x)\n class(seg_tree):: st\n integer(int64), intent(in):: i\n integer(int64):: ind\n integer(int64), intent(in):: x\n \n ind = i + st%n - 1\n st%v(ind) = x\n do while(ind > 1)\n ind = ind/2\n st%v(ind) = f(st%v(2*ind), st%v(2*ind+1))\n end do\n end subroutine\n\n function st_query(st, a, b) result(ret)\n class(seg_tree):: st\n integer(int64), intent(in):: a,b\n integer(int64):: ret\n ret = st_query_sub(st, a, b, 1_8, 1_8, st%n)\n end function\n\n function st_at(st, i) result(ret)\n class(seg_tree):: st\n integer(int64),intent(in):: i\n integer(int64):: ret\n ret = st%v(i+st%n-1)\n end function\n\n recursive function st_query_sub(st, a, b, k, l, r) result(ret)\n type(seg_tree),intent(in):: st\n integer(int64),intent(in):: a,b,k,l,r\n integer(int64):: ret, vl, vr\n\n if (r < a .or. b < l) then\n ret = 10_int64**16\n else if (a <= l .and. r <= b) then\n ret = st%v(k)\n else\n vl = st_query_sub(st,a,b,k*2, l, (l+r)/2)\n vr = st_query_sub(st,a,b,k*2+1, (l+r)/2+1, r)\n ret = f(vl,vr)\n end if\n end function\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use segment_tree_mod\n implicit none\n integer(int64):: n,nq\n integer(int64):: i,ans,v\n integer(int64), allocatable:: q(:,:)\n type(seg_tree):: x_st, y_st\n\n read*, n,nq\n allocate(q(2,nq))\n do i=1,nq\n read*, q(:,i)\n end do\n\n ans = (n-2)*(n-2)\n call x_st%init(n)\n call y_st%init(n)\n do i=1,n-1\n call x_st%update(i,10_int64**16)\n call y_st%update(i,10_int64**16)\n end do\n call x_st%update(n,n)\n call y_st%update(n,n)\n\n do i=1,nq\n if (q(1,i) == 1) then\n v = x_st%query(q(2,i),n)\n ! print'(\"v: \",i0)', v\n ans=ans-(v-2)\n call y_st%update(v,min(y_st%at(v),q(2,i)))\n else\n v = y_st%query(q(2,i),n)\n ! print'(\"v: \",i0)', v\n ans=ans-(v-2)\n call x_st%update(v,min(x_st%at(v),q(2,i)))\n end if\n ! print'(i0)', ans\n end do\n print'(i0)', ans\nend program main", "language": "Fortran", "metadata": {"date": 1600610889, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02551.html", "problem_id": "p02551", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02551/input.txt", "sample_output_relpath": "derived/input_output/data/p02551/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02551/Fortran/s067030413.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067030413", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module segment_tree_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n\n type seg_tree\n integer(int64):: n,n2\n integer(int64),pointer:: v(:)\n contains\n procedure:: init => st_init\n procedure:: update => st_update\n procedure:: query => st_query\n procedure:: at => st_at\n end type\ncontains\n function f(a,b) result(ret)\n integer(int64):: a,b,ret\n ret = min(a,b)\n end function\n\n subroutine st_init(st, n)\n class(seg_tree):: st\n integer(int64),intent(in):: n\n integer(int64):: x\n x=1\n do while(n > x)\n x = 2*x\n end do\n st%n = x\n st%n2 = 2*x-1\n allocate(st%v(st%n2), source=10_int64**16)\n end subroutine\n\n subroutine st_update(st, i, x)\n class(seg_tree):: st\n integer(int64), intent(in):: i\n integer(int64):: ind\n integer(int64), intent(in):: x\n \n ind = i + st%n - 1\n st%v(ind) = x\n do while(ind > 1)\n ind = ind/2\n st%v(ind) = f(st%v(2*ind), st%v(2*ind+1))\n end do\n end subroutine\n\n function st_query(st, a, b) result(ret)\n class(seg_tree):: st\n integer(int64), intent(in):: a,b\n integer(int64):: ret\n ret = st_query_sub(st, a, b, 1_8, 1_8, st%n)\n end function\n\n function st_at(st, i) result(ret)\n class(seg_tree):: st\n integer(int64),intent(in):: i\n integer(int64):: ret\n ret = st%v(i+st%n-1)\n end function\n\n recursive function st_query_sub(st, a, b, k, l, r) result(ret)\n type(seg_tree),intent(in):: st\n integer(int64),intent(in):: a,b,k,l,r\n integer(int64):: ret, vl, vr\n\n if (r < a .or. b < l) then\n ret = 10_int64**16\n else if (a <= l .and. r <= b) then\n ret = st%v(k)\n else\n vl = st_query_sub(st,a,b,k*2, l, (l+r)/2)\n vr = st_query_sub(st,a,b,k*2+1, (l+r)/2+1, r)\n ret = f(vl,vr)\n end if\n end function\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use segment_tree_mod\n implicit none\n integer(int64):: n,nq\n integer(int64):: i,ans,v\n integer(int64), allocatable:: q(:,:)\n type(seg_tree):: x_st, y_st\n\n read*, n,nq\n allocate(q(2,nq))\n do i=1,nq\n read*, q(:,i)\n end do\n\n ans = (n-2)*(n-2)\n call x_st%init(n)\n call y_st%init(n)\n do i=1,n-1\n call x_st%update(i,10_int64**16)\n call y_st%update(i,10_int64**16)\n end do\n call x_st%update(n,n)\n call y_st%update(n,n)\n\n do i=1,nq\n if (q(1,i) == 1) then\n v = x_st%query(q(2,i),n)\n ! print'(\"v: \",i0)', v\n ans=ans-(v-2)\n call y_st%update(v,min(y_st%at(v),q(2,i)))\n else\n v = y_st%query(q(2,i),n)\n ! print'(\"v: \",i0)', v\n ans=ans-(v-2)\n call x_st%update(v,min(x_st%at(v),q(2,i)))\n end if\n ! print'(i0)', ans\n end do\n print'(i0)', ans\nend program main", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a grid with N rows and N columns of squares. Let (i, j) be the square at the i-th row from the top and the j-th column from the left.\n\nEach of the central (N-2) \\times (N-2) squares in the grid has a black stone on it.\nEach of the 2N - 1 squares on the bottom side and the right side has a white stone on it.\n\nQ queries are given. We ask you to process them in order.\nThere are two kinds of queries. Their input format and description are as follows:\n\n1 x: Place a white stone on (1, x). After that, for each black stone between (1, x) and the first white stone you hit if you go down from (1, x), replace it with a white stone.\n\n2 x: Place a white stone on (x, 1). After that, for each black stone between (x, 1) and the first white stone you hit if you go right from (x, 1), replace it with a white stone.\n\nHow many black stones are there on the grid after processing all Q queries?\n\nConstraints\n\n3 \\leq N \\leq 2\\times 10^5\n\n0 \\leq Q \\leq \\min(2N-4,2\\times 10^5)\n\n2 \\leq x \\leq N-1\n\nQueries are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nQuery_1\n\\vdots\nQuery_Q\n\nOutput\n\nPrint how many black stones there are on the grid after processing all Q queries.\n\nSample Input 1\n\n5 5\n1 3\n2 3\n1 4\n2 2\n1 2\n\nSample Output 1\n\n1\n\nAfter each query, the grid changes in the following way:\n\nSample Input 2\n\n200000 0\n\nSample Output 2\n\n39999200004\n\nSample Input 3\n\n176527 15\n1 81279\n2 22308\n2 133061\n1 80744\n2 44603\n1 170938\n2 139754\n2 15220\n1 172794\n1 159290\n2 156968\n1 56426\n2 77429\n1 97459\n2 71282\n\nSample Output 3\n\n31159505795", "sample_input": "5 5\n1 3\n2 3\n1 4\n2 2\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02551", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a grid with N rows and N columns of squares. Let (i, j) be the square at the i-th row from the top and the j-th column from the left.\n\nEach of the central (N-2) \\times (N-2) squares in the grid has a black stone on it.\nEach of the 2N - 1 squares on the bottom side and the right side has a white stone on it.\n\nQ queries are given. We ask you to process them in order.\nThere are two kinds of queries. Their input format and description are as follows:\n\n1 x: Place a white stone on (1, x). After that, for each black stone between (1, x) and the first white stone you hit if you go down from (1, x), replace it with a white stone.\n\n2 x: Place a white stone on (x, 1). After that, for each black stone between (x, 1) and the first white stone you hit if you go right from (x, 1), replace it with a white stone.\n\nHow many black stones are there on the grid after processing all Q queries?\n\nConstraints\n\n3 \\leq N \\leq 2\\times 10^5\n\n0 \\leq Q \\leq \\min(2N-4,2\\times 10^5)\n\n2 \\leq x \\leq N-1\n\nQueries are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nQuery_1\n\\vdots\nQuery_Q\n\nOutput\n\nPrint how many black stones there are on the grid after processing all Q queries.\n\nSample Input 1\n\n5 5\n1 3\n2 3\n1 4\n2 2\n1 2\n\nSample Output 1\n\n1\n\nAfter each query, the grid changes in the following way:\n\nSample Input 2\n\n200000 0\n\nSample Output 2\n\n39999200004\n\nSample Input 3\n\n176527 15\n1 81279\n2 22308\n2 133061\n1 80744\n2 44603\n1 170938\n2 139754\n2 15220\n1 172794\n1 159290\n2 156968\n1 56426\n2 77429\n1 97459\n2 71282\n\nSample Output 3\n\n31159505795", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3030, "cpu_time_ms": 209, "memory_kb": 14128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s156741519", "group_id": "codeNet:p02552", "input_text": "program answer\n implicit none\n integer :: x\n read(*,*) x\n\n if(x==0) then\n write(*,*) '1'\n else\n write(*,*) '0'\n end if\n\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1600023645, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/Fortran/s156741519.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156741519", "user_id": "u873780029"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "program answer\n implicit none\n integer :: x\n read(*,*) x\n\n if(x==0) then\n write(*,*) '1'\n else\n write(*,*) '0'\n end if\n\n stop\n end program answer", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 11, "memory_kb": 2792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s520343086", "group_id": "codeNet:p02553", "input_text": "program sample\n implicit none\n integer(8) :: a,b,c,d,e\n\n read(*,*) a,b,c,d\n\n e=max(a*c,a*d,b*c,b*d)\n\n write(*,*) e\n \n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1600024206, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02553/input.txt", "sample_output_relpath": "derived/input_output/data/p02553/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02553/Fortran/s520343086.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s520343086", "user_id": "u943740059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n integer(8) :: a,b,c,d,e\n\n read(*,*) a,b,c,d\n\n e=max(a*c,a*d,b*c,b*d)\n\n write(*,*) e\n \n stop\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "sample_input": "1 2 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02553", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 148, "cpu_time_ms": 12, "memory_kb": 2920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s931609326", "group_id": "codeNet:p02555", "input_text": "program redistribution\n implicit none\n integer(8), parameter :: modu = 1000000007\n integer :: s\n integer(8) :: m(3, 3) = 0\n read(*,*) s\n if (s < 3) then\n write(*,'(i0)') 0\n stop\n end if\n m(1, 1) = 1\n m(2, 1) = 1\n m(3, 2) = 1\n m(1, 3) = 1\n m = modmatpow(m, s - 3)\n write(*,'(i0)') m(1, 1)\ncontains\n function modmatmul(x, y) result(res)\n integer(8), intent(in) :: x(3, 3), y(3, 3)\n integer(8) :: tmp, res(3, 3)\n integer :: i, j, k\n do j = 1, 3\n do i = 1, 3\n res(i, j) = 0\n end do\n do k = 1, 3\n tmp = y(k, j)\n do i = 1, 3\n res(i, j) = mod(res(i, j) + x(i, k) * tmp, modu)\n end do\n end do\n end do\n end\n function modmatpow(x, n) result(res)\n integer(8), intent(in) :: x(3, 3)\n integer, intent(in) :: n\n integer(8) :: res(3, 3), tmp(3, 3)\n integer :: m, i\n res = 0\n do i = 1, 3\n res(i, i) = 1\n end do\n tmp = x\n m = n\n do while (m > 0)\n if (btest(m, 0)) res = modmatmul(res, tmp)\n tmp = modmatmul(tmp, tmp)\n m = rshift(m, 1)\n end do\n end\nend program redistribution", "language": "Fortran", "metadata": {"date": 1600096838, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02555.html", "problem_id": "p02555", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02555/input.txt", "sample_output_relpath": "derived/input_output/data/p02555/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02555/Fortran/s931609326.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931609326", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program redistribution\n implicit none\n integer(8), parameter :: modu = 1000000007\n integer :: s\n integer(8) :: m(3, 3) = 0\n read(*,*) s\n if (s < 3) then\n write(*,'(i0)') 0\n stop\n end if\n m(1, 1) = 1\n m(2, 1) = 1\n m(3, 2) = 1\n m(1, 3) = 1\n m = modmatpow(m, s - 3)\n write(*,'(i0)') m(1, 1)\ncontains\n function modmatmul(x, y) result(res)\n integer(8), intent(in) :: x(3, 3), y(3, 3)\n integer(8) :: tmp, res(3, 3)\n integer :: i, j, k\n do j = 1, 3\n do i = 1, 3\n res(i, j) = 0\n end do\n do k = 1, 3\n tmp = y(k, j)\n do i = 1, 3\n res(i, j) = mod(res(i, j) + x(i, k) * tmp, modu)\n end do\n end do\n end do\n end\n function modmatpow(x, n) result(res)\n integer(8), intent(in) :: x(3, 3)\n integer, intent(in) :: n\n integer(8) :: res(3, 3), tmp(3, 3)\n integer :: m, i\n res = 0\n do i = 1, 3\n res(i, i) = 1\n end do\n tmp = x\n m = n\n do while (m > 0)\n if (btest(m, 0)) res = modmatmul(res, tmp)\n tmp = modmatmul(tmp, tmp)\n m = rshift(m, 1)\n end do\n end\nend program redistribution", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind how many sequences there are whose terms are all integers greater than or equal to 3, and whose sum is equal to S.\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq S \\leq 2000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n3\n\n3 sequences satisfy the condition: \\{3,4\\}, \\{4,3\\} and \\{7\\}.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nThere are no sequences that satisfy the condition.\n\nSample Input 3\n\n1729\n\nSample Output 3\n\n294867501", "sample_input": "7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02555", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind how many sequences there are whose terms are all integers greater than or equal to 3, and whose sum is equal to S.\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq S \\leq 2000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n3\n\n3 sequences satisfy the condition: \\{3,4\\}, \\{4,3\\} and \\{7\\}.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nThere are no sequences that satisfy the condition.\n\nSample Input 3\n\n1729\n\nSample Output 3\n\n294867501", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1105, "cpu_time_ms": 5, "memory_kb": 2912}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s763464290", "group_id": "codeNet:p02570", "input_text": "program atcoder\nimplicit none \ninteger d, t, s\nreal(8) time\nread(*,*) d,t,s\n\ntime = dble(d)/dble(s)\n\nif (time <= t) then\n\twrite(*,*) 'Yes'\nelse\n\twrite(*,*) 'No'\nend if \nend program", "language": "Fortran", "metadata": {"date": 1599219323, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Fortran/s763464290.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763464290", "user_id": "u664509885"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program atcoder\nimplicit none \ninteger d, t, s\nreal(8) time\nread(*,*) d,t,s\n\ntime = dble(d)/dble(s)\n\nif (time <= t) then\n\twrite(*,*) 'Yes'\nelse\n\twrite(*,*) 'No'\nend if \nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 13, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s286546908", "group_id": "codeNet:p02570", "input_text": "program donot_be_late\n implicit none\n integer d, t, s\n real ans, a, b\n\n read *, d, t, s\n\n a=real(d)\n b=real(s)\n ans=a/b\n if(t>=ans)then\n print *,\"Yes\"\n else\n print *,\"No\"\n endif\nend program donot_be_late", "language": "Fortran", "metadata": {"date": 1599137766, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Fortran/s286546908.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s286546908", "user_id": "u273543964"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program donot_be_late\n implicit none\n integer d, t, s\n real ans, a, b\n\n read *, d, t, s\n\n a=real(d)\n b=real(s)\n ans=a/b\n if(t>=ans)then\n print *,\"Yes\"\n else\n print *,\"No\"\n endif\nend program donot_be_late", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 13, "memory_kb": 2788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s490274988", "group_id": "codeNet:p02570", "input_text": "program donot_be_late\n implicit none\n integer d, t, s\n real ans\n\n read *, d, t, s\n ans=d/s\n if(t>=ans) then\n print *,\"Yes\"\n else\n print *,\"No\"\n end if\nend program donot_be_late", "language": "Fortran", "metadata": {"date": 1599135316, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Fortran/s490274988.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s490274988", "user_id": "u273543964"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program donot_be_late\n implicit none\n integer d, t, s\n real ans\n\n read *, d, t, s\n ans=d/s\n if(t>=ans) then\n print *,\"Yes\"\n else\n print *,\"No\"\n end if\nend program donot_be_late", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 11, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s957853799", "group_id": "codeNet:p02570", "input_text": "program answer\n implicit none\n integer :: D, T, S\n read(*,*) D, T, S\n if(dble(D)/S>T) then\n write(*,*) 'No'\n else\n write(*,*) 'Yes'\n end if\n\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1598727806, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Fortran/s957853799.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s957853799", "user_id": "u873780029"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program answer\n implicit none\n integer :: D, T, S\n read(*,*) D, T, S\n if(dble(D)/S>T) then\n write(*,*) 'No'\n else\n write(*,*) 'Yes'\n end if\n\n stop\n end program answer", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 12, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s370655362", "group_id": "codeNet:p02570", "input_text": "program main\n implicit none\n integer :: D, T,S\n\n read(*,*) D,T,S\n\n if (real(D)/real(S) <= T ) then\n write(*,'(a)') 'Yes'\n else\n write(*,'(a)') 'No'\n end if\n\n\nend program\n", "language": "Fortran", "metadata": {"date": 1598727788, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02570/input.txt", "sample_output_relpath": "derived/input_output/data/p02570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02570/Fortran/s370655362.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s370655362", "user_id": "u886432251"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n integer :: D, T,S\n\n read(*,*) D,T,S\n\n if (real(D)/real(S) <= T ) then\n write(*,'(a)') 'Yes'\n else\n write(*,'(a)') 'No'\n end if\n\n\nend program\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "sample_input": "1000 15 80\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02570", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is meeting up with Aoki.\n\nThey have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.\n\nTakahashi will leave his house now and go straight to the place at a speed of S meters per minute.\n\nWill he arrive in time?\n\nConstraints\n\n1 \\leq D \\leq 10000\n\n1 \\leq T \\leq 10000\n\n1 \\leq S \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD T S\n\nOutput\n\nIf Takahashi will reach the place in time, print Yes; otherwise, print No.\n\nSample Input 1\n\n1000 15 80\n\nSample Output 1\n\nYes\n\nIt takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.\n\nSample Input 2\n\n2000 20 100\n\nSample Output 2\n\nYes\n\nIt takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.\n\nSample Input 3\n\n10000 1 1\n\nSample Output 3\n\nNo\n\nHe will be late.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s887096951", "group_id": "codeNet:p02571", "input_text": "program main\n implicit none\n character(1000)::s,t\n integer::n,m,ans,i,j,nm\n integer,allocatable::aaa(:)\n\n ans=0\n\n read*,s,t\n !print*,s,t\n\n n=len_trim(s)\n m=len_trim(t)\n nm=n-m\n !print*,n,m,nm\n allocate(aaa(nm+1))\n !print*,s(n:n),t(m:m)\n if(nm==0) then\n do i=1,m\n if(s(i:i)/=t(i:i)) then\n !print*,s(i:i)\n ans=ans+1\n end if\n end do\n go to 100\n end if\n\n \n ans=0\n if(nm>0) then\n !print*,s(1:1)\n do i=1,nm+1\n aaa(i)=0\n do j=i,m+i-1\n ! print*,s(j:j)\n if(s(j:j)/=t(j-i+1:j-i+1)) then\n ! print*,s(j:j)\n aaa(i)=aaa(i)+1\n end if\n end do\n end do\n ans=minval(aaa)\n end if\n\n100 print*,ans\nend program main", "language": "Fortran", "metadata": {"date": 1598729867, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02571.html", "problem_id": "p02571", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02571/input.txt", "sample_output_relpath": "derived/input_output/data/p02571/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02571/Fortran/s887096951.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s887096951", "user_id": "u882765852"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n character(1000)::s,t\n integer::n,m,ans,i,j,nm\n integer,allocatable::aaa(:)\n\n ans=0\n\n read*,s,t\n !print*,s,t\n\n n=len_trim(s)\n m=len_trim(t)\n nm=n-m\n !print*,n,m,nm\n allocate(aaa(nm+1))\n !print*,s(n:n),t(m:m)\n if(nm==0) then\n do i=1,m\n if(s(i:i)/=t(i:i)) then\n !print*,s(i:i)\n ans=ans+1\n end if\n end do\n go to 100\n end if\n\n \n ans=0\n if(nm>0) then\n !print*,s(1:1)\n do i=1,nm+1\n aaa(i)=0\n do j=i,m+i-1\n ! print*,s(j:j)\n if(s(j:j)/=t(j-i+1:j-i+1)) then\n ! print*,s(j:j)\n aaa(i)=aaa(i)+1\n end if\n end do\n end do\n ans=minval(aaa)\n end if\n\n100 print*,ans\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "sample_input": "cabacc\nabc\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02571", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 864, "cpu_time_ms": 10, "memory_kb": 2868}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s471530205", "group_id": "codeNet:p02571", "input_text": "program p2\n implicit none\n character(len=1005)::s, t\n integer::tmp, ans, i, j, ls, lt\n read(*,*) s, t\n ls = len_trim(s)\n lt = len_trim(t)\n ans = lt\n do i = 1, ls-lt+1\n tmp = 0\n do j = 1, lt\n if(s(i+j-1:i+j-1) .ne. t(j:j)) tmp = tmp + 1\n end do\n ans = min(tmp,ans)\n end do\n write(*,*) ans\n stop\nend program", "language": "Fortran", "metadata": {"date": 1598727914, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02571.html", "problem_id": "p02571", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02571/input.txt", "sample_output_relpath": "derived/input_output/data/p02571/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02571/Fortran/s471530205.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s471530205", "user_id": "u841856382"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program p2\n implicit none\n character(len=1005)::s, t\n integer::tmp, ans, i, j, ls, lt\n read(*,*) s, t\n ls = len_trim(s)\n lt = len_trim(t)\n ans = lt\n do i = 1, ls-lt+1\n tmp = 0\n do j = 1, lt\n if(s(i+j-1:i+j-1) .ne. t(j:j)) tmp = tmp + 1\n end do\n ans = min(tmp,ans)\n end do\n write(*,*) ans\n stop\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "sample_input": "cabacc\nabc\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02571", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 10, "memory_kb": 2800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s662221605", "group_id": "codeNet:p02573", "input_text": "program answer\n implicit none\n integer :: i, N, M, count, h\n integer, allocatable :: A(:), B(:), C(:), D(:,:)\n read(*,*) N, M\n allocate(A(M),B(M),C(N),D(N,N))\n do i = 1, M\n read(*,*) A(i), B(i)\n end do\n\n do i = 1, M\n if(B(i) null(), right => null()\n integer :: level = 1\n type(t_entry), pointer :: e => null()\n end type\n\n type tree_map\n integer :: size = 0\n type(t_node), private, pointer :: root => null()\n integer(val_kind) :: default = 0\n contains\n procedure :: clear => clear\n procedure :: is_empty => is_empty\n procedure :: is_not_empty => is_not_empty\n procedure :: get_keys => get_keys\n procedure :: put => put\n procedure :: remove => remove\n procedure :: get => get\n procedure :: contains => contain\n procedure :: first_key => get_first_key\n procedure :: poll_first => poll_first\n procedure :: last_key => get_last_key\n procedure :: poll_last => poll_last\n procedure :: floor_key => floor_key\n procedure :: lower_key => lower_key\n procedure :: ceiling_key => ceiling_key\n procedure :: higher_key => higher_key\n end type\n\ncontains\n\n function new_entry(key, val) result(res)\n integer(key_kind), intent(in) :: key\n integer(val_kind), optional, intent(in) :: val\n type(t_entry), pointer :: res\n res => null()\n allocate(res)\n res%key = key\n res%val = merge(val, 0_val_kind, present(val))\n end\n\n function new_node(e) result(res)\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: res\n res => null()\n allocate(res)\n res%e => e\n end\n\n integer function level(node) result(res)\n type(t_node), pointer, intent(in) :: node\n res = merge(node%level, 0, associated(node))\n end\n\n logical function is_leaf(node) result(res)\n type(t_node), pointer, intent(in) :: node\n res = associated(node) .and. &\n .not.associated(node%left) .and. &\n .not.associated(node%right)\n end\n\n function skew(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n if (.not.associated(node)) then\n res => null()\n else if (.not.associated(node%left)) then\n res => node\n else if (level(node%left) == level(node)) then\n res => node%left\n node%left => res%right\n res%right => node\n else\n res => node\n end if\n end\n\n function split(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n if (.not.associated(node)) then\n res => null()\n else if (.not.associated(node%right)) then\n res => node\n else if (.not.associated(node%right%right)) then\n res => node\n else if (level(node%right%right) == level(node)) then\n res => node%right\n node%right => res%left\n res%left => node\n res%level = res%level + 1\n else\n res => node\n end if\n end\n\n function predecessor(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n res => null()\n if (.not.associated(node%left)) return\n res => node%left\n do while (associated(res%right))\n res => res%right\n end do\n end\n\n function successor(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n res => null()\n if (.not.associated(node%right)) return\n res => node%right\n do while (associated(res%left))\n res => res%left\n end do\n end\n\n recursive function insert(node, e) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: res\n res => new_node(e)\n if (.not.associated(node)) return\n res => node\n if (e%key < res%e%key) then\n res%left => insert(res%left, e)\n else if (e%key > res%e%key) then\n res%right => insert(res%right, e)\n else\n res%e => e\n end if\n res => skew(res)\n res => split(res)\n end\n\n recursive function delete(node, e) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: res, l\n res => node\n if (.not.associated(node)) return\n if (e%key < res%e%key) then\n res%left => delete(res%left,e)\n else if (e%key > res%e%key) then\n res%right => delete(res%right,e)\n else\n if (is_leaf(res)) then\n res => null()\n return\n end if\n if (.not.associated(res%left)) then\n l => successor(res)\n res%right => delete(res%right, l%e)\n res%e => l%e\n else\n l => predecessor(res)\n res%left => delete(res%left, l%e)\n res%e => l%e\n end if\n end if\n res => decrease_level(res)\n res => skew(res)\n res%right => skew(res%right)\n if (associated(res%right)) res%right%right => skew(res%right%right)\n res => split(res)\n res%right => split(res%right)\n end\n\n function decrease_level(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n integer :: should_be\n res => node\n should_be = min(level(res%left), level(res%right)) + 1\n if (res%level > should_be) then\n res%level = should_be\n if (level(res%right) > should_be) res%right%level = should_be\n end if\n end\n\n recursive subroutine release_tree(node)\n type(t_node), pointer, intent(inout) :: node\n if (.not.associated(node)) return\n call release_tree(node%left)\n call release_tree(node%right)\n deallocate(node)\n end\n\n recursive subroutine get_keys_list(node, keys, num)\n type(t_node), pointer, intent(in) :: node\n integer(key_kind), intent(inout) :: keys(:)\n integer, intent(inout) :: num\n if (.not.associated(node)) return\n call get_keys_list(node%left, keys, num)\n num = num + 1\n keys(num) = node%e%key\n call get_keys_list(node%right, keys, num)\n end\n\n subroutine clear(this)\n class(tree_map), intent(inout) :: this\n call release_tree(this%root)\n this%root => null()\n end\n\n logical function is_empty(this) result(res)\n class(tree_map), intent(in) :: this\n res = .not.associated(this%root)\n end\n\n logical function is_not_empty(this) result(res)\n class(tree_map), intent(in) :: this\n res = associated(this%root)\n end\n\n subroutine put_entry(map, e)\n type(tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n if (.not.contains_entry(map, e)) map%size = map%size + 1\n map%root => insert(map%root, e)\n end\n\n subroutine remove_entry(map, e)\n type(tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n if (contains_entry(map, e)) then\n map%root => delete(map%root, e)\n map%size = map%size - 1\n end if\n end\n\n function get_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n res => n%e\n return\n end if\n end do\n end\n\n function contains_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n logical :: res\n res = .false.\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n res = .true.\n return\n end if\n end do\n end\n\n function get_first_entry(map) result(res)\n type(tree_map), intent(in) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n res => n%e\n end\n\n function poll_first_entry(map) result(res)\n type(tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => get_first_entry(map)\n map%root => delete(map%root, res)\n end\n\n function get_last_entry(map) result(res)\n type(tree_map), intent(in) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n res => n%e\n end\n\n function poll_last_entry(map) result(res)\n type(tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => get_last_entry(map)\n map%root => delete(map%root, res)\n end\n\n function floor_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n if (.not.associated(res)) then\n res => n%e\n cycle\n end if\n if (e%key - res%key > e%key - n%e%key) res => n%e\n n => n%right\n else\n res => n%e\n return\n end if\n end do\n end\n\n function lower_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: res\n res => floor_entry(map, new_entry(e%key - 1))\n end\n\n function ceiling_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n if (.not.associated(res)) then\n res => n%e\n cycle\n end if\n if (e%key - res%key < e%key - n%e%key) res => n%e\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n res => n%e\n return\n end if\n end do\n end\n\n function higher_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: res\n res => ceiling_entry(map, new_entry(e%key + 1))\n end\n\n function get_keys(this) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind) :: res(this%size)\n integer :: num\n res = 0\n num = 0\n call get_keys_list(this%root, res, num)\n end\n\n subroutine put(this, key, val)\n class(tree_map), intent(inout) :: this\n integer(key_kind), intent(in) :: key\n integer(val_kind), intent(in) :: val\n call put_entry(this, new_entry(key, val))\n end\n\n subroutine remove(this, key)\n class(tree_map), intent(inout) :: this\n integer(key_kind), intent(in) :: key\n call remove_entry(this, new_entry(key))\n end\n\n integer(val_kind) function get(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => get_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%val\n end\n\n logical function contain(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n res = contains_entry(this, new_entry(key))\n end\n\n integer(key_kind) function get_first_key(this) result(res)\n class(tree_map), intent(in) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => get_first_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function poll_first(this) result(res)\n class(tree_map), intent(inout) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => poll_first_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function get_last_key(this) result(res)\n class(tree_map), intent(in) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => get_last_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function poll_last(this) result(res)\n class(tree_map), intent(inout) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => poll_last_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function floor_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => floor_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function lower_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => lower_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function ceiling_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => ceiling_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function higher_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => higher_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\nend module mod_tree_map\nprogram i_hate_shortest_path_problem\n use mod_tree_map\n implicit none\n integer :: h, w, a, b, c, d, e, key, val, i\n type(tree_map) :: map, cnt\n read(*,*) h, w\n do i = 1, w\n call map%put(i, i)\n end do\n call cnt%put(0, w)\n do i = 1, h\n read(*,*) a, b\n key = map%ceiling_key(a)\n b = b + 1\n c = -1\n do while (key <= b .and. key > 0)\n val = map%get(key)\n c = max(c, val)\n d = key - val\n e = cnt%get(d) - 1\n if (e == 0) then\n call cnt%remove(d)\n else\n call cnt%put(d, e)\n end if\n call map%remove(key)\n key = map%ceiling_key(key)\n end do\n if (c > 0 .and. b <= w) then\n call map%put(b, c)\n d = b - c\n call cnt%put(d, cnt%get(d) + 1)\n end if\n write(*,'(i0)') merge(cnt%first_key() + i, -1, cnt%size > 0)\n end do\nend program i_hate_shortest_path_problem", "language": "Fortran", "metadata": {"date": 1598745575, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02575.html", "problem_id": "p02575", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02575/input.txt", "sample_output_relpath": "derived/input_output/data/p02575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02575/Fortran/s414892242.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414892242", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n3\n6\n-1\n", "input_to_evaluate": "module mod_tree_map\n implicit none\n integer, private, parameter :: key_kind = 4\n integer, private, parameter :: val_kind = 4\n\n type t_entry\n private\n integer(key_kind) :: key\n integer(val_kind) :: val\n end type\n\n type t_node\n private\n type(t_node), pointer :: left => null(), right => null()\n integer :: level = 1\n type(t_entry), pointer :: e => null()\n end type\n\n type tree_map\n integer :: size = 0\n type(t_node), private, pointer :: root => null()\n integer(val_kind) :: default = 0\n contains\n procedure :: clear => clear\n procedure :: is_empty => is_empty\n procedure :: is_not_empty => is_not_empty\n procedure :: get_keys => get_keys\n procedure :: put => put\n procedure :: remove => remove\n procedure :: get => get\n procedure :: contains => contain\n procedure :: first_key => get_first_key\n procedure :: poll_first => poll_first\n procedure :: last_key => get_last_key\n procedure :: poll_last => poll_last\n procedure :: floor_key => floor_key\n procedure :: lower_key => lower_key\n procedure :: ceiling_key => ceiling_key\n procedure :: higher_key => higher_key\n end type\n\ncontains\n\n function new_entry(key, val) result(res)\n integer(key_kind), intent(in) :: key\n integer(val_kind), optional, intent(in) :: val\n type(t_entry), pointer :: res\n res => null()\n allocate(res)\n res%key = key\n res%val = merge(val, 0_val_kind, present(val))\n end\n\n function new_node(e) result(res)\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: res\n res => null()\n allocate(res)\n res%e => e\n end\n\n integer function level(node) result(res)\n type(t_node), pointer, intent(in) :: node\n res = merge(node%level, 0, associated(node))\n end\n\n logical function is_leaf(node) result(res)\n type(t_node), pointer, intent(in) :: node\n res = associated(node) .and. &\n .not.associated(node%left) .and. &\n .not.associated(node%right)\n end\n\n function skew(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n if (.not.associated(node)) then\n res => null()\n else if (.not.associated(node%left)) then\n res => node\n else if (level(node%left) == level(node)) then\n res => node%left\n node%left => res%right\n res%right => node\n else\n res => node\n end if\n end\n\n function split(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n if (.not.associated(node)) then\n res => null()\n else if (.not.associated(node%right)) then\n res => node\n else if (.not.associated(node%right%right)) then\n res => node\n else if (level(node%right%right) == level(node)) then\n res => node%right\n node%right => res%left\n res%left => node\n res%level = res%level + 1\n else\n res => node\n end if\n end\n\n function predecessor(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n res => null()\n if (.not.associated(node%left)) return\n res => node%left\n do while (associated(res%right))\n res => res%right\n end do\n end\n\n function successor(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n res => null()\n if (.not.associated(node%right)) return\n res => node%right\n do while (associated(res%left))\n res => res%left\n end do\n end\n\n recursive function insert(node, e) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: res\n res => new_node(e)\n if (.not.associated(node)) return\n res => node\n if (e%key < res%e%key) then\n res%left => insert(res%left, e)\n else if (e%key > res%e%key) then\n res%right => insert(res%right, e)\n else\n res%e => e\n end if\n res => skew(res)\n res => split(res)\n end\n\n recursive function delete(node, e) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: res, l\n res => node\n if (.not.associated(node)) return\n if (e%key < res%e%key) then\n res%left => delete(res%left,e)\n else if (e%key > res%e%key) then\n res%right => delete(res%right,e)\n else\n if (is_leaf(res)) then\n res => null()\n return\n end if\n if (.not.associated(res%left)) then\n l => successor(res)\n res%right => delete(res%right, l%e)\n res%e => l%e\n else\n l => predecessor(res)\n res%left => delete(res%left, l%e)\n res%e => l%e\n end if\n end if\n res => decrease_level(res)\n res => skew(res)\n res%right => skew(res%right)\n if (associated(res%right)) res%right%right => skew(res%right%right)\n res => split(res)\n res%right => split(res%right)\n end\n\n function decrease_level(node) result(res)\n type(t_node), pointer, intent(in) :: node\n type(t_node), pointer :: res\n integer :: should_be\n res => node\n should_be = min(level(res%left), level(res%right)) + 1\n if (res%level > should_be) then\n res%level = should_be\n if (level(res%right) > should_be) res%right%level = should_be\n end if\n end\n\n recursive subroutine release_tree(node)\n type(t_node), pointer, intent(inout) :: node\n if (.not.associated(node)) return\n call release_tree(node%left)\n call release_tree(node%right)\n deallocate(node)\n end\n\n recursive subroutine get_keys_list(node, keys, num)\n type(t_node), pointer, intent(in) :: node\n integer(key_kind), intent(inout) :: keys(:)\n integer, intent(inout) :: num\n if (.not.associated(node)) return\n call get_keys_list(node%left, keys, num)\n num = num + 1\n keys(num) = node%e%key\n call get_keys_list(node%right, keys, num)\n end\n\n subroutine clear(this)\n class(tree_map), intent(inout) :: this\n call release_tree(this%root)\n this%root => null()\n end\n\n logical function is_empty(this) result(res)\n class(tree_map), intent(in) :: this\n res = .not.associated(this%root)\n end\n\n logical function is_not_empty(this) result(res)\n class(tree_map), intent(in) :: this\n res = associated(this%root)\n end\n\n subroutine put_entry(map, e)\n type(tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n if (.not.contains_entry(map, e)) map%size = map%size + 1\n map%root => insert(map%root, e)\n end\n\n subroutine remove_entry(map, e)\n type(tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n if (contains_entry(map, e)) then\n map%root => delete(map%root, e)\n map%size = map%size - 1\n end if\n end\n\n function get_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n res => n%e\n return\n end if\n end do\n end\n\n function contains_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n logical :: res\n res = .false.\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n res = .true.\n return\n end if\n end do\n end\n\n function get_first_entry(map) result(res)\n type(tree_map), intent(in) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n res => n%e\n end\n\n function poll_first_entry(map) result(res)\n type(tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => get_first_entry(map)\n map%root => delete(map%root, res)\n end\n\n function get_last_entry(map) result(res)\n type(tree_map), intent(in) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n res => n%e\n end\n\n function poll_last_entry(map) result(res)\n type(tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => get_last_entry(map)\n map%root => delete(map%root, res)\n end\n\n function floor_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n if (.not.associated(res)) then\n res => n%e\n cycle\n end if\n if (e%key - res%key > e%key - n%e%key) res => n%e\n n => n%right\n else\n res => n%e\n return\n end if\n end do\n end\n\n function lower_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: res\n res => floor_entry(map, new_entry(e%key - 1))\n end\n\n function ceiling_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: res\n res => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n if (.not.associated(res)) then\n res => n%e\n cycle\n end if\n if (e%key - res%key < e%key - n%e%key) res => n%e\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n res => n%e\n return\n end if\n end do\n end\n\n function higher_entry(map, e) result(res)\n type(tree_map), intent(in) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: res\n res => ceiling_entry(map, new_entry(e%key + 1))\n end\n\n function get_keys(this) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind) :: res(this%size)\n integer :: num\n res = 0\n num = 0\n call get_keys_list(this%root, res, num)\n end\n\n subroutine put(this, key, val)\n class(tree_map), intent(inout) :: this\n integer(key_kind), intent(in) :: key\n integer(val_kind), intent(in) :: val\n call put_entry(this, new_entry(key, val))\n end\n\n subroutine remove(this, key)\n class(tree_map), intent(inout) :: this\n integer(key_kind), intent(in) :: key\n call remove_entry(this, new_entry(key))\n end\n\n integer(val_kind) function get(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => get_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%val\n end\n\n logical function contain(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n res = contains_entry(this, new_entry(key))\n end\n\n integer(key_kind) function get_first_key(this) result(res)\n class(tree_map), intent(in) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => get_first_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function poll_first(this) result(res)\n class(tree_map), intent(inout) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => poll_first_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function get_last_key(this) result(res)\n class(tree_map), intent(in) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => get_last_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function poll_last(this) result(res)\n class(tree_map), intent(inout) :: this\n type(t_entry), pointer :: e\n res = this%default\n e => poll_last_entry(this)\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function floor_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => floor_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function lower_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => lower_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function ceiling_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => ceiling_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\n integer(key_kind) function higher_key(this, key) result(res)\n class(tree_map), intent(in) :: this\n integer(key_kind), intent(in) :: key\n type(t_entry), pointer :: e\n res = this%default\n e => higher_entry(this, new_entry(key))\n if (.not.associated(e)) return\n res = e%key\n end\n\nend module mod_tree_map\nprogram i_hate_shortest_path_problem\n use mod_tree_map\n implicit none\n integer :: h, w, a, b, c, d, e, key, val, i\n type(tree_map) :: map, cnt\n read(*,*) h, w\n do i = 1, w\n call map%put(i, i)\n end do\n call cnt%put(0, w)\n do i = 1, h\n read(*,*) a, b\n key = map%ceiling_key(a)\n b = b + 1\n c = -1\n do while (key <= b .and. key > 0)\n val = map%get(key)\n c = max(c, val)\n d = key - val\n e = cnt%get(d) - 1\n if (e == 0) then\n call cnt%remove(d)\n else\n call cnt%put(d, e)\n end if\n call map%remove(key)\n key = map%ceiling_key(key)\n end do\n if (c > 0 .and. b <= w) then\n call map%put(b, c)\n d = b - c\n call cnt%put(d, cnt%get(d) + 1)\n end if\n write(*,'(i0)') merge(cnt%first_key() + i, -1, cnt%size > 0)\n end do\nend program i_hate_shortest_path_problem", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a grid of squares with H+1 horizontal rows and W vertical columns.\n\nYou will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \\ldots, B_i-th squares from the left in the i-th row from the top.\n\nFor each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.\n\nConstraints\n\n1 \\leq H,W \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_1 B_1\nA_2 B_2\n:\nA_H B_H\n\nOutput\n\nPrint H lines. The i-th line should contain the answer for the case k=i.\n\nSample Input 1\n\n4 4\n2 4\n1 1\n2 3\n2 4\n\nSample Output 1\n\n1\n3\n6\n-1\n\nLet (i,j) denote the square at the i-th row from the top and j-th column from the left.\n\nFor k=1, we need one move such as (1,1) → (2,1).\n\nFor k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).\n\nFor k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).\n\nFor k=4, it is impossible to reach any square in the fifth row from the top.", "sample_input": "4 4\n2 4\n1 1\n2 3\n2 4\n"}, "reference_outputs": ["1\n3\n6\n-1\n"], "source_document_id": "p02575", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a grid of squares with H+1 horizontal rows and W vertical columns.\n\nYou will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \\ldots, B_i-th squares from the left in the i-th row from the top.\n\nFor each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.\n\nConstraints\n\n1 \\leq H,W \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_1 B_1\nA_2 B_2\n:\nA_H B_H\n\nOutput\n\nPrint H lines. The i-th line should contain the answer for the case k=i.\n\nSample Input 1\n\n4 4\n2 4\n1 1\n2 3\n2 4\n\nSample Output 1\n\n1\n3\n6\n-1\n\nLet (i,j) denote the square at the i-th row from the top and j-th column from the left.\n\nFor k=1, we need one move such as (1,1) → (2,1).\n\nFor k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).\n\nFor k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).\n\nFor k=4, it is impossible to reach any square in the fifth row from the top.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 14369, "cpu_time_ms": 935, "memory_kb": 508508}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s417737589", "group_id": "codeNet:p02577", "input_text": "program answer\n implicit none\n integer(16) :: N, i, a, b\n integer(16), allocatable :: s(:)\n read(*,*) N\n if(N==0) then\n write(*,*) 'Yes'\n stop\n end if\n \n do i = 1, 200000\n if(10**(i-1)<=N.and.N<10**i) then\n a=i\n allocate(s(a))\n exit\n end if\n end do\n\n do i = 1, a\n s(a-i+1)=int(N/10**(a-i))\n N=N-10**(a-i)*int(N/10**(a-i))\n end do\n\n if(mod(sum(s),9)==0) then\n write(*,*) 'Yes'\n else\n write(*,*) 'No'\n end if\n deallocate(s)\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1598123892, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/Fortran/s417737589.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s417737589", "user_id": "u873780029"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program answer\n implicit none\n integer(16) :: N, i, a, b\n integer(16), allocatable :: s(:)\n read(*,*) N\n if(N==0) then\n write(*,*) 'Yes'\n stop\n end if\n \n do i = 1, 200000\n if(10**(i-1)<=N.and.N<10**i) then\n a=i\n allocate(s(a))\n exit\n end if\n end do\n\n do i = 1, a\n s(a-i+1)=int(N/10**(a-i))\n N=N-10**(a-i)*int(N/10**(a-i))\n end do\n\n if(mod(sum(s),9)==0) then\n write(*,*) 'Yes'\n else\n write(*,*) 'No'\n end if\n deallocate(s)\n stop\n end program answer", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 516, "cpu_time_ms": 89, "memory_kb": 3336}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s154721365", "group_id": "codeNet:p02577", "input_text": "program b176\n \nimplicit none\ncharacter(len=200000) :: a \ninteger :: n, i, t\n\nread *, a\n\nn = 0\n\ndo i = 1, 200000\n if (a(i:i) == ' ') then\n exit\n else\n read(a(i:i),*) t\n n = n + t\n end if\nend do\n\n!print *, n\n \nif(mod(n, 9) == 0) then\n print *, 'Yes'\nelse\n print *, 'No'\nend if\n\n\nend program b176", "language": "Fortran", "metadata": {"date": 1598123559, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/Fortran/s154721365.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154721365", "user_id": "u644436095"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program b176\n \nimplicit none\ncharacter(len=200000) :: a \ninteger :: n, i, t\n\nread *, a\n\nn = 0\n\ndo i = 1, 200000\n if (a(i:i) == ' ') then\n exit\n else\n read(a(i:i),*) t\n n = n + t\n end if\nend do\n\n!print *, n\n \nif(mod(n, 9) == 0) then\n print *, 'Yes'\nelse\n print *, 'No'\nend if\n\n\nend program b176", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 296, "cpu_time_ms": 85, "memory_kb": 3088}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s649077987", "group_id": "codeNet:p02577", "input_text": " PROGRAM piyo\n IMPLICIT NONE\n INTEGER,PARAMETER :: p = 8\n integer(p) :: N(2*10**5+1)\n N = 0\n read'(*(i1))',N\n \n if( mod(sum(N),9)==0 )then\n print*,'Yes'\n else\n print*,'No'\n end if\n \n \n stop\n !debugg\n \n print*,n(1:10)\n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1598123193, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/Fortran/s649077987.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649077987", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " PROGRAM piyo\n IMPLICIT NONE\n INTEGER,PARAMETER :: p = 8\n integer(p) :: N(2*10**5+1)\n N = 0\n read'(*(i1))',N\n \n if( mod(sum(N),9)==0 )then\n print*,'Yes'\n else\n print*,'No'\n end if\n \n \n stop\n !debugg\n \n print*,n(1:10)\n \n \n END PROGRAM", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 29, "memory_kb": 4488}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s305110765", "group_id": "codeNet:p02577", "input_text": "program ABC176B\n implicit none\n integer(8)::i,ans=0\n character(2000000)::S\n read*,S\n do i=1,len_trim(S)\n ans=ans+ichar(S(i:i))-48\n end do\n \n if(mod(ans,9)==0)then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\nend program ABC176B", "language": "Fortran", "metadata": {"date": 1598123070, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/Fortran/s305110765.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305110765", "user_id": "u414699019"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC176B\n implicit none\n integer(8)::i,ans=0\n character(2000000)::S\n read*,S\n do i=1,len_trim(S)\n ans=ans+ichar(S(i:i))-48\n end do\n \n if(mod(ans,9)==0)then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\nend program ABC176B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 14, "memory_kb": 5000}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s593463613", "group_id": "codeNet:p02578", "input_text": "program main\n\n implicit none\n integer::n,i,answer\n real(8)::ans,maxx\n real(8),allocatable::a(:)\n \n read*,n\n allocate(a(n))\n read*,a\n !print*,a\n\nans=0\nmaxx=a(1)\n do i=2,n\n if(maxx>a(i)) then\n ans=ans+(maxx-a(i))\n !print*,ans\n end if\n if(maxxa(i)) then\n ans=ans+(maxx-a(i))\n !print*,ans\n end if\n if(maxx dq_append\n procedure:: appendleft => dq_appendleft\n procedure:: pop => dq_pop\n procedure:: popleft => dq_popleft\n procedure:: right => dq_right\n procedure:: left => dq_left\n procedure:: remaining_elements => dq_remaining_elements\n procedure:: remain => dq_remain\n end type\n\n interface deque\n procedure:: dq_init\n end interface\ncontains\n function dq_init() result(dq)\n ! 初期化\n type(deque):: dq\n dq%r=0; dq%rmax=1\n dq%l=1; dq%lmax=-1\n allocate(dq%v(dq%lmax:dq%rmax))\n end function\n\n\n subroutine dq_append(dq,num)\n ! 右端に挿入\n class(deque):: dq\n integer(int32):: num\n if (dq%r+1 > dq%rmax) call dq_add_(dq)\n dq%r=dq%r+1\n dq%v(dq%r) = num\n end subroutine\n\n subroutine dq_appendleft(dq,num)\n ! 左端に挿入\n class(deque):: dq\n integer(int32):: num\n if (dq%l-1 < dq%lmax) call dq_add_(dq)\n dq%l=dq%l-1\n dq%v(dq%l) = num\n end subroutine\n\n subroutine dq_add_(dq)\n ! arrayの延長\n class(deque):: dq\n integer(int32):: l\n integer(int32),pointer:: tmp(:)\n l = size(dq%v)\n allocate(tmp(l))\n tmp(:) = dq%v(:)\n deallocate(dq%v)\n allocate(dq%v(3*dq%lmax:3*dq%rmax))\n dq%v(dq%lmax:dq%rmax) = tmp(:)\n dq%lmax = 3*dq%lmax\n dq%rmax = 3*dq%rmax\n end subroutine\n\n\n function dq_pop(dq) result(ret)\n ! 右端から取り出し\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n dq%r=dq%r-1\n end function\n\n function dq_popleft(dq) result(ret)\n ! 左端から取り出し\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n dq%l=dq%l+1\n end function\n\n\n function dq_right(dq) result(ret)\n ! 右端を確認\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n end function\n\n function dq_left(dq) result(ret)\n ! 左端を確認\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n end function\n\n function dq_remaining_elements(dq) result(ret)\n ! 残りの要素数\n class(deque):: dq\n integer(int32):: ret \n ret = dq%r - dq%l + 1\n end function\n\n function dq_remain(dq) result(ret)\n ! 要素が残っているかどうか\n class(deque):: dq\n logical:: ret\n ret = dq%remaining_elements() > 0\n end function\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use deque_mod\n implicit none\n integer(int32):: h,w,sx,sy,gx,gy,i,j,x,y,dx,dy,nx,ny\n integer(int32),allocatable:: nm(:,:)\n character(1),allocatable:: s(:,:)\n logical,allocatable:: passed(:,:)\n type(deque):: tx, ty, tx2,ty2\n\n tx = deque()\n ty = deque()\n tx2 = deque()\n ty2 = deque()\n read*, h,w\n read*, sy,sx\n read*, gy,gx\n\n allocate(nm(w,h), source=1000000000)\n allocate(s(w,h))\n allocate(passed(w,h),source=.false.)\n \n do y=1,h\n block; character(w):: inpt_s\n read*, inpt_s\n do x=1,w\n s(x,y) = inpt_s(x:x)\n end do\n end block\n end do\n\n call tx%append(sx)\n call ty%append(sy)\n nm(sx,sy) = 0\n\n do while(tx%remain())\n do while(tx%remain())\n x = tx%popleft()\n y = ty%popleft()\n ! print'(*(i0,1x))', x,y\n passed(x,y) = .true.\n call tx2%append(x)\n call ty2%append(y)\n ! do i=1,h\n ! print'(*(i0,1x))', nm(:,i)\n ! end do\n\n do dy = -1,1\n do dx = -1,1\n if (dx==0 .and. dy==0) cycle\n if (dx /= 0 .and. dy /= 0) cycle\n nx = x+dx; ny = y+dy\n if (.not. in_s(nx,ny)) cycle\n if (s(nx,ny) == \"#\") cycle\n if (nm(nx,ny) > nm(x,y)) then\n ! print'(*(i0,1x))', nx,ny\n nm(nx,ny) = nm(x,y)\n call tx%append(nx)\n call ty%append(ny)\n end if\n end do\n end do\n end do\n\n do while(tx2%remain())\n x = tx2%popleft()\n y = ty2%popleft()\n do dy=-2,2\n do dx=-2,2\n nx = dx+x; ny=dy+y\n if (.not. in_s(nx,ny)) cycle\n if (s(nx, ny) == \"#\") cycle\n if (nm(nx,ny) > nm(x,y)+1) then\n ! print'(*(i0,1x))', nx,ny\n nm(nx,ny) = nm(x,y)+1\n call tx%append(nx)\n call ty%append(ny)\n end if\n end do\n end do\n end do\n end do\n\n if (nm(gx,gy) == 1000000000) then\n print'(i0)', -1\n stop\n end if\n print'(i0)', nm(gx,gy)\ncontains\n function in_s(x,y) result(ret)\n integer(int32):: x,y\n logical:: ret\n\n ret = 1 <= x .and. x <= w\n ret = ret .and. (1 <= y .and. y <= h)\n end function\nend program main", "language": "Fortran", "metadata": {"date": 1598129440, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02579.html", "problem_id": "p02579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02579/input.txt", "sample_output_relpath": "derived/input_output/data/p02579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02579/Fortran/s921738874.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s921738874", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module deque_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n type deque\n integer(int32),pointer:: v(:)\n integer(int32):: l,r\n integer(int32):: lmax, rmax\n contains\n procedure:: append => dq_append\n procedure:: appendleft => dq_appendleft\n procedure:: pop => dq_pop\n procedure:: popleft => dq_popleft\n procedure:: right => dq_right\n procedure:: left => dq_left\n procedure:: remaining_elements => dq_remaining_elements\n procedure:: remain => dq_remain\n end type\n\n interface deque\n procedure:: dq_init\n end interface\ncontains\n function dq_init() result(dq)\n ! 初期化\n type(deque):: dq\n dq%r=0; dq%rmax=1\n dq%l=1; dq%lmax=-1\n allocate(dq%v(dq%lmax:dq%rmax))\n end function\n\n\n subroutine dq_append(dq,num)\n ! 右端に挿入\n class(deque):: dq\n integer(int32):: num\n if (dq%r+1 > dq%rmax) call dq_add_(dq)\n dq%r=dq%r+1\n dq%v(dq%r) = num\n end subroutine\n\n subroutine dq_appendleft(dq,num)\n ! 左端に挿入\n class(deque):: dq\n integer(int32):: num\n if (dq%l-1 < dq%lmax) call dq_add_(dq)\n dq%l=dq%l-1\n dq%v(dq%l) = num\n end subroutine\n\n subroutine dq_add_(dq)\n ! arrayの延長\n class(deque):: dq\n integer(int32):: l\n integer(int32),pointer:: tmp(:)\n l = size(dq%v)\n allocate(tmp(l))\n tmp(:) = dq%v(:)\n deallocate(dq%v)\n allocate(dq%v(3*dq%lmax:3*dq%rmax))\n dq%v(dq%lmax:dq%rmax) = tmp(:)\n dq%lmax = 3*dq%lmax\n dq%rmax = 3*dq%rmax\n end subroutine\n\n\n function dq_pop(dq) result(ret)\n ! 右端から取り出し\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n dq%r=dq%r-1\n end function\n\n function dq_popleft(dq) result(ret)\n ! 左端から取り出し\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n dq%l=dq%l+1\n end function\n\n\n function dq_right(dq) result(ret)\n ! 右端を確認\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n end function\n\n function dq_left(dq) result(ret)\n ! 左端を確認\n class(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n end function\n\n function dq_remaining_elements(dq) result(ret)\n ! 残りの要素数\n class(deque):: dq\n integer(int32):: ret \n ret = dq%r - dq%l + 1\n end function\n\n function dq_remain(dq) result(ret)\n ! 要素が残っているかどうか\n class(deque):: dq\n logical:: ret\n ret = dq%remaining_elements() > 0\n end function\nend module\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use deque_mod\n implicit none\n integer(int32):: h,w,sx,sy,gx,gy,i,j,x,y,dx,dy,nx,ny\n integer(int32),allocatable:: nm(:,:)\n character(1),allocatable:: s(:,:)\n logical,allocatable:: passed(:,:)\n type(deque):: tx, ty, tx2,ty2\n\n tx = deque()\n ty = deque()\n tx2 = deque()\n ty2 = deque()\n read*, h,w\n read*, sy,sx\n read*, gy,gx\n\n allocate(nm(w,h), source=1000000000)\n allocate(s(w,h))\n allocate(passed(w,h),source=.false.)\n \n do y=1,h\n block; character(w):: inpt_s\n read*, inpt_s\n do x=1,w\n s(x,y) = inpt_s(x:x)\n end do\n end block\n end do\n\n call tx%append(sx)\n call ty%append(sy)\n nm(sx,sy) = 0\n\n do while(tx%remain())\n do while(tx%remain())\n x = tx%popleft()\n y = ty%popleft()\n ! print'(*(i0,1x))', x,y\n passed(x,y) = .true.\n call tx2%append(x)\n call ty2%append(y)\n ! do i=1,h\n ! print'(*(i0,1x))', nm(:,i)\n ! end do\n\n do dy = -1,1\n do dx = -1,1\n if (dx==0 .and. dy==0) cycle\n if (dx /= 0 .and. dy /= 0) cycle\n nx = x+dx; ny = y+dy\n if (.not. in_s(nx,ny)) cycle\n if (s(nx,ny) == \"#\") cycle\n if (nm(nx,ny) > nm(x,y)) then\n ! print'(*(i0,1x))', nx,ny\n nm(nx,ny) = nm(x,y)\n call tx%append(nx)\n call ty%append(ny)\n end if\n end do\n end do\n end do\n\n do while(tx2%remain())\n x = tx2%popleft()\n y = ty2%popleft()\n do dy=-2,2\n do dx=-2,2\n nx = dx+x; ny=dy+y\n if (.not. in_s(nx,ny)) cycle\n if (s(nx, ny) == \"#\") cycle\n if (nm(nx,ny) > nm(x,y)+1) then\n ! print'(*(i0,1x))', nx,ny\n nm(nx,ny) = nm(x,y)+1\n call tx%append(nx)\n call ty%append(ny)\n end if\n end do\n end do\n end do\n end do\n\n if (nm(gx,gy) == 1000000000) then\n print'(i0)', -1\n stop\n end if\n print'(i0)', nm(gx,gy)\ncontains\n function in_s(x,y) result(ret)\n integer(int32):: x,y\n logical:: ret\n\n ret = 1 <= x .and. x <= w\n ret = ret .and. (1 <= y .and. y <= h)\n end function\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02579", "source_text": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5425, "cpu_time_ms": 178, "memory_kb": 30344}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s905755911", "group_id": "codeNet:p02581", "input_text": "module mod_selection_sort\n implicit none\n integer, private, parameter :: intkind = 4\ncontains\n logical function less(a, b) result(res)\n integer(intkind), intent(in) :: a, b\n res = a <= b\n end\n subroutine swap(a, b)\n integer(intkind), intent(inout) :: a, b\n a = xor(a, b)\n b = xor(a, b)\n a = xor(a, b)\n end\n subroutine selection_sort(a)\n integer(intkind), intent(inout) :: a(:)\n integer :: n, i, j, m\n n = size(a)\n do i = 1, n - 1\n m = i\n do j = i + 1, n\n if (.not.less(a(m), a(j))) m = j\n end do\n if (i /= m) call swap(a(i), a(m))\n end do\n end\nend module mod_selection_sort\nprogram brave_chain\n use mod_selection_sort\n implicit none\n integer, parameter :: inf = 1e9\n integer :: n, a(6000) = 0, a1, a2, a3, dp(2000, 2000) = -inf, m = 0, b(3) = 0, v, i, j\n integer, dimension(2000) :: dp0 = 0, mv = -inf, mv0 = 0\n read(*,*) n\n read(*,*) a(1:3 * n)\n call update(a(1), a(2), 0)\n do i = 3, 3 * n - 2, 3\n if (a(i) == a(i + 1) .and. a(i) == a(i + 2)) then\n m = m + 1\n cycle\n end if\n call selection_sort(a(i:i + 2))\n if (a(i + 1) == a(i + 2)) call swap(a(i), a(i + 2))\n a1 = a(i)\n a2 = a(i + 1)\n a3 = a(i + 2)\n do j = 1, n\n dp0(j) = dp(min(a1, j), max(a1, j))\n end do\n mv0(1:n) = mv(1:n)\n v = max(0, maxval(mv(1:n)))\n b(1) = dp(a1, a1)\n b(2) = dp(a2, a2)\n b(3) = dp(a3, a3)\n if (a1 == a2) then\n do j = 1, n\n call update(a3, j, dp0(j) + 1)\n end do\n end if\n call update(a2, a3, b(1) + 1)\n call update(a1, a3, b(2) + 1)\n call update(a1, a2, b(3) + 1)\n call update(a2, a3, v)\n call update(a1, a3, v)\n call update(a1, a2, v)\n do j = 1, n\n call update(a1, j, mv0(j))\n call update(a2, j, mv0(j))\n call update(a3, j, mv0(j))\n end do\n end do\n i = a(3 * n)\n write(*,'(i0)') max(dp(i, i) + 1, maxval(mv(1:n))) + m\ncontains\n subroutine update(a, b, z)\n integer, intent(in) :: a, b, z\n integer :: x, y\n if (a > b) then\n x = b\n y = a\n else\n x = a\n y = b\n end if\n if (dp(x, y) >= z) return\n dp(x, y) = z\n mv(x) = max(mv(x), z)\n mv(y) = max(mv(y), z)\n end\nend program brave_chain", "language": "Fortran", "metadata": {"date": 1598207761, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02581.html", "problem_id": "p02581", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02581/input.txt", "sample_output_relpath": "derived/input_output/data/p02581/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02581/Fortran/s905755911.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s905755911", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module mod_selection_sort\n implicit none\n integer, private, parameter :: intkind = 4\ncontains\n logical function less(a, b) result(res)\n integer(intkind), intent(in) :: a, b\n res = a <= b\n end\n subroutine swap(a, b)\n integer(intkind), intent(inout) :: a, b\n a = xor(a, b)\n b = xor(a, b)\n a = xor(a, b)\n end\n subroutine selection_sort(a)\n integer(intkind), intent(inout) :: a(:)\n integer :: n, i, j, m\n n = size(a)\n do i = 1, n - 1\n m = i\n do j = i + 1, n\n if (.not.less(a(m), a(j))) m = j\n end do\n if (i /= m) call swap(a(i), a(m))\n end do\n end\nend module mod_selection_sort\nprogram brave_chain\n use mod_selection_sort\n implicit none\n integer, parameter :: inf = 1e9\n integer :: n, a(6000) = 0, a1, a2, a3, dp(2000, 2000) = -inf, m = 0, b(3) = 0, v, i, j\n integer, dimension(2000) :: dp0 = 0, mv = -inf, mv0 = 0\n read(*,*) n\n read(*,*) a(1:3 * n)\n call update(a(1), a(2), 0)\n do i = 3, 3 * n - 2, 3\n if (a(i) == a(i + 1) .and. a(i) == a(i + 2)) then\n m = m + 1\n cycle\n end if\n call selection_sort(a(i:i + 2))\n if (a(i + 1) == a(i + 2)) call swap(a(i), a(i + 2))\n a1 = a(i)\n a2 = a(i + 1)\n a3 = a(i + 2)\n do j = 1, n\n dp0(j) = dp(min(a1, j), max(a1, j))\n end do\n mv0(1:n) = mv(1:n)\n v = max(0, maxval(mv(1:n)))\n b(1) = dp(a1, a1)\n b(2) = dp(a2, a2)\n b(3) = dp(a3, a3)\n if (a1 == a2) then\n do j = 1, n\n call update(a3, j, dp0(j) + 1)\n end do\n end if\n call update(a2, a3, b(1) + 1)\n call update(a1, a3, b(2) + 1)\n call update(a1, a2, b(3) + 1)\n call update(a2, a3, v)\n call update(a1, a3, v)\n call update(a1, a2, v)\n do j = 1, n\n call update(a1, j, mv0(j))\n call update(a2, j, mv0(j))\n call update(a3, j, mv0(j))\n end do\n end do\n i = a(3 * n)\n write(*,'(i0)') max(dp(i, i) + 1, maxval(mv(1:n))) + m\ncontains\n subroutine update(a, b, z)\n integer, intent(in) :: a, b, z\n integer :: x, y\n if (a > b) then\n x = b\n y = a\n else\n x = a\n y = b\n end if\n if (dp(x, y) >= z) return\n dp(x, y) = z\n mv(x) = max(mv(x), z)\n mv(y) = max(mv(y), z)\n end\nend program brave_chain", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have 3N cards arranged in a row from left to right, where each card has an integer between 1 and N (inclusive) written on it. The integer written on the i-th card from the left is A_i.\n\nYou will do the following operation N-1 times:\n\nRearrange the five leftmost cards in any order you like, then remove the three leftmost cards. If the integers written on those three cards are all equal, you gain 1 point.\n\nAfter these N-1 operations, if the integers written on the remaining three cards are all equal, you will gain 1 additional point.\n\nFind the maximum number of points you can gain.\n\nConstraints\n\n1 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_{3N}\n\nOutput\n\nPrint the maximum number of points you can gain.\n\nSample Input 1\n\n2\n1 2 1 2 2 1\n\nSample Output 1\n\n2\n\nLet us rearrange the five leftmost cards so that the integers written on the six cards will be 2\\ 2\\ 2\\ 1\\ 1\\ 1 from left to right.\n\nThen, remove the three leftmost cards, all of which have the same integer 2, gaining 1 point.\n\nNow, the integers written on the remaining cards are 1\\ 1\\ 1.\n\nSince these three cards have the same integer 1, we gain 1 more point.\n\nIn this way, we can gain 2 points - which is the maximum possible.\n\nSample Input 2\n\n3\n1 1 2 2 3 3 3 2 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1 1 2 2 2 3 3 3 1\n\nSample Output 3\n\n3", "sample_input": "2\n1 2 1 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02581", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have 3N cards arranged in a row from left to right, where each card has an integer between 1 and N (inclusive) written on it. The integer written on the i-th card from the left is A_i.\n\nYou will do the following operation N-1 times:\n\nRearrange the five leftmost cards in any order you like, then remove the three leftmost cards. If the integers written on those three cards are all equal, you gain 1 point.\n\nAfter these N-1 operations, if the integers written on the remaining three cards are all equal, you will gain 1 additional point.\n\nFind the maximum number of points you can gain.\n\nConstraints\n\n1 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_{3N}\n\nOutput\n\nPrint the maximum number of points you can gain.\n\nSample Input 1\n\n2\n1 2 1 2 2 1\n\nSample Output 1\n\n2\n\nLet us rearrange the five leftmost cards so that the integers written on the six cards will be 2\\ 2\\ 2\\ 1\\ 1\\ 1 from left to right.\n\nThen, remove the three leftmost cards, all of which have the same integer 2, gaining 1 point.\n\nNow, the integers written on the remaining cards are 1\\ 1\\ 1.\n\nSince these three cards have the same integer 1, we gain 1 more point.\n\nIn this way, we can gain 2 points - which is the maximum possible.\n\nSample Input 2\n\n3\n1 1 2 2 3 3 3 2 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1 1 2 2 2 3 3 3 1\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2203, "cpu_time_ms": 120, "memory_kb": 18656}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s728112512", "group_id": "codeNet:p02582", "input_text": "program main\nimplicit none\n\ncharacter*3 :: s\ncharacter*1 :: r\ninteger :: curLongest,totalLongest,i\nread(*,*) s\n\nr = 'R'\n\ntotalLongest = 0\ncurLongest = 0\n\ndo i=1,3\n if(s(i:i).eq.r) then\n ! write(*,*) s(i:i),r\n curLongest = curLongest + 1\n else\n curLongest = 0\n endif\n if(totalLongest.lt.curLongest) then\n totalLongest = curLongest\n endif\nenddo\n\nwrite(*,*) totalLongest\nend program", "language": "Fortran", "metadata": {"date": 1597633231, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02582/input.txt", "sample_output_relpath": "derived/input_output/data/p02582/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02582/Fortran/s728112512.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728112512", "user_id": "u181303581"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit none\n\ncharacter*3 :: s\ncharacter*1 :: r\ninteger :: curLongest,totalLongest,i\nread(*,*) s\n\nr = 'R'\n\ntotalLongest = 0\ncurLongest = 0\n\ndo i=1,3\n if(s(i:i).eq.r) then\n ! write(*,*) s(i:i),r\n curLongest = curLongest + 1\n else\n curLongest = 0\n endif\n if(totalLongest.lt.curLongest) then\n totalLongest = curLongest\n endif\nenddo\n\nwrite(*,*) totalLongest\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 13, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s236779608", "group_id": "codeNet:p02582", "input_text": "program rainy_season\n implicit none\n character(3) :: s\n integer :: n\n read(*,*) s\n if (s == 'RRR') then\n n = 3\n else if (s == 'SRR' .or. s == 'RRS') then\n n = 2\n else if (s == 'RRR') then\n n = 0\n else\n n = 1\n end if\n write(*,'(i0)') n\nend program rainy_season", "language": "Fortran", "metadata": {"date": 1597518210, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02582/input.txt", "sample_output_relpath": "derived/input_output/data/p02582/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02582/Fortran/s236779608.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s236779608", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program rainy_season\n implicit none\n character(3) :: s\n integer :: n\n read(*,*) s\n if (s == 'RRR') then\n n = 3\n else if (s == 'SRR' .or. s == 'RRS') then\n n = 2\n else if (s == 'RRR') then\n n = 0\n else\n n = 1\n end if\n write(*,'(i0)') n\nend program rainy_season", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 15, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s398853072", "group_id": "codeNet:p02583", "input_text": "program make_triangle\n integer :: n\n integer,allocatable :: l(:)\n integer :: i, j, k\n integer :: t(3)\n integer :: ans = 0\n\n read *, n\n allocate(l(n))\n do i = 1, n\n read *, l(i)\n end do\n\n do i = 1, n-1\n do j = i + 1, n\n if(l(i) .gt. l(j))then\n k = t(i)\n t(i) = t(j)\n t(j) = k\n end if\n end do\n end do\n\n do i = 1, n\n do j = i+1, n\n do k = j+1, n\n if(t(k) /= t(j) .and. t(i) /= t(j) .and. t(i) + t(j) > t(k)) then\n ans = ans + 1\n end if\n end do\n end do\n end do\n print *, ans\nend program", "language": "Fortran", "metadata": {"date": 1597923023, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02583.html", "problem_id": "p02583", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02583/input.txt", "sample_output_relpath": "derived/input_output/data/p02583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02583/Fortran/s398853072.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s398853072", "user_id": "u622206408"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program make_triangle\n integer :: n\n integer,allocatable :: l(:)\n integer :: i, j, k\n integer :: t(3)\n integer :: ans = 0\n\n read *, n\n allocate(l(n))\n do i = 1, n\n read *, l(i)\n end do\n\n do i = 1, n-1\n do j = i + 1, n\n if(l(i) .gt. l(j))then\n k = t(i)\n t(i) = t(j)\n t(j) = k\n end if\n end do\n end do\n\n do i = 1, n\n do j = i+1, n\n do k = j+1, n\n if(t(k) /= t(j) .and. t(i) /= t(j) .and. t(i) + t(j) > t(k)) then\n ans = ans + 1\n end if\n end do\n end do\n end do\n print *, ans\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "sample_input": "5\n4 4 9 7 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02583", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 692, "cpu_time_ms": 20, "memory_kb": 3160}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s429274952", "group_id": "codeNet:p02583", "input_text": "program main\n implicit none\n integer :: n, i, j, k, counts\n integer, allocatable :: l(:)\n \n read(*,*) n\n \n allocate( l(n) )\n read(*,*) ( l(i), i = 1, n )\n \n counts = 0\n \n do i = 1, n-2\n do j = i+1, n-1\n do k = i+2, n\n if ( l(i)+l(j) > l(k) .and. l(j)+l(k) > l(i) .and. l(k)+l(i) > l(j) ) then\n if( l(i) == l(j) .or. l(i) == l(k) .or. l(j) == l(k) ) then\n counts = counts\n else\n counts = counts + 1\n endif\n else\n counts = counts\n endif\n enddo\n enddo\n enddo\n \n write(*,*) counts\n \nend program main", "language": "Fortran", "metadata": {"date": 1597522847, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02583.html", "problem_id": "p02583", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02583/input.txt", "sample_output_relpath": "derived/input_output/data/p02583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02583/Fortran/s429274952.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s429274952", "user_id": "u660615005"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, j, k, counts\n integer, allocatable :: l(:)\n \n read(*,*) n\n \n allocate( l(n) )\n read(*,*) ( l(i), i = 1, n )\n \n counts = 0\n \n do i = 1, n-2\n do j = i+1, n-1\n do k = i+2, n\n if ( l(i)+l(j) > l(k) .and. l(j)+l(k) > l(i) .and. l(k)+l(i) > l(j) ) then\n if( l(i) == l(j) .or. l(i) == l(k) .or. l(j) == l(k) ) then\n counts = counts\n else\n counts = counts + 1\n endif\n else\n counts = counts\n endif\n enddo\n enddo\n enddo\n \n write(*,*) counts\n \nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "sample_input": "5\n4 4 9 7 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02583", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 606, "cpu_time_ms": 10, "memory_kb": 2716}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s536597250", "group_id": "codeNet:p02584", "input_text": " program WalkingTakahashi\n!\n implicit none\n integer(8) :: X,K,D\n integer(8) :: ans1,ans2\n intrinsic abs,mod\n!\n read(*,*) X,K,D\n!\n ans1 = abs(X)/D\n ans2 = ans1 + 1\n!\n if(K >= ans1) then\n if(mod(K-ans1,2) == 0) write(*,*) X-ans1*D\n if(mod(K-ans1,2) == 1) write(*,*) ans2*D-X\n else\n write(*,*) X-K*D\n end if\n!\n end program WalkingTakahashi", "language": "Fortran", "metadata": {"date": 1597520730, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02584.html", "problem_id": "p02584", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02584/input.txt", "sample_output_relpath": "derived/input_output/data/p02584/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02584/Fortran/s536597250.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s536597250", "user_id": "u954587078"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": " program WalkingTakahashi\n!\n implicit none\n integer(8) :: X,K,D\n integer(8) :: ans1,ans2\n intrinsic abs,mod\n!\n read(*,*) X,K,D\n!\n ans1 = abs(X)/D\n ans2 = ans1 + 1\n!\n if(K >= ans1) then\n if(mod(K-ans1,2) == 0) write(*,*) X-ans1*D\n if(mod(K-ans1,2) == 1) write(*,*) ans2*D-X\n else\n write(*,*) X-K*D\n end if\n!\n end program WalkingTakahashi", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "sample_input": "6 2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02584", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, who lives on the number line, is now at coordinate X. He will make exactly K moves of distance D in the positive or negative direction.\n\nMore specifically, in one move, he can go from coordinate x to x + D or x - D.\n\nHe wants to make K moves so that the absolute value of the coordinate of the destination will be the smallest possible.\n\nFind the minimum possible absolute value of the coordinate of the destination.\n\nConstraints\n\n-10^{15} \\leq X \\leq 10^{15}\n\n1 \\leq K \\leq 10^{15}\n\n1 \\leq D \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX K D\n\nOutput\n\nPrint the minimum possible absolute value of the coordinate of the destination.\n\nSample Input 1\n\n6 2 4\n\nSample Output 1\n\n2\n\nTakahashi is now at coordinate 6. It is optimal to make the following moves:\n\nMove from coordinate 6 to (6 - 4 =) 2.\n\nMove from coordinate 2 to (2 - 4 =) -2.\n\nHere, the absolute value of the coordinate of the destination is 2, and we cannot make it smaller.\n\nSample Input 2\n\n7 4 3\n\nSample Output 2\n\n1\n\nTakahashi is now at coordinate 7. It is optimal to make, for example, the following moves:\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 7.\n\nMove from coordinate 7 to 4.\n\nMove from coordinate 4 to 1.\n\nHere, the absolute value of the coordinate of the destination is 1, and we cannot make it smaller.\n\nSample Input 3\n\n10 1 2\n\nSample Output 3\n\n8\n\nSample Input 4\n\n1000000000000000 1000000000000000 1000000000000000\n\nSample Output 4\n\n1000000000000000\n\nThe answer can be enormous.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 417, "cpu_time_ms": 15, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s538476752", "group_id": "codeNet:p02585", "input_text": "program D175\n implicit none\n integer(16) :: N, K\n integer(16), allocatable, dimension(:) :: P, C\n integer(16) :: i, j, l, ans, max1, max2\n \n read(5,*) N, K\n allocate(P(N), C(N))\n read(5,*) (P(i), i = 1, N)\n read(5,*) (C(i), i = 1, N)\n\n\n do i = 1, N\n ans = 0\n l = i\n do j = 1, K\n l = P(l)\n ans = ans + C(l)\n if (j == 1) then\n max2 = ans\n else\n if (max2 < ans) then\n max2 = ans\n end if\n end if\n end do\n\n if (i == 1) then\n max1 = max2\n else\n if (max1 < max2) then\n max1 = max2\n end if\n end if\n\n end do\n\n write(6,*) max1\n\nend program D175", "language": "Fortran", "metadata": {"date": 1598313241, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/Fortran/s538476752.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s538476752", "user_id": "u952194205"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program D175\n implicit none\n integer(16) :: N, K\n integer(16), allocatable, dimension(:) :: P, C\n integer(16) :: i, j, l, ans, max1, max2\n \n read(5,*) N, K\n allocate(P(N), C(N))\n read(5,*) (P(i), i = 1, N)\n read(5,*) (C(i), i = 1, N)\n\n\n do i = 1, N\n ans = 0\n l = i\n do j = 1, K\n l = P(l)\n ans = ans + C(l)\n if (j == 1) then\n max2 = ans\n else\n if (max2 < ans) then\n max2 = ans\n end if\n end if\n end do\n\n if (i == 1) then\n max1 = max2\n else\n if (max1 < max2) then\n max1 = max2\n end if\n end if\n\n end do\n\n write(6,*) max1\n\nend program D175", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 786, "cpu_time_ms": 3308, "memory_kb": 3060}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s459147855", "group_id": "codeNet:p02585", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,k,ans,si,i\n integer(int64), allocatable:: p(:), c(:)\n \n\n read*, n,k\n allocate(p(n), c(n))\n\n read*, p(:)\n read*, c(:)\n ans = -6e18\n do si=1,n\n block; integer(int64):: x, s(n), l, tot, now,t,e\n x = si\n l=0\n tot = 0\n do while(.true.)\n l=l+1\n x = p(x)\n s(l) = c(x)\n tot = tot + c(x)\n if (x == si) exit\n end do\n t=0\n do i=1,l\n t = t + s(i)\n if (i > k) exit\n now = t\n if (tot > 0)then\n e = (k-i)/l\n now = now + tot*e\n end if\n ans = max(ans, now)\n end do\n end block\n end do\n print'(i0)', ans\nend program main", "language": "Fortran", "metadata": {"date": 1597674447, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02585.html", "problem_id": "p02585", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02585/input.txt", "sample_output_relpath": "derived/input_output/data/p02585/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02585/Fortran/s459147855.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s459147855", "user_id": "u234636620"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,k,ans,si,i\n integer(int64), allocatable:: p(:), c(:)\n \n\n read*, n,k\n allocate(p(n), c(n))\n\n read*, p(:)\n read*, c(:)\n ans = -6e18\n do si=1,n\n block; integer(int64):: x, s(n), l, tot, now,t,e\n x = si\n l=0\n tot = 0\n do while(.true.)\n l=l+1\n x = p(x)\n s(l) = c(x)\n tot = tot + c(x)\n if (x == si) exit\n end do\n t=0\n do i=1,l\n t = t + s(i)\n if (i > k) exit\n now = t\n if (tot > 0)then\n e = (k-i)/l\n now = now + tot*e\n end if\n ans = max(ans, now)\n end do\n end block\n end do\n print'(i0)', ans\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "sample_input": "5 2\n2 4 5 1 3\n3 4 -10 -8 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02585", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi will play a game using a piece on an array of squares numbered 1, 2, \\cdots, N. Square i has an integer C_i written on it. Also, he is given a permutation of 1, 2, \\cdots, N: P_1, P_2, \\cdots, P_N.\n\nNow, he will choose one square and place the piece on that square. Then, he will make the following move some number of times between 1 and K (inclusive):\n\nIn one move, if the piece is now on Square i (1 \\leq i \\leq N), move it to Square P_i. Here, his score increases by C_{P_i}.\n\nHelp him by finding the maximum possible score at the end of the game. (The score is 0 at the beginning of the game.)\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq P_i \\leq N\n\nP_i \\neq i\n\nP_1, P_2, \\cdots, P_N are all different.\n\n-10^9 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_1 P_2 \\cdots P_N\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the maximum possible score at the end of the game.\n\nSample Input 1\n\n5 2\n2 4 5 1 3\n3 4 -10 -8 8\n\nSample Output 1\n\n8\n\nWhen we start at some square of our choice and make at most two moves, we have the following options:\n\nIf we start at Square 1, making one move sends the piece to Square 2, after which the score is 4. Making another move sends the piece to Square 4, after which the score is 4 + (-8) = -4.\n\nIf we start at Square 2, making one move sends the piece to Square 4, after which the score is -8. Making another move sends the piece to Square 1, after which the score is -8 + 3 = -5.\n\nIf we start at Square 3, making one move sends the piece to Square 5, after which the score is 8. Making another move sends the piece to Square 3, after which the score is 8 + (-10) = -2.\n\nIf we start at Square 4, making one move sends the piece to Square 1, after which the score is 3. Making another move sends the piece to Square 2, after which the score is 3 + 4 = 7.\n\nIf we start at Square 5, making one move sends the piece to Square 3, after which the score is -10. Making another move sends the piece to Square 5, after which the score is -10 + 8 = -2.\n\nThe maximum score achieved is 8.\n\nSample Input 2\n\n2 3\n2 1\n10 -7\n\nSample Output 2\n\n13\n\nSample Input 3\n\n3 3\n3 1 2\n-1000 -2000 -3000\n\nSample Output 3\n\n-1000\n\nWe have to make at least one move.\n\nSample Input 4\n\n10 58\n9 1 6 7 8 4 3 2 10 5\n695279662 988782657 -119067776 382975538 -151885171 -177220596 -169777795 37619092 389386780 980092719\n\nSample Output 4\n\n29507023469\n\nThe absolute value of the answer may be enormous.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 931, "cpu_time_ms": 315, "memory_kb": 3048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s014609730", "group_id": "codeNet:p02587", "input_text": "program making_palindrome\n implicit none\n integer(8), parameter :: inf = 1e18\n integer :: n, i\n character(20) :: s(50, 2) = ''\n integer(8) :: c(50) = 0, m(50, 21, 2) = 0, x = inf\n logical :: u(50, 21, 2) = .false.\n read(*,*) n\n do i = 1, n\n read(*,*) s(i, 1), c(i)\n s(i, 2) = reverse(s(i, 1)(1:len_trim(s(i, 1))))\n end do\n do i = 1, n\n x = min(x, solve(i, 1, 1) + c(i))\n end do\n write(*,'(i0)') merge(x, -1_8, x < inf)\ncontains\n function reverse(s) result(res)\n character(*), intent(in) :: s\n character(len_trim(s)) :: res\n integer :: n, i\n n = len_trim(s)\n do i = 1, n\n res(i:i) = s(n - i + 1:n - i + 1)\n end do\n end\n recursive integer(8) function solve(i, j, k) result(res)\n integer, intent(in) :: i, j, k\n integer :: l, r, t\n logical :: f\n res = m(i, j, k)\n if (u(i, j, k)) return\n u(i, j, k) = .true.\n m(i, j, k) = inf\n l = j\n r = len_trim(s(i, k))\n f = .true.\n do while (l < r)\n if (s(i, k)(l:l) /= s(i, k)(r:r)) then\n f = .false.\n exit\n end if\n l = l + 1\n r = r - 1\n end do\n if (f) then\n m(i, j, k) = 0\n res = 0\n return\n end if\n do t = 1, n\n l = j\n r = 1\n do while (l <= len_trim(s(i, k)) .and. r <= len_trim(s(t, 3 - k)))\n if (s(i, k)(l:l) /= s(t, 3 - k)(r:r)) exit\n l = l + 1\n r = r + 1\n end do\n if (l == len_trim(s(i, k)) + 1) then\n m(i, j, k) = min(m(i, j, k), solve(t, r, 3 - k) + c(t))\n end if\n if (r == len_trim(s(t, 3 - k)) + 1) then\n m(i, j, k) = min(m(i, j, k), solve(i, l, k) + c(t))\n end if\n end do\n res = m(i, j, k)\n end\nend program making_palindrome", "language": "Fortran", "metadata": {"date": 1597615513, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02587.html", "problem_id": "p02587", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02587/input.txt", "sample_output_relpath": "derived/input_output/data/p02587/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02587/Fortran/s014609730.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s014609730", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program making_palindrome\n implicit none\n integer(8), parameter :: inf = 1e18\n integer :: n, i\n character(20) :: s(50, 2) = ''\n integer(8) :: c(50) = 0, m(50, 21, 2) = 0, x = inf\n logical :: u(50, 21, 2) = .false.\n read(*,*) n\n do i = 1, n\n read(*,*) s(i, 1), c(i)\n s(i, 2) = reverse(s(i, 1)(1:len_trim(s(i, 1))))\n end do\n do i = 1, n\n x = min(x, solve(i, 1, 1) + c(i))\n end do\n write(*,'(i0)') merge(x, -1_8, x < inf)\ncontains\n function reverse(s) result(res)\n character(*), intent(in) :: s\n character(len_trim(s)) :: res\n integer :: n, i\n n = len_trim(s)\n do i = 1, n\n res(i:i) = s(n - i + 1:n - i + 1)\n end do\n end\n recursive integer(8) function solve(i, j, k) result(res)\n integer, intent(in) :: i, j, k\n integer :: l, r, t\n logical :: f\n res = m(i, j, k)\n if (u(i, j, k)) return\n u(i, j, k) = .true.\n m(i, j, k) = inf\n l = j\n r = len_trim(s(i, k))\n f = .true.\n do while (l < r)\n if (s(i, k)(l:l) /= s(i, k)(r:r)) then\n f = .false.\n exit\n end if\n l = l + 1\n r = r - 1\n end do\n if (f) then\n m(i, j, k) = 0\n res = 0\n return\n end if\n do t = 1, n\n l = j\n r = 1\n do while (l <= len_trim(s(i, k)) .and. r <= len_trim(s(t, 3 - k)))\n if (s(i, k)(l:l) /= s(t, 3 - k)(r:r)) exit\n l = l + 1\n r = r + 1\n end do\n if (l == len_trim(s(i, k)) + 1) then\n m(i, j, k) = min(m(i, j, k), solve(t, r, 3 - k) + c(t))\n end if\n if (r == len_trim(s(t, 3 - k)) + 1) then\n m(i, j, k) = min(m(i, j, k), solve(i, l, k) + c(t))\n end if\n end do\n res = m(i, j, k)\n end\nend program making_palindrome", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have N strings of lowercase English letters: S_1, S_2, \\cdots, S_N.\n\nTakahashi wants to make a string that is a palindrome by choosing one or more of these strings - the same string can be chosen more than once - and concatenating them in some order of his choice.\n\nThe cost of using the string S_i once is C_i, and the cost of using it multiple times is C_i multiplied by that number of times.\n\nFind the minimum total cost needed to choose strings so that Takahashi can make a palindrome.\n\nIf there is no choice of strings in which he can make a palindrome, print -1.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq |S_i| \\leq 20\n\nS_i consists of lowercase English letters.\n\n1 \\leq C_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 C_1\nS_2 C_2\n:\nS_N C_N\n\nOutput\n\nPrint the minimum total cost needed to choose strings so that Takahashi can make a palindrome, or -1 if there is no such choice.\n\nSample Input 1\n\n3\nba 3\nabc 4\ncbaa 5\n\nSample Output 1\n\n7\n\nWe have ba, abc, and cbaa.\n\nFor example, we can use ba once and abc once for a cost of 7, then concatenate them in the order abc, ba to make a palindrome.\nAlso, we can use abc once and cbaa once for a cost of 9, then concatenate them in the order cbaa, abc to make a palindrome.\n\nWe cannot make a palindrome for a cost less than 7, so we should print 7.\n\nSample Input 2\n\n2\nabcab 5\ncba 3\n\nSample Output 2\n\n11\n\nWe can choose abcab once and cba twice, then concatenate them in the order abcab, cba, cba to make a palindrome for a cost of 11.\n\nSample Input 3\n\n4\nab 5\ncba 3\na 12\nab 10\n\nSample Output 3\n\n8\n\nWe can choose a once, which is already a palindrome, but it is cheaper to concatenate ab and cba.\n\nSample Input 4\n\n2\nabc 1\nab 2\n\nSample Output 4\n\n-1\n\nWe cannot make a palindrome, so we should print -1.", "sample_input": "3\nba 3\nabc 4\ncbaa 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02587", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have N strings of lowercase English letters: S_1, S_2, \\cdots, S_N.\n\nTakahashi wants to make a string that is a palindrome by choosing one or more of these strings - the same string can be chosen more than once - and concatenating them in some order of his choice.\n\nThe cost of using the string S_i once is C_i, and the cost of using it multiple times is C_i multiplied by that number of times.\n\nFind the minimum total cost needed to choose strings so that Takahashi can make a palindrome.\n\nIf there is no choice of strings in which he can make a palindrome, print -1.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq |S_i| \\leq 20\n\nS_i consists of lowercase English letters.\n\n1 \\leq C_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 C_1\nS_2 C_2\n:\nS_N C_N\n\nOutput\n\nPrint the minimum total cost needed to choose strings so that Takahashi can make a palindrome, or -1 if there is no such choice.\n\nSample Input 1\n\n3\nba 3\nabc 4\ncbaa 5\n\nSample Output 1\n\n7\n\nWe have ba, abc, and cbaa.\n\nFor example, we can use ba once and abc once for a cost of 7, then concatenate them in the order abc, ba to make a palindrome.\nAlso, we can use abc once and cbaa once for a cost of 9, then concatenate them in the order cbaa, abc to make a palindrome.\n\nWe cannot make a palindrome for a cost less than 7, so we should print 7.\n\nSample Input 2\n\n2\nabcab 5\ncba 3\n\nSample Output 2\n\n11\n\nWe can choose abcab once and cba twice, then concatenate them in the order abcab, cba, cba to make a palindrome for a cost of 11.\n\nSample Input 3\n\n4\nab 5\ncba 3\na 12\nab 10\n\nSample Output 3\n\n8\n\nWe can choose a once, which is already a palindrome, but it is cheaper to concatenate ab and cba.\n\nSample Input 4\n\n2\nabc 1\nab 2\n\nSample Output 4\n\n-1\n\nWe cannot make a palindrome, so we should print -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1692, "cpu_time_ms": 8, "memory_kb": 2960}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s833312700", "group_id": "codeNet:p02588", "input_text": "program integer_product\n implicit none\n integer :: n, p2(200000) = 0, p5(200000) = 0, i, j, m\n integer(8) :: a\n character(16) :: s\n read(*,*) n\n do i = 1, n\n read(*,*) s\n m = len_trim(s)\n do j = 1, m\n if (s(j:j) == '.') then\n p2(i) = j - m\n p5(i) = j - m\n s(j:m - 1) = s(j + 1:m)\n s(m:) = ''\n exit\n end if\n end do\n read(s,*) a\n do while (mod(a, 2_8) == 0)\n a = a / 2\n p2(i) = p2(i) + 1\n end do\n do while (mod(a, 5_8) == 0)\n a = a / 5\n p5(i) = p5(i) + 1\n end do\n end do\n a = 0\n do i = 1, n - 1\n do j = i + 1, n\n if (p2(i) + p2(j) >= 0 .and. p5(i) + p5(j) >= 0) a = a + 1\n end do\n end do\n write(*,'(i0)') a\nend program integer_product", "language": "Fortran", "metadata": {"date": 1597206283, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02588.html", "problem_id": "p02588", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02588/input.txt", "sample_output_relpath": "derived/input_output/data/p02588/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02588/Fortran/s833312700.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s833312700", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program integer_product\n implicit none\n integer :: n, p2(200000) = 0, p5(200000) = 0, i, j, m\n integer(8) :: a\n character(16) :: s\n read(*,*) n\n do i = 1, n\n read(*,*) s\n m = len_trim(s)\n do j = 1, m\n if (s(j:j) == '.') then\n p2(i) = j - m\n p5(i) = j - m\n s(j:m - 1) = s(j + 1:m)\n s(m:) = ''\n exit\n end if\n end do\n read(s,*) a\n do while (mod(a, 2_8) == 0)\n a = a / 2\n p2(i) = p2(i) + 1\n end do\n do while (mod(a, 5_8) == 0)\n a = a / 5\n p5(i) = p5(i) + 1\n end do\n end do\n a = 0\n do i = 1, n - 1\n do j = i + 1, n\n if (p2(i) + p2(j) >= 0 .and. p5(i) + p5(j) >= 0) a = a + 1\n end do\n end do\n write(*,'(i0)') a\nend program integer_product", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N real values A_1, A_2, \\ldots, A_N.\nCompute the number of pairs of indices (i, j)\nsuch that i < j and the product A_i \\cdot A_j is integer.\n\nConstraints\n\n2 \\leq N \\leq 200\\,000\n\n0 < A_i < 10^4\n\nA_i is given with at most 9 digits after the decimal.\n\nInput\n\nInput is given from Standard Input in the following format.\n\nN\nA_1\nA_2\n\\vdots\nA_N\n\nOutput\n\nPrint the number of pairs with integer product A_i \\cdot A_j (and i < j).\n\nSample Input 1\n\n5\n7.5\n2.4\n17.000000001\n17\n16.000000000\n\nSample Output 1\n\n3\n\nThere are 3 pairs with integer product:\n\n7.5 \\cdot 2.4 = 18\n\n7.5 \\cdot 16 = 120\n\n17 \\cdot 16 = 272\n\nSample Input 2\n\n11\n0.9\n1\n1\n1.25\n2.30000\n5\n70\n0.000000001\n9999.999999999\n0.999999999\n1.000000001\n\nSample Output 2\n\n8", "sample_input": "5\n7.5\n2.4\n17.000000001\n17\n16.000000000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02588", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N real values A_1, A_2, \\ldots, A_N.\nCompute the number of pairs of indices (i, j)\nsuch that i < j and the product A_i \\cdot A_j is integer.\n\nConstraints\n\n2 \\leq N \\leq 200\\,000\n\n0 < A_i < 10^4\n\nA_i is given with at most 9 digits after the decimal.\n\nInput\n\nInput is given from Standard Input in the following format.\n\nN\nA_1\nA_2\n\\vdots\nA_N\n\nOutput\n\nPrint the number of pairs with integer product A_i \\cdot A_j (and i < j).\n\nSample Input 1\n\n5\n7.5\n2.4\n17.000000001\n17\n16.000000000\n\nSample Output 1\n\n3\n\nThere are 3 pairs with integer product:\n\n7.5 \\cdot 2.4 = 18\n\n7.5 \\cdot 16 = 120\n\n17 \\cdot 16 = 272\n\nSample Input 2\n\n11\n0.9\n1\n1\n1.25\n2.30000\n5\n70\n0.000000001\n9999.999999999\n0.999999999\n1.000000001\n\nSample Output 2\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 746, "cpu_time_ms": 2205, "memory_kb": 4124}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s754826857", "group_id": "codeNet:p02594", "input_text": "program main\n\timplicit none\n integer a\n read *,a\n if (a>=30) then\n \tprint *, \"Yes\"\n else\n \tprint *, \"No\"\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1598102335, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02594/input.txt", "sample_output_relpath": "derived/input_output/data/p02594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02594/Fortran/s754826857.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s754826857", "user_id": "u488424305"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "program main\n\timplicit none\n integer a\n read *,a\n if (a>=30) then\n \tprint *, \"Yes\"\n else\n \tprint *, \"No\"\n end if\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "sample_input": "25\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02594", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 5, "memory_kb": 2920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s627883493", "group_id": "codeNet:p02594", "input_text": "program main\nimplicit none\n\ninteger x\n\nread(*,*) x\nif(x.ge.30) then\n write(*,'(A)') \"YES\"\nelse\n write(*,'(A)')\"NO\"\nendif\nend program\n", "language": "Fortran", "metadata": {"date": 1597656564, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02594/input.txt", "sample_output_relpath": "derived/input_output/data/p02594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02594/Fortran/s627883493.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s627883493", "user_id": "u181303581"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "program main\nimplicit none\n\ninteger x\n\nread(*,*) x\nif(x.ge.30) then\n write(*,'(A)') \"YES\"\nelse\n write(*,'(A)')\"NO\"\nendif\nend program\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "sample_input": "25\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02594", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 2828}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s568276706", "group_id": "codeNet:p02595", "input_text": "program distance\n integer :: n, d, i\n integer :: ans = 0\n integer, allocatable :: x(:)\n integer, allocatable :: y(:)\n\n read *, n, d\n allocate(x(n))\n allocate(y(n))\n print *, \"座標を入力\"\n do i = 1, n\n read *, x(i), y(i)\n if(real(d) >= sqrt(real((x(i)**2)+(y(i)**2))))then\n ans = ans+1\n end if\n end do\n print *, ans\nend program", "language": "Fortran", "metadata": {"date": 1597951476, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02595/input.txt", "sample_output_relpath": "derived/input_output/data/p02595/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02595/Fortran/s568276706.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s568276706", "user_id": "u622206408"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program distance\n integer :: n, d, i\n integer :: ans = 0\n integer, allocatable :: x(:)\n integer, allocatable :: y(:)\n\n read *, n, d\n allocate(x(n))\n allocate(y(n))\n print *, \"座標を入力\"\n do i = 1, n\n read *, x(i), y(i)\n if(real(d) >= sqrt(real((x(i)**2)+(y(i)**2))))then\n ans = ans+1\n end if\n end do\n print *, ans\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 108, "memory_kb": 4436}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s345129384", "group_id": "codeNet:p02595", "input_text": "program test\n implicit none\n integer(8)::N,i,ans\n real(8)::X,Y,D\n read*,N,D\n ans=0\n do i=1,N\n \tread*,X,Y\n \tif(sqrt(X*X+Y*Y)<=D) then\n \tans=ans+1\n else \n \tans=ans\n end if\nend do\nprint*,ans\nend program test", "language": "Fortran", "metadata": {"date": 1597023702, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02595/input.txt", "sample_output_relpath": "derived/input_output/data/p02595/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02595/Fortran/s345129384.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s345129384", "user_id": "u723571904"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program test\n implicit none\n integer(8)::N,i,ans\n real(8)::X,Y,D\n read*,N,D\n ans=0\n do i=1,N\n \tread*,X,Y\n \tif(sqrt(X*X+Y*Y)<=D) then\n \tans=ans+1\n else \n \tans=ans\n end if\nend do\nprint*,ans\nend program test", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 216, "cpu_time_ms": 138, "memory_kb": 2940}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s214575537", "group_id": "codeNet:p02595", "input_text": "program ABC174B\n implicit none\n integer(8)::N,D,i,X,Y,ans=0\n read*,N,D\n do i=1,N\n read*,X,Y\n if(X**2+Y**2<=D**2)ans=ans+1\n end do\n print'(i0)',ans\nend program ABC174B", "language": "Fortran", "metadata": {"date": 1596704096, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02595/input.txt", "sample_output_relpath": "derived/input_output/data/p02595/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02595/Fortran/s214575537.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s214575537", "user_id": "u414699019"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ABC174B\n implicit none\n integer(8)::N,D,i,X,Y,ans=0\n read*,N,D\n do i=1,N\n read*,X,Y\n if(X**2+Y**2<=D**2)ans=ans+1\n end do\n print'(i0)',ans\nend program ABC174B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 113, "memory_kb": 2896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s154106132", "group_id": "codeNet:p02595", "input_text": "program main\n implicit none\n integer::n,d,xx,yy,i,cou\n real(8),allocatable::x(:),y(:)\n real(8)::z\n\n read*,n,d\n allocate(x(n),y(n))\n\n do i=1,n\n read*,xx,yy\n x(i)=xx\n y(i)=yy\n !print*,x(i),y(i)\n end do\n !print*,x,y\n\n\n cou=0\n do i=1,n\n z=sqrt(x(i)**2+y(i)**2)\n if(z<=d) then\n cou=cou+1\n end if\n end do\n\n print*,cou\n\n\n\nend program main", "language": "Fortran", "metadata": {"date": 1596417441, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02595/input.txt", "sample_output_relpath": "derived/input_output/data/p02595/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02595/Fortran/s154106132.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154106132", "user_id": "u882765852"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer::n,d,xx,yy,i,cou\n real(8),allocatable::x(:),y(:)\n real(8)::z\n\n read*,n,d\n allocate(x(n),y(n))\n\n do i=1,n\n read*,xx,yy\n x(i)=xx\n y(i)=yy\n !print*,x(i),y(i)\n end do\n !print*,x,y\n\n\n cou=0\n do i=1,n\n z=sqrt(x(i)**2+y(i)**2)\n if(z<=d) then\n cou=cou+1\n end if\n end do\n\n print*,cou\n\n\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 416, "cpu_time_ms": 121, "memory_kb": 5996}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s779038341", "group_id": "codeNet:p02596", "input_text": "program baisuu_search\n integer(8) :: K, i\n integer(8) :: c = 0\n logical :: f = .false.\n\n read *, K\n do i = 7 ,2**20-1, i*10+1\n c = c + 1\n if(mod(i, K) .eq. 0)then\n f = .true.\n end if\n if(f .eqv. .true.)exit\n end do\n if(f .eqv. .true.)then\n print *, c\n else\n print *, '-1'\n end if\nend program", "language": "Fortran", "metadata": {"date": 1597956442, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02596.html", "problem_id": "p02596", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02596/input.txt", "sample_output_relpath": "derived/input_output/data/p02596/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02596/Fortran/s779038341.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s779038341", "user_id": "u622206408"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program baisuu_search\n integer(8) :: K, i\n integer(8) :: c = 0\n logical :: f = .false.\n\n read *, K\n do i = 7 ,2**20-1, i*10+1\n c = c + 1\n if(mod(i, K) .eq. 0)then\n f = .true.\n end if\n if(f .eqv. .true.)exit\n end do\n if(f .eqv. .true.)then\n print *, c\n else\n print *, '-1'\n end if\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "sample_input": "101\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02596", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 2752}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s007527443", "group_id": "codeNet:p02596", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: k, n, ans\n logical,allocatable:: kishutu(:)\n\n read*, k\n allocate(kishutu(0:k), source = .false.)\n if (mod(k,7)==0) k=k/7\n n = mod(1,k)\n ans=1\n do while(n /= 0)\n if (kishutu(n)) then\n print'(i0)', -1\n stop\n end if\n kishutu(n) = .true.\n n = mod(n*10+1,k)\n ans=ans+1\n end do\n print'(i0)', ans\nend program main", "language": "Fortran", "metadata": {"date": 1596979703, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02596.html", "problem_id": "p02596", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02596/input.txt", "sample_output_relpath": "derived/input_output/data/p02596/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02596/Fortran/s007527443.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007527443", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: k, n, ans\n logical,allocatable:: kishutu(:)\n\n read*, k\n allocate(kishutu(0:k), source = .false.)\n if (mod(k,7)==0) k=k/7\n n = mod(1,k)\n ans=1\n do while(n /= 0)\n if (kishutu(n)) then\n print'(i0)', -1\n stop\n end if\n kishutu(n) = .true.\n n = mod(n*10+1,k)\n ans=ans+1\n end do\n print'(i0)', ans\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "sample_input": "101\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02596", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi loves the number 7 and multiples of K.\n\nWhere is the first occurrence of a multiple of K in the sequence 7,77,777,\\ldots? (Also see Output and Sample Input/Output below.)\n\nIf the sequence contains no multiples of K, print -1 instead.\n\nConstraints\n\n1 \\leq K \\leq 10^6\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint an integer representing the position of the first occurrence of a multiple of K. (For example, if the first occurrence is the fourth element of the sequence, print 4.)\n\nSample Input 1\n\n101\n\nSample Output 1\n\n4\n\nNone of 7, 77, and 777 is a multiple of 101, but 7777 is.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1\n\nAll elements in the sequence are odd numbers; there are no multiples of 2.\n\nSample Input 3\n\n999983\n\nSample Output 3\n\n999982", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 25, "memory_kb": 6660}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s218796617", "group_id": "codeNet:p02597", "input_text": "program alter_altar\n implicit none\n character(200001) :: c = '0'\n integer n\n integer :: r(200001) = 0\n integer :: w(200001) = 0\n integer :: i = 1\n integer :: k = 1\n integer :: j = 0\n read *, n\n read *, c\n do\n if(i /= 1)then\n w(i) = index(c(w(i+1):),'W')\n r(k) = index(c(:r(k-1)),'R',back=.true.)\n if(w(i) > r(k) .or. w(i) == 0 .or. r(i) == 0) exit\n !c(w(i):w(i)) = 'R'\n !c(r(k):r(k)) = 'W'\n j = j + 1\n else if(i == 1)then\n w(i) = index(c,'W')\n r(k) = index(c,'R',back=.true.)\n if(w(i) > r(k) .or. w(i) == 0 .or. r(i) == 0) exit\n if(w(i) < r(k))then\n !c(w(i):w(i)) = 'R'\n !c(r(k):r(k)) = 'W'\n j = j + 1\n end if\n end if\n end do\n print \"('',i0)\", j\nend program", "language": "Fortran", "metadata": {"date": 1598299251, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02597.html", "problem_id": "p02597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02597/input.txt", "sample_output_relpath": "derived/input_output/data/p02597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02597/Fortran/s218796617.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s218796617", "user_id": "u622206408"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program alter_altar\n implicit none\n character(200001) :: c = '0'\n integer n\n integer :: r(200001) = 0\n integer :: w(200001) = 0\n integer :: i = 1\n integer :: k = 1\n integer :: j = 0\n read *, n\n read *, c\n do\n if(i /= 1)then\n w(i) = index(c(w(i+1):),'W')\n r(k) = index(c(:r(k-1)),'R',back=.true.)\n if(w(i) > r(k) .or. w(i) == 0 .or. r(i) == 0) exit\n !c(w(i):w(i)) = 'R'\n !c(r(k):r(k)) = 'W'\n j = j + 1\n else if(i == 1)then\n w(i) = index(c,'W')\n r(k) = index(c,'R',back=.true.)\n if(w(i) > r(k) .or. w(i) == 0 .or. r(i) == 0) exit\n if(w(i) < r(k))then\n !c(w(i):w(i)) = 'R'\n !c(r(k):r(k)) = 'W'\n j = j + 1\n end if\n end if\n end do\n print \"('',i0)\", j\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "sample_input": "4\nWWRR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02597", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 883, "cpu_time_ms": 2205, "memory_kb": 3288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s953533785", "group_id": "codeNet:p02597", "input_text": "program main\n implicit none\n integer n,i,j,k,ans\n character*200000 C\n read(*,*) n\n read(*,*) c\n \n ans = 0\n k = n\n do i=1,n\n if(i >= k)then\n exit\n end if\n if(C(i:i)=='W')then\n do j=k,1,-1\n if(C(j:j)=='R')then\n C(i:i)='R'\n C(j:j)='W'\n k=j-1\n ans = ans + 1\n exit\n end if\n end do\n end if\n end do\n \n write(*,*) ans\nend program main", "language": "Fortran", "metadata": {"date": 1596420565, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02597.html", "problem_id": "p02597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02597/input.txt", "sample_output_relpath": "derived/input_output/data/p02597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02597/Fortran/s953533785.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s953533785", "user_id": "u671401989"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n,i,j,k,ans\n character*200000 C\n read(*,*) n\n read(*,*) c\n \n ans = 0\n k = n\n do i=1,n\n if(i >= k)then\n exit\n end if\n if(C(i:i)=='W')then\n do j=k,1,-1\n if(C(j:j)=='R')then\n C(i:i)='R'\n C(j:j)='W'\n k=j-1\n ans = ans + 1\n exit\n end if\n end do\n end if\n end do\n \n write(*,*) ans\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "sample_input": "4\nWWRR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02597", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 2205, "memory_kb": 3308}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s308020027", "group_id": "codeNet:p02599", "input_text": "module mod_wavelet_matrix\n implicit none\n integer, private, parameter :: intkind = 4\n integer, private, parameter :: bitsize = 64\n integer(8), private, parameter :: mask = -1\n type space_saving_array\n integer :: n, size, offset\n integer(8), allocatable :: bit(:)\n integer, allocatable :: cnt(:)\n end type\n type wavelet_matrix\n integer :: n, m\n type(space_saving_array), allocatable :: bit(:)\n integer, private, allocatable :: order(:), start(:)\n integer(intkind), private, allocatable :: vals(:)\n contains\n procedure :: access => access_to\n procedure :: rank => rank_of\n procedure :: select => select_from\n procedure :: quantile => quantile\n procedure :: range_less => range_less\n procedure :: range_freq => range_freq\n end type\n interface wavelet_matrix\n module procedure :: new_wm\n end interface\n private :: space_saving_array, new_ssa, access_ssa, rank_ssa, select_ssa\n private :: find\ncontains\n type(space_saving_array) function new_ssa(a) result(res)\n logical, intent(in) :: a(:)\n integer :: n, m, i, j, k\n n = size(a)\n m = (n + bitsize - 1) / bitsize\n res%n = n\n res%size = m\n allocate(res%bit(m), res%cnt(0:m))\n res%bit = 0\n j = 1\n k = 0\n do i = 1, n\n if (a(i)) res%bit(j) = ibset(res%bit(j), k)\n k = k + 1\n if (k == bitsize) then\n j = j + 1\n k = 0\n end if\n end do\n res%cnt(0) = 0\n do i = 1, m\n res%cnt(i) = res%cnt(i - 1) + popcnt(res%bit(i))\n end do\n res%offset = n - res%cnt(m)\n end\n logical function access_ssa(this, idx) result(res)\n type(space_saving_array), intent(in) :: this\n integer, intent(in) :: idx\n integer :: i, j\n i = (idx - 1) / bitsize + 1\n j = idx - 1 - (i - 1) * bitsize\n res = btest(this%bit(i), j)\n end\n integer function rank_ssa(this, idx, bool) result(res)\n type(space_saving_array), intent(in) :: this\n integer, intent(in) :: idx\n logical, intent(in) :: bool\n integer :: i, j\n i = (idx - 1) / bitsize + 1\n j = idx - (i - 1) * bitsize\n ! res = this%cnt(i - 1) + popcnt(and(not(lshift(mask, j)), this%bit(i)))\n res = this%cnt(i) - popcnt(and(lshift(mask, j), this%bit(i)))\n if (bool) return\n res = idx - res\n end\n integer function select_ssa(this, ord, bool) result(res)\n type(space_saving_array), intent(in) :: this\n integer, intent(in) :: ord\n logical, intent(in) :: bool\n integer :: l, r, m, s\n res = -1\n s = merge(this%cnt(this%size), this%n - this%cnt(this%size), bool)\n if (s < ord) return\n l = 0\n r = this%size + 1\n do while (r - l > 1)\n m = (l + r) / 2\n s = merge(this%cnt(m), bitsize * m - this%cnt(m), bool)\n if (s < ord) then\n l = m\n else\n r = m\n end if\n end do\n l = bitsize * (r - 1)\n r = bitsize * r + 1\n do while (r - l > 1)\n m = (l + r) / 2\n if (rank_ssa(this, m, bool) < ord) then\n l = m\n else\n r = m\n end if\n end do\n res = r\n end\n type(wavelet_matrix) function new_wm(a, sigma) result(res)\n integer(intkind), intent(in) :: a(:)\n integer(intkind), optional, intent(in) :: sigma\n integer(intkind) :: maxa, x(size(a)), y(size(a)), z(size(a))\n integer, allocatable :: s(:), t(:), u(:)\n integer :: n, m, nx, ny, i, j\n logical :: bool(size(a))\n maxa = merge(sigma, maxval(a), present(sigma))\n n = size(a)\n m = 8 * intkind - 1\n do while (.not.btest(maxa, m))\n m = m - 1\n end do\n res%n = n\n res%m = m\n allocate(res%bit(0:m))\n z = a\n do j = 0, m\n nx = 0\n ny = 0\n do i = 1, n\n bool(i) = btest(z(i), m - j)\n if (bool(i)) then\n ny = ny + 1\n y(ny) = z(i)\n else\n nx = nx + 1\n x(nx) = z(i)\n end if\n end do\n res%bit(j) = new_ssa(bool)\n z(1:nx) = x(1:nx)\n z(nx + 1:n) = y(1:ny)\n end do\n nx = n\n n = 1\n do i = 2, nx\n if (z(i) /= z(i - 1)) n = n + 1\n end do\n allocate(s(n), t(n), u(n), res%order(n), res%start(n), res%vals(n))\n u = [(i, i = 1, n)]\n n = 1\n res%start(1) = 1\n do i = 2, nx\n if (z(i) /= z(n)) then\n n = n + 1\n z(n) = z(i)\n res%start(n) = i\n end if\n end do\n do j = 0, m\n nx = 0\n ny = 0\n do i = 1, n\n if (btest(z(i), j)) then\n ny = ny + 1\n y(ny) = z(i)\n t(ny) = u(i)\n else\n nx = nx + 1\n x(nx) = z(i)\n s(nx) = u(i)\n end if\n end do\n z(1:nx) = x(1:nx)\n z(nx + 1:n) = y(1:ny)\n u(1:nx) = s(1:nx)\n u(nx + 1:n) = t(1:ny)\n end do\n res%order = u\n res%vals = z(1:n)\n end\n integer function find(this, val) result(res)\n type(wavelet_matrix), intent(in) :: this\n integer(intkind) :: val\n integer :: l, r\n l = 0\n r = size(this%vals) + 1\n do while (r - l > 1)\n res = (l + r) / 2\n if (this%vals(res) < val) then\n l = res\n else if (this%vals(res) > val) then\n r = res\n else\n return\n end if\n end do\n res = -1\n end\n integer(intkind) function access_to(this, idx) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: idx\n logical :: bool\n integer :: i, j\n i = idx\n res = 0\n do j = 0, this%m\n bool = access_ssa(this%bit(j), i)\n i = rank_ssa(this%bit(j), i, bool)\n if (bool) then\n res = ibset(res, this%m - j)\n i = i + this%bit(j)%offset\n end if\n end do\n end\n integer function rank_of(this, idx, val) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: idx\n integer(intkind), intent(in) :: val\n logical :: bool\n integer :: i, j, k\n res = 0\n k = find(this, val)\n if (k < 0) return\n k = this%order(k)\n i = idx\n do j = 0, this%m\n bool = btest(val, this%m - j)\n i = rank_ssa(this%bit(j), i, bool)\n if (bool) i = i + this%bit(j)%offset\n end do\n res = i - this%start(k) + 1\n end\n integer function select_from(this, ord, val) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: ord\n integer(intkind), intent(in) :: val\n logical :: bool\n integer :: i, j, k, l\n res = -1\n k = find(this, val)\n if (k < 0) return\n k = this%order(k)\n i = this%start(k) + ord - 1\n if (k == size(this%start)) then\n if (i > this%n) return\n else\n if (i >= this%start(k + 1)) return\n end if\n do j = this%m, 0, -1\n bool = btest(val, this%m - j)\n if (bool) i = i - this%bit(j)%offset\n i = select_ssa(this%bit(j), i, bool)\n end do\n res = i\n end\n integer(intkind) function quantile(this, a, b, ord) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: a, b, ord\n logical :: bool\n integer :: l, r, i, j, d\n res = -1\n if (b - a + 1 < ord) return\n l = a\n r = b\n i = ord\n res = 0\n do j = 0, this%m\n d = (r - l + 1) - (rank_ssa(this%bit(j), r, .true.) - rank_ssa(this%bit(j), l - 1, .true.))\n bool = i > d\n l = rank_ssa(this%bit(j), l - 1, bool) + 1\n r = rank_ssa(this%bit(j), r, bool)\n if (bool) then\n res = ibset(res, this%m - j)\n i = i - d\n l = l + this%bit(j)%offset\n r = r + this%bit(j)%offset\n end if\n end do\n end\n integer function range_less(this, a, b, val) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: a, b\n integer(intkind), intent(in) :: val\n logical :: bool\n integer :: l, r, i, j, d\n res = 0\n if (a > b) return\n l = a\n r = b\n do j = 0, this%m\n d = (r - l + 1) - (rank_ssa(this%bit(j), r, .true.) - rank_ssa(this%bit(j), l - 1, .true.))\n bool = btest(val, this%m - j)\n l = rank_ssa(this%bit(j), l - 1, bool) + 1\n r = rank_ssa(this%bit(j), r, bool)\n if (bool) then\n res = res + d\n l = l + this%bit(j)%offset\n r = r + this%bit(j)%offset\n end if\n end do\n end\n integer function range_freq(this, a, b, x, y) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: a, b\n integer(intkind), intent(in) :: x, y\n res = 0\n if (x > y) return\n res = range_less(this, a, b, y + 1) - range_less(this, a, b, x)\n end\nend module mod_wavelet_matrix\nprogram range_set_query\n use mod_wavelet_matrix\n implicit none\n integer :: n, q, l, r, i\n integer, dimension(500000) :: c = 0, a = 0, b = 0\n type(wavelet_matrix) :: wm\n read(*,*) n, q\n read(*,*) c(1:n)\n b(1:n) = n + 1\n do i = 1, n\n a(i) = b(c(i))\n b(c(i)) = i\n end do\n wm = wavelet_matrix(a(1:n))\n do i = 1, q\n read(*,*) l, r\n write(*,'(i0)') r - l + 1 - wm%range_freq(l, r, l, r)\n end do\nend program range_set_query", "language": "Fortran", "metadata": {"date": 1599459441, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02599.html", "problem_id": "p02599", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02599/input.txt", "sample_output_relpath": "derived/input_output/data/p02599/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02599/Fortran/s308020027.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s308020027", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n3\n1\n", "input_to_evaluate": "module mod_wavelet_matrix\n implicit none\n integer, private, parameter :: intkind = 4\n integer, private, parameter :: bitsize = 64\n integer(8), private, parameter :: mask = -1\n type space_saving_array\n integer :: n, size, offset\n integer(8), allocatable :: bit(:)\n integer, allocatable :: cnt(:)\n end type\n type wavelet_matrix\n integer :: n, m\n type(space_saving_array), allocatable :: bit(:)\n integer, private, allocatable :: order(:), start(:)\n integer(intkind), private, allocatable :: vals(:)\n contains\n procedure :: access => access_to\n procedure :: rank => rank_of\n procedure :: select => select_from\n procedure :: quantile => quantile\n procedure :: range_less => range_less\n procedure :: range_freq => range_freq\n end type\n interface wavelet_matrix\n module procedure :: new_wm\n end interface\n private :: space_saving_array, new_ssa, access_ssa, rank_ssa, select_ssa\n private :: find\ncontains\n type(space_saving_array) function new_ssa(a) result(res)\n logical, intent(in) :: a(:)\n integer :: n, m, i, j, k\n n = size(a)\n m = (n + bitsize - 1) / bitsize\n res%n = n\n res%size = m\n allocate(res%bit(m), res%cnt(0:m))\n res%bit = 0\n j = 1\n k = 0\n do i = 1, n\n if (a(i)) res%bit(j) = ibset(res%bit(j), k)\n k = k + 1\n if (k == bitsize) then\n j = j + 1\n k = 0\n end if\n end do\n res%cnt(0) = 0\n do i = 1, m\n res%cnt(i) = res%cnt(i - 1) + popcnt(res%bit(i))\n end do\n res%offset = n - res%cnt(m)\n end\n logical function access_ssa(this, idx) result(res)\n type(space_saving_array), intent(in) :: this\n integer, intent(in) :: idx\n integer :: i, j\n i = (idx - 1) / bitsize + 1\n j = idx - 1 - (i - 1) * bitsize\n res = btest(this%bit(i), j)\n end\n integer function rank_ssa(this, idx, bool) result(res)\n type(space_saving_array), intent(in) :: this\n integer, intent(in) :: idx\n logical, intent(in) :: bool\n integer :: i, j\n i = (idx - 1) / bitsize + 1\n j = idx - (i - 1) * bitsize\n ! res = this%cnt(i - 1) + popcnt(and(not(lshift(mask, j)), this%bit(i)))\n res = this%cnt(i) - popcnt(and(lshift(mask, j), this%bit(i)))\n if (bool) return\n res = idx - res\n end\n integer function select_ssa(this, ord, bool) result(res)\n type(space_saving_array), intent(in) :: this\n integer, intent(in) :: ord\n logical, intent(in) :: bool\n integer :: l, r, m, s\n res = -1\n s = merge(this%cnt(this%size), this%n - this%cnt(this%size), bool)\n if (s < ord) return\n l = 0\n r = this%size + 1\n do while (r - l > 1)\n m = (l + r) / 2\n s = merge(this%cnt(m), bitsize * m - this%cnt(m), bool)\n if (s < ord) then\n l = m\n else\n r = m\n end if\n end do\n l = bitsize * (r - 1)\n r = bitsize * r + 1\n do while (r - l > 1)\n m = (l + r) / 2\n if (rank_ssa(this, m, bool) < ord) then\n l = m\n else\n r = m\n end if\n end do\n res = r\n end\n type(wavelet_matrix) function new_wm(a, sigma) result(res)\n integer(intkind), intent(in) :: a(:)\n integer(intkind), optional, intent(in) :: sigma\n integer(intkind) :: maxa, x(size(a)), y(size(a)), z(size(a))\n integer, allocatable :: s(:), t(:), u(:)\n integer :: n, m, nx, ny, i, j\n logical :: bool(size(a))\n maxa = merge(sigma, maxval(a), present(sigma))\n n = size(a)\n m = 8 * intkind - 1\n do while (.not.btest(maxa, m))\n m = m - 1\n end do\n res%n = n\n res%m = m\n allocate(res%bit(0:m))\n z = a\n do j = 0, m\n nx = 0\n ny = 0\n do i = 1, n\n bool(i) = btest(z(i), m - j)\n if (bool(i)) then\n ny = ny + 1\n y(ny) = z(i)\n else\n nx = nx + 1\n x(nx) = z(i)\n end if\n end do\n res%bit(j) = new_ssa(bool)\n z(1:nx) = x(1:nx)\n z(nx + 1:n) = y(1:ny)\n end do\n nx = n\n n = 1\n do i = 2, nx\n if (z(i) /= z(i - 1)) n = n + 1\n end do\n allocate(s(n), t(n), u(n), res%order(n), res%start(n), res%vals(n))\n u = [(i, i = 1, n)]\n n = 1\n res%start(1) = 1\n do i = 2, nx\n if (z(i) /= z(n)) then\n n = n + 1\n z(n) = z(i)\n res%start(n) = i\n end if\n end do\n do j = 0, m\n nx = 0\n ny = 0\n do i = 1, n\n if (btest(z(i), j)) then\n ny = ny + 1\n y(ny) = z(i)\n t(ny) = u(i)\n else\n nx = nx + 1\n x(nx) = z(i)\n s(nx) = u(i)\n end if\n end do\n z(1:nx) = x(1:nx)\n z(nx + 1:n) = y(1:ny)\n u(1:nx) = s(1:nx)\n u(nx + 1:n) = t(1:ny)\n end do\n res%order = u\n res%vals = z(1:n)\n end\n integer function find(this, val) result(res)\n type(wavelet_matrix), intent(in) :: this\n integer(intkind) :: val\n integer :: l, r\n l = 0\n r = size(this%vals) + 1\n do while (r - l > 1)\n res = (l + r) / 2\n if (this%vals(res) < val) then\n l = res\n else if (this%vals(res) > val) then\n r = res\n else\n return\n end if\n end do\n res = -1\n end\n integer(intkind) function access_to(this, idx) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: idx\n logical :: bool\n integer :: i, j\n i = idx\n res = 0\n do j = 0, this%m\n bool = access_ssa(this%bit(j), i)\n i = rank_ssa(this%bit(j), i, bool)\n if (bool) then\n res = ibset(res, this%m - j)\n i = i + this%bit(j)%offset\n end if\n end do\n end\n integer function rank_of(this, idx, val) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: idx\n integer(intkind), intent(in) :: val\n logical :: bool\n integer :: i, j, k\n res = 0\n k = find(this, val)\n if (k < 0) return\n k = this%order(k)\n i = idx\n do j = 0, this%m\n bool = btest(val, this%m - j)\n i = rank_ssa(this%bit(j), i, bool)\n if (bool) i = i + this%bit(j)%offset\n end do\n res = i - this%start(k) + 1\n end\n integer function select_from(this, ord, val) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: ord\n integer(intkind), intent(in) :: val\n logical :: bool\n integer :: i, j, k, l\n res = -1\n k = find(this, val)\n if (k < 0) return\n k = this%order(k)\n i = this%start(k) + ord - 1\n if (k == size(this%start)) then\n if (i > this%n) return\n else\n if (i >= this%start(k + 1)) return\n end if\n do j = this%m, 0, -1\n bool = btest(val, this%m - j)\n if (bool) i = i - this%bit(j)%offset\n i = select_ssa(this%bit(j), i, bool)\n end do\n res = i\n end\n integer(intkind) function quantile(this, a, b, ord) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: a, b, ord\n logical :: bool\n integer :: l, r, i, j, d\n res = -1\n if (b - a + 1 < ord) return\n l = a\n r = b\n i = ord\n res = 0\n do j = 0, this%m\n d = (r - l + 1) - (rank_ssa(this%bit(j), r, .true.) - rank_ssa(this%bit(j), l - 1, .true.))\n bool = i > d\n l = rank_ssa(this%bit(j), l - 1, bool) + 1\n r = rank_ssa(this%bit(j), r, bool)\n if (bool) then\n res = ibset(res, this%m - j)\n i = i - d\n l = l + this%bit(j)%offset\n r = r + this%bit(j)%offset\n end if\n end do\n end\n integer function range_less(this, a, b, val) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: a, b\n integer(intkind), intent(in) :: val\n logical :: bool\n integer :: l, r, i, j, d\n res = 0\n if (a > b) return\n l = a\n r = b\n do j = 0, this%m\n d = (r - l + 1) - (rank_ssa(this%bit(j), r, .true.) - rank_ssa(this%bit(j), l - 1, .true.))\n bool = btest(val, this%m - j)\n l = rank_ssa(this%bit(j), l - 1, bool) + 1\n r = rank_ssa(this%bit(j), r, bool)\n if (bool) then\n res = res + d\n l = l + this%bit(j)%offset\n r = r + this%bit(j)%offset\n end if\n end do\n end\n integer function range_freq(this, a, b, x, y) result(res)\n class(wavelet_matrix), intent(in) :: this\n integer, intent(in) :: a, b\n integer(intkind), intent(in) :: x, y\n res = 0\n if (x > y) return\n res = range_less(this, a, b, y + 1) - range_less(this, a, b, x)\n end\nend module mod_wavelet_matrix\nprogram range_set_query\n use mod_wavelet_matrix\n implicit none\n integer :: n, q, l, r, i\n integer, dimension(500000) :: c = 0, a = 0, b = 0\n type(wavelet_matrix) :: wm\n read(*,*) n, q\n read(*,*) c(1:n)\n b(1:n) = n + 1\n do i = 1, n\n a(i) = b(c(i))\n b(c(i)) = i\n end do\n wm = wavelet_matrix(a(1:n))\n do i = 1, q\n read(*,*) l, r\n write(*,'(i0)') r - l + 1 - wm%range_freq(l, r, l, r)\n end do\nend program range_set_query", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.\n\nYou are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?\n\nConstraints\n\n1\\leq N,Q \\leq 5 \\times 10^5\n\n1\\leq c_i \\leq N\n\n1\\leq l_i \\leq r_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 Q\nc_1 c_2 \\cdots c_N\nl_1 r_1\nl_2 r_2\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n4 3\n1 2 1 3\n1 3\n2 4\n3 3\n\nSample Output 1\n\n2\n3\n1\n\nThe 1-st, 2-nd, and 3-rd balls from the left have the colors 1, 2, and 1 - two different colors.\n\nThe 2-st, 3-rd, and 4-th balls from the left have the colors 2, 1, and 3 - three different colors.\n\nThe 3-rd ball from the left has the color 1 - just one color.\n\nSample Input 2\n\n10 10\n2 5 6 5 2 1 7 9 7 2\n5 5\n2 4\n6 7\n2 2\n7 8\n7 9\n1 8\n6 9\n8 10\n6 8\n\nSample Output 2\n\n1\n2\n2\n1\n2\n2\n6\n3\n3\n3", "sample_input": "4 3\n1 2 1 3\n1 3\n2 4\n3 3\n"}, "reference_outputs": ["2\n3\n1\n"], "source_document_id": "p02599", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have N colored balls arranged in a row from left to right; the color of the i-th ball from the left is c_i.\n\nYou are given Q queries. The i-th query is as follows: how many different colors do the l_i-th through r_i-th balls from the left have?\n\nConstraints\n\n1\\leq N,Q \\leq 5 \\times 10^5\n\n1\\leq c_i \\leq N\n\n1\\leq l_i \\leq r_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 Q\nc_1 c_2 \\cdots c_N\nl_1 r_1\nl_2 r_2\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n4 3\n1 2 1 3\n1 3\n2 4\n3 3\n\nSample Output 1\n\n2\n3\n1\n\nThe 1-st, 2-nd, and 3-rd balls from the left have the colors 1, 2, and 1 - two different colors.\n\nThe 2-st, 3-rd, and 4-th balls from the left have the colors 2, 1, and 3 - three different colors.\n\nThe 3-rd ball from the left has the color 1 - just one color.\n\nSample Input 2\n\n10 10\n2 5 6 5 2 1 7 9 7 2\n5 5\n2 4\n6 7\n2 2\n7 8\n7 9\n1 8\n6 9\n8 10\n6 8\n\nSample Output 2\n\n1\n2\n2\n1\n2\n2\n6\n3\n3\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8754, "cpu_time_ms": 1296, "memory_kb": 26144}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s618926290", "group_id": "codeNet:p02600", "input_text": "program abc19\n implicit none\n integer::X,s\n read(*,*)X\n if(X<=599)then\n s=8\n else if(X<=799)then\n s=7\n else if(X<=999)then\n s=6\n else if(X<=1199)then\n s=5\n else if(X<=1399)then\n s=4\n else if(X<=1599)then\n s=3\n else if(X<=1799)then\n s=2\n else\n s=1\n end if\n print'(i0)',s\nend program abc19", "language": "Fortran", "metadata": {"date": 1595725561, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Fortran/s618926290.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s618926290", "user_id": "u897889420"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program abc19\n implicit none\n integer::X,s\n read(*,*)X\n if(X<=599)then\n s=8\n else if(X<=799)then\n s=7\n else if(X<=999)then\n s=6\n else if(X<=1199)then\n s=5\n else if(X<=1399)then\n s=4\n else if(X<=1599)then\n s=3\n else if(X<=1799)then\n s=2\n else\n s=1\n end if\n print'(i0)',s\nend program abc19", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 21, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s098305279", "group_id": "codeNet:p02600", "input_text": "program kyu_in_atcoder\n implicit none\n integer :: x, k\n read(*,*) x\n write(*,'(i0)') 10 - x / 200\nend program kyu_in_atcoder", "language": "Fortran", "metadata": {"date": 1595725395, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Fortran/s098305279.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s098305279", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program kyu_in_atcoder\n implicit none\n integer :: x, k\n read(*,*) x\n write(*,'(i0)') 10 - x / 200\nend program kyu_in_atcoder", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 10, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s822570824", "group_id": "codeNet:p02601", "input_text": "program pr1\n implicit none\n integer :: a, b, c, k, btmp, ctmp\n integer :: i, j\n read(*,*) a,b,c\n read(*,*) k\n\n do i = 0, k\n do j = 0, i\n btmp = b*(2**j)\n ctmp = c*(2**(i-j))\n if ( a < btmp .and. btmp < ctmp ) then\n write(*,'(a)') 'Yes'\n stop\n end if\n end do\n end do\n write(*,'(a)') 'No'\n \n stop\nend program pr1\n", "language": "Fortran", "metadata": {"date": 1595725788, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02601/input.txt", "sample_output_relpath": "derived/input_output/data/p02601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02601/Fortran/s822570824.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822570824", "user_id": "u961266059"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program pr1\n implicit none\n integer :: a, b, c, k, btmp, ctmp\n integer :: i, j\n read(*,*) a,b,c\n read(*,*) k\n\n do i = 0, k\n do j = 0, i\n btmp = b*(2**j)\n ctmp = c*(2**(i-j))\n if ( a < btmp .and. btmp < ctmp ) then\n write(*,'(a)') 'Yes'\n stop\n end if\n end do\n end do\n write(*,'(a)') 'No'\n \n stop\nend program pr1\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "sample_input": "7 2 5\n3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02601", "source_text": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 377, "cpu_time_ms": 13, "memory_kb": 2932}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s007280254", "group_id": "codeNet:p02602", "input_text": "program MSOLUTIONSC\n implicit none\n integer(8)::N,K,i,l,r\n integer(8),allocatable,dimension(:)::A\n read*,N,K\n allocate(A(N))\n read*,A\n\n l=A(1)\n do i=2,N-K+1\n if(A(i+K-1)>l)then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\n l=A(i)\n end do\nend program MSOLUTIONSC", "language": "Fortran", "metadata": {"date": 1596741390, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/Fortran/s007280254.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s007280254", "user_id": "u414699019"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "program MSOLUTIONSC\n implicit none\n integer(8)::N,K,i,l,r\n integer(8),allocatable,dimension(:)::A\n read*,N,K\n allocate(A(N))\n read*,A\n\n l=A(1)\n do i=2,N-K+1\n if(A(i+K-1)>l)then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\n l=A(i)\n end do\nend program MSOLUTIONSC", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 94, "memory_kb": 4636}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s918640178", "group_id": "codeNet:p02602", "input_text": " PROGRAM Marks\n IMPLICIT NONE\n INTEGER,PARAMETER :: p = 16\n integer(p) :: n,k, i\n integer(p),allocatable :: a(:),score(:)\n \n read*,n,k\n allocate( a(n),score(n) )\n read*,a\n \n do i = k+1,n\n if( a(i-k)score(i-1) )then\n ! print*,'Yes'\n ! else\n ! print*,'No'\n ! end if\n ! end do\n \n \n stop\n !debugg\n \n do i = k,n\n print*,score(i)\n end do\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1595727049, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/Fortran/s918640178.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s918640178", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": " PROGRAM Marks\n IMPLICIT NONE\n INTEGER,PARAMETER :: p = 16\n integer(p) :: n,k, i\n integer(p),allocatable :: a(:),score(:)\n \n read*,n,k\n allocate( a(n),score(n) )\n read*,a\n \n do i = k+1,n\n if( a(i-k)score(i-1) )then\n ! print*,'Yes'\n ! else\n ! print*,'No'\n ! end if\n ! end do\n \n \n stop\n !debugg\n \n do i = k,n\n print*,score(i)\n end do\n \n END PROGRAM", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 833, "cpu_time_ms": 107, "memory_kb": 6108}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s462568666", "group_id": "codeNet:p02603", "input_text": "program answer\n implicit none\n integer(8) :: i, N, sum, ka\n integer(8), allocatable :: A(:)\n read(*,*) N\n allocate(A(N))\n read(*,*) A\n\n sum=1000\n ka=0\n\n do i = 1, N-1\n if(A(i)<=A(i+1)) then\n ka=sum/A(i)\n sum=sum-ka*A(i)\n else\n ka=0\n end if\n sum=sum+ka*A(i+1)\n ka=0\n end do\n write(*,*) sum\n deallocate(A)\n stop\n end program answer\n", "language": "Fortran", "metadata": {"date": 1595733399, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02603.html", "problem_id": "p02603", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02603/input.txt", "sample_output_relpath": "derived/input_output/data/p02603/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02603/Fortran/s462568666.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462568666", "user_id": "u873780029"}, "prompt_components": {"gold_output": "1685\n", "input_to_evaluate": "program answer\n implicit none\n integer(8) :: i, N, sum, ka\n integer(8), allocatable :: A(:)\n read(*,*) N\n allocate(A(N))\n read(*,*) A\n\n sum=1000\n ka=0\n\n do i = 1, N-1\n if(A(i)<=A(i+1)) then\n ka=sum/A(i)\n sum=sum-ka*A(i)\n else\n ka=0\n end if\n sum=sum+ka*A(i+1)\n ka=0\n end do\n write(*,*) sum\n deallocate(A)\n stop\n end program answer\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nTo become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives.\n\nHe is famous across the country for his ability to foresee the future. He already knows that the price of one stock in the next N days will be as follows:\n\nA_1 yen on the 1-st day, A_2 yen on the 2-nd day, ..., A_N yen on the N-th day.\n\nIn the i-th day, M-kun can make the following trade any number of times (possibly zero), within the amount of money and stocks that he has at the time.\n\nBuy stock: Pay A_i yen and receive one stock.\n\nSell stock: Sell one stock for A_i yen.\n\nWhat is the maximum possible amount of money that M-kun can have in the end by trading optimally?\n\nConstraints\n\n2 \\leq N \\leq 80\n\n100 \\leq A_i \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the maximum possible amount of money that M-kun can have in the end, as an integer.\n\nSample Input 1\n\n7\n100 130 130 130 115 115 150\n\nSample Output 1\n\n1685\n\nIn this sample input, M-kun has seven days of trading. One way to have 1685 yen in the end is as follows:\n\nInitially, he has 1000 yen and no stocks.\n\nDay 1: Buy 10 stocks for 1000 yen. Now he has 0 yen.\n\nDay 2: Sell 7 stocks for 910 yen. Now he has 910 yen.\n\nDay 3: Sell 3 stocks for 390 yen. Now he has 1300 yen.\n\nDay 4: Do nothing.\n\nDay 5: Buy 1 stock for 115 yen. Now he has 1185 yen.\n\nDay 6: Buy 10 stocks for 1150 yen. Now he has 35 yen.\n\nDay 7: Sell 11 stocks for 1650 yen. Now he has 1685 yen.\n\nThere is no way to have 1686 yen or more in the end, so the answer is 1685.\n\nSample Input 2\n\n6\n200 180 160 140 120 100\n\nSample Output 2\n\n1000\n\nIn this sample input, it is optimal to do nothing throughout the six days, after which we will have 1000 yen.\n\nSample Input 3\n\n2\n157 193\n\nSample Output 3\n\n1216\n\nIn this sample input, it is optimal to buy 6 stocks in Day 1 and sell them in Day 2, after which we will have 1216 yen.", "sample_input": "7\n100 130 130 130 115 115 150\n"}, "reference_outputs": ["1685\n"], "source_document_id": "p02603", "source_text": "Score: 400 points\n\nProblem Statement\n\nTo become a millionaire, M-kun has decided to make money by trading in the next N days. Currently, he has 1000 yen and no stocks - only one kind of stock is issued in the country where he lives.\n\nHe is famous across the country for his ability to foresee the future. He already knows that the price of one stock in the next N days will be as follows:\n\nA_1 yen on the 1-st day, A_2 yen on the 2-nd day, ..., A_N yen on the N-th day.\n\nIn the i-th day, M-kun can make the following trade any number of times (possibly zero), within the amount of money and stocks that he has at the time.\n\nBuy stock: Pay A_i yen and receive one stock.\n\nSell stock: Sell one stock for A_i yen.\n\nWhat is the maximum possible amount of money that M-kun can have in the end by trading optimally?\n\nConstraints\n\n2 \\leq N \\leq 80\n\n100 \\leq A_i \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the maximum possible amount of money that M-kun can have in the end, as an integer.\n\nSample Input 1\n\n7\n100 130 130 130 115 115 150\n\nSample Output 1\n\n1685\n\nIn this sample input, M-kun has seven days of trading. One way to have 1685 yen in the end is as follows:\n\nInitially, he has 1000 yen and no stocks.\n\nDay 1: Buy 10 stocks for 1000 yen. Now he has 0 yen.\n\nDay 2: Sell 7 stocks for 910 yen. Now he has 910 yen.\n\nDay 3: Sell 3 stocks for 390 yen. Now he has 1300 yen.\n\nDay 4: Do nothing.\n\nDay 5: Buy 1 stock for 115 yen. Now he has 1185 yen.\n\nDay 6: Buy 10 stocks for 1150 yen. Now he has 35 yen.\n\nDay 7: Sell 11 stocks for 1650 yen. Now he has 1685 yen.\n\nThere is no way to have 1686 yen or more in the end, so the answer is 1685.\n\nSample Input 2\n\n6\n200 180 160 140 120 100\n\nSample Output 2\n\n1000\n\nIn this sample input, it is optimal to do nothing throughout the six days, after which we will have 1000 yen.\n\nSample Input 3\n\n2\n157 193\n\nSample Output 3\n\n1216\n\nIn this sample input, it is optimal to buy 6 stocks in Day 1 and sell them in Day 2, after which we will have 1216 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 384, "cpu_time_ms": 14, "memory_kb": 2824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s864910422", "group_id": "codeNet:p02603", "input_text": "program answer\n implicit none\n integer :: i, N, sum, ka\n integer, allocatable :: A(:)\n read(*,*) N\n allocate(A(N))\n read(*,*) A\n\n sum=1000\n \n do i = 1, N-1\n if(A(i) 0) then\n if(u(i) == \"R\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n else if(u(j) == \"D\") then\n if(dy > 0) then\n if(dx < 0) then\n if(u(i) == \"L\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dx == 0) then\n if(u(i) == \"U\") then\n dt = abs(dy)*5\n c = c + 1\n end if\n else if(dx > 0) then\n if(u(i) == \"R\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n else if(u(j) == \"R\") then\n if(dx < 0) then\n if(dy < 0) then\n if(u(i) == \"D\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dy == 0) then\n if(u(i) == \"L\") then\n dt = abs(dx)*5\n c = c + 1\n end if\n else if(dy > 0) then\n if(u(i) == \"U\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n else if(u(j) == \"L\") then\n if(dx > 0) then\n if(dy < 0) then\n if(u(i) == \"D\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dy == 0) then\n if(u(i) == \"R\") then\n dt = abs(dx)*5\n c = c + 1\n end if\n else if(dy > 0) then\n if(u(i) == \"U\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n end if\n if (dt < dt_min) then\n dt_min = dt\n end if\n end do\n end do\n \n if (c == 0) then\n write(*,*) \"SAFE\"\n else\n write(*,*) dt_min\n end if\n\nend program\n", "language": "Fortran", "metadata": {"date": 1595731449, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02605.html", "problem_id": "p02605", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02605/input.txt", "sample_output_relpath": "derived/input_output/data/p02605/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02605/Fortran/s789880415.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s789880415", "user_id": "u806372060"}, "prompt_components": {"gold_output": "230\n", "input_to_evaluate": "program main\n implicit none\n integer(8) n\n integer(8), allocatable, dimension(:) :: x,y\n character(:), allocatable :: u(:)\n integer(8) i, j, c\n integer dx, dy, dt, dt_min\n read(*,*) n\n allocate(x(n))\n allocate(y(n))\n allocate(character(1) :: u(n))\n do i = 1, n\n read(*,*) x(i), y(i), u(i)\n end do\n\n dt_min = 400000\n dt = dt_min\n c = 0\n\n do i = 1, n\n do j = i+1, n\n dx = x(j) - x(i)\n dy = y(j) - y(i)\n if(u(j) == \"U\") then\n if(dy < 0) then\n if(dx < 0) then\n if(u(i) == \"L\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dx == 0) then\n if(u(i) == \"D\") then\n dt = abs(dy)*5\n c = c + 1\n end if\n else if(dx > 0) then\n if(u(i) == \"R\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n else if(u(j) == \"D\") then\n if(dy > 0) then\n if(dx < 0) then\n if(u(i) == \"L\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dx == 0) then\n if(u(i) == \"U\") then\n dt = abs(dy)*5\n c = c + 1\n end if\n else if(dx > 0) then\n if(u(i) == \"R\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n else if(u(j) == \"R\") then\n if(dx < 0) then\n if(dy < 0) then\n if(u(i) == \"D\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dy == 0) then\n if(u(i) == \"L\") then\n dt = abs(dx)*5\n c = c + 1\n end if\n else if(dy > 0) then\n if(u(i) == \"U\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n else if(u(j) == \"L\") then\n if(dx > 0) then\n if(dy < 0) then\n if(u(i) == \"D\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n else if(dy == 0) then\n if(u(i) == \"R\") then\n dt = abs(dx)*5\n c = c + 1\n end if\n else if(dy > 0) then\n if(u(i) == \"U\") then\n if(abs(dx) == abs(dy)) then\n dt = abs(dy)*10\n c = c + 1\n end if\n end if\n end if\n end if\n end if\n if (dt < dt_min) then\n dt_min = dt\n end if\n end do\n end do\n \n if (c == 0) then\n write(*,*) \"SAFE\"\n else\n write(*,*) dt_min\n end if\n\nend program\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "sample_input": "2\n11 1 U\n11 47 D\n"}, "reference_outputs": ["230\n"], "source_document_id": "p02605", "source_text": "Score: 600 points\n\nProblem Statement\n\nM-kun is a brilliant air traffic controller.\n\nOn the display of his radar, there are N airplanes numbered 1, 2, ..., N, all flying at the same altitude.\n\nEach of the airplanes flies at a constant speed of 0.1 per second in a constant direction. The current coordinates of the airplane numbered i are (X_i, Y_i), and the direction of the airplane is as follows:\n\nif U_i is U, it flies in the positive y direction;\n\nif U_i is R, it flies in the positive x direction;\n\nif U_i is D, it flies in the negative y direction;\n\nif U_i is L, it flies in the negative x direction.\n\nTo help M-kun in his work, determine whether there is a pair of airplanes that will collide with each other if they keep flying as they are now.\n\nIf there is such a pair, find the number of seconds after which the first collision will happen.\n\nWe assume that the airplanes are negligibly small so that two airplanes only collide when they reach the same coordinates simultaneously.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n0 \\leq X_i, Y_i \\leq 200000\n\nU_i is U, R, D, or L.\n\nThe current positions of the N airplanes, (X_i, Y_i), are all distinct.\n\nN, X_i, and Y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1 U_1\nX_2 Y_2 U_2\nX_3 Y_3 U_3\n:\nX_N Y_N U_N\n\nOutput\n\nIf there is a pair of airplanes that will collide with each other if they keep flying as they are now, print an integer representing the number of seconds after which the first collision will happen.\n\nIf there is no such pair, print SAFE.\n\nSample Input 1\n\n2\n11 1 U\n11 47 D\n\nSample Output 1\n\n230\n\nIf the airplanes keep flying as they are now, two airplanes numbered 1 and 2 will reach the coordinates (11, 24) simultaneously and collide.\n\nSample Input 2\n\n4\n20 30 U\n30 20 R\n20 10 D\n10 20 L\n\nSample Output 2\n\nSAFE\n\nNo pair of airplanes will collide.\n\nSample Input 3\n\n8\n168 224 U\n130 175 R\n111 198 D\n121 188 L\n201 116 U\n112 121 R\n145 239 D\n185 107 L\n\nSample Output 3\n\n100", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4356, "cpu_time_ms": 3308, "memory_kb": 5824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s982736014", "group_id": "codeNet:p02606", "input_text": "program abc7\n implicit none\n integer::L,R,d,s,i\n read(*,*)L,R,d\n do i=L,R\n if(mod(i,d)==0)then\n s=s+1\n end if\n end do\n print'(i0)',s\nend program abc7", "language": "Fortran", "metadata": {"date": 1594515908, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02606.html", "problem_id": "p02606", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02606/input.txt", "sample_output_relpath": "derived/input_output/data/p02606/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02606/Fortran/s982736014.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s982736014", "user_id": "u897889420"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program abc7\n implicit none\n integer::L,R,d,s,i\n read(*,*)L,R,d\n do i=L,R\n if(mod(i,d)==0)then\n s=s+1\n end if\n end do\n print'(i0)',s\nend program abc7", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "sample_input": "5 10 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02606", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many multiples of d are there among the integers between L and R (inclusive)?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L \\leq R \\leq 100\n\n1 \\leq d \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL R d\n\nOutput\n\nPrint the number of multiples of d among the integers between L and R (inclusive).\n\nSample Input 1\n\n5 10 2\n\nSample Output 1\n\n3\n\nAmong the integers between 5 and 10, there are three multiples of 2: 6, 8, and 10.\n\nSample Input 2\n\n6 20 7\n\nSample Output 2\n\n2\n\nAmong the integers between 6 and 20, there are two multiples of 7: 7 and 14.\n\nSample Input 3\n\n1 100 1\n\nSample Output 3\n\n100", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 13, "memory_kb": 2868}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s495846889", "group_id": "codeNet:p02607", "input_text": "program answer\n implicit none\n integer :: N, i, count\n integer, allocatable :: a(:)\n read(*,*) N\n allocate(a(N))\n read(*,*) a\n\n count=0\n do i = 1, N, 2\n if(mod(a(i),2)==1) then\n count=count+1\n end if\n end do\n\n write(*,*) count\n deallocate(a)\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1594515952, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/Fortran/s495846889.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s495846889", "user_id": "u873780029"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program answer\n implicit none\n integer :: N, i, count\n integer, allocatable :: a(:)\n read(*,*) N\n allocate(a(N))\n read(*,*) a\n\n count=0\n do i = 1, N, 2\n if(mod(a(i),2)==1) then\n count=count+1\n end if\n end do\n\n write(*,*) count\n deallocate(a)\n stop\n end program answer", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 2792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s277547457", "group_id": "codeNet:p02608", "input_text": "program atcoder\nimplicit none\ninteger :: n , x , y , z , i , sum\nreal :: j\nread *,n\nsum = 0\nj = real(n)\ndo i = 1 , n\n sum = 0\n do x = int(sqrt(j/6.0)) , int(sqrt(j))+1\n do y = x , int(sqrt(j))+1\n do z = y , int(sqrt(j))+1\n if(x**2 + y**2 + z**2 + x*y + y*z + z*x == i)then\n sum = sum + 1\n if(x == y .and. y == z)goto 10\n end if\n end do\n end do\n end do\n print *, sum * 3\n goto 20\n10 print *, sum * 3 - 2\n20 end do\nend program atcoder", "language": "Fortran", "metadata": {"date": 1594519995, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Fortran/s277547457.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s277547457", "user_id": "u223215060"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "program atcoder\nimplicit none\ninteger :: n , x , y , z , i , sum\nreal :: j\nread *,n\nsum = 0\nj = real(n)\ndo i = 1 , n\n sum = 0\n do x = int(sqrt(j/6.0)) , int(sqrt(j))+1\n do y = x , int(sqrt(j))+1\n do z = y , int(sqrt(j))+1\n if(x**2 + y**2 + z**2 + x*y + y*z + z*x == i)then\n sum = sum + 1\n if(x == y .and. y == z)goto 10\n end if\n end do\n end do\n end do\n print *, sum * 3\n goto 20\n10 print *, sum * 3 - 2\n20 end do\nend program atcoder", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 477, "memory_kb": 2660}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s854510610", "group_id": "codeNet:p02608", "input_text": "program abc9\n implicit none\n integer::N,i,x,y,z,s,t,sa=0,sb=0,sc=0\n read(*,*)N\n do i=1,N\n t=int(sqrt(dble(i))-1)+1\n s=0\n sa=0\n sb=0\n sc=0\n do x=1,t\n do y=x,t\n do z=y,t\n if(x**2+y**2+z**2+x*y+y*z+z*x==i)then\n if(x==y.and.y==z)then\n sb=sb+1\n else if(x==y.or.y==z.or.z==x)then\n sa=sa+1\n else\n sc=sc+1\n end if\n end if\n end do\n end do\n end do\n s=sc*6+sa*3+sb\n print'(i0)',s\n end do\nend program abc9", "language": "Fortran", "metadata": {"date": 1594519553, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Fortran/s854510610.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s854510610", "user_id": "u897889420"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "program abc9\n implicit none\n integer::N,i,x,y,z,s,t,sa=0,sb=0,sc=0\n read(*,*)N\n do i=1,N\n t=int(sqrt(dble(i))-1)+1\n s=0\n sa=0\n sb=0\n sc=0\n do x=1,t\n do y=x,t\n do z=y,t\n if(x**2+y**2+z**2+x*y+y*z+z*x==i)then\n if(x==y.and.y==z)then\n sb=sb+1\n else if(x==y.or.y==z.or.z==x)then\n sa=sa+1\n else\n sc=sc+1\n end if\n end if\n end do\n end do\n end do\n s=sc*6+sa*3+sb\n print'(i0)',s\n end do\nend program abc9", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 926, "memory_kb": 2804}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s176940727", "group_id": "codeNet:p02608", "input_text": "program tsundoku\n implicit none\n integer :: n, m, i,j, h = 0, l, r, p\n integer(8) :: k, t\n integer(8), dimension(0:200001) :: a = 0, b = 0, x = 0, y = 0\n read(*,*) n\n do t=1,n\n m=int(sqrt(dble(t)))\n p=0\n\tdo i=1,m\n \tdo j=1,m\n \tdo k=1,m\n \tif((i*i+j*j+k*k+i*j+j*k+i*k)==t)then\n p=p+1\n end if\n end do\n end do\n end do\n write(*,*)p\n end do\nend program tsundoku", "language": "Fortran", "metadata": {"date": 1594516808, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/Fortran/s176940727.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s176940727", "user_id": "u970637660"}, "prompt_components": {"gold_output": "0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n", "input_to_evaluate": "program tsundoku\n implicit none\n integer :: n, m, i,j, h = 0, l, r, p\n integer(8) :: k, t\n integer(8), dimension(0:200001) :: a = 0, b = 0, x = 0, y = 0\n read(*,*) n\n do t=1,n\n m=int(sqrt(dble(t)))\n p=0\n\tdo i=1,m\n \tdo j=1,m\n \tdo k=1,m\n \tif((i*i+j*j+k*k+i*j+j*k+i*k)==t)then\n p=p+1\n end if\n end do\n end do\n end do\n write(*,*)p\n end do\nend program tsundoku", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s007928868", "group_id": "codeNet:p02613", "input_text": "program testcase\n integer(8) n\n integer i\n integer :: ac = 0\n integer :: tle = 0\n integer :: wa = 0\n integer :: re = 0\n character(3) str\n !character, allocatable :: s(:)\n read *, n\n !allocate (s(n))\n do i = 1, n\n read *, str\n if(str .eq. \"AC\")then\n ac = ac + 1\n else if(str .eq. \"WA\")then\n wa = wa + 1\n else if(str .eq. \"RE\")then\n re = re + 1\n else if(str .eq. \"TLE\")then\n tle = tle + 1\n end if\n end do\n print *, 'AC ×', ac\n print *, 'WA ×', wa\n print *, 'TLE ×', tle\n print *, 'RE ×', re\nend program", "language": "Fortran", "metadata": {"date": 1598043022, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/Fortran/s007928868.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s007928868", "user_id": "u622206408"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "program testcase\n integer(8) n\n integer i\n integer :: ac = 0\n integer :: tle = 0\n integer :: wa = 0\n integer :: re = 0\n character(3) str\n !character, allocatable :: s(:)\n read *, n\n !allocate (s(n))\n do i = 1, n\n read *, str\n if(str .eq. \"AC\")then\n ac = ac + 1\n else if(str .eq. \"WA\")then\n wa = wa + 1\n else if(str .eq. \"RE\")then\n re = re + 1\n else if(str .eq. \"TLE\")then\n tle = tle + 1\n end if\n end do\n print *, 'AC ×', ac\n print *, 'WA ×', wa\n print *, 'TLE ×', tle\n print *, 'RE ×', re\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 43, "memory_kb": 2820}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s127285091", "group_id": "codeNet:p02613", "input_text": " PROGRAM piyo\n IMPLICIT NONE\n INTEGER,PARAMETER :: prec = 16\n integer(prec) :: n,i,awtr(4)=0,num = 1\n character(3) :: s\n \n read*,n\n do i = 1,n\n read*,s(1:3)\n \n select case( s )\n case( 'AC ')\n num = 1\n case( 'WA ' )\n num = 2\n case( 'TLE' )\n num = 3\n case( 'RE' )\n num = 4\n end select\n \n awtr(num) = awtr(num) + 1\n end do\n \n print'(a,i0)','AC x ',awtr(1)\n print'(a,i0)','WA x ',awtr(2)\n print'(a,i0)','TLE x ',awtr(3)\n print'(a,i0)','RE x ',awtr(4)\n \n \n \n stop\n !debugg\n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1593997628, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/Fortran/s127285091.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127285091", "user_id": "u171356453"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": " PROGRAM piyo\n IMPLICIT NONE\n INTEGER,PARAMETER :: prec = 16\n integer(prec) :: n,i,awtr(4)=0,num = 1\n character(3) :: s\n \n read*,n\n do i = 1,n\n read*,s(1:3)\n \n select case( s )\n case( 'AC ')\n num = 1\n case( 'WA ' )\n num = 2\n case( 'TLE' )\n num = 3\n case( 'RE' )\n num = 4\n end select\n \n awtr(num) = awtr(num) + 1\n end do\n \n print'(a,i0)','AC x ',awtr(1)\n print'(a,i0)','WA x ',awtr(2)\n print'(a,i0)','TLE x ',awtr(3)\n print'(a,i0)','RE x ',awtr(4)\n \n \n \n stop\n !debugg\n \n \n \n END PROGRAM", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 723, "cpu_time_ms": 42, "memory_kb": 2960}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s413856795", "group_id": "codeNet:p02614", "input_text": "program prob3\n implicit none\n integer::h, w, k, i, j, l, cnt, it, jt\n integer, allocatable::c(:,:), tmp(:,:), tmpp(:,:)\n character(len=10)::s\n read(*,*) h, w, k\n allocate(c(h,w), tmp(h,w), tmpp(h,w))\n do i = 1, h\n read(*,*) s\n do j = 1, w\n if(s(j:j) .eq. \".\") then\n c(i,j) = 0\n else\n c(i,j) = 1\n end if\n end do\n end do\n cnt = 0\n do i = 0, 2**h-1\n tmp = c\n it = i\n do j = 1, h\n if(mod(it,2) == 1) tmp(j,:) = 0\n it = it/2\n end do\n do j = 0, 2**w-1\n \ttmpp = tmp\n jt = j\n do l = 1, w\n if(mod(jt,2) == 1) tmpp(:,l) = 0\n jt = jt/2\n end do\n if(sum(tmpp) == k) cnt = cnt + 1\n end do\n end do\n write(*,*) cnt\n deallocate(c,tmp,tmpp)\n stop\nend program", "language": "Fortran", "metadata": {"date": 1598209596, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02614.html", "problem_id": "p02614", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02614/input.txt", "sample_output_relpath": "derived/input_output/data/p02614/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02614/Fortran/s413856795.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s413856795", "user_id": "u841856382"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program prob3\n implicit none\n integer::h, w, k, i, j, l, cnt, it, jt\n integer, allocatable::c(:,:), tmp(:,:), tmpp(:,:)\n character(len=10)::s\n read(*,*) h, w, k\n allocate(c(h,w), tmp(h,w), tmpp(h,w))\n do i = 1, h\n read(*,*) s\n do j = 1, w\n if(s(j:j) .eq. \".\") then\n c(i,j) = 0\n else\n c(i,j) = 1\n end if\n end do\n end do\n cnt = 0\n do i = 0, 2**h-1\n tmp = c\n it = i\n do j = 1, h\n if(mod(it,2) == 1) tmp(j,:) = 0\n it = it/2\n end do\n do j = 0, 2**w-1\n \ttmpp = tmp\n jt = j\n do l = 1, w\n if(mod(jt,2) == 1) tmpp(:,l) = 0\n jt = jt/2\n end do\n if(sum(tmpp) == k) cnt = cnt + 1\n end do\n end do\n write(*,*) cnt\n deallocate(c,tmp,tmpp)\n stop\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \\leq i \\leq H, 1 \\leq j \\leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is ., and black if c_{i,j} is #.\n\nConsider doing the following operation:\n\nChoose some number of rows (possibly zero), and some number of columns (possibly zero). Then, paint red all squares in the chosen rows and all squares in the chosen columns.\n\nYou are given a positive integer K. How many choices of rows and columns result in exactly K black squares remaining after the operation? Here, we consider two choices different when there is a row or column chosen in only one of those choices.\n\nConstraints\n\n1 \\leq H, W \\leq 6\n\n1 \\leq K \\leq HW\n\nc_{i,j} is . or #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nc_{1,1}c_{1,2}...c_{1,W}\nc_{2,1}c_{2,2}...c_{2,W}\n:\nc_{H,1}c_{H,2}...c_{H,W}\n\nOutput\n\nPrint an integer representing the number of choices of rows and columns satisfying the condition.\n\nSample Input 1\n\n2 3 2\n..#\n###\n\nSample Output 1\n\n5\n\nFive choices below satisfy the condition.\n\nThe 1-st row and 1-st column\n\nThe 1-st row and 2-nd column\n\nThe 1-st row and 3-rd column\n\nThe 1-st and 2-nd column\n\nThe 3-rd column\n\nSample Input 2\n\n2 3 4\n..#\n###\n\nSample Output 2\n\n1\n\nOne choice, which is choosing nothing, satisfies the condition.\n\nSample Input 3\n\n2 2 3\n##\n##\n\nSample Output 3\n\n0\n\nSample Input 4\n\n6 6 8\n..##..\n.#..#.\n#....#\n######\n#....#\n#....#\n\nSample Output 4\n\n208", "sample_input": "2 3 2\n..#\n###\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02614", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a grid of H rows and W columns of squares. The color of the square at the i-th row from the top and the j-th column from the left (1 \\leq i \\leq H, 1 \\leq j \\leq W) is given to you as a character c_{i,j}: the square is white if c_{i,j} is ., and black if c_{i,j} is #.\n\nConsider doing the following operation:\n\nChoose some number of rows (possibly zero), and some number of columns (possibly zero). Then, paint red all squares in the chosen rows and all squares in the chosen columns.\n\nYou are given a positive integer K. How many choices of rows and columns result in exactly K black squares remaining after the operation? Here, we consider two choices different when there is a row or column chosen in only one of those choices.\n\nConstraints\n\n1 \\leq H, W \\leq 6\n\n1 \\leq K \\leq HW\n\nc_{i,j} is . or #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nc_{1,1}c_{1,2}...c_{1,W}\nc_{2,1}c_{2,2}...c_{2,W}\n:\nc_{H,1}c_{H,2}...c_{H,W}\n\nOutput\n\nPrint an integer representing the number of choices of rows and columns satisfying the condition.\n\nSample Input 1\n\n2 3 2\n..#\n###\n\nSample Output 1\n\n5\n\nFive choices below satisfy the condition.\n\nThe 1-st row and 1-st column\n\nThe 1-st row and 2-nd column\n\nThe 1-st row and 3-rd column\n\nThe 1-st and 2-nd column\n\nThe 3-rd column\n\nSample Input 2\n\n2 3 4\n..#\n###\n\nSample Output 2\n\n1\n\nOne choice, which is choosing nothing, satisfies the condition.\n\nSample Input 3\n\n2 2 3\n##\n##\n\nSample Output 3\n\n0\n\nSample Input 4\n\n6 6 8\n..##..\n.#..#.\n#....#\n######\n#....#\n#....#\n\nSample Output 4\n\n208", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 911, "cpu_time_ms": 13, "memory_kb": 2824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s598276094", "group_id": "codeNet:p02615", "input_text": "program ABC173D\n implicit none\n integer(8)::N,i,ans=0\n integer(8),allocatable,dimension(:)::A\n read*,N\n allocate(A(N))\n read*,A\n call heapsort(N,A)\n do i=1,N-1\n ans=ans+A(N-i/2)\n end do\n\n print'(i0)',ans\nend program ABC173D\n\nsubroutine heapsort(n,array)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t\n \n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine heapsort", "language": "Fortran", "metadata": {"date": 1596703758, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02615.html", "problem_id": "p02615", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02615/input.txt", "sample_output_relpath": "derived/input_output/data/p02615/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02615/Fortran/s598276094.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s598276094", "user_id": "u414699019"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program ABC173D\n implicit none\n integer(8)::N,i,ans=0\n integer(8),allocatable,dimension(:)::A\n read*,N\n allocate(A(N))\n read*,A\n call heapsort(N,A)\n do i=1,N-1\n ans=ans+A(N-i/2)\n end do\n\n print'(i0)',ans\nend program ABC173D\n\nsubroutine heapsort(n,array)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t\n \n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine heapsort", "problem_context": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "sample_input": "4\n2 2 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02615", "source_text": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1096, "cpu_time_ms": 74, "memory_kb": 4616}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s786280023", "group_id": "codeNet:p02615", "input_text": "module module_sort\n use iso_fortran_env\n implicit none\n\n interface quicksort\n module procedure :: int32_qsort\n module procedure :: int64_qsort\n end interface quicksort\ncontains\n\n recursive function int32_qsort(m) result(res)\n integer(int32), intent(in) :: m(:)\n integer(int32) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int32_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int32_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int32_qsort\n\n recursive function int64_qsort(m) result(res)\n integer(int64), intent(in) :: m(:)\n integer(int64) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int64_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int64_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int64_qsort\n\nend module module_sort\n\nprogram main\n use module_sort\n use iso_fortran_env\n implicit none\n integer(8) :: n\n integer(8), allocatable :: ai(:)\n integer(8) :: i, ie\n integer(8) :: ans\n\n read *, n\n allocate( ai(n) )\n read *, ai( 1:n )\n! ai = quicksort( ai )\n! print *, int32, int64, int128\n! call qsort( ai )\n! ai(n:1:-1) = ai(1:n)\n ai = intQsort( ai )\n ai(n:1:-1) = ai(1:n)\n\n if ( mod((n-1), 2) == 0 ) then\n ie = (n-1) / 2\n ans = ai(1) + ai(ie + 1)\n else\n ie = n / 2\n ans = ai(1)\n endif\n\n do i = 2, ie\n ans = ans + ai(i) * 2\n enddo\n\n print *, ans\n\ncontains\n\nrecursive subroutine qsort(a)\n implicit none\n integer(8),intent(inout) :: a(:)\n integer(8)::i,j,toobig,toosmall,pv,n\n\n n = size(a)\ni = 1\nj = n\npv = a((i+j)/2)\ndo\n do\n if (a(i) < pv) then\n i = i+1\n else\n exit\n end if\n end do\n do\n if(a(j) > pv) then\n j = j-1\n else\n exit\n end if\n end do\n if (i>=j) then\n exit\n else\n toobig = a(j)\n toosmall = a(i)\n a(i) = toobig\n a(j) = toosmall\n i = i+1\n j = j-1\n end if\n end do\n if (i > 2) then\n call qsort(a(1:i-1))\n end if\n if (j < n-1) then\n call qsort(a(j+1:n))\n end if\nend subroutine qsort\n\npure recursive function intQsort( a ) result( r )\nimplicit none\ninteger(8), intent(in) :: a(:)\ninteger(8) :: r( size(a) )\ninteger(8) :: sample(3), len, i,j\n\nlen = size( a(:) )\nif( len<=1 )then\n r = a\nelse\n !select pivot\n sample(1:3) = [a(1), a(len/2), a(len)]\n do i = 1,2\n do j = 2,3\n if( sample(i)>sample(j) )then\n len = sample(i) !len is buffer\n sample(i) = sample(j)\n sample(j) = len\n end if\n end do\n end do\n \n r = [ intQsort( pack(a(:), a(:)< sample(2)) ), &\n pack(a(:), a(:)==sample(2)) , &\n intQsort( pack(a(:), a(:)> sample(2)) ) ]\nend if\nend function intQsort\n\nend program main", "language": "Fortran", "metadata": {"date": 1596390904, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02615.html", "problem_id": "p02615", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02615/input.txt", "sample_output_relpath": "derived/input_output/data/p02615/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02615/Fortran/s786280023.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s786280023", "user_id": "u128084721"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "module module_sort\n use iso_fortran_env\n implicit none\n\n interface quicksort\n module procedure :: int32_qsort\n module procedure :: int64_qsort\n end interface quicksort\ncontains\n\n recursive function int32_qsort(m) result(res)\n integer(int32), intent(in) :: m(:)\n integer(int32) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int32_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int32_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int32_qsort\n\n recursive function int64_qsort(m) result(res)\n integer(int64), intent(in) :: m(:)\n integer(int64) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int64_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int64_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int64_qsort\n\nend module module_sort\n\nprogram main\n use module_sort\n use iso_fortran_env\n implicit none\n integer(8) :: n\n integer(8), allocatable :: ai(:)\n integer(8) :: i, ie\n integer(8) :: ans\n\n read *, n\n allocate( ai(n) )\n read *, ai( 1:n )\n! ai = quicksort( ai )\n! print *, int32, int64, int128\n! call qsort( ai )\n! ai(n:1:-1) = ai(1:n)\n ai = intQsort( ai )\n ai(n:1:-1) = ai(1:n)\n\n if ( mod((n-1), 2) == 0 ) then\n ie = (n-1) / 2\n ans = ai(1) + ai(ie + 1)\n else\n ie = n / 2\n ans = ai(1)\n endif\n\n do i = 2, ie\n ans = ans + ai(i) * 2\n enddo\n\n print *, ans\n\ncontains\n\nrecursive subroutine qsort(a)\n implicit none\n integer(8),intent(inout) :: a(:)\n integer(8)::i,j,toobig,toosmall,pv,n\n\n n = size(a)\ni = 1\nj = n\npv = a((i+j)/2)\ndo\n do\n if (a(i) < pv) then\n i = i+1\n else\n exit\n end if\n end do\n do\n if(a(j) > pv) then\n j = j-1\n else\n exit\n end if\n end do\n if (i>=j) then\n exit\n else\n toobig = a(j)\n toosmall = a(i)\n a(i) = toobig\n a(j) = toosmall\n i = i+1\n j = j-1\n end if\n end do\n if (i > 2) then\n call qsort(a(1:i-1))\n end if\n if (j < n-1) then\n call qsort(a(j+1:n))\n end if\nend subroutine qsort\n\npure recursive function intQsort( a ) result( r )\nimplicit none\ninteger(8), intent(in) :: a(:)\ninteger(8) :: r( size(a) )\ninteger(8) :: sample(3), len, i,j\n\nlen = size( a(:) )\nif( len<=1 )then\n r = a\nelse\n !select pivot\n sample(1:3) = [a(1), a(len/2), a(len)]\n do i = 1,2\n do j = 2,3\n if( sample(i)>sample(j) )then\n len = sample(i) !len is buffer\n sample(i) = sample(j)\n sample(j) = len\n end if\n end do\n end do\n \n r = [ intQsort( pack(a(:), a(:)< sample(2)) ), &\n pack(a(:), a(:)==sample(2)) , &\n intQsort( pack(a(:), a(:)> sample(2)) ) ]\nend if\nend function intQsort\n\nend program main", "problem_context": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "sample_input": "4\n2 2 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02615", "source_text": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2805, "cpu_time_ms": 145, "memory_kb": 11952}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s852730553", "group_id": "codeNet:p02615", "input_text": "module module_sort\n use iso_fortran_env\n implicit none\n\n interface quicksort\n module procedure :: int32_qsort\n module procedure :: int64_qsort\n end interface quicksort\ncontains\n\n recursive function int32_qsort(m) result(res)\n integer(int32), intent(in) :: m(:)\n integer(int32) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int32_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int32_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int32_qsort\n\n recursive function int64_qsort(m) result(res)\n integer(int64), intent(in) :: m(:)\n integer(int64) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int64_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int64_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int64_qsort\n\nend module module_sort\n\nprogram main\n use module_sort\n use iso_fortran_env\n implicit none\n integer(int64) :: n\n integer(int64), allocatable :: ai(:)\n integer(int64) :: i, ie\n integer(int64) :: ans\n\n read *, n\n allocate( ai(n) )\n read *, ai( 1:n )\n ans = 0\n\n ai = quicksort( ai ) \n\n if ( mod((n-1), 2) == 0 ) then\n ie = (n-1) / 2\n ans = 2 * sum( ai(1:ie) ) - ai(1) + ai(ie + 1)\n else\n ie = n / 2\n ans = 2 * sum( ai(1:ie) ) - ai(1)\n endif\n\n print *, ans\n\nend program main", "language": "Fortran", "metadata": {"date": 1596256722, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02615.html", "problem_id": "p02615", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02615/input.txt", "sample_output_relpath": "derived/input_output/data/p02615/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02615/Fortran/s852730553.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s852730553", "user_id": "u128084721"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "module module_sort\n use iso_fortran_env\n implicit none\n\n interface quicksort\n module procedure :: int32_qsort\n module procedure :: int64_qsort\n end interface quicksort\ncontains\n\n recursive function int32_qsort(m) result(res)\n integer(int32), intent(in) :: m(:)\n integer(int32) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int32_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int32_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int32_qsort\n\n recursive function int64_qsort(m) result(res)\n integer(int64), intent(in) :: m(:)\n integer(int64) :: res(size(m)) \n\n if (size(m) <= 1) then; res = m\n else; res = [int64_qsort( pack(m(2:), m(2:) >= m(1)) ), m(1), int64_qsort( pack(m(2:), m(2:) < m(1)) )]\n end if\n\n end function int64_qsort\n\nend module module_sort\n\nprogram main\n use module_sort\n use iso_fortran_env\n implicit none\n integer(int64) :: n\n integer(int64), allocatable :: ai(:)\n integer(int64) :: i, ie\n integer(int64) :: ans\n\n read *, n\n allocate( ai(n) )\n read *, ai( 1:n )\n ans = 0\n\n ai = quicksort( ai ) \n\n if ( mod((n-1), 2) == 0 ) then\n ie = (n-1) / 2\n ans = 2 * sum( ai(1:ie) ) - ai(1) + ai(ie + 1)\n else\n ie = n / 2\n ans = 2 * sum( ai(1:ie) ) - ai(1)\n endif\n\n print *, ans\n\nend program main", "problem_context": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "sample_input": "4\n2 2 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02615", "source_text": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1416, "cpu_time_ms": 2294, "memory_kb": 3289028}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s215967558", "group_id": "codeNet:p02615", "input_text": "program main\n implicit none\n integer(8) i, ans, frag, r, N\n integer(8),allocatable :: A(:)\n \n read(*, *) N\n allocate(A(N))\n read(*, *) (A(i), i = 1,N)\n call qsort(A)\n ans = 0\n r = N\n frag = 1\n do i = 1,N-1\n ans = ans + A(r)\n if (frag == 1) then\n frag = 0\n r = r-1\n end if\n end do\n\n write(*, *) ans\n \ncontains\n\nrecursive subroutine qsort(a)\nimplicit none\n!integer(8),intent(in) :: n\ninteger(8),intent(inout) :: a(:)\ninteger(8)::i,j,toobig,toosmall,pv,n\nn = size(a)\ni = 1\nj = n\npv = a((i+j)/2)\ndo\n do\n if (a(i) < pv) then\n i = i+1\n else\n exit\n end if\n end do\n do\n if(a(j) > pv) then\n j = j-1\n else\n exit\n end if\n end do\n if (i>=j) then\n exit\n else\n toobig = a(j)\n toosmall = a(i)\n a(i) = toobig\n a(j) = toosmall\n i = i+1\n j = j-1\n end if\n end do\n if (i > 2) then\n call qsort(a(1:i-1))\n end if\n if (j < n-1) then\n call qsort(a(j+1:n))\n end if\nend subroutine qsort\nend program main\n\n", "language": "Fortran", "metadata": {"date": 1593999487, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02615.html", "problem_id": "p02615", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02615/input.txt", "sample_output_relpath": "derived/input_output/data/p02615/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02615/Fortran/s215967558.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s215967558", "user_id": "u050276949"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program main\n implicit none\n integer(8) i, ans, frag, r, N\n integer(8),allocatable :: A(:)\n \n read(*, *) N\n allocate(A(N))\n read(*, *) (A(i), i = 1,N)\n call qsort(A)\n ans = 0\n r = N\n frag = 1\n do i = 1,N-1\n ans = ans + A(r)\n if (frag == 1) then\n frag = 0\n r = r-1\n end if\n end do\n\n write(*, *) ans\n \ncontains\n\nrecursive subroutine qsort(a)\nimplicit none\n!integer(8),intent(in) :: n\ninteger(8),intent(inout) :: a(:)\ninteger(8)::i,j,toobig,toosmall,pv,n\nn = size(a)\ni = 1\nj = n\npv = a((i+j)/2)\ndo\n do\n if (a(i) < pv) then\n i = i+1\n else\n exit\n end if\n end do\n do\n if(a(j) > pv) then\n j = j-1\n else\n exit\n end if\n end do\n if (i>=j) then\n exit\n else\n toobig = a(j)\n toosmall = a(i)\n a(i) = toobig\n a(j) = toosmall\n i = i+1\n j = j-1\n end if\n end do\n if (i > 2) then\n call qsort(a(1:i-1))\n end if\n if (j < n-1) then\n call qsort(a(j+1:n))\n end if\nend subroutine qsort\nend program main\n\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "sample_input": "4\n2 2 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02615", "source_text": "Score: 400 points\n\nProblem Statement\n\nQuickly after finishing the tutorial of the online game ATChat, you have decided to visit a particular place with N-1 players who happen to be there. These N players, including you, are numbered 1 through N, and the friendliness of Player i is A_i.\n\nThe N players will arrive at the place one by one in some order. To make sure nobody gets lost, you have set the following rule: players who have already arrived there should form a circle, and a player who has just arrived there should cut into the circle somewhere.\n\nWhen each player, except the first one to arrive, arrives at the place, the player gets comfort equal to the smaller of the friendliness of the clockwise adjacent player and that of the counter-clockwise adjacent player. The first player to arrive there gets the comfort of 0.\n\nWhat is the maximum total comfort the N players can get by optimally choosing the order of arrivals and the positions in the circle to cut into?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the maximum total comfort the N players can get.\n\nSample Input 1\n\n4\n2 2 1 3\n\nSample Output 1\n\n7\n\nBy arriving at the place in the order Player 4, 2, 1, 3, and cutting into the circle as shown in the figure, they can get the total comfort of 7.\n\nThey cannot get the total comfort greater than 7, so the answer is 7.\n\nSample Input 2\n\n7\n1 1 1 1 1 1 1\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1007, "cpu_time_ms": 77, "memory_kb": 4668}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s541834976", "group_id": "codeNet:p02616", "input_text": "program multiplication_4\n implicit none\n integer(8), parameter :: m = 1000000007\n integer :: n, k, i, j, cnt = 0\n integer(8) :: a(200000, 2) = 0, nega = -1, posi = -1, x = 1, y = -1, z = -1\n read(*,*) n, k\n read(*,*) a(1:n, 1)\n do i = 1, n\n if (a(i, 1) >= 0) then\n a(i, 2) = 0\n else\n a(i, 1) = -a(i, 1)\n a(i, 2) = 1\n end if\n end do\n call merge_sort(a(1:n, :))\n do i = 1, k\n x = mod(x * a(i, 1), m)\n if (a(i, 2) == 1) then\n cnt = cnt + 1\n nega = a(i, 1)\n else\n posi = a(i, 1)\n end if\n end do\n if (x == 0 .or. mod(cnt, 2) == 0) then\n write(*,'(i0)') x\n stop\n end if\n if (posi /= -1) then\n do i = k + 1, n\n if (a(i, 2) == 1) then\n y = mod(x * a(i, 1), m)\n y = mod(y * inv(posi), m)\n exit\n end if\n end do\n end if\n if (nega /= -1) then\n do i = k + 1, n\n if (a(i, 2) == 0) then\n z = mod(x * a(i, 1), m)\n z = mod(z * inv(nega), m)\n exit\n end if\n end do\n end if\n if (y /= -1 .or. z /= -1) then\n write(*,'(i0)') max(y, z)\n stop\n end if\n j = n\n do while (j >= 1 .and. a(j, 1) == 0)\n j = j - 1\n end do\n if (n - j >= k .or. j - k + 1 < 1) then\n write(*,'(i0)') 0\n stop\n end if\n x = 1\n do i = j, j - k + 1, -1\n x = mod(x * a(i, 1), m)\n end do\n write(*,'(i0)') modulo(-x, m)\ncontains\n subroutine merge_sort(a)\n integer(8), intent(inout) :: a(:, :)\n integer :: n, m, l, i, u\n n = size(a, 1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m / 2\n u = min(2 * i * l, n)\n call merger(a(2 * (i - 1) * l + 1:(2 * i - 1) * l, :), a((2 * i - 1) * l + 1:u, :))\n end do\n l = 2 * l\n m = (m + 1) / 2\n end do\n end\n subroutine merger(a1, a2)\n integer(8), intent(inout) :: a1(:, :), a2(:, :)\n integer(8) :: a(size(a1, 1) + size(a2, 1), size(a1, 2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1, 1)\n n2 = size(a2, 1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (a1(i1, 1) > a2(i2, 1) .or. &\n (a1(i1, 1) == a2(i2, 1) .and. a1(i1, 2) <= a2(i2, 2))) then\n a(i1+i2-1, :) = a1(i1, :)\n i1 = i1+1\n else\n a(i1+i2-1, :) = a2(i2, :)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n a(i1 + i2 - 1:n1 + n2, :) = a1(i1:n1, :)\n else\n a(i1 + i2 - 1:n1 + n2, :) = a2(i2:n2, :)\n end if\n a1 = a(1:n1, :)\n a2 = a(n1 + 1:n1 + n2, :)\n end\n pure elemental integer(8) function inv(v) result(res)\n integer(8), intent(in) :: v\n integer(8) :: a, b, c, x, y, z\n a = v\n b = m\n c = 0\n res = 1\n do while (b /= 0)\n x = b\n y = mod(a, b)\n z = res - a / b * c\n res = c\n a = x\n b = y\n c = z\n end do\n res = modulo(res, m)\n end\nend program multiplication_4", "language": "Fortran", "metadata": {"date": 1593978981, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02616.html", "problem_id": "p02616", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02616/input.txt", "sample_output_relpath": "derived/input_output/data/p02616/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02616/Fortran/s541834976.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s541834976", "user_id": "u506403362"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program multiplication_4\n implicit none\n integer(8), parameter :: m = 1000000007\n integer :: n, k, i, j, cnt = 0\n integer(8) :: a(200000, 2) = 0, nega = -1, posi = -1, x = 1, y = -1, z = -1\n read(*,*) n, k\n read(*,*) a(1:n, 1)\n do i = 1, n\n if (a(i, 1) >= 0) then\n a(i, 2) = 0\n else\n a(i, 1) = -a(i, 1)\n a(i, 2) = 1\n end if\n end do\n call merge_sort(a(1:n, :))\n do i = 1, k\n x = mod(x * a(i, 1), m)\n if (a(i, 2) == 1) then\n cnt = cnt + 1\n nega = a(i, 1)\n else\n posi = a(i, 1)\n end if\n end do\n if (x == 0 .or. mod(cnt, 2) == 0) then\n write(*,'(i0)') x\n stop\n end if\n if (posi /= -1) then\n do i = k + 1, n\n if (a(i, 2) == 1) then\n y = mod(x * a(i, 1), m)\n y = mod(y * inv(posi), m)\n exit\n end if\n end do\n end if\n if (nega /= -1) then\n do i = k + 1, n\n if (a(i, 2) == 0) then\n z = mod(x * a(i, 1), m)\n z = mod(z * inv(nega), m)\n exit\n end if\n end do\n end if\n if (y /= -1 .or. z /= -1) then\n write(*,'(i0)') max(y, z)\n stop\n end if\n j = n\n do while (j >= 1 .and. a(j, 1) == 0)\n j = j - 1\n end do\n if (n - j >= k .or. j - k + 1 < 1) then\n write(*,'(i0)') 0\n stop\n end if\n x = 1\n do i = j, j - k + 1, -1\n x = mod(x * a(i, 1), m)\n end do\n write(*,'(i0)') modulo(-x, m)\ncontains\n subroutine merge_sort(a)\n integer(8), intent(inout) :: a(:, :)\n integer :: n, m, l, i, u\n n = size(a, 1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m / 2\n u = min(2 * i * l, n)\n call merger(a(2 * (i - 1) * l + 1:(2 * i - 1) * l, :), a((2 * i - 1) * l + 1:u, :))\n end do\n l = 2 * l\n m = (m + 1) / 2\n end do\n end\n subroutine merger(a1, a2)\n integer(8), intent(inout) :: a1(:, :), a2(:, :)\n integer(8) :: a(size(a1, 1) + size(a2, 1), size(a1, 2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1, 1)\n n2 = size(a2, 1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (a1(i1, 1) > a2(i2, 1) .or. &\n (a1(i1, 1) == a2(i2, 1) .and. a1(i1, 2) <= a2(i2, 2))) then\n a(i1+i2-1, :) = a1(i1, :)\n i1 = i1+1\n else\n a(i1+i2-1, :) = a2(i2, :)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n a(i1 + i2 - 1:n1 + n2, :) = a1(i1:n1, :)\n else\n a(i1 + i2 - 1:n1 + n2, :) = a2(i2:n2, :)\n end if\n a1 = a(1:n1, :)\n a2 = a(n1 + 1:n1 + n2, :)\n end\n pure elemental integer(8) function inv(v) result(res)\n integer(8), intent(in) :: v\n integer(8) :: a, b, c, x, y, z\n a = v\n b = m\n c = 0\n res = 1\n do while (b /= 0)\n x = b\n y = mod(a, b)\n z = res - a / b * c\n res = c\n a = x\n b = y\n c = z\n end do\n res = modulo(res, m)\n end\nend program multiplication_4", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "sample_input": "4 2\n1 2 -3 -4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02616", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N integers A_1,\\ldots,A_N.\n\nWe will choose exactly K of these elements. Find the maximum possible product of the chosen elements.\n\nThen, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2\\times 10^5\n\n|A_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 \\ldots A_N\n\nOutput\n\nPrint the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).\n\nSample Input 1\n\n4 2\n1 2 -3 -4\n\nSample Output 1\n\n12\n\nThe possible products of the two chosen elements are 2, -3, -4, -6, -8, and 12, so the maximum product is 12.\n\nSample Input 2\n\n4 3\n-1 -2 -3 -4\n\nSample Output 2\n\n1000000001\n\nThe possible products of the three chosen elements are -24, -12, -8, and -6, so the maximum product is -6.\n\nWe print this value modulo (10^9+7), that is, 1000000001.\n\nSample Input 3\n\n2 1\n-1 1000000000\n\nSample Output 3\n\n1000000000\n\nThe possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.\n\nSample Input 4\n\n10 10\n1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1\n\nSample Output 4\n\n999983200\n\nBe sure to print the product modulo (10^9+7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2792, "cpu_time_ms": 97, "memory_kb": 10504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s516050729", "group_id": "codeNet:p02620", "input_text": "program r20628c\n \nimplicit none\ninteger :: c(1:26)\ninteger, allocatable :: interval(:, :)\ninteger, allocatable :: s(:, :)\ninteger, allocatable :: t(:), v(:)\ninteger :: i, j, d, m, h\ninteger, allocatable :: smalld(:)\ninteger, allocatable :: q(:)\n\n\nread *, d\n\nallocate(s(1:26, 1:d))\nallocate(interval(1:26, 0:d))\nallocate(t(1:d))\nallocate(v(0:d))\n\ninterval(:, :) = 0 !interval(i,d) = d - last(d,i)\nv(0) = 0\n\nread *, c(1:26)\n\ndo i = 1, d\n read *, s(:, i)\nend do\n\ndo i = 1, d\n read *, t(i)\n \n v(i) = v(i-1) + s(t(i), i)\n \n do j = 1, 26\n if(t(i) == j) then\n interval(j, i) = 0\n else\n interval(j, i) = interval(j, i-1) + 1\n end if\n v(i) = v(i) - (c(j) * interval(j, i))\n end do\n \n! print *, v(i)\nend do\n\nread *, m\n\nallocate(smalld(1:m))\nallocate(q(1:m))\n\ndo h = 1, m\n read *, smalld(h), q(h)\n t(smalld(h)) = q(h)\n \n v(smalld(h)) = v(smalld(h)-1) + s(q(h), smalld(h))\n \n do j = 1, 26\n \n if(q(h) == j) then\n interval(j, smalld(h)) = 0\n else\n interval(j, smalld(h)) = interval(j, smalld(h)-1) + 1\n end if\n \n v(smalld(h)) = v(smalld(h)) - (c(j) * interval(j, smalld(h)))\n end do \n \n do i = smalld(h)+1, d\n \n v(i) = v(i-1) + s(t(i), i)\n \n do j = 1, 26\n if(t(i) == j) then\n interval(j, i) = 0\n else\n interval(j, i) = interval(j, i-1) + 1\n end if\n v(i) = v(i) - (c(j) * interval(j, i))\n end do \n end do\n \n print *, v(d)\n \nend do\n\n\nend program r20628c", "language": "Fortran", "metadata": {"date": 1593399065, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02620.html", "problem_id": "p02620", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02620/input.txt", "sample_output_relpath": "derived/input_output/data/p02620/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02620/Fortran/s516050729.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s516050729", "user_id": "u644436095"}, "prompt_components": {"gold_output": "72882\n56634\n38425\n27930\n42884\n", "input_to_evaluate": "program r20628c\n \nimplicit none\ninteger :: c(1:26)\ninteger, allocatable :: interval(:, :)\ninteger, allocatable :: s(:, :)\ninteger, allocatable :: t(:), v(:)\ninteger :: i, j, d, m, h\ninteger, allocatable :: smalld(:)\ninteger, allocatable :: q(:)\n\n\nread *, d\n\nallocate(s(1:26, 1:d))\nallocate(interval(1:26, 0:d))\nallocate(t(1:d))\nallocate(v(0:d))\n\ninterval(:, :) = 0 !interval(i,d) = d - last(d,i)\nv(0) = 0\n\nread *, c(1:26)\n\ndo i = 1, d\n read *, s(:, i)\nend do\n\ndo i = 1, d\n read *, t(i)\n \n v(i) = v(i-1) + s(t(i), i)\n \n do j = 1, 26\n if(t(i) == j) then\n interval(j, i) = 0\n else\n interval(j, i) = interval(j, i-1) + 1\n end if\n v(i) = v(i) - (c(j) * interval(j, i))\n end do\n \n! print *, v(i)\nend do\n\nread *, m\n\nallocate(smalld(1:m))\nallocate(q(1:m))\n\ndo h = 1, m\n read *, smalld(h), q(h)\n t(smalld(h)) = q(h)\n \n v(smalld(h)) = v(smalld(h)-1) + s(q(h), smalld(h))\n \n do j = 1, 26\n \n if(q(h) == j) then\n interval(j, smalld(h)) = 0\n else\n interval(j, smalld(h)) = interval(j, smalld(h)-1) + 1\n end if\n \n v(smalld(h)) = v(smalld(h)) - (c(j) * interval(j, smalld(h)))\n end do \n \n do i = smalld(h)+1, d\n \n v(i) = v(i-1) + s(t(i), i)\n \n do j = 1, 26\n if(t(i) == j) then\n interval(j, i) = 0\n else\n interval(j, i) = interval(j, i-1) + 1\n end if\n v(i) = v(i) - (c(j) * interval(j, i))\n end do \n end do\n \n print *, v(d)\n \nend do\n\n\nend program r20628c", "problem_context": "(Please read problem A first. The maximum score you can get by solving this problem C is 1, which will have almost no effect on your ranking.)\n\nBeginner's Guide\n\n\"Local search\" is a powerful method for finding a high-quality solution.\nIn this method, instead of constructing a solution from scratch, we try to find a better solution by slightly modifying the already found solution.\nIf the solution gets better, update it, and if it gets worse, restore it.\nBy repeating this process, the quality of the solution is gradually improved over time.\nThe pseudo-code is as follows.\n\nsolution = compute an initial solution (by random generation, or by applying other methods such as greedy)\nwhile the remaining time > 0:\nslightly modify the solution (randomly)\nif the solution gets worse:\nrestore the solution\n\nFor example, in this problem, we can use the following modification: pick the date d and contest type q at random and change the type of contest to be held on day d to q.\nThe pseudo-code is as follows.\n\nt[1..D] = compute an initial solution (by random generation, or by applying other methods such as greedy)\nwhile the remaining time > 0:\npick d and q at random\nold = t[d] # Remember the original value so that we can restore it later\nt[d] = q\nif the solution gets worse:\nt[d] = old\n\nThe most important thing when using the local search method is the design of how to modify solutions.\n\nIf the amount of modification is too small, we will soon fall into a dead-end (local optimum) and, conversely, if the amount of modification is too large, the probability of finding an improving move becomes extremely small.\n\nIn order to increase the number of iterations, it is desirable to be able to quickly calculate the score after applying a modification.\n\nIn this problem C, we focus on the second point.\nThe score after the modification can, of course, be obtained by calculating the score from scratch.\nHowever, by focusing on only the parts that have been modified, it may be possible to quickly compute the difference between the scores before and after the modification.\nFrom another viewpoint, the impossibility of such a fast incremental calculation implies that a small modification to the solution affects a majority of the score calculation.\nIn such a case, we may need to redesign how to modify solutions, or there is a high possibility that the problem is not suitable for local search.\nLet's implement fast incremental score computation.\nIt's time to demonstrate the skills of algorithms and data structures you have developed in ABC and ARC!\n\nIn this kind of contest, where the objective is to find a better solution instead of the optimal one, a bug in a program does not result in a wrong answer, which may delay the discovery of the bug.\nFor early detection of bugs, it is a good idea to unit test functions you implemented complicated routines.\nFor example, if you implement fast incremental score calculation, it is a good idea to test that the scores computed by the fast implementation match the scores computed from scratch, as we will do in this problem C.\n\nProblem Statement\n\nYou will be given a contest schedule for D days and M queries of schedule modification.\nIn the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule.\nNote that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.\n\nInput\n\nInput is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.\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}\nt_1\nt_2\n\\vdots\nt_D\nM\nd_1 q_1\nd_2 q_2\n\\vdots\nd_M q_M\n\nThe constraints and generation methods for the input part are the same as those for Problem A.\n\nFor each d=1,\\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\\ldots,26}.\n\nThe number of queries M is an integer satisfying 1\\leq M\\leq 10^5.\n\nFor each i=1,\\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\\ldots,D}.\n\nFor each i=1,\\ldots,26, q_i is an integer satisfying 1\\leq q_i\\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.\n\nOutput\n\nLet v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query.\nPrint M integers v_i to Standard Output in the following format:\n\nv_1\nv_2\n\\vdots\nv_M\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\n1\n17\n13\n14\n13\n5\n1 7\n4 11\n3 4\n5 24\n4 19\n\nSample Output 1\n\n72882\n56634\n38425\n27930\n42884\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.\n\nNext Step\n\nLet's go back to Problem A and implement the local search algorithm by utilizing the incremental score calculator you just implemented!\nFor this problem, the current modification \"pick the date d and contest type q at random and change the type of contest to be held on day d to q\" is actually not so good. By considering why it is not good, let's improve the modification operation.\nOne of the most powerful and widely used variant of the local search method is \"Simulated Annealing (SA)\", which makes it easier to reach a better solution by stochastically accepting worsening moves.\nFor more information about SA and other local search techniques, please refer to the editorial that will be published after the contest.", "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\n1\n17\n13\n14\n13\n5\n1 7\n4 11\n3 4\n5 24\n4 19\n"}, "reference_outputs": ["72882\n56634\n38425\n27930\n42884\n"], "source_document_id": "p02620", "source_text": "(Please read problem A first. The maximum score you can get by solving this problem C is 1, which will have almost no effect on your ranking.)\n\nBeginner's Guide\n\n\"Local search\" is a powerful method for finding a high-quality solution.\nIn this method, instead of constructing a solution from scratch, we try to find a better solution by slightly modifying the already found solution.\nIf the solution gets better, update it, and if it gets worse, restore it.\nBy repeating this process, the quality of the solution is gradually improved over time.\nThe pseudo-code is as follows.\n\nsolution = compute an initial solution (by random generation, or by applying other methods such as greedy)\nwhile the remaining time > 0:\nslightly modify the solution (randomly)\nif the solution gets worse:\nrestore the solution\n\nFor example, in this problem, we can use the following modification: pick the date d and contest type q at random and change the type of contest to be held on day d to q.\nThe pseudo-code is as follows.\n\nt[1..D] = compute an initial solution (by random generation, or by applying other methods such as greedy)\nwhile the remaining time > 0:\npick d and q at random\nold = t[d] # Remember the original value so that we can restore it later\nt[d] = q\nif the solution gets worse:\nt[d] = old\n\nThe most important thing when using the local search method is the design of how to modify solutions.\n\nIf the amount of modification is too small, we will soon fall into a dead-end (local optimum) and, conversely, if the amount of modification is too large, the probability of finding an improving move becomes extremely small.\n\nIn order to increase the number of iterations, it is desirable to be able to quickly calculate the score after applying a modification.\n\nIn this problem C, we focus on the second point.\nThe score after the modification can, of course, be obtained by calculating the score from scratch.\nHowever, by focusing on only the parts that have been modified, it may be possible to quickly compute the difference between the scores before and after the modification.\nFrom another viewpoint, the impossibility of such a fast incremental calculation implies that a small modification to the solution affects a majority of the score calculation.\nIn such a case, we may need to redesign how to modify solutions, or there is a high possibility that the problem is not suitable for local search.\nLet's implement fast incremental score computation.\nIt's time to demonstrate the skills of algorithms and data structures you have developed in ABC and ARC!\n\nIn this kind of contest, where the objective is to find a better solution instead of the optimal one, a bug in a program does not result in a wrong answer, which may delay the discovery of the bug.\nFor early detection of bugs, it is a good idea to unit test functions you implemented complicated routines.\nFor example, if you implement fast incremental score calculation, it is a good idea to test that the scores computed by the fast implementation match the scores computed from scratch, as we will do in this problem C.\n\nProblem Statement\n\nYou will be given a contest schedule for D days and M queries of schedule modification.\nIn the i-th query, given integers d_i and q_i, change the type of contest to be held on day d_i to q_i, and then output the final satisfaction at the end of day D on the updated schedule.\nNote that we do not revert each query. That is, the i-th query is applied to the new schedule obtained by the (i-1)-th query.\n\nInput\n\nInput is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.\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}\nt_1\nt_2\n\\vdots\nt_D\nM\nd_1 q_1\nd_2 q_2\n\\vdots\nd_M q_M\n\nThe constraints and generation methods for the input part are the same as those for Problem A.\n\nFor each d=1,\\ldots,D, t_d is an integer generated independently and uniformly at random from {1,2,\\ldots,26}.\n\nThe number of queries M is an integer satisfying 1\\leq M\\leq 10^5.\n\nFor each i=1,\\ldots,M, d_i is an integer generated independently and uniformly at random from {1,2,\\ldots,D}.\n\nFor each i=1,\\ldots,26, q_i is an integer satisfying 1\\leq q_i\\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i.\n\nOutput\n\nLet v_i be the final satisfaction at the end of day D on the schedule after applying the i-th query.\nPrint M integers v_i to Standard Output in the following format:\n\nv_1\nv_2\n\\vdots\nv_M\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\n1\n17\n13\n14\n13\n5\n1 7\n4 11\n3 4\n5 24\n4 19\n\nSample Output 1\n\n72882\n56634\n38425\n27930\n42884\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.\n\nNext Step\n\nLet's go back to Problem A and implement the local search algorithm by utilizing the incremental score calculator you just implemented!\nFor this problem, the current modification \"pick the date d and contest type q at random and change the type of contest to be held on day d to q\" is actually not so good. By considering why it is not good, let's improve the modification operation.\nOne of the most powerful and widely used variant of the local search method is \"Simulated Annealing (SA)\", which makes it easier to reach a better solution by stochastically accepting worsening moves.\nFor more information about SA and other local search techniques, please refer to the editorial that will be published after the contest.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1386, "cpu_time_ms": 743, "memory_kb": 3388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s927780259", "group_id": "codeNet:p02621", "input_text": "program main\n implicit none\n integer i, a\n read(*, *) a\n !read(*, *) (L(i), i = 1,N)\n i = a + a**2 + a**3\n write(*, *) i\nend program main\n", "language": "Fortran", "metadata": {"date": 1593306119, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Fortran/s927780259.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s927780259", "user_id": "u050276949"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program main\n implicit none\n integer i, a\n read(*, *) a\n !read(*, *) (L(i), i = 1,N)\n i = a + a**2 + a**3\n write(*, *) i\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 11, "memory_kb": 2852}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s780992432", "group_id": "codeNet:p02621", "input_text": "program answer\n implicit none\n \n integer :: a\n \n read(*,*) a\n \n write(*,*) a+a**2+a**3\n \n stop\nend program answer\n \n", "language": "Fortran", "metadata": {"date": 1593306080, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Fortran/s780992432.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780992432", "user_id": "u873780029"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program answer\n implicit none\n \n integer :: a\n \n read(*,*) a\n \n write(*,*) a+a**2+a**3\n \n stop\nend program answer\n \n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s388503848", "group_id": "codeNet:p02621", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n\n \n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) n\n \n write(*,*) n+n**2+n**3\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1593306046, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/Fortran/s388503848.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s388503848", "user_id": "u713568912"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n\n \n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) n\n \n write(*,*) n+n**2+n**3\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2796}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s730660926", "group_id": "codeNet:p02622", "input_text": "program million_change\n character :: S(200001)\n character :: T(200001)\n integer i\n read *, S(200001)\n read *, T(200001)\n do i = 1, size(S)\n if(S(i) /= T(i))then\n S(i) = T(i)\n end if\n end do\nend program", "language": "Fortran", "metadata": {"date": 1598283774, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02622/input.txt", "sample_output_relpath": "derived/input_output/data/p02622/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02622/Fortran/s730660926.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s730660926", "user_id": "u622206408"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program million_change\n character :: S(200001)\n character :: T(200001)\n integer i\n read *, S(200001)\n read *, T(200001)\n do i = 1, size(S)\n if(S(i) /= T(i))then\n S(i) = T(i)\n end if\n end do\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 14, "memory_kb": 3008}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s352064220", "group_id": "codeNet:p02622", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n\n character(len=200000)::s,t\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*)s\n read(*,*)t\n n=len_trim(s)\n m=0\n do i=1,n\n if(s(i:i) .ne. t(i:i))then\n m=m+1\n end if\n end do\n write(*,*) m\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1593306365, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02622/input.txt", "sample_output_relpath": "derived/input_output/data/p02622/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02622/Fortran/s352064220.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s352064220", "user_id": "u713568912"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n\n character(len=200000)::s,t\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*)s\n read(*,*)t\n n=len_trim(s)\n m=0\n do i=1,n\n if(s(i:i) .ne. t(i:i))then\n m=m+1\n end if\n end do\n write(*,*) m\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 19, "memory_kb": 3448}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s929493929", "group_id": "codeNet:p02626", "input_text": "program unfair_nim\n implicit none\n integer :: n, i\n integer(8) :: a(300) = 0, s, x = 0, d, y = 0\n read(*,*) n\n read(*,*) a(1:n)\n s = a(1) + a(2)\n do i = 3, n\n x = xor(x, a(i))\n end do\n if (s - x < 0 .or. mod(s - x, 2) /= 0) then\n write(*,'(i0)') -1\n stop\n end if\n d = (s - x) / 2\n if (and(d, x) /= 0 .or. d > a(1)) then\n write(*,'(i0)') -1\n stop\n end if\n do i = 62, 0, -1\n if (.not.btest(x, i)) cycle\n y = ibset(y, i)\n if (xor(d, y) > a(1)) y = ibclr(y, i)\n end do\n write(*,'(i0)') a(1) - xor(d, y)\nend program unfair_nim", "language": "Fortran", "metadata": {"date": 1593316918, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02626.html", "problem_id": "p02626", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02626/input.txt", "sample_output_relpath": "derived/input_output/data/p02626/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02626/Fortran/s929493929.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s929493929", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program unfair_nim\n implicit none\n integer :: n, i\n integer(8) :: a(300) = 0, s, x = 0, d, y = 0\n read(*,*) n\n read(*,*) a(1:n)\n s = a(1) + a(2)\n do i = 3, n\n x = xor(x, a(i))\n end do\n if (s - x < 0 .or. mod(s - x, 2) /= 0) then\n write(*,'(i0)') -1\n stop\n end if\n d = (s - x) / 2\n if (and(d, x) /= 0 .or. d > a(1)) then\n write(*,'(i0)') -1\n stop\n end if\n do i = 62, 0, -1\n if (.not.btest(x, i)) cycle\n y = ibset(y, i)\n if (xor(d, y) > a(1)) y = ibclr(y, i)\n end do\n write(*,'(i0)') a(1) - xor(d, y)\nend program unfair_nim", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N piles of stones. The i-th pile has A_i stones.\n\nAoki and Takahashi are about to use them to play the following game:\n\nStarting with Aoki, the two players alternately do the following operation:\n\nOperation: Choose one pile of stones, and remove one or more stones from it.\n\nWhen a player is unable to do the operation, he loses, and the other player wins.\n\nWhen the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile.\n\nIn such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins.\n\nIf this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 300\n\n1 \\leq A_i \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum number of stones to move to guarantee Takahashi's win; otherwise, print -1 instead.\n\nSample Input 1\n\n2\n5 3\n\nSample Output 1\n\n1\n\nWithout moving stones, if Aoki first removes 2 stones from the 1-st pile, Takahashi cannot win in any way.\n\nIf Takahashi moves 1 stone from the 1-st pile to the 2-nd before the game begins so that both piles have 4 stones, Takahashi can always win by properly choosing his actions.\n\nSample Input 2\n\n2\n3 5\n\nSample Output 2\n\n-1\n\nIt is not allowed to move stones from the 2-nd pile to the 1-st.\n\nSample Input 3\n\n3\n1 1 2\n\nSample Output 3\n\n-1\n\nIt is not allowed to move all stones from the 1-st pile.\n\nSample Input 4\n\n8\n10 9 8 7 6 5 4 3\n\nSample Output 4\n\n3\n\nSample Input 5\n\n3\n4294967297 8589934593 12884901890\n\nSample Output 5\n\n1\n\nWatch out for overflows.", "sample_input": "2\n5 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02626", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N piles of stones. The i-th pile has A_i stones.\n\nAoki and Takahashi are about to use them to play the following game:\n\nStarting with Aoki, the two players alternately do the following operation:\n\nOperation: Choose one pile of stones, and remove one or more stones from it.\n\nWhen a player is unable to do the operation, he loses, and the other player wins.\n\nWhen the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile.\n\nIn such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins.\n\nIf this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 300\n\n1 \\leq A_i \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum number of stones to move to guarantee Takahashi's win; otherwise, print -1 instead.\n\nSample Input 1\n\n2\n5 3\n\nSample Output 1\n\n1\n\nWithout moving stones, if Aoki first removes 2 stones from the 1-st pile, Takahashi cannot win in any way.\n\nIf Takahashi moves 1 stone from the 1-st pile to the 2-nd before the game begins so that both piles have 4 stones, Takahashi can always win by properly choosing his actions.\n\nSample Input 2\n\n2\n3 5\n\nSample Output 2\n\n-1\n\nIt is not allowed to move stones from the 2-nd pile to the 1-st.\n\nSample Input 3\n\n3\n1 1 2\n\nSample Output 3\n\n-1\n\nIt is not allowed to move all stones from the 1-st pile.\n\nSample Input 4\n\n8\n10 9 8 7 6 5 4 3\n\nSample Output 4\n\n3\n\nSample Input 5\n\n3\n4294967297 8589934593 12884901890\n\nSample Output 5\n\n1\n\nWatch out for overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 9, "memory_kb": 2896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s695683827", "group_id": "codeNet:p02627", "input_text": "program abc171\n use,intrinsic :: iso_fortran_env\n implicit none\n character(1):: r\n\n read*, r\n if (ichar(r) < ichar('a')) then\n print'(a)', 'A'\n \n else\n print'(a)', 'a'\n end if\nend program abc171", "language": "Fortran", "metadata": {"date": 1592787763, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02627/input.txt", "sample_output_relpath": "derived/input_output/data/p02627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02627/Fortran/s695683827.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s695683827", "user_id": "u234636620"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "program abc171\n use,intrinsic :: iso_fortran_env\n implicit none\n character(1):: r\n\n read*, r\n if (ichar(r) < ichar('a')) then\n print'(a)', 'A'\n \n else\n print'(a)', 'a'\n end if\nend program abc171", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "sample_input": "B\n"}, "reference_outputs": ["A\n"], "source_document_id": "p02627", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn uppercase or lowercase English letter \\alpha will be given as input.\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nConstraints\n\n\\alpha is an uppercase (A - Z) or lowercase (a - z) English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nα\n\nOutput\n\nIf \\alpha is uppercase, print A; if it is lowercase, print a.\n\nSample Input 1\n\nB\n\nSample Output 1\n\nA\n\nB is uppercase, so we should print A.\n\nSample Input 2\n\na\n\nSample Output 2\n\na\n\na is lowercase, so we should print a.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 10, "memory_kb": 2924}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s747499099", "group_id": "codeNet:p02628", "input_text": "program sample\nimplicit none\n\ninteger(8) :: N, K, i, sum, m, j\ninteger(8), allocatable:: p(:)\n\nread(*,*) N, K\nallocate(p(N))\nread(*,*) p\n\ndo j = 1, N-1\ndo i = 1, N-1\nif(p(i) > p(i+1))then\nm=p(i)\np(i)=p(i+1)\np(i+1)=m\nend if\nend do\nend do\n\n\nsum = 0\ndo i = 1, K\nsum = sum + p(i)\nend do\n\nwrite(*,*) sum\n\n\ndeallocate(p)\nstop\n\nend program sample", "language": "Fortran", "metadata": {"date": 1593167331, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/Fortran/s747499099.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747499099", "user_id": "u318703176"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program sample\nimplicit none\n\ninteger(8) :: N, K, i, sum, m, j\ninteger(8), allocatable:: p(:)\n\nread(*,*) N, K\nallocate(p(N))\nread(*,*) p\n\ndo j = 1, N-1\ndo i = 1, N-1\nif(p(i) > p(i+1))then\nm=p(i)\np(i)=p(i+1)\np(i+1)=m\nend if\nend do\nend do\n\n\nsum = 0\ndo i = 1, K\nsum = sum + p(i)\nend do\n\nwrite(*,*) sum\n\n\ndeallocate(p)\nstop\n\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 339, "cpu_time_ms": 7, "memory_kb": 2884}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s227826221", "group_id": "codeNet:p02628", "input_text": "program sample\nimplicit none\n\ninteger(8) :: N, K, i, sum, m\ninteger(8), allocatable:: p(:)\n\nread(*,*) N, K\nallocate(p(N))\nread(*,*) p\n\nif(N > 1)then\ndo i = 1, N-1\nif(p(i) > p(i+1))then\nm=p(i)\np(i)=p(i+1)\np(i+1)=m\nendif\nend do\n\nsum = 0\ndo i = 1, K\nsum = sum + p(i)\nend do\n\nwrite(*,*) sum\nend if\n\nif(N == 1)then\nsum = p(1)\nwrite(*,*) sum\nend if\n\ndeallocate(p)\nstop\n\nend program sample", "language": "Fortran", "metadata": {"date": 1593166936, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/Fortran/s227826221.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s227826221", "user_id": "u318703176"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program sample\nimplicit none\n\ninteger(8) :: N, K, i, sum, m\ninteger(8), allocatable:: p(:)\n\nread(*,*) N, K\nallocate(p(N))\nread(*,*) p\n\nif(N > 1)then\ndo i = 1, N-1\nif(p(i) > p(i+1))then\nm=p(i)\np(i)=p(i+1)\np(i+1)=m\nendif\nend do\n\nsum = 0\ndo i = 1, K\nsum = sum + p(i)\nend do\n\nwrite(*,*) sum\nend if\n\nif(N == 1)then\nsum = p(1)\nwrite(*,*) sum\nend if\n\ndeallocate(p)\nstop\n\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 382, "cpu_time_ms": 6, "memory_kb": 2700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s718518893", "group_id": "codeNet:p02628", "input_text": "program answer2\n implicit none\n \n integer :: i, j, N, K, m\n integer, allocatable :: p(:)\n \n read(*,*) N, K\n allocate(p(N))\n read(*,*) p\n \n do j =1, N-1\n do i = 1, N-1\n if(p(i)>p(i+1)) then\n m=p(i)\n p(i)=p(i+1)\n p(i+1)=m\n end if\n end do\n end do\n \n m=0\n do i =1, K\n m= m+p(i)\n end do\n \n write(*,*) m\n deallocate(p)\n stop\nend program answer2\n \n", "language": "Fortran", "metadata": {"date": 1592799306, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/Fortran/s718518893.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s718518893", "user_id": "u873780029"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program answer2\n implicit none\n \n integer :: i, j, N, K, m\n integer, allocatable :: p(:)\n \n read(*,*) N, K\n allocate(p(N))\n read(*,*) p\n \n do j =1, N-1\n do i = 1, N-1\n if(p(i)>p(i+1)) then\n m=p(i)\n p(i)=p(i+1)\n p(i+1)=m\n end if\n end do\n end do\n \n m=0\n do i =1, K\n m= m+p(i)\n end do\n \n write(*,*) m\n deallocate(p)\n stop\nend program answer2\n \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 2812}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s974206769", "group_id": "codeNet:p02629", "input_text": "program main\n! use iso_fortran_env\n implicit none\n\n integer(16) :: n, m\n character(:),allocatable :: txt\n character(26) :: alp\n\n alp = \"zabcdefghijklmnopqrstuvwxy\"\n\n read(*,*) n\n txt = \"\"\n\n do\n m = mod(n, 26)\n n = int(n / 26)\n if (m == 0) then\n n = n - 1\n endif\n txt = alp(m+1:m+1)//txt\n if (n == 0) exit\n enddo\n\n print *, trim(txt)\n\nend program main", "language": "Fortran", "metadata": {"date": 1592968586, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02629.html", "problem_id": "p02629", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02629/input.txt", "sample_output_relpath": "derived/input_output/data/p02629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02629/Fortran/s974206769.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s974206769", "user_id": "u128084721"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "program main\n! use iso_fortran_env\n implicit none\n\n integer(16) :: n, m\n character(:),allocatable :: txt\n character(26) :: alp\n\n alp = \"zabcdefghijklmnopqrstuvwxy\"\n\n read(*,*) n\n txt = \"\"\n\n do\n m = mod(n, 26)\n n = int(n / 26)\n if (m == 0) then\n n = n - 1\n endif\n txt = alp(m+1:m+1)//txt\n if (n == 0) exit\n enddo\n\n print *, trim(txt)\n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "sample_input": "2\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02629", "source_text": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 436, "cpu_time_ms": 13, "memory_kb": 2716}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s202094167", "group_id": "codeNet:p02629", "input_text": "program one_quadrillion_and_one_dalmatians\n implicit none\n integer(8) :: n\n integer :: i = 0, k(11) = 0\n read(*,*) n\n do while (n > 0)\n i = i + 1\n k(i) = int(mod(n - 1, 26) + 1) + 96\n n = n / 26\n end do\n do while (i > 0)\n write(*,'(a)',advance='no') achar(k(i))\n i = i - 1\n end do\n write(*,*)\nend program one_quadrillion_and_one_dalmatians", "language": "Fortran", "metadata": {"date": 1592788315, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02629.html", "problem_id": "p02629", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02629/input.txt", "sample_output_relpath": "derived/input_output/data/p02629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02629/Fortran/s202094167.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s202094167", "user_id": "u506403362"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "program one_quadrillion_and_one_dalmatians\n implicit none\n integer(8) :: n\n integer :: i = 0, k(11) = 0\n read(*,*) n\n do while (n > 0)\n i = i + 1\n k(i) = int(mod(n - 1, 26) + 1) + 96\n n = n / 26\n end do\n do while (i > 0)\n write(*,'(a)',advance='no') achar(k(i))\n i = i - 1\n end do\n write(*,*)\nend program one_quadrillion_and_one_dalmatians", "problem_context": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "sample_input": "2\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02629", "source_text": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 363, "cpu_time_ms": 11, "memory_kb": 2924}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s477880881", "group_id": "codeNet:p02630", "input_text": "program main\n use iso_fortran_env\n implicit none\n integer(int32) :: n, q\n integer(int64) :: an(10000000)\n integer(int32),allocatable :: a(:), b(:), c(:)\n integer(int32) :: i\n integer(int64) :: s\n\n read *, n\n allocate(a(n))\n read *, (a(i), i = 1, n)\n read *, q\n allocate(b(q), c(q))\n read *, (b(i), c(i), i = 1, q)\n\n an = 0\n do i = 1, n\n an(a(i)) = an(a(i)) + 1\n enddo\n\n s = sum(a)\n\n do i = 1, q\n s = s + (c(i) - b(i)) * an(b(i))\n an(c(i)) = an(c(i)) + an(b(i))\n an(b(i)) = 0\n print *, s\n enddo\n\nend program main", "language": "Fortran", "metadata": {"date": 1592977101, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02630.html", "problem_id": "p02630", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02630/input.txt", "sample_output_relpath": "derived/input_output/data/p02630/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02630/Fortran/s477880881.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s477880881", "user_id": "u128084721"}, "prompt_components": {"gold_output": "11\n12\n16\n", "input_to_evaluate": "program main\n use iso_fortran_env\n implicit none\n integer(int32) :: n, q\n integer(int64) :: an(10000000)\n integer(int32),allocatable :: a(:), b(:), c(:)\n integer(int32) :: i\n integer(int64) :: s\n\n read *, n\n allocate(a(n))\n read *, (a(i), i = 1, n)\n read *, q\n allocate(b(q), c(q))\n read *, (b(i), c(i), i = 1, q)\n\n an = 0\n do i = 1, n\n an(a(i)) = an(a(i)) + 1\n enddo\n\n s = sum(a)\n\n do i = 1, q\n s = s + (c(i) - b(i)) * an(b(i))\n an(c(i)) = an(c(i)) + an(b(i))\n an(b(i)) = 0\n print *, s\n enddo\n\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have a sequence A composed of N positive integers: A_{1}, A_{2}, \\cdots, A_{N}.\n\nYou will now successively do the following Q operations:\n\nIn the i-th operation, you replace every element whose value is B_{i} with C_{i}.\n\nFor each i (1 \\leq i \\leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, Q, A_{i}, B_{i}, C_{i} \\leq 10^{5}\n\nB_{i} \\neq C_{i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1} A_{2} \\cdots A_{N}\nQ\nB_{1} C_{1}\nB_{2} C_{2}\n\\vdots\nB_{Q} C_{Q}\n\nOutput\n\nPrint Q integers S_{i} to Standard Output in the following format:\n\nS_{1}\nS_{2}\n\\vdots\nS_{Q}\n\nNote that S_{i} may not fit into a 32-bit integer.\n\nSample Input 1\n\n4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n\nSample Output 1\n\n11\n12\n16\n\nInitially, the sequence A is 1,2,3,4.\n\nAfter each operation, it becomes the following:\n\n2, 2, 3, 4\n\n2, 2, 4, 4\n\n4, 4, 4, 4\n\nSample Input 2\n\n4\n1 1 1 1\n3\n1 2\n2 1\n3 5\n\nSample Output 2\n\n8\n4\n4\n\nNote that the sequence A may not contain an element whose value is B_{i}.\n\nSample Input 3\n\n2\n1 2\n3\n1 100\n2 100\n100 1000\n\nSample Output 3\n\n102\n200\n2000", "sample_input": "4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n"}, "reference_outputs": ["11\n12\n16\n"], "source_document_id": "p02630", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have a sequence A composed of N positive integers: A_{1}, A_{2}, \\cdots, A_{N}.\n\nYou will now successively do the following Q operations:\n\nIn the i-th operation, you replace every element whose value is B_{i} with C_{i}.\n\nFor each i (1 \\leq i \\leq Q), find S_{i}: the sum of all elements in A just after the i-th operation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, Q, A_{i}, B_{i}, C_{i} \\leq 10^{5}\n\nB_{i} \\neq C_{i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1} A_{2} \\cdots A_{N}\nQ\nB_{1} C_{1}\nB_{2} C_{2}\n\\vdots\nB_{Q} C_{Q}\n\nOutput\n\nPrint Q integers S_{i} to Standard Output in the following format:\n\nS_{1}\nS_{2}\n\\vdots\nS_{Q}\n\nNote that S_{i} may not fit into a 32-bit integer.\n\nSample Input 1\n\n4\n1 2 3 4\n3\n1 2\n3 4\n2 4\n\nSample Output 1\n\n11\n12\n16\n\nInitially, the sequence A is 1,2,3,4.\n\nAfter each operation, it becomes the following:\n\n2, 2, 3, 4\n\n2, 2, 4, 4\n\n4, 4, 4, 4\n\nSample Input 2\n\n4\n1 1 1 1\n3\n1 2\n2 1\n3 5\n\nSample Output 2\n\n8\n4\n4\n\nNote that the sequence A may not contain an element whose value is B_{i}.\n\nSample Input 3\n\n2\n1 2\n3\n1 100\n2 100\n100 1000\n\nSample Output 3\n\n102\n200\n2000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 146, "memory_kb": 82676}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s511434752", "group_id": "codeNet:p02635", "input_text": "program shift\n implicit none\n integer(8), parameter :: modu = 998244353\n character(300) :: s\n integer :: k, n, a(302) = 0, m = 1, x = 0, h = 0, r, d, w, c, b, i, j\n integer(8) :: dp(0:300, 0:301) = 0\n read(*,*) s, k\n n = len_trim(s)\n do i = 1, n\n if (s(i:i) == '0') then\n m = m + 1\n a(m) = x\n else\n x = x + 1\n end if\n end do\n m = m + 1\n a(m) = x\n k = min(k, x)\n dp(0, 0) = 1\n do i = 1, m - 1\n do j = h, 0, -1\n r = min(k - j, a(i + 1) - a(i))\n do d = 1, r\n w = j + d\n b = a(m) - a(i + 1) + d\n do c = 0, a(m) - a(i + 1)\n b = c + d\n dp(w, c) = dp(w, c) + dp(j, b)\n if (dp(w, c) >= modu) dp(w, c) = dp(w, c) - modu\n end do\n end do\n do c = 1, a(m) - a(i + 1)\n dp(j, c) = dp(j, c) + dp(j, c - 1)\n !if (dp(j, c) >= modu) dp(j, c) = dp(j, c) - modu\n end do\n end do\n h = min(k, h + a(i + 1) - a(i))\n end do\n write(*,'(i0)') mod(sum(dp(0:h, 0)), modu)\nend program shift", "language": "Fortran", "metadata": {"date": 1598162976, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02635.html", "problem_id": "p02635", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02635/input.txt", "sample_output_relpath": "derived/input_output/data/p02635/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02635/Fortran/s511434752.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s511434752", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program shift\n implicit none\n integer(8), parameter :: modu = 998244353\n character(300) :: s\n integer :: k, n, a(302) = 0, m = 1, x = 0, h = 0, r, d, w, c, b, i, j\n integer(8) :: dp(0:300, 0:301) = 0\n read(*,*) s, k\n n = len_trim(s)\n do i = 1, n\n if (s(i:i) == '0') then\n m = m + 1\n a(m) = x\n else\n x = x + 1\n end if\n end do\n m = m + 1\n a(m) = x\n k = min(k, x)\n dp(0, 0) = 1\n do i = 1, m - 1\n do j = h, 0, -1\n r = min(k - j, a(i + 1) - a(i))\n do d = 1, r\n w = j + d\n b = a(m) - a(i + 1) + d\n do c = 0, a(m) - a(i + 1)\n b = c + d\n dp(w, c) = dp(w, c) + dp(j, b)\n if (dp(w, c) >= modu) dp(w, c) = dp(w, c) - modu\n end do\n end do\n do c = 1, a(m) - a(i + 1)\n dp(j, c) = dp(j, c) + dp(j, c - 1)\n !if (dp(j, c) >= modu) dp(j, c) = dp(j, c) - modu\n end do\n end do\n h = min(k, h + a(i + 1) - a(i))\n end do\n write(*,'(i0)') mod(sum(dp(0:h, 0)), modu)\nend program shift", "problem_context": "Score : 800 points\n\nProblem Statement\n\nGiven is a string S consisting of 0 and 1. Find the number of strings, modulo 998244353, that can result from applying the following operation on S between 0 and K times (inclusive):\n\nChoose a pair of integers i, j (1\\leq i < j\\leq |S|) such that the i-th and j-th characters of S are 0 and 1, respectively. Remove the j-th character from S and insert it to the immediate left of the i-th character.\n\nConstraints\n\n1 \\leq |S| \\leq 300\n\n0 \\leq K \\leq 10^9\n\nS consists of 0 and 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS K\n\nOutput\n\nFind the number of strings, modulo 998244353, that can result from applying the operation on S between 0 and K times (inclusive).\n\nSample Input 1\n\n0101 1\n\nSample Output 1\n\n4\n\nFour strings, 0101, 0110, 1001, and 1010, can result.\n\nSample Input 2\n\n01100110 2\n\nSample Output 2\n\n14\n\nSample Input 3\n\n1101010010101101110111100011011111011000111101110101010010101010101 20\n\nSample Output 3\n\n113434815", "sample_input": "0101 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02635", "source_text": "Score : 800 points\n\nProblem Statement\n\nGiven is a string S consisting of 0 and 1. Find the number of strings, modulo 998244353, that can result from applying the following operation on S between 0 and K times (inclusive):\n\nChoose a pair of integers i, j (1\\leq i < j\\leq |S|) such that the i-th and j-th characters of S are 0 and 1, respectively. Remove the j-th character from S and insert it to the immediate left of the i-th character.\n\nConstraints\n\n1 \\leq |S| \\leq 300\n\n0 \\leq K \\leq 10^9\n\nS consists of 0 and 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS K\n\nOutput\n\nFind the number of strings, modulo 998244353, that can result from applying the operation on S between 0 and K times (inclusive).\n\nSample Input 1\n\n0101 1\n\nSample Output 1\n\n4\n\nFour strings, 0101, 0110, 1001, and 1010, can result.\n\nSample Input 2\n\n01100110 2\n\nSample Output 2\n\n14\n\nSample Input 3\n\n1101010010101101110111100011011111011000111101110101010010101010101 20\n\nSample Output 3\n\n113434815", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1002, "cpu_time_ms": 10, "memory_kb": 3396}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s948827002", "group_id": "codeNet:p02639", "input_text": "program main\n implicit none\n integer x(5),i\n read(*,*)x\n do i=1,5\n if(x(i)==0)then\n write(*,*)i\n \texit\n endif\n enddo\nend program main", "language": "Fortran", "metadata": {"date": 1597409979, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02639/input.txt", "sample_output_relpath": "derived/input_output/data/p02639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02639/Fortran/s948827002.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s948827002", "user_id": "u176979814"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer x(5),i\n read(*,*)x\n do i=1,5\n if(x(i)==0)then\n write(*,*)i\n \texit\n endif\n enddo\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 11, "memory_kb": 2728}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s499416551", "group_id": "codeNet:p02639", "input_text": "program prob7\n implicit none\n integer :: x(5)\n integer :: i\n read(*,*) x\n\n do i = 1, 5\n if(x(i) /= i) then\n write(*,*) i\n end if\n end do\n\n\n stop\ncontains\nend program prob7", "language": "Fortran", "metadata": {"date": 1592625911, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02639/input.txt", "sample_output_relpath": "derived/input_output/data/p02639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02639/Fortran/s499416551.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499416551", "user_id": "u478462004"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program prob7\n implicit none\n integer :: x(5)\n integer :: i\n read(*,*) x\n\n do i = 1, 5\n if(x(i) /= i) then\n write(*,*) i\n end if\n end do\n\n\n stop\ncontains\nend program prob7", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 6, "memory_kb": 2800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s025366608", "group_id": "codeNet:p02639", "input_text": "program main\n\nread*,i1,i2,i3,i4,i5\n\nif(i1==0)then\nprint*,'1'\nend if\nif(i2==0)then\nprint*,'2'\nend if\nif(i3==0)then\nprint*,'3'\nend if\nif(i4==0)then\nprint*,'4'\nend if\nif(i5==0)then\nprint*,'5'\nend if\n\nend program", "language": "Fortran", "metadata": {"date": 1592183067, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02639/input.txt", "sample_output_relpath": "derived/input_output/data/p02639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02639/Fortran/s025366608.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025366608", "user_id": "u298439196"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n\nread*,i1,i2,i3,i4,i5\n\nif(i1==0)then\nprint*,'1'\nend if\nif(i2==0)then\nprint*,'2'\nend if\nif(i3==0)then\nprint*,'3'\nend if\nif(i4==0)then\nprint*,'4'\nend if\nif(i5==0)then\nprint*,'5'\nend if\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 2, "memory_kb": 2788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s292479243", "group_id": "codeNet:p02639", "input_text": "program main\n implicit none\n integer i, A(5), ans\n !read(*, *)\n read(*, *) (A(i), i = 1,5)\n ans = 0\n do i = 1,5\n if (A(i) == 0) then\n ans = i\n endif\n end do\n write(*, *) ans\nend program main\n", "language": "Fortran", "metadata": {"date": 1592183038, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02639/input.txt", "sample_output_relpath": "derived/input_output/data/p02639/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02639/Fortran/s292479243.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s292479243", "user_id": "u050276949"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer i, A(5), ans\n !read(*, *)\n read(*, *) (A(i), i = 1,5)\n ans = 0\n do i = 1,5\n if (A(i) == 0) then\n ans = i\n endif\n end do\n write(*, *) ans\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2676}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s621857064", "group_id": "codeNet:p02640", "input_text": "program main\ninteger::x,y\nread*,x,y\nif(mod(y,2)==0 .and. 2*x<=y .and. y<=4*x)then\n print*,\"Yes\"\nelse \n print*,\"No\"\nend if\nend program main", "language": "Fortran", "metadata": {"date": 1592363997, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Fortran/s621857064.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621857064", "user_id": "u737968367"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\ninteger::x,y\nread*,x,y\nif(mod(y,2)==0 .and. 2*x<=y .and. y<=4*x)then\n print*,\"Yes\"\nelse \n print*,\"No\"\nend if\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 14, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s320731493", "group_id": "codeNet:p02640", "input_text": "program main\n implicit none\n\n integer :: x, y\n\n read(*,*) x, y\n\n if (mod(4*x-y,2)/=0 .or. mod(y-2*x,2)/=0 .or. y-2*x < 0 .or. 4*x-y < 0 ) then\n write(*,*) 'No'\n else\n write(*,*) 'Yes'\n end if\n\nend program main\n\n", "language": "Fortran", "metadata": {"date": 1592183628, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Fortran/s320731493.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320731493", "user_id": "u979474608"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n\n integer :: x, y\n\n read(*,*) x, y\n\n if (mod(4*x-y,2)/=0 .or. mod(y-2*x,2)/=0 .or. y-2*x < 0 .or. 4*x-y < 0 ) then\n write(*,*) 'No'\n else\n write(*,*) 'Yes'\n end if\n\nend program main\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s464206478", "group_id": "codeNet:p02640", "input_text": "program crane\n\n implicit none\n integer::x,y,n,jj,i,ans\n\n jj=0\n\n read*,x,y\n \n n=y/x+1\n\n do i=0,n\n ans=2*i+4*(x-i)\n if(x-i>=0) then\n if(ans==y) jj=jj+1\n end if\n end do\n\n if(jj==0) print*,'No'\n if(jj/=0) print*,'Yes'\n\nend program crane", "language": "Fortran", "metadata": {"date": 1592183502, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02640/input.txt", "sample_output_relpath": "derived/input_output/data/p02640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02640/Fortran/s464206478.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s464206478", "user_id": "u882765852"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program crane\n\n implicit none\n integer::x,y,n,jj,i,ans\n\n jj=0\n\n read*,x,y\n \n n=y/x+1\n\n do i=0,n\n ans=2*i+4*(x-i)\n if(x-i>=0) then\n if(ans==y) jj=jj+1\n end if\n end do\n\n if(jj==0) print*,'No'\n if(jj/=0) print*,'Yes'\n\nend program crane", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 2, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s672584867", "group_id": "codeNet:p02641", "input_text": "program main\n implicit none\n integer x, n\n integer, allocatable, dimension(:) :: p\n integer, dimension(102) :: q\n integer i, min, d, a\n\n read(*,*) x, n\n allocate(p(n))\n read(*,*) p\n\n do i = 1, 102\n q(i) = i-1\n end do\n\n do i = 1, n\n q(p(i)+1) = 1000\n end do\n\n a = 1\n min = 200\n do i = 1, 102\n d = abs(q(i)-x)\n if(d < min) then\n min = d\n a = q(i)\n else if (d == min) then\n if (q(i) < a) then\n a = q(i)\n end if\n end if\n end do\n\n\n write(*,*) a\n\nend program\n", "language": "Fortran", "metadata": {"date": 1592185842, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/Fortran/s672584867.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s672584867", "user_id": "u806372060"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program main\n implicit none\n integer x, n\n integer, allocatable, dimension(:) :: p\n integer, dimension(102) :: q\n integer i, min, d, a\n\n read(*,*) x, n\n allocate(p(n))\n read(*,*) p\n\n do i = 1, 102\n q(i) = i-1\n end do\n\n do i = 1, n\n q(p(i)+1) = 1000\n end do\n\n a = 1\n min = 200\n do i = 1, 102\n d = abs(q(i)-x)\n if(d < min) then\n min = d\n a = q(i)\n else if (d == min) then\n if (q(i) < a) then\n a = q(i)\n end if\n end if\n end do\n\n\n write(*,*) a\n\nend program\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2804}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s652610834", "group_id": "codeNet:p02641", "input_text": "program main\n implicit none\n\n integer :: x, y, z, n, i, k\n integer,allocatable :: p(:)\n\n read(*,*) x, n\n\n if(n == 0) then\n write(*,*) x\n stop\n end if\n \n allocate(p(n))\n read(*,*) p\n\n\n call heapsort(p)\n\n do i = 1, n\n if(p(i) == x) then\n k = i\n exit\n else\n k = -1\n end if\n end do\n\n if(k == -1) then\n write(*,*) x\n stop\n else\n do i = 1, k-1\n if(p(k-i) /= x-i) then\n y = x-i\n exit\n else\n y = x - k\n end if\n end do\n \n do i = 1, n-k\n if(p(k+i) /= x+i) then\n z = x+i\n exit\n else\n z = x + (n - k + 1)\n end if\n \n\n end do\n\n end if\n \n \n if(abs(y-x) <= abs(z-x))then\n write(*,*) y\n else\n write(*,*) z\n end if\n\n stop\n \n\n contains\n subroutine heapsort(array)\n implicit none\n integer, intent(inout) :: array(:)\n \n integer :: i,k,j,l\n double precision :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1592185493, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02641.html", "problem_id": "p02641", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02641/input.txt", "sample_output_relpath": "derived/input_output/data/p02641/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02641/Fortran/s652610834.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s652610834", "user_id": "u979474608"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program main\n implicit none\n\n integer :: x, y, z, n, i, k\n integer,allocatable :: p(:)\n\n read(*,*) x, n\n\n if(n == 0) then\n write(*,*) x\n stop\n end if\n \n allocate(p(n))\n read(*,*) p\n\n\n call heapsort(p)\n\n do i = 1, n\n if(p(i) == x) then\n k = i\n exit\n else\n k = -1\n end if\n end do\n\n if(k == -1) then\n write(*,*) x\n stop\n else\n do i = 1, k-1\n if(p(k-i) /= x-i) then\n y = x-i\n exit\n else\n y = x - k\n end if\n end do\n \n do i = 1, n-k\n if(p(k+i) /= x+i) then\n z = x+i\n exit\n else\n z = x + (n - k + 1)\n end if\n \n\n end do\n\n end if\n \n \n if(abs(y-x) <= abs(z-x))then\n write(*,*) y\n else\n write(*,*) z\n end if\n\n stop\n \n\n contains\n subroutine heapsort(array)\n implicit none\n integer, intent(inout) :: array(:)\n \n integer :: i,k,j,l\n double precision :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort\n\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "sample_input": "6 5\n4 7 10 6 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02641", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are an integer X and an integer sequence of length N: p_1, \\ldots, p_N.\n\nAmong the integers not contained in the sequence p_1, \\ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n0 \\leq N \\leq 100\n\n1 \\leq p_i \\leq 100\n\np_1, \\ldots, p_N are all distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX N\np_1 ... p_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6 5\n4 7 10 6 5\n\nSample Output 1\n\n8\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one nearest to 6 is 8.\n\nSample Input 2\n\n10 5\n4 7 10 6 5\n\nSample Output 2\n\n9\n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones nearest to 10 are 9 and 11. We should print the smaller one, 9.\n\nSample Input 3\n\n100 0\n\nSample Output 3\n\n100\n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X itself can be the answer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1641, "cpu_time_ms": 3, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s558226042", "group_id": "codeNet:p02644", "input_text": "module mod_leftist_heap\n implicit none\n type t_key\n integer :: distance, count, x, y, direction\n end type\n type t_node\n type(t_node), private, pointer :: left => null(), right => null()\n integer :: rank = 1\n type(t_key), pointer :: key\n end type\n type leftist_heap\n integer :: size = 0\n type(t_node), private, pointer :: root => null()\n contains\n procedure :: offer => offer\n procedure :: poll => poll\n procedure :: meld => meld\n end type\ncontains\n logical function less(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n res = a%key%distance < b%key%distance\n end\n subroutine swap(a, b)\n type(t_node), pointer, intent(inout) :: a, b\n type(t_node), pointer :: c\n c => a\n a => b\n b => c\n end\n function newk0(distance, count, x, y, direction) result(res)\n integer, intent(in) :: distance, count, x, y, direction\n type(t_key), pointer :: res\n res => null()\n allocate(res)\n res%distance = distance\n res%count = count\n res%x = x\n res%y = y\n res%direction = direction\n end\n function newn0(key) result(res)\n type(t_key), pointer, intent(in) :: key\n type(t_node), pointer :: res\n res => null()\n allocate(res)\n res%key => key\n end\n recursive function meld_node(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n type(t_node), pointer :: res\n logical :: f\n if (.not.associated(a)) then\n res => b; return\n end if\n if (.not.associated(b)) then\n res => a; return\n end if\n if (less(a, b)) then\n res => a\n res%right => meld_node(res%right, b)\n else\n res => b\n res%right => meld_node(res%right, a)\n end if\n f = .not.associated(res%left)\n if (.not.f) f = res%left%rank < res%right%rank\n if (f) call swap(res%left, res%right)\n res%rank = merge(res%right%rank, 0, associated(res%right)) + 1\n end\n function poll(this) result(res)\n class(leftist_heap), intent(inout) :: this\n type(t_node), pointer :: left, right\n type(t_key), pointer :: res\n res => this%root%key\n left => this%root%left\n right => this%root%right\n deallocate(this%root)\n this%root => meld_node(left, right)\n this%size = this%size - 1\n end\n subroutine offer(this, distance, count, x, y, direction)\n class(leftist_heap), intent(inout) :: this\n integer, intent(in) :: distance, count, x, y, direction\n this%root => meld_node(this%root, newn0(newk0(distance, count, x, y, direction)))\n this%size = this%size + 1\n end\n type(leftist_heap) function meld(this, other) result(res)\n class(leftist_heap), intent(in) :: this\n type(leftist_heap), intent(in) :: other\n res%root => meld_node(this%root, other%root)\n res%size = this%size + other%size\n end\nend module mod_leftist_heap\nprogram pond_skater\n use mod_leftist_heap\n implicit none\n integer, parameter :: infty = lshift(1, 30)\n integer :: h, w, k, x(2), y(2), i, j\n integer :: dx(4) = (/0, 1, 0, -1/), dy(4) = (/1, 0, -1, 0/)\n integer :: dist, cnt, p, q, idx, u, v, cost, next\n integer, allocatable :: a(:, :, :)\n character(1000000) :: s\n type(leftist_heap) :: pq\n type(t_key), pointer :: key\n read(*,*) h, w, k\n read(*,*) x(1), y(1), x(2), y(2)\n allocate(a(0:h + 1, 0:w + 1, 4))\n a = -1\n do i = 1, h\n read(*,*) s\n do j = 1, w\n if (s(j:j) == '.') a(i, j, :) = infty\n end do\n end do\n a(x(1), y(1), :) = 0\n do i = 1, 4\n call pq%offer(0, k - 1, x(1), y(1), i)\n end do\n do while (pq%size > 0)\n key => pq%poll()\n dist = key%distance\n cnt = key%count\n p = key%x\n q = key%y\n idx = key%direction\n if (a(p, q, idx) < dist) cycle\n do i = 1, 4\n u = p + dx(i)\n v = q + dy(i)\n if (i == idx) then\n cost = 0\n next = cnt + 1\n if (next >= k) then\n cost = 1\n next = 0\n end if\n if (a(u, v, i) > dist + cost) then\n a(u, v, i) = dist + cost\n call pq%offer(a(u, v, i), next, u, v, i)\n end if\n else\n if (a(u, v, i) > dist + 1) then\n a(u, v, i) = dist + 1\n call pq%offer(a(u, v, i), 0, u, v, i)\n end if\n end if\n end do\n end do\n dist = minval(a(x(2), y(2), :))\n write(*,'(i0)') merge(-1, dist, dist == infty)\nend program pond_skater", "language": "Fortran", "metadata": {"date": 1593120424, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02644.html", "problem_id": "p02644", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02644/input.txt", "sample_output_relpath": "derived/input_output/data/p02644/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02644/Fortran/s558226042.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558226042", "user_id": "u506403362"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "module mod_leftist_heap\n implicit none\n type t_key\n integer :: distance, count, x, y, direction\n end type\n type t_node\n type(t_node), private, pointer :: left => null(), right => null()\n integer :: rank = 1\n type(t_key), pointer :: key\n end type\n type leftist_heap\n integer :: size = 0\n type(t_node), private, pointer :: root => null()\n contains\n procedure :: offer => offer\n procedure :: poll => poll\n procedure :: meld => meld\n end type\ncontains\n logical function less(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n res = a%key%distance < b%key%distance\n end\n subroutine swap(a, b)\n type(t_node), pointer, intent(inout) :: a, b\n type(t_node), pointer :: c\n c => a\n a => b\n b => c\n end\n function newk0(distance, count, x, y, direction) result(res)\n integer, intent(in) :: distance, count, x, y, direction\n type(t_key), pointer :: res\n res => null()\n allocate(res)\n res%distance = distance\n res%count = count\n res%x = x\n res%y = y\n res%direction = direction\n end\n function newn0(key) result(res)\n type(t_key), pointer, intent(in) :: key\n type(t_node), pointer :: res\n res => null()\n allocate(res)\n res%key => key\n end\n recursive function meld_node(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n type(t_node), pointer :: res\n logical :: f\n if (.not.associated(a)) then\n res => b; return\n end if\n if (.not.associated(b)) then\n res => a; return\n end if\n if (less(a, b)) then\n res => a\n res%right => meld_node(res%right, b)\n else\n res => b\n res%right => meld_node(res%right, a)\n end if\n f = .not.associated(res%left)\n if (.not.f) f = res%left%rank < res%right%rank\n if (f) call swap(res%left, res%right)\n res%rank = merge(res%right%rank, 0, associated(res%right)) + 1\n end\n function poll(this) result(res)\n class(leftist_heap), intent(inout) :: this\n type(t_node), pointer :: left, right\n type(t_key), pointer :: res\n res => this%root%key\n left => this%root%left\n right => this%root%right\n deallocate(this%root)\n this%root => meld_node(left, right)\n this%size = this%size - 1\n end\n subroutine offer(this, distance, count, x, y, direction)\n class(leftist_heap), intent(inout) :: this\n integer, intent(in) :: distance, count, x, y, direction\n this%root => meld_node(this%root, newn0(newk0(distance, count, x, y, direction)))\n this%size = this%size + 1\n end\n type(leftist_heap) function meld(this, other) result(res)\n class(leftist_heap), intent(in) :: this\n type(leftist_heap), intent(in) :: other\n res%root => meld_node(this%root, other%root)\n res%size = this%size + other%size\n end\nend module mod_leftist_heap\nprogram pond_skater\n use mod_leftist_heap\n implicit none\n integer, parameter :: infty = lshift(1, 30)\n integer :: h, w, k, x(2), y(2), i, j\n integer :: dx(4) = (/0, 1, 0, -1/), dy(4) = (/1, 0, -1, 0/)\n integer :: dist, cnt, p, q, idx, u, v, cost, next\n integer, allocatable :: a(:, :, :)\n character(1000000) :: s\n type(leftist_heap) :: pq\n type(t_key), pointer :: key\n read(*,*) h, w, k\n read(*,*) x(1), y(1), x(2), y(2)\n allocate(a(0:h + 1, 0:w + 1, 4))\n a = -1\n do i = 1, h\n read(*,*) s\n do j = 1, w\n if (s(j:j) == '.') a(i, j, :) = infty\n end do\n end do\n a(x(1), y(1), :) = 0\n do i = 1, 4\n call pq%offer(0, k - 1, x(1), y(1), i)\n end do\n do while (pq%size > 0)\n key => pq%poll()\n dist = key%distance\n cnt = key%count\n p = key%x\n q = key%y\n idx = key%direction\n if (a(p, q, idx) < dist) cycle\n do i = 1, 4\n u = p + dx(i)\n v = q + dy(i)\n if (i == idx) then\n cost = 0\n next = cnt + 1\n if (next >= k) then\n cost = 1\n next = 0\n end if\n if (a(u, v, i) > dist + cost) then\n a(u, v, i) = dist + cost\n call pq%offer(a(u, v, i), next, u, v, i)\n end if\n else\n if (a(u, v, i) > dist + 1) then\n a(u, v, i) = dist + 1\n call pq%offer(a(u, v, i), 0, u, v, i)\n end if\n end if\n end do\n end do\n dist = minval(a(x(2), y(2), :))\n write(*,'(i0)') merge(-1, dist, dist == infty)\nend program pond_skater", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.\n\nSome of the squares have a lotus leaf on it and cannot be entered.\nThe square (i,j) has a lotus leaf on it if c_{ij} is @, and it does not if c_{ij} is ..\n\nIn one stroke, Snuke can move between 1 and K squares (inclusive) toward one of the four directions: north, east, south, and west.\nThe move may not pass through a square with a lotus leaf. Moving to such a square or out of the pond is also forbidden.\n\nFind the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2).\nIf the travel from (x_1,y_1) to (x_2,y_2) is impossible, point out that fact.\n\nConstraints\n\n1 \\leq H,W,K \\leq 10^6\n\nH \\times W \\leq 10^6\n\n1 \\leq x_1,x_2 \\leq H\n\n1 \\leq y_1,y_2 \\leq W\n\nx_1 \\neq x_2 or y_1 \\neq y_2.\n\nc_{i,j} is . or @.\n\nc_{x_1,y_1} = .\n\nc_{x_2,y_2} = .\n\nAll numbers in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nx_1 y_1 x_2 y_2\nc_{1,1}c_{1,2} .. c_{1,W}\nc_{2,1}c_{2,2} .. c_{2,W}\n:\nc_{H,1}c_{H,2} .. c_{H,W}\n\nOutput\n\nPrint the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2), or print -1 if the travel is impossible.\n\nSample Input 1\n\n3 5 2\n3 2 3 4\n.....\n.@..@\n..@..\n\nSample Output 1\n\n5\n\nInitially, Snuke is at the square (3,2).\nHe can reach the square (3, 4) by making five strokes as follows:\n\nFrom (3, 2), go west one square to (3, 1).\n\nFrom (3, 1), go north two squares to (1, 1).\n\nFrom (1, 1), go east two squares to (1, 3).\n\nFrom (1, 3), go east one square to (1, 4).\n\nFrom (1, 4), go south two squares to (3, 4).\n\nSample Input 2\n\n1 6 4\n1 1 1 6\n......\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 1\n2 1 2 3\n.@.\n.@.\n.@.\n\nSample Output 3\n\n-1", "sample_input": "3 5 2\n3 2 3 4\n.....\n.@..@\n..@..\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02644", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke, a water strider, lives in a rectangular pond that can be seen as a grid with H east-west rows and W north-south columns. Let (i,j) be the square at the i-th row from the north and j-th column from the west.\n\nSome of the squares have a lotus leaf on it and cannot be entered.\nThe square (i,j) has a lotus leaf on it if c_{ij} is @, and it does not if c_{ij} is ..\n\nIn one stroke, Snuke can move between 1 and K squares (inclusive) toward one of the four directions: north, east, south, and west.\nThe move may not pass through a square with a lotus leaf. Moving to such a square or out of the pond is also forbidden.\n\nFind the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2).\nIf the travel from (x_1,y_1) to (x_2,y_2) is impossible, point out that fact.\n\nConstraints\n\n1 \\leq H,W,K \\leq 10^6\n\nH \\times W \\leq 10^6\n\n1 \\leq x_1,x_2 \\leq H\n\n1 \\leq y_1,y_2 \\leq W\n\nx_1 \\neq x_2 or y_1 \\neq y_2.\n\nc_{i,j} is . or @.\n\nc_{x_1,y_1} = .\n\nc_{x_2,y_2} = .\n\nAll numbers in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nx_1 y_1 x_2 y_2\nc_{1,1}c_{1,2} .. c_{1,W}\nc_{2,1}c_{2,2} .. c_{2,W}\n:\nc_{H,1}c_{H,2} .. c_{H,W}\n\nOutput\n\nPrint the minimum number of strokes Snuke takes to travel from the square (x_1,y_1) to (x_2,y_2), or print -1 if the travel is impossible.\n\nSample Input 1\n\n3 5 2\n3 2 3 4\n.....\n.@..@\n..@..\n\nSample Output 1\n\n5\n\nInitially, Snuke is at the square (3,2).\nHe can reach the square (3, 4) by making five strokes as follows:\n\nFrom (3, 2), go west one square to (3, 1).\n\nFrom (3, 1), go north two squares to (1, 1).\n\nFrom (1, 1), go east two squares to (1, 3).\n\nFrom (1, 3), go east one square to (1, 4).\n\nFrom (1, 4), go south two squares to (3, 4).\n\nSample Input 2\n\n1 6 4\n1 1 1 6\n......\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 1\n2 1 2 3\n.@.\n.@.\n.@.\n\nSample Output 3\n\n-1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4257, "cpu_time_ms": 514, "memory_kb": 110196}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s826991915", "group_id": "codeNet:p02645", "input_text": "program sample\n\tcharacter(len=20) :: x\n \n read(*,*) x\n \n write(*,'(a)') x(1:3)\n \n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1592631209, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02645.html", "problem_id": "p02645", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02645/input.txt", "sample_output_relpath": "derived/input_output/data/p02645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02645/Fortran/s826991915.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s826991915", "user_id": "u323210830"}, "prompt_components": {"gold_output": "tak\n", "input_to_evaluate": "program sample\n\tcharacter(len=20) :: x\n \n read(*,*) x\n \n write(*,'(a)') x(1:3)\n \n stop\nend program sample", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "sample_input": "takahashi\n"}, "reference_outputs": ["tak\n"], "source_document_id": "p02645", "source_text": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 123, "cpu_time_ms": 5, "memory_kb": 2868}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s333920404", "group_id": "codeNet:p02645", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n\n real(8)::a,b\n integer(8),allocatable :: x(:),y(:)\n character(20)::s\n read(*,*) s\n \n write(*,*) s(1:3)\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1592096615, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02645.html", "problem_id": "p02645", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02645/input.txt", "sample_output_relpath": "derived/input_output/data/p02645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02645/Fortran/s333920404.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s333920404", "user_id": "u713568912"}, "prompt_components": {"gold_output": "tak\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n\n real(8)::a,b\n integer(8),allocatable :: x(:),y(:)\n character(20)::s\n read(*,*) s\n \n write(*,*) s(1:3)\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "sample_input": "takahashi\n"}, "reference_outputs": ["tak\n"], "source_document_id": "p02645", "source_text": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 216, "cpu_time_ms": 2, "memory_kb": 2788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s194344618", "group_id": "codeNet:p02646", "input_text": "program main\n implicit none\n integer a, b, v, w, t\n integer flag\n\n read(*,*) a, v\n read(*,*) b, w\n read(*,*) t\n\n flag = 0\n\n if(a > b) then\n if(a-v*t <= b-w*t) then\n flag = 1\n end if\n else if (a < b) then\n if(a+v*t >= b+w*t) then\n flag = 1\n end if\n else if (a == b) then\n flag = 1\n end if\n\n if(flag == 1) then\n write(*,*) \"YES\"\n else\n write(*,*) \"NO\"\n end if\n\nend program\n\n", "language": "Fortran", "metadata": {"date": 1592097617, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02646.html", "problem_id": "p02646", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02646/input.txt", "sample_output_relpath": "derived/input_output/data/p02646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02646/Fortran/s194344618.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s194344618", "user_id": "u806372060"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program main\n implicit none\n integer a, b, v, w, t\n integer flag\n\n read(*,*) a, v\n read(*,*) b, w\n read(*,*) t\n\n flag = 0\n\n if(a > b) then\n if(a-v*t <= b-w*t) then\n flag = 1\n end if\n else if (a < b) then\n if(a+v*t >= b+w*t) then\n flag = 1\n end if\n else if (a == b) then\n flag = 1\n end if\n\n if(flag == 1) then\n write(*,*) \"YES\"\n else\n write(*,*) \"NO\"\n end if\n\nend program\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "sample_input": "1 2\n3 1\n3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02646", "source_text": "Score : 200 points\n\nProblem Statement\n\nTwo children are playing tag on a number line. (In the game of tag, the child called \"it\" tries to catch the other child.) The child who is \"it\" is now at coordinate A, and he can travel the distance of V per second.\nThe other child is now at coordinate B, and she can travel the distance of W per second.\n\nHe can catch her when his coordinate is the same as hers.\nDetermine whether he can catch her within T seconds (including exactly T seconds later).\nWe assume that both children move optimally.\n\nConstraints\n\n-10^9 \\leq A,B \\leq 10^9\n\n1 \\leq V,W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA V\nB W\nT\n\nOutput\n\nIf \"it\" can catch the other child, print YES; otherwise, print NO.\n\nSample Input 1\n\n1 2\n3 1\n3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n1 2\n3 2\n3\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n1 2\n3 3\n3\n\nSample Output 3\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 485, "cpu_time_ms": 6, "memory_kb": 2836}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s328989252", "group_id": "codeNet:p02647", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,k,i,j,l,r,jj\n integer(int64), allocatable:: a(:), na(:),ims(:)\n logical:: same\n\n read*, n,k\n allocate(a(n), na(0:n),ims(n))\n read*, a(:)\n ! a(:) = 0\n ! a(1) = 1\n\n if (k >= 50) then\n a(:) = n\n print'(*(i0,1x))', a(:)\n stop\n end if\n\n do i=1,k\n na(:) = 0\n ims(:) = 0\n same = .true.\n do j=1,n\n\n l = max(j-a(j),1_8)\n r = (j+a(j)+1)\n ! print'(*(i0,1x))', j,l,r\n ims(l)=ims(l)+1\n if (r <= n) ims(r)=ims(r)-1\n end do\n ! print'(*(i0,1x))', ims(:)\n do j=1,n\n na(j) = na(j-1)+ims(j)\n end do\n\n do j=1,n\n if (na(j) /= a(j)) same = .false.\n end do\n if (same) exit\n a(:) = na(1:)\n end do\n ! print'(i0)', i\n print'(*(i0,1x))', na(1:)\nend program main", "language": "Fortran", "metadata": {"date": 1592100295, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02647.html", "problem_id": "p02647", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02647/input.txt", "sample_output_relpath": "derived/input_output/data/p02647/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02647/Fortran/s328989252.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s328989252", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1 2 2 1 2\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,k,i,j,l,r,jj\n integer(int64), allocatable:: a(:), na(:),ims(:)\n logical:: same\n\n read*, n,k\n allocate(a(n), na(0:n),ims(n))\n read*, a(:)\n ! a(:) = 0\n ! a(1) = 1\n\n if (k >= 50) then\n a(:) = n\n print'(*(i0,1x))', a(:)\n stop\n end if\n\n do i=1,k\n na(:) = 0\n ims(:) = 0\n same = .true.\n do j=1,n\n\n l = max(j-a(j),1_8)\n r = (j+a(j)+1)\n ! print'(*(i0,1x))', j,l,r\n ims(l)=ims(l)+1\n if (r <= n) ims(r)=ims(r)-1\n end do\n ! print'(*(i0,1x))', ims(:)\n do j=1,n\n na(j) = na(j-1)+ims(j)\n end do\n\n do j=1,n\n if (na(j) /= a(j)) same = .false.\n end do\n if (same) exit\n a(:) = na(1:)\n end do\n ! print'(i0)', i\n print'(*(i0,1x))', na(1:)\nend program main", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "sample_input": "5 1\n1 0 0 1 0\n"}, "reference_outputs": ["1 2 2 1 2\n"], "source_document_id": "p02647", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 946, "cpu_time_ms": 112, "memory_kb": 9204}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s643658314", "group_id": "codeNet:p02647", "input_text": "program light\n implicit none\n integer :: n, k, i, j\n integer,allocatable :: a(:), a2(:)\n\n read(*,*) n, k\n\n if ( k>=n ) then\n read(*,*)\n do i = 1, n\n write(*,'(200000(i0,x))',advance='no') n\n end do\n stop\n end if\n \n allocate(a(n),a2(n))\n read(*,*) a\n a2 = 0\n do i = 1, k\n do j = 1, n\n a2(max(1,j-a(j)):min(j+a(j),n))= a2(max(1,j-a(j)):min(j+a(j),n)) + 1\n end do\n a = a2\n a2 = 0\n if (minval(a)==n) then\n exit\n end if\n end do\n write(*,'(200000(i0,x))') a\n deallocate(a,a2)\n stop\nend program light\n", "language": "Fortran", "metadata": {"date": 1592100165, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02647.html", "problem_id": "p02647", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02647/input.txt", "sample_output_relpath": "derived/input_output/data/p02647/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02647/Fortran/s643658314.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s643658314", "user_id": "u961266059"}, "prompt_components": {"gold_output": "1 2 2 1 2\n", "input_to_evaluate": "program light\n implicit none\n integer :: n, k, i, j\n integer,allocatable :: a(:), a2(:)\n\n read(*,*) n, k\n\n if ( k>=n ) then\n read(*,*)\n do i = 1, n\n write(*,'(200000(i0,x))',advance='no') n\n end do\n stop\n end if\n \n allocate(a(n),a2(n))\n read(*,*) a\n a2 = 0\n do i = 1, k\n do j = 1, n\n a2(max(1,j-a(j)):min(j+a(j),n))= a2(max(1,j-a(j)):min(j+a(j),n)) + 1\n end do\n a = a2\n a2 = 0\n if (minval(a)==n) then\n exit\n end if\n end do\n write(*,'(200000(i0,x))') a\n deallocate(a,a2)\n stop\nend program light\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "sample_input": "5 1\n1 0 0 1 0\n"}, "reference_outputs": ["1 2 2 1 2\n"], "source_document_id": "p02647", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N bulbs arranged on a number line, numbered 1 to N from left to right.\nBulb i is at coordinate i.\n\nEach bulb has a non-negative integer parameter called intensity.\nWhen there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.\nInitially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:\n\nFor each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.\n\nFind the intensity of each bulb after the K operations.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:\n\nA{'}_1 A{'}_2 \\ldots A{'}_N\n\nSample Input 1\n\n5 1\n1 0 0 1 0\n\nSample Output 1\n\n1 2 2 1 2\n\nInitially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.\nSimilarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.\n\nSample Input 2\n\n5 2\n1 0 0 1 0\n\nSample Output 2\n\n3 3 4 4 3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 570, "cpu_time_ms": 2205, "memory_kb": 5144}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s907375771", "group_id": "codeNet:p02648", "input_text": "program knapsack_queries_on_a_tree\n implicit none\n integer :: n, q, u(100000,3) = 0, p(0:18) = -1, m, r, h, i, j, k\n integer, dimension(262144) :: v = 0, w = 0\n integer(8) :: dp(0:18,100000) = 0, ans(100000) = 0\n read(*,*) n\n do i = 1, n\n read(*,*) v(i), w(i)\n end do\n read(*,*) q\n do i = 1, q\n read(*,*) u(i,1:2)\n u(i,3) = i\n end do\n call merge_sort(u(1:q,1:3),1)\n p(0) = 1\n dp(0,w(1):100000) = v(1)\n do i = 1, q\n m = u(i,1)\n h = headbit(m)\n do j = 1, h\n r = rshift(m,h-j)\n if (p(j) == r) cycle\n p(j) = r\n dp(j,:) = 0\n do k = 100000, w(r), -1\n dp(j,k) = max(dp(j-1,k),dp(j-1,k-w(r))+v(r))\n end do\n end do\n ans(u(i,3)) = dp(h,u(i,2))\n end do\n do i = 1, q\n write(*,'(i0)') ans(i)\n end do\ncontains\n integer function headbit(n)\n integer, intent(in) :: n\n integer :: i\n do i = 18, 0, -1\n if (btest(n,i)) then\n headbit = i\n return\n end if\n end do\n end\n subroutine merge_sort(a,k)\n integer, intent(inout) :: a(:,:)\n integer, intent(in) :: k\n integer :: n, m, l, i, u\n n = size(a,1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(a(2*(i-1)*l+1:(2*i-1)*l,:),a((2*i-1)*l+1:u,:),k)\n end do\n l = 2*l\n m = (m+1)/2\n end do\n end\n subroutine merger(a1,a2,k)\n integer, intent(inout) :: a1(:,:), a2(:,:)\n integer, intent(in) :: k\n integer :: a(size(a1,1)+size(a2,1),size(a1,2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1,1)\n n2 = size(a2,1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (a1(i1,k) <= a2(i2,k)) then\n a(i1+i2-1,:) = a1(i1,:)\n i1 = i1+1\n else\n a(i1+i2-1,:) = a2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n a(i1+i2-1:n1+n2,:) = a1(i1:n1,:)\n else\n a(i1+i2-1:n1+n2,:) = a2(i2:n2,:)\n end if\n a1 = a(1:n1,:)\n a2 = a(n1+1:n1+n2,:)\n end\nend program knapsack_queries_on_a_tree", "language": "Fortran", "metadata": {"date": 1592100294, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02648.html", "problem_id": "p02648", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02648/input.txt", "sample_output_relpath": "derived/input_output/data/p02648/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02648/Fortran/s907375771.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s907375771", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "program knapsack_queries_on_a_tree\n implicit none\n integer :: n, q, u(100000,3) = 0, p(0:18) = -1, m, r, h, i, j, k\n integer, dimension(262144) :: v = 0, w = 0\n integer(8) :: dp(0:18,100000) = 0, ans(100000) = 0\n read(*,*) n\n do i = 1, n\n read(*,*) v(i), w(i)\n end do\n read(*,*) q\n do i = 1, q\n read(*,*) u(i,1:2)\n u(i,3) = i\n end do\n call merge_sort(u(1:q,1:3),1)\n p(0) = 1\n dp(0,w(1):100000) = v(1)\n do i = 1, q\n m = u(i,1)\n h = headbit(m)\n do j = 1, h\n r = rshift(m,h-j)\n if (p(j) == r) cycle\n p(j) = r\n dp(j,:) = 0\n do k = 100000, w(r), -1\n dp(j,k) = max(dp(j-1,k),dp(j-1,k-w(r))+v(r))\n end do\n end do\n ans(u(i,3)) = dp(h,u(i,2))\n end do\n do i = 1, q\n write(*,'(i0)') ans(i)\n end do\ncontains\n integer function headbit(n)\n integer, intent(in) :: n\n integer :: i\n do i = 18, 0, -1\n if (btest(n,i)) then\n headbit = i\n return\n end if\n end do\n end\n subroutine merge_sort(a,k)\n integer, intent(inout) :: a(:,:)\n integer, intent(in) :: k\n integer :: n, m, l, i, u\n n = size(a,1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(a(2*(i-1)*l+1:(2*i-1)*l,:),a((2*i-1)*l+1:u,:),k)\n end do\n l = 2*l\n m = (m+1)/2\n end do\n end\n subroutine merger(a1,a2,k)\n integer, intent(inout) :: a1(:,:), a2(:,:)\n integer, intent(in) :: k\n integer :: a(size(a1,1)+size(a2,1),size(a1,2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1,1)\n n2 = size(a2,1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (a1(i1,k) <= a2(i2,k)) then\n a(i1+i2-1,:) = a1(i1,:)\n i1 = i1+1\n else\n a(i1+i2-1,:) = a2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n a(i1+i2-1:n1+n2,:) = a1(i1:n1,:)\n else\n a(i1+i2-1:n1+n2,:) = a2(i2:n2,:)\n end if\n a1 = a(1:n1,:)\n a2 = a(n1+1:n1+n2,:)\n end\nend program knapsack_queries_on_a_tree", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1994, "cpu_time_ms": 3309, "memory_kb": 21788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s705294804", "group_id": "codeNet:p02657", "input_text": "program main\n implicit none\n integer :: a, b\n read *, a, b\n print \"(i0)\", a * b\nend program main\n", "language": "Fortran", "metadata": {"date": 1600916358, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02657.html", "problem_id": "p02657", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02657/input.txt", "sample_output_relpath": "derived/input_output/data/p02657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02657/Fortran/s705294804.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s705294804", "user_id": "u388927326"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer :: a, b\n read *, a, b\n print \"(i0)\", a * b\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 11, "memory_kb": 2888}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s067767386", "group_id": "codeNet:p02657", "input_text": "program test\nimplicit none\ninteger::a,b\nread*,a,b\nprint*,a*b\nend program test", "language": "Fortran", "metadata": {"date": 1591588592, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02657.html", "problem_id": "p02657", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02657/input.txt", "sample_output_relpath": "derived/input_output/data/p02657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02657/Fortran/s067767386.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067767386", "user_id": "u723571904"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program test\nimplicit none\ninteger::a,b\nread*,a,b\nprint*,a*b\nend program test", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 77, "cpu_time_ms": 3, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s116237539", "group_id": "codeNet:p02657", "input_text": "program ABC169_A\n integer::A,B\n read(*,*)A,B\n write(*,*)A*B\nend program ABC169_A", "language": "Fortran", "metadata": {"date": 1590973278, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02657.html", "problem_id": "p02657", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02657/input.txt", "sample_output_relpath": "derived/input_output/data/p02657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02657/Fortran/s116237539.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116237539", "user_id": "u359178469"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program ABC169_A\n integer::A,B\n read(*,*)A,B\n write(*,*)A*B\nend program ABC169_A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 7, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s517768631", "group_id": "codeNet:p02657", "input_text": "program b169a\n\nimplicit none\ninteger :: a, b\n\nread *, a, b\n\nprint *, a * b\n\nend program b169a", "language": "Fortran", "metadata": {"date": 1590973277, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02657.html", "problem_id": "p02657", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02657/input.txt", "sample_output_relpath": "derived/input_output/data/p02657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02657/Fortran/s517768631.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517768631", "user_id": "u644436095"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program b169a\n\nimplicit none\ninteger :: a, b\n\nread *, a, b\n\nprint *, a * b\n\nend program b169a", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 93, "cpu_time_ms": 8, "memory_kb": 2796}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s515742655", "group_id": "codeNet:p02660", "input_text": "program main\n implicit none\n integer(8) i, N, lim, m(100), t, ans, exp, level, N1\n !integer(8),allocatable:: A(:,:)\n read(*, *) N\n N1 = N\n lim = 1000000\n !allocate(A(N,2)\n m = 0\n t = 0\n do i = 1,50\n m(i) = t+i\n t = m(i)\n end do\n !read(*, *) (L(i), i = 1,N)\n t = 2\n exp = 0\n level = 0\n ans = 0\n if (N == 1) then\n ans = 0\n else\n do\n if (mod(N,t) == 0) then\n exp = exp + 1\n N = N/t\n if (exp == m(level+1)) then\n level = level + 1\n end if\n else\n ans = ans + level\n exp = 0\n level = 0\n t = t+1\n endif\n if (t > lim) then\n if (N1 == N) then\n ans = ans + 1\n endif\n exit\n endif\n end do\n endif\n write(*, *) ans\nend program main\n", "language": "Fortran", "metadata": {"date": 1590979100, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02660.html", "problem_id": "p02660", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02660/input.txt", "sample_output_relpath": "derived/input_output/data/p02660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02660/Fortran/s515742655.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s515742655", "user_id": "u050276949"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer(8) i, N, lim, m(100), t, ans, exp, level, N1\n !integer(8),allocatable:: A(:,:)\n read(*, *) N\n N1 = N\n lim = 1000000\n !allocate(A(N,2)\n m = 0\n t = 0\n do i = 1,50\n m(i) = t+i\n t = m(i)\n end do\n !read(*, *) (L(i), i = 1,N)\n t = 2\n exp = 0\n level = 0\n ans = 0\n if (N == 1) then\n ans = 0\n else\n do\n if (mod(N,t) == 0) then\n exp = exp + 1\n N = N/t\n if (exp == m(level+1)) then\n level = level + 1\n end if\n else\n ans = ans + level\n exp = 0\n level = 0\n t = t+1\n endif\n if (t > lim) then\n if (N1 == N) then\n ans = ans + 1\n endif\n exit\n endif\n end do\n endif\n write(*, *) ans\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "sample_input": "24\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02660", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N. Consider repeatedly applying the operation below on N:\n\nFirst, choose a positive integer z satisfying all of the conditions below:\n\nz can be represented as z=p^e, where p is a prime number and e is a positive integer;\n\nz divides N;\n\nz is different from all integers chosen in previous operations.\n\nThen, replace N with N/z.\n\nFind the maximum number of times the operation can be applied.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum number of times the operation can be applied.\n\nSample Input 1\n\n24\n\nSample Output 1\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=12.)\n\nChoose z=3 (=3^1). (Now we have N=4.)\n\nChoose z=4 (=2^2). (Now we have N=1.)\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nWe cannot apply the operation at all.\n\nSample Input 3\n\n64\n\nSample Output 3\n\n3\n\nWe can apply the operation three times by, for example, making the following choices:\n\nChoose z=2 (=2^1). (Now we have N=32.)\n\nChoose z=4 (=2^2). (Now we have N=8.)\n\nChoose z=8 (=2^3). (Now we have N=1.)\n\nSample Input 4\n\n1000000007\n\nSample Output 4\n\n1\n\nWe can apply the operation once by, for example, making the following choice:\n\nz=1000000007 (=1000000007^1). (Now we have N=1.)\n\nSample Input 5\n\n997764507000\n\nSample Output 5\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 773, "cpu_time_ms": 19, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s664233245", "group_id": "codeNet:p02663", "input_text": "program main\n implicit none\n integer :: h1, m1, h2, m2, k\n integer :: str, fin, ans\n\n read *, h1, m1, h2, m2, k\n \n str = h1*60+m1\n fin = h2*60+m2\n\n ans = fin-str-k\n print *, ans\n\nend program main\n\n", "language": "Fortran", "metadata": {"date": 1590942067, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02663.html", "problem_id": "p02663", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02663/input.txt", "sample_output_relpath": "derived/input_output/data/p02663/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02663/Fortran/s664233245.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664233245", "user_id": "u353721260"}, "prompt_components": {"gold_output": "270\n", "input_to_evaluate": "program main\n implicit none\n integer :: h1, m1, h2, m2, k\n integer :: str, fin, ans\n\n read *, h1, m1, h2, m2, k\n \n str = h1*60+m1\n fin = h2*60+m2\n\n ans = fin-str-k\n print *, ans\n\nend program main\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn this problem, we use the 24-hour clock.\n\nTakahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.)\nHe has decided to study for K consecutive minutes while he is up.\nWhat is the length of the period in which he can start studying?\n\nConstraints\n\n0 \\le H_1, H_2 \\le 23\n\n0 \\le M_1, M_2 \\le 59\n\nThe time H_1 : M_1 comes before the time H_2 : M_2.\n\nK \\ge 1\n\nTakahashi is up for at least K minutes.\n\nAll values in input are integers (without leading zeros).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH_1 M_1 H_2 M_2 K\n\nOutput\n\nPrint the length of the period in which he can start studying, as an integer.\n\nSample Input 1\n\n10 0 15 0 30\n\nSample Output 1\n\n270\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly three in the afternoon.\nIt takes 30 minutes to do the study, so he can start it in the period between ten o'clock and half-past two. The length of this period is 270 minutes, so we should print 270.\n\nSample Input 2\n\n10 0 12 0 120\n\nSample Output 2\n\n0\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly noon. It takes 120 minutes to do the study, so he has to start it at exactly ten o'clock. Thus, we should print 0.", "sample_input": "10 0 15 0 30\n"}, "reference_outputs": ["270\n"], "source_document_id": "p02663", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn this problem, we use the 24-hour clock.\n\nTakahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.)\nHe has decided to study for K consecutive minutes while he is up.\nWhat is the length of the period in which he can start studying?\n\nConstraints\n\n0 \\le H_1, H_2 \\le 23\n\n0 \\le M_1, M_2 \\le 59\n\nThe time H_1 : M_1 comes before the time H_2 : M_2.\n\nK \\ge 1\n\nTakahashi is up for at least K minutes.\n\nAll values in input are integers (without leading zeros).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH_1 M_1 H_2 M_2 K\n\nOutput\n\nPrint the length of the period in which he can start studying, as an integer.\n\nSample Input 1\n\n10 0 15 0 30\n\nSample Output 1\n\n270\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly three in the afternoon.\nIt takes 30 minutes to do the study, so he can start it in the period between ten o'clock and half-past two. The length of this period is 270 minutes, so we should print 270.\n\nSample Input 2\n\n10 0 12 0 120\n\nSample Output 2\n\n0\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly noon. It takes 120 minutes to do the study, so he has to start it at exactly ten o'clock. Thus, we should print 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 242, "cpu_time_ms": 6, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s042641789", "group_id": "codeNet:p02663", "input_text": "program a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h1, m1, h2, m2, k\n integer(int32):: t1, t2\n\n\n read*, h1, m1, h2, m2, k\n\n t1 = 60*h1+h2\n t2 = 60*h2+h2\n\n print'(i0)', t2-t1-k\nend program a", "language": "Fortran", "metadata": {"date": 1590887175, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02663.html", "problem_id": "p02663", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02663/input.txt", "sample_output_relpath": "derived/input_output/data/p02663/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02663/Fortran/s042641789.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s042641789", "user_id": "u234636620"}, "prompt_components": {"gold_output": "270\n", "input_to_evaluate": "program a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h1, m1, h2, m2, k\n integer(int32):: t1, t2\n\n\n read*, h1, m1, h2, m2, k\n\n t1 = 60*h1+h2\n t2 = 60*h2+h2\n\n print'(i0)', t2-t1-k\nend program a", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn this problem, we use the 24-hour clock.\n\nTakahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.)\nHe has decided to study for K consecutive minutes while he is up.\nWhat is the length of the period in which he can start studying?\n\nConstraints\n\n0 \\le H_1, H_2 \\le 23\n\n0 \\le M_1, M_2 \\le 59\n\nThe time H_1 : M_1 comes before the time H_2 : M_2.\n\nK \\ge 1\n\nTakahashi is up for at least K minutes.\n\nAll values in input are integers (without leading zeros).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH_1 M_1 H_2 M_2 K\n\nOutput\n\nPrint the length of the period in which he can start studying, as an integer.\n\nSample Input 1\n\n10 0 15 0 30\n\nSample Output 1\n\n270\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly three in the afternoon.\nIt takes 30 minutes to do the study, so he can start it in the period between ten o'clock and half-past two. The length of this period is 270 minutes, so we should print 270.\n\nSample Input 2\n\n10 0 12 0 120\n\nSample Output 2\n\n0\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly noon. It takes 120 minutes to do the study, so he has to start it at exactly ten o'clock. Thus, we should print 0.", "sample_input": "10 0 15 0 30\n"}, "reference_outputs": ["270\n"], "source_document_id": "p02663", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn this problem, we use the 24-hour clock.\n\nTakahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.)\nHe has decided to study for K consecutive minutes while he is up.\nWhat is the length of the period in which he can start studying?\n\nConstraints\n\n0 \\le H_1, H_2 \\le 23\n\n0 \\le M_1, M_2 \\le 59\n\nThe time H_1 : M_1 comes before the time H_2 : M_2.\n\nK \\ge 1\n\nTakahashi is up for at least K minutes.\n\nAll values in input are integers (without leading zeros).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH_1 M_1 H_2 M_2 K\n\nOutput\n\nPrint the length of the period in which he can start studying, as an integer.\n\nSample Input 1\n\n10 0 15 0 30\n\nSample Output 1\n\n270\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly three in the afternoon.\nIt takes 30 minutes to do the study, so he can start it in the period between ten o'clock and half-past two. The length of this period is 270 minutes, so we should print 270.\n\nSample Input 2\n\n10 0 12 0 120\n\nSample Output 2\n\n0\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly noon. It takes 120 minutes to do the study, so he has to start it at exactly ten o'clock. Thus, we should print 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 3, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s361387819", "group_id": "codeNet:p02664", "input_text": "program b0530\n \nimplicit none\ncharacter(len=200000) :: t\ninteger :: i\n \nread *, t\n \ndo i = 1, 200000\n if (t(i:i) == '?') then\n t(i:i) = 'D'\n end if\nend do\n \nprint *, trim(t)\n \nend program b0530", "language": "Fortran", "metadata": {"date": 1591409482, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02664.html", "problem_id": "p02664", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02664/input.txt", "sample_output_relpath": "derived/input_output/data/p02664/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02664/Fortran/s361387819.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s361387819", "user_id": "u644436095"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "program b0530\n \nimplicit none\ncharacter(len=200000) :: t\ninteger :: i\n \nread *, t\n \ndo i = 1, 200000\n if (t(i:i) == '?') then\n t(i:i) = 'D'\n end if\nend do\n \nprint *, trim(t)\n \nend program b0530", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 3300}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s957537182", "group_id": "codeNet:p02664", "input_text": "program NOMURA2020B\n character(200000)::T\n integer(8)::ans=0\n read(*,*)T\n do i=1,len_trim(T)\n if(T(i:i)=='?') T(i:i)='D'\n end do\n write(*,*)T\nend program NOMURA2020B", "language": "Fortran", "metadata": {"date": 1590894021, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02664.html", "problem_id": "p02664", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02664/input.txt", "sample_output_relpath": "derived/input_output/data/p02664/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02664/Fortran/s957537182.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s957537182", "user_id": "u359178469"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "program NOMURA2020B\n character(200000)::T\n integer(8)::ans=0\n read(*,*)T\n do i=1,len_trim(T)\n if(T(i:i)=='?') T(i:i)='D'\n end do\n write(*,*)T\nend program NOMURA2020B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s038521122", "group_id": "codeNet:p02664", "input_text": "program NOMURA2020B\n character(200000)::T\n read(*,*)T\n do i=1,len_trim(T)\n if(T(i:i)=='?') T(i:i)='D'\n end do\n write(*,*)trim(T)\nend program NOMURA2020B ", "language": "Fortran", "metadata": {"date": 1590888093, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02664.html", "problem_id": "p02664", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02664/input.txt", "sample_output_relpath": "derived/input_output/data/p02664/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02664/Fortran/s038521122.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s038521122", "user_id": "u359178469"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "program NOMURA2020B\n character(200000)::T\n read(*,*)T\n do i=1,len_trim(T)\n if(T(i:i)=='?') T(i:i)='D'\n end do\n write(*,*)trim(T)\nend program NOMURA2020B ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 3224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s548833396", "group_id": "codeNet:p02665", "input_text": "program folia\n implicit none\n integer :: n, i\n integer(8) :: a(0:100001) = 0, p(0:60) = 0, x = 0, m = 0\n read(*,*) n\n read(*,*) a(0:n)\n p(0) = 1\n do i = 1, 60\n p(i) = (p(i - 1) - a(i - 1)) * 2\n if (a(i) > p(i)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n do i = n, 61, -1\n m = m + a(i)\n x = x + m\n end do\n do i = min(n, 60), 0, -1\n m = min(m + a(i), p(i))\n x = x + m\n end do\n write(*,'(i0)') x\nend program folia", "language": "Fortran", "metadata": {"date": 1593468167, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02665.html", "problem_id": "p02665", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02665/input.txt", "sample_output_relpath": "derived/input_output/data/p02665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02665/Fortran/s548833396.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s548833396", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program folia\n implicit none\n integer :: n, i\n integer(8) :: a(0:100001) = 0, p(0:60) = 0, x = 0, m = 0\n read(*,*) n\n read(*,*) a(0:n)\n p(0) = 1\n do i = 1, 60\n p(i) = (p(i - 1) - a(i - 1)) * 2\n if (a(i) > p(i)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n do i = n, 61, -1\n m = m + a(i)\n x = x + m\n end do\n do i = min(n, 60), 0, -1\n m = min(m + a(i), p(i))\n x = x + m\n end do\n write(*,'(i0)') x\nend program folia", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "sample_input": "3\n0 1 1 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02665", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 40, "memory_kb": 3732}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s556890000", "group_id": "codeNet:p02665", "input_text": "program folia\n implicit none\n integer :: n, i\n integer(8) :: a(0:100001) = 0, p(0:60) = 0, r, m = 0\n read(*,*) n\n read(*,*) a(0:n)\n p = (/(ibset(0_8, i), i = 0, 60)/)\n do i = min(60, n), 0, -1\n r = (a(i + 1) + 1) / 2 + a(i)\n if (r > p(i)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n r = 0\n do i = n, 61, -1\n m = m + a(i)\n r = r + m\n end do\n do i = min(n, 60), 1, -1\n m = min(m + a(i), (p(i - 1) - a(i - 1)) * 2)\n r = r + m\n end do\n write(*,'(i0)') r + 1\nend program folia", "language": "Fortran", "metadata": {"date": 1593467652, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02665.html", "problem_id": "p02665", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02665/input.txt", "sample_output_relpath": "derived/input_output/data/p02665/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02665/Fortran/s556890000.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s556890000", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program folia\n implicit none\n integer :: n, i\n integer(8) :: a(0:100001) = 0, p(0:60) = 0, r, m = 0\n read(*,*) n\n read(*,*) a(0:n)\n p = (/(ibset(0_8, i), i = 0, 60)/)\n do i = min(60, n), 0, -1\n r = (a(i + 1) + 1) / 2 + a(i)\n if (r > p(i)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n r = 0\n do i = n, 61, -1\n m = m + a(i)\n r = r + m\n end do\n do i = min(n, 60), 1, -1\n m = min(m + a(i), (p(i - 1) - a(i - 1)) * 2)\n r = r + m\n end do\n write(*,'(i0)') r + 1\nend program folia", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "sample_input": "3\n0 1 1 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02665", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence of length N+1: A_0, A_1, A_2, \\ldots, A_N. Is there a binary tree of depth N such that, for each d = 0, 1, \\ldots, N, there are exactly A_d leaves at depth d? If such a tree exists, print the maximum possible number of vertices in such a tree; otherwise, print -1.\n\nNotes\n\nA binary tree is a rooted tree such that each vertex has at most two direct children.\n\nA leaf in a binary tree is a vertex with zero children.\n\nThe depth of a vertex v in a binary tree is the distance from the tree's root to v. (The root has the depth of 0.)\n\nThe depth of a binary tree is the maximum depth of a vertex in the tree.\n\nConstraints\n\n0 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^{8} (0 \\leq i \\leq N)\n\nA_N \\geq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_0 A_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the answer as an integer.\n\nSample Input 1\n\n3\n0 1 1 2\n\nSample Output 1\n\n7\n\nBelow is the tree with the maximum possible number of vertices. It has seven vertices, so we should print 7.\n\nSample Input 2\n\n4\n0 0 1 0 2\n\nSample Output 2\n\n10\n\nSample Input 3\n\n2\n0 3 1\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n1\n1 1\n\nSample Output 4\n\n-1\n\nSample Input 5\n\n10\n0 0 1 1 2 3 5 8 13 21 34\n\nSample Output 5\n\n264", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 3920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s752563993", "group_id": "codeNet:p02675", "input_text": " PROGRAM piyo\n IMPLICIT NONE\n integer :: n\n \n read*,n\n \n n = n - n/10*10\n \n select case( n )\n case( 2,4,5,7,9 )\n print*,'hon'\n case( 0,1,6,8 )\n print*,'pon'\n case( 3 )\n print*,'bon'\n \n end select\n \n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1589763771, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02675/input.txt", "sample_output_relpath": "derived/input_output/data/p02675/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02675/Fortran/s752563993.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s752563993", "user_id": "u171356453"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": " PROGRAM piyo\n IMPLICIT NONE\n integer :: n\n \n read*,n\n \n n = n - n/10*10\n \n select case( n )\n case( 2,4,5,7,9 )\n print*,'hon'\n case( 0,1,6,8 )\n print*,'pon'\n case( 3 )\n print*,'bon'\n \n end select\n \n \n \n \n END PROGRAM", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "sample_input": "16\n"}, "reference_outputs": ["pon\n"], "source_document_id": "p02675", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 348, "cpu_time_ms": 5, "memory_kb": 2796}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s624669694", "group_id": "codeNet:p02676", "input_text": "PROGRAM c168b\n\nIMPLICIT NONE\nINTEGER :: i, K\nCHARACTER(LEN=100) :: S\n\nREAD *, K\nREAD *, S\n\ni = LEN_TRIM(S)\n\nIF (i > K) THEN\n PRINT *, S(1:K), \"...\"\nELSE\n PRINT *, S\nEND IF\n\nEND PROGRAM c168b", "language": "Fortran", "metadata": {"date": 1589764344, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02676/input.txt", "sample_output_relpath": "derived/input_output/data/p02676/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02676/Fortran/s624669694.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624669694", "user_id": "u644436095"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "PROGRAM c168b\n\nIMPLICIT NONE\nINTEGER :: i, K\nCHARACTER(LEN=100) :: S\n\nREAD *, K\nREAD *, S\n\ni = LEN_TRIM(S)\n\nIF (i > K) THEN\n PRINT *, S(1:K), \"...\"\nELSE\n PRINT *, S\nEND IF\n\nEND PROGRAM c168b", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 2, "memory_kb": 2852}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s740771004", "group_id": "codeNet:p02676", "input_text": "program ABC168_B\n character(100)::S\n read(*,*)K\n read(*,*)S\n if(len_trim(S)<=K) then\n write(*,*)trim(S)\n else\n write(*,*)S(1:K),'...'\n end if\nend program ABC168_B", "language": "Fortran", "metadata": {"date": 1589764292, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02676/input.txt", "sample_output_relpath": "derived/input_output/data/p02676/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02676/Fortran/s740771004.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740771004", "user_id": "u359178469"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "program ABC168_B\n character(100)::S\n read(*,*)K\n read(*,*)S\n if(len_trim(S)<=K) then\n write(*,*)trim(S)\n else\n write(*,*)S(1:K),'...'\n end if\nend program ABC168_B", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 4, "memory_kb": 2796}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s601562737", "group_id": "codeNet:p02677", "input_text": "program abc168C\n implicit none\n\n integer(8) :: a, b\n real(8) :: h, m\n real(8), parameter :: pi = 3.141592653589_8\n real(8) :: int1, int2, realp\n read(*,*) a, b, h, m\n \n int1 = real(a**2+b**2, kind=8)\n int2 = real(2*a*b, kind=8)\n realp = cos((h/6-m/30+m/360)*pi)\n\n write(*,*) sqrt(int1-int2*realp)\n\n stop\nend program abc168C", "language": "Fortran", "metadata": {"date": 1589767392, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02677/input.txt", "sample_output_relpath": "derived/input_output/data/p02677/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02677/Fortran/s601562737.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601562737", "user_id": "u765134750"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "program abc168C\n implicit none\n\n integer(8) :: a, b\n real(8) :: h, m\n real(8), parameter :: pi = 3.141592653589_8\n real(8) :: int1, int2, realp\n read(*,*) a, b, h, m\n \n int1 = real(a**2+b**2, kind=8)\n int2 = real(2*a*b, kind=8)\n realp = cos((h/6-m/30+m/360)*pi)\n\n write(*,*) sqrt(int1-int2*realp)\n\n stop\nend program abc168C", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 2, "memory_kb": 3304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s275793548", "group_id": "codeNet:p02677", "input_text": "program main\nreal*8 :: a,b,h,m,pi,om1,om2,x1,y1,x2,y2,t,ans\nread(*,*) a,b,h,m\n\npi = 3.141592653589793d0\nom1 = 2.d0*pi/(12.d0 * 60.d0)\nom2 = 2.d0*pi/60.d0\nt = 60.d0 * h + m\nx1 = a*cos(om1*t)\ny1 = a*sin(om1*t)\nx2 = b*cos(om2*t)\ny2 = b*sin(om2*t)\n\nans = sqrt((x1 - x2)**2 + (y1 - y2)**2)\nwrite(*,*)ans,om1,om2,t\nend program", "language": "Fortran", "metadata": {"date": 1589766270, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02677/input.txt", "sample_output_relpath": "derived/input_output/data/p02677/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02677/Fortran/s275793548.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s275793548", "user_id": "u850779832"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "program main\nreal*8 :: a,b,h,m,pi,om1,om2,x1,y1,x2,y2,t,ans\nread(*,*) a,b,h,m\n\npi = 3.141592653589793d0\nom1 = 2.d0*pi/(12.d0 * 60.d0)\nom2 = 2.d0*pi/60.d0\nt = 60.d0 * h + m\nx1 = a*cos(om1*t)\ny1 = a*sin(om1*t)\nx2 = b*cos(om2*t)\ny2 = b*sin(om2*t)\n\nans = sqrt((x1 - x2)**2 + (y1 - y2)**2)\nwrite(*,*)ans,om1,om2,t\nend program", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 320, "cpu_time_ms": 3, "memory_kb": 3244}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s830616852", "group_id": "codeNet:p02677", "input_text": "program main\n implicit none\n integer i\n double precision dX, dY, P, ans, A, B, H, M\n read(*, *)A, B, H, M\n !read(*, *) (L(i), i = 1,N)\n P = 3.141592653589793238462643383279d0\n P = 2*P\n P = P/12\n H = H+M/60\n M = M/5\n dX = A*cos(-P*H)-B*cos(-P*M)\n dY = A*sin(-P*H)-B*sin(-P*M)\n ans = (dX**2+dY**2)**(0.5)\n write(*, *) ans\nend program main", "language": "Fortran", "metadata": {"date": 1589766113, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02677/input.txt", "sample_output_relpath": "derived/input_output/data/p02677/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02677/Fortran/s830616852.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830616852", "user_id": "u050276949"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "program main\n implicit none\n integer i\n double precision dX, dY, P, ans, A, B, H, M\n read(*, *)A, B, H, M\n !read(*, *) (L(i), i = 1,N)\n P = 3.141592653589793238462643383279d0\n P = 2*P\n P = P/12\n H = H+M/60\n M = M/5\n dX = A*cos(-P*H)-B*cos(-P*M)\n dY = A*sin(-P*H)-B*sin(-P*M)\n ans = (dX**2+dY**2)**(0.5)\n write(*, *) ans\nend program main", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 350, "cpu_time_ms": 2, "memory_kb": 3472}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s109368412", "group_id": "codeNet:p02677", "input_text": " PROGRAM Colon\n IMPLICIT NONE\n real(16),parameter :: pi=3.141592653589793238\n real(16) :: a,b,h,m, ans2\n real(16) :: angleA,angleB,angleSub\n \n \n read*,a,b,h,m\n \n \n angleA = h / real(12) * real(2) * pi\n angleB = m / real(60) * real(2) * pi\n \n ! print*,angleA,angleB,abs(angleA-angleB)\n \n angleSub = max(angleA,angleB) - min(angleA,angleB)\n ! print*,angleSub\n \n ans2 = a*a + b*b - (real(2)*a*b*cos( angleSub ))\n print*,sqrt(ans2)\n \n ! print*,cos( angleSub )\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1589765982, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02677/input.txt", "sample_output_relpath": "derived/input_output/data/p02677/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02677/Fortran/s109368412.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s109368412", "user_id": "u171356453"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": " PROGRAM Colon\n IMPLICIT NONE\n real(16),parameter :: pi=3.141592653589793238\n real(16) :: a,b,h,m, ans2\n real(16) :: angleA,angleB,angleSub\n \n \n read*,a,b,h,m\n \n \n angleA = h / real(12) * real(2) * pi\n angleB = m / real(60) * real(2) * pi\n \n ! print*,angleA,angleB,abs(angleA-angleB)\n \n angleSub = max(angleA,angleB) - min(angleA,angleB)\n ! print*,angleSub\n \n ans2 = a*a + b*b - (real(2)*a*b*cos( angleSub ))\n print*,sqrt(ans2)\n \n ! print*,cos( angleSub )\n \n END PROGRAM", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 587, "cpu_time_ms": 4, "memory_kb": 2924}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s284251386", "group_id": "codeNet:p02678", "input_text": " MODULE intQueueMod\n implicit none\n! Module for QUEUE : First in, First out\n! reference : プログラミングコンテスト攻略のための\n! アルゴリズムとデータ構造\n\n integer(16),parameter :: binSize = 10**6\n integer(16),parameter :: precision = 16\n \n type intQueue\n private\n integer(precision) :: bin( 1:binSize ) = 0\n integer(precision) :: head = 1, tail = 1\n !head : Where the head value is.\n !tail : Where the blank next to tail is.\n contains\n procedure,public,pass :: initialize => intInit\n procedure,public,pass :: isEmpty => intIsEmpty\n procedure,public,pass :: isFull => intIsFull\n procedure,public,pass :: enQueue => intEnQ\n procedure,public,pass :: deQueue => intDeQ\n end type\n \n contains\n!Reset queue. Not nessesary in first time.\n pure subroutine intInit( q )\n implicit none\n class(intQueue),intent(inout) :: q\n \n q%head = 1\n q%tail = 1\n end subroutine intInit\n \n!Check status\n pure function intIsEmpty( q ) result( ans )\n implicit none\n class(intQueue),intent(in) :: q\n logical :: ans\n \n ans = q%head==q%tail\n end function intIsEmpty\n \n \n pure function intIsFull( q ) result( ans )\n implicit none\n class(intQueue),intent(in) :: q\n logical :: ans\n \n ans = q%head==mod( q%tail+1,binSize )\n end function intIsFull\n\n!set x to tail\n subroutine intEnQ( q,x )\n implicit none\n class(intQueue) ,intent(inout) :: q\n integer(precision),intent(in ) :: x\n \n if( q%isFull() )then\n print*,'Queue is full,Error!';stop\n else\n q%bin(q%tail) = x\n if( q%tail==binSize )then\n q%tail = 1\n else\n q%tail = q%tail + 1\n end if\n end if\n end subroutine intEnQ\n \n!get x from head\n impure function intDeQ( q ) result( x )\n implicit none\n class(intQueue),intent(inout) :: q\n integer(precision) :: x\n \n if( q%isEmpty() )then\n print*,'Stack is empty, Error!';stop\n else\n x = q%bin(q%head)\n if( q%head==binSize )then\n q%head = 1\n else\n q%head = q%head + 1\n end if\n end if\n end function intDeQ\n END MODULE intQueueMod\n \n!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\n module piyoMod\n use intQueueMod\n \n type rooms\n integer(16),allocatable :: nei(:)\n integer(16) :: numNei=0\n end type\n \n integer(16),allocatable :: flag(:)\n type(intQueue) :: nextQ,beforeQ\n \n contains\n subroutine solve( rIn,roomNum,before )\n implicit none\n type(rooms),intent(in),allocatable :: rIn(:)\n integer(16),intent(in) :: roomNum,before\n integer(16) :: i\n \n if( flag(roomNum)/=-1 ) return\n flag( roomNum ) = before\n if( rIn(roomNum)%numNei==0 ) return\n \n do i = 1,rIn(roomNum)%numNei\n call nextQ%enQueue( rIn(roomNum)%nei(i) )\n call beforeQ%enQueue( roomNum )\n end do\n \n end subroutine\n end module\n \n PROGRAM doubleDots\n use piyoMod\n IMPLICIT NONE\n integer(16) :: n,m,numNei\n integer(16),allocatable :: a(:),b(:)\n type(rooms),allocatable :: room(:)\n integer(16) :: i\n integer(16),allocatable :: buffer(:)\n \n read*,n,m\n allocate( a(m),b(m),room(n),flag(n) )\n flag(1:n) = -1\n do i = 1,m\n read*,a(i),b(i)\n end do\n \n do i = 1,m\n room(a(i))%numNei = room(a(i))%numNei + 1\n numNei = room(a(i))%numNei\n allocate( buffer(numNei) )\n buffer(1:numNei-1) = room(a(i))%nei\n if(allocated(room(a(i))%nei) )deallocate( room(a(i))%nei )\n buffer(numNei) = b(i)\n room(a(i))%nei = buffer(1:numNei)\n deallocate( buffer )\n \n room(b(i))%numNei = room(b(i))%numNei + 1\n numNei = room(b(i))%numNei\n allocate( buffer(numNei) )\n buffer(1:numNei-1) = room(b(i))%nei\n if(allocated(room(b(i))%nei) )deallocate( room(b(i))%nei )\n buffer(numNei) = a(i)\n room(b(i))%nei = buffer(1:numNei)\n deallocate( buffer )\n end do\n \n \n call nextQ%enQueue(1_16)\n call beforeQ%enQueue(0_16) !dummy\n ! do while( .true. )\n ! if( nextQ%isEmpty() ) exit\n ! \n ! call solve( room,nextQ%deQueue(),beforeQ%deQueue() )\n ! end do\n \n \n \n \n if( count(flag(2:n)==-1) >=1 )then\n print*,'No';stop\n end if\n \n print*,'Yes'\n do i = 2,n\n print*,flag(i)\n end do\n \n \n \n \n \n \n ! print*,n,m\n ! do i = 1,m\n ! print*,a(i),b(i)\n ! end do\n \n \n ! do i= 1,n\n ! print*,'room',i,room(i)%numNei\n ! print*,room(i)%nei\n ! end do\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1589926055, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02678.html", "problem_id": "p02678", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02678/input.txt", "sample_output_relpath": "derived/input_output/data/p02678/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02678/Fortran/s284251386.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s284251386", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Yes\n1\n2\n2\n", "input_to_evaluate": " MODULE intQueueMod\n implicit none\n! Module for QUEUE : First in, First out\n! reference : プログラミングコンテスト攻略のための\n! アルゴリズムとデータ構造\n\n integer(16),parameter :: binSize = 10**6\n integer(16),parameter :: precision = 16\n \n type intQueue\n private\n integer(precision) :: bin( 1:binSize ) = 0\n integer(precision) :: head = 1, tail = 1\n !head : Where the head value is.\n !tail : Where the blank next to tail is.\n contains\n procedure,public,pass :: initialize => intInit\n procedure,public,pass :: isEmpty => intIsEmpty\n procedure,public,pass :: isFull => intIsFull\n procedure,public,pass :: enQueue => intEnQ\n procedure,public,pass :: deQueue => intDeQ\n end type\n \n contains\n!Reset queue. Not nessesary in first time.\n pure subroutine intInit( q )\n implicit none\n class(intQueue),intent(inout) :: q\n \n q%head = 1\n q%tail = 1\n end subroutine intInit\n \n!Check status\n pure function intIsEmpty( q ) result( ans )\n implicit none\n class(intQueue),intent(in) :: q\n logical :: ans\n \n ans = q%head==q%tail\n end function intIsEmpty\n \n \n pure function intIsFull( q ) result( ans )\n implicit none\n class(intQueue),intent(in) :: q\n logical :: ans\n \n ans = q%head==mod( q%tail+1,binSize )\n end function intIsFull\n\n!set x to tail\n subroutine intEnQ( q,x )\n implicit none\n class(intQueue) ,intent(inout) :: q\n integer(precision),intent(in ) :: x\n \n if( q%isFull() )then\n print*,'Queue is full,Error!';stop\n else\n q%bin(q%tail) = x\n if( q%tail==binSize )then\n q%tail = 1\n else\n q%tail = q%tail + 1\n end if\n end if\n end subroutine intEnQ\n \n!get x from head\n impure function intDeQ( q ) result( x )\n implicit none\n class(intQueue),intent(inout) :: q\n integer(precision) :: x\n \n if( q%isEmpty() )then\n print*,'Stack is empty, Error!';stop\n else\n x = q%bin(q%head)\n if( q%head==binSize )then\n q%head = 1\n else\n q%head = q%head + 1\n end if\n end if\n end function intDeQ\n END MODULE intQueueMod\n \n!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\n module piyoMod\n use intQueueMod\n \n type rooms\n integer(16),allocatable :: nei(:)\n integer(16) :: numNei=0\n end type\n \n integer(16),allocatable :: flag(:)\n type(intQueue) :: nextQ,beforeQ\n \n contains\n subroutine solve( rIn,roomNum,before )\n implicit none\n type(rooms),intent(in),allocatable :: rIn(:)\n integer(16),intent(in) :: roomNum,before\n integer(16) :: i\n \n if( flag(roomNum)/=-1 ) return\n flag( roomNum ) = before\n if( rIn(roomNum)%numNei==0 ) return\n \n do i = 1,rIn(roomNum)%numNei\n call nextQ%enQueue( rIn(roomNum)%nei(i) )\n call beforeQ%enQueue( roomNum )\n end do\n \n end subroutine\n end module\n \n PROGRAM doubleDots\n use piyoMod\n IMPLICIT NONE\n integer(16) :: n,m,numNei\n integer(16),allocatable :: a(:),b(:)\n type(rooms),allocatable :: room(:)\n integer(16) :: i\n integer(16),allocatable :: buffer(:)\n \n read*,n,m\n allocate( a(m),b(m),room(n),flag(n) )\n flag(1:n) = -1\n do i = 1,m\n read*,a(i),b(i)\n end do\n \n do i = 1,m\n room(a(i))%numNei = room(a(i))%numNei + 1\n numNei = room(a(i))%numNei\n allocate( buffer(numNei) )\n buffer(1:numNei-1) = room(a(i))%nei\n if(allocated(room(a(i))%nei) )deallocate( room(a(i))%nei )\n buffer(numNei) = b(i)\n room(a(i))%nei = buffer(1:numNei)\n deallocate( buffer )\n \n room(b(i))%numNei = room(b(i))%numNei + 1\n numNei = room(b(i))%numNei\n allocate( buffer(numNei) )\n buffer(1:numNei-1) = room(b(i))%nei\n if(allocated(room(b(i))%nei) )deallocate( room(b(i))%nei )\n buffer(numNei) = a(i)\n room(b(i))%nei = buffer(1:numNei)\n deallocate( buffer )\n end do\n \n \n call nextQ%enQueue(1_16)\n call beforeQ%enQueue(0_16) !dummy\n ! do while( .true. )\n ! if( nextQ%isEmpty() ) exit\n ! \n ! call solve( room,nextQ%deQueue(),beforeQ%deQueue() )\n ! end do\n \n \n \n \n if( count(flag(2:n)==-1) >=1 )then\n print*,'No';stop\n end if\n \n print*,'Yes'\n do i = 2,n\n print*,flag(i)\n end do\n \n \n \n \n \n \n ! print*,n,m\n ! do i = 1,m\n ! print*,a(i),b(i)\n ! end do\n \n \n ! do i= 1,n\n ! print*,'room',i,room(i)%numNei\n ! print*,room(i)%nei\n ! end do\n \n END PROGRAM", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThere is a cave.\n\nThe cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 is a special room with an entrance from the outside.\n\nIt is dark in the cave, so we have decided to place a signpost in each room except Room 1. The signpost in each room will point to one of the rooms directly connected to that room with a passage.\n\nSince it is dangerous in the cave, our objective is to satisfy the condition below for each room except Room 1.\n\nIf you start in that room and repeatedly move to the room indicated by the signpost in the room you are in, you will reach Room 1 after traversing the minimum number of passages possible.\n\nDetermine whether there is a way to place signposts satisfying our objective, and print one such way if it exists.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq N\\ (1 \\leq i \\leq M)\n\nA_i \\neq B_i\\ (1 \\leq i \\leq M)\n\nOne can travel between any two rooms by traversing passages.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nIf there is no way to place signposts satisfying the objective, print No.\n\nOtherwise, print N lines. The first line should contain Yes, and the i-th line (2 \\leq i \\leq N) should contain the integer representing the room indicated by the signpost in Room i.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 2\n\nSample Output 1\n\nYes\n1\n2\n2\n\nIf we place the signposts as described in the sample output, the following happens:\n\nStarting in Room 2, you will reach Room 1 after traversing one passage: (2) \\to 1. This is the minimum number of passages possible.\n\nStarting in Room 3, you will reach Room 1 after traversing two passages: (3) \\to 2 \\to 1. This is the minimum number of passages possible.\n\nStarting in Room 4, you will reach Room 1 after traversing two passages: (4) \\to 2 \\to 1. This is the minimum number of passages possible.\n\nThus, the objective is satisfied.\n\nSample Input 2\n\n6 9\n3 4\n6 1\n2 4\n5 3\n4 6\n1 5\n6 2\n4 5\n5 6\n\nSample Output 2\n\nYes\n6\n5\n5\n1\n1\n\nIf there are multiple solutions, any of them will be accepted.", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 2\n"}, "reference_outputs": ["Yes\n1\n2\n2\n"], "source_document_id": "p02678", "source_text": "Score: 400 points\n\nProblem Statement\n\nThere is a cave.\n\nThe cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 is a special room with an entrance from the outside.\n\nIt is dark in the cave, so we have decided to place a signpost in each room except Room 1. The signpost in each room will point to one of the rooms directly connected to that room with a passage.\n\nSince it is dangerous in the cave, our objective is to satisfy the condition below for each room except Room 1.\n\nIf you start in that room and repeatedly move to the room indicated by the signpost in the room you are in, you will reach Room 1 after traversing the minimum number of passages possible.\n\nDetermine whether there is a way to place signposts satisfying our objective, and print one such way if it exists.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq N\\ (1 \\leq i \\leq M)\n\nA_i \\neq B_i\\ (1 \\leq i \\leq M)\n\nOne can travel between any two rooms by traversing passages.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nIf there is no way to place signposts satisfying the objective, print No.\n\nOtherwise, print N lines. The first line should contain Yes, and the i-th line (2 \\leq i \\leq N) should contain the integer representing the room indicated by the signpost in Room i.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 2\n\nSample Output 1\n\nYes\n1\n2\n2\n\nIf we place the signposts as described in the sample output, the following happens:\n\nStarting in Room 2, you will reach Room 1 after traversing one passage: (2) \\to 1. This is the minimum number of passages possible.\n\nStarting in Room 3, you will reach Room 1 after traversing two passages: (3) \\to 2 \\to 1. This is the minimum number of passages possible.\n\nStarting in Room 4, you will reach Room 1 after traversing two passages: (4) \\to 2 \\to 1. This is the minimum number of passages possible.\n\nThus, the objective is satisfied.\n\nSample Input 2\n\n6 9\n3 4\n6 1\n2 4\n5 3\n4 6\n1 5\n6 2\n4 5\n5 6\n\nSample Output 2\n\nYes\n6\n5\n5\n1\n1\n\nIf there are multiple solutions, any of them will be accepted.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5117, "cpu_time_ms": 2206, "memory_kb": 36504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s364634062", "group_id": "codeNet:p02681", "input_text": "PROGRAM c167a\n\nIMPLICIT NONE\nCHARACTER(LEN=10) :: S\nCHARACTER(LEN=11) :: T\nINTEGER :: b\n\nREAD *, S\nREAD *, T\n\nb = LEN_TRIM(T)\n \n IF (T(1 : b-1) == TRIM(S)) THEN\n PRINT *, 'Yes'\n ELSE\n PRINT *, 'No'\n END IF\n \nEND PROGRAM c167a", "language": "Fortran", "metadata": {"date": 1589159808, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02681/input.txt", "sample_output_relpath": "derived/input_output/data/p02681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02681/Fortran/s364634062.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364634062", "user_id": "u644436095"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "PROGRAM c167a\n\nIMPLICIT NONE\nCHARACTER(LEN=10) :: S\nCHARACTER(LEN=11) :: T\nINTEGER :: b\n\nREAD *, S\nREAD *, T\n\nb = LEN_TRIM(T)\n \n IF (T(1 : b-1) == TRIM(S)) THEN\n PRINT *, 'Yes'\n ELSE\n PRINT *, 'No'\n END IF\n \nEND PROGRAM c167a", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 2, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s651050450", "group_id": "codeNet:p02681", "input_text": "program registration\n implicit none\n character(11) :: s, t\n integer :: n\n read(*,*) s\n read(*,*) t\n n = len_trim(s)\n if (s(1:n) == t(1:n)) then\n write(*,'(a)') \"Yes\"\n else\n write(*,'(a)') \"No\"\n end if\nend program registration", "language": "Fortran", "metadata": {"date": 1589158922, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02681/input.txt", "sample_output_relpath": "derived/input_output/data/p02681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02681/Fortran/s651050450.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651050450", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program registration\n implicit none\n character(11) :: s, t\n integer :: n\n read(*,*) s\n read(*,*) t\n n = len_trim(s)\n if (s(1:n) == t(1:n)) then\n write(*,'(a)') \"Yes\"\n else\n write(*,'(a)') \"No\"\n end if\nend program registration", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 240, "cpu_time_ms": 2, "memory_kb": 2924}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s846267271", "group_id": "codeNet:p02682", "input_text": "program main\n\timplicit none\n integer a, b, c, k, i\n read(*,*)a, b, c, k\n if (a>=k.or.a+b>=k) then\n \twrite(*,*)a\n else\n \ti = a-(k-a-b)\n write(*,*)i\n\tend if\nend program main", "language": "Fortran", "metadata": {"date": 1590896709, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02682.html", "problem_id": "p02682", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02682/input.txt", "sample_output_relpath": "derived/input_output/data/p02682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02682/Fortran/s846267271.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s846267271", "user_id": "u552145906"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n\timplicit none\n integer a, b, c, k, i\n read(*,*)a, b, c, k\n if (a>=k.or.a+b>=k) then\n \twrite(*,*)a\n else\n \ti = a-(k-a-b)\n write(*,*)i\n\tend if\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 196, "cpu_time_ms": 7, "memory_kb": 2800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s238425898", "group_id": "codeNet:p02683", "input_text": "program ABC167_C\n integer(8)::N,M,X,cost,ans=10000000\n integer(8),allocatable::C(:),A(:,:),S(:)\n read(*,*)N,M,X\n allocate(C(N),A(N,M),S(M))\n do i=1,N\n read(*,*)C(i),A(i,:)\n end do\n do i=0,2**N-1\n S=0\n cost=0\n do j=0,N-1\n if(btest(i,j)) then !iのj+1番目が1なら真\n do k=1,m\n S(k)=S(k)+A(j+1,k)\n end do\n cost=cost+C(j+1)\n end if\n if(minval(S)>=X) ans=min(cost,ans)\n end do\n end do\n if(ans==10000000) then\n write(*,*)'-1'\n else\n write(*,*)ans\n end if\nend program ABC167_C", "language": "Fortran", "metadata": {"date": 1589684266, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/Fortran/s238425898.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s238425898", "user_id": "u359178469"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "program ABC167_C\n integer(8)::N,M,X,cost,ans=10000000\n integer(8),allocatable::C(:),A(:,:),S(:)\n read(*,*)N,M,X\n allocate(C(N),A(N,M),S(M))\n do i=1,N\n read(*,*)C(i),A(i,:)\n end do\n do i=0,2**N-1\n S=0\n cost=0\n do j=0,N-1\n if(btest(i,j)) then !iのj+1番目が1なら真\n do k=1,m\n S(k)=S(k)+A(j+1,k)\n end do\n cost=cost+C(j+1)\n end if\n if(minval(S)>=X) ans=min(cost,ans)\n end do\n end do\n if(ans==10000000) then\n write(*,*)'-1'\n else\n write(*,*)ans\n end if\nend program ABC167_C", "problem_context": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "sample_input": "3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n"}, "reference_outputs": ["120\n"], "source_document_id": "p02683", "source_text": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2872}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s207628170", "group_id": "codeNet:p02683", "input_text": " PROGRAM skillUp\n IMPLICIT NONE\n integer(16) :: n,m,x\n integer(16),allocatable :: c(:),a(:,:),su(:)\n integer(16) :: i,k\n logical,allocatable :: flag(:)\n \n read*,n,m,x\n allocate( c(n), a(n,m),flag(n),su(m) )\n do i = 1,n\n read*,c(i),a(i,1:m)\n end do\n \n outer:do i = i,2**n-1\n do k = 1,n\n flag(k) = btest( i,k-1 )\n end do\n ! print*,flag\n \n do k = 1,m\n su(k) = sum( a(:,k),flag )\n end do\n !print*,su\n do k = 1,m\n if( su(k)= x) ans = min(ans,cnt)\n end do\n if (ans == 1000000000) ans=-1\n print'(i0)', ans\nend program main", "language": "Fortran", "metadata": {"date": 1589160144, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/Fortran/s667913154.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s667913154", "user_id": "u234636620"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32)::n,m,i,x,j,k,ans,cnt\n integer(int32), allocatable:: c(:), a(:,:),r(:)\n logical,allocatable:: buy(:)\n\n read*, n,m,x\n\n allocate(c(n), a(m,n), r(m))\n allocate(buy(n))\n\n do i=1,n\n read*, c(i), a(:,i)\n end do\n ans = 1000000000\n do i=0,2**n\n do j=1,n\n buy(j) = btest(i,j-1)\n end do\n r(:) = 0\n cnt=0\n do j=1,n\n if (buy(j))then\n r(:) = r(:) + a(:,j)\n cnt=cnt+c(j)\n end if\n end do\n if (minval(r) >= x) ans = min(ans,cnt)\n end do\n if (ans == 1000000000) ans=-1\n print'(i0)', ans\nend program main", "problem_context": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "sample_input": "3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n"}, "reference_outputs": ["120\n"], "source_document_id": "p02683", "source_text": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 727, "cpu_time_ms": 4, "memory_kb": 2844}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s331115223", "group_id": "codeNet:p02685", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,m,k,ans,i,c,f\n integer(int64), allocatable:: frac(:), ifrac(:)\n integer(int64),parameter:: md = 998244353\n\n read*, n,m,k\n\n allocate(frac(0:n), ifrac(0:n))\n frac(0) = 1\n ifrac(0) = 1\n do i=1,n\n frac(i) = mod(frac(i-1)*i,md)\n ifrac(i) = inv(frac(i),md)\n end do\n\n do i=0,k\n f = mod(m*factorial(m-1,n-i-1,md),md)\n c = comb(n-1,i,md)\n ans = mod(ans + mod(f*c,md),md)\n end do\n\n print'(i0)', ans\ncontains\n function comb(a,b,md) result(ret)\n integer(int64):: a,b,md\n integer(int64):: ret\n ret = mod(mod(frac(a)*ifrac(b),md)*ifrac(a-b),md)\n end function\n\n function inv(x,md) result(ret)\n integer(int64),intent(in):: x,md\n integer(int64):: ret\n ret = factorial(x,md-2,md)\n end function\n\n function factorial(a,b,md) result(ret)\n integer(int64):: a,b,md\n integer(int64):: aa,bb,ret\n aa = a\n bb = b\n ret = 1\n do while(bb > 0)\n if (mod(bb,2_8)/=0) ret=mod(ret*aa,md)\n aa=mod(aa*aa,md)\n bb=bb/2\n end do\n end function\nend program main", "language": "Fortran", "metadata": {"date": 1589167580, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02685.html", "problem_id": "p02685", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02685/input.txt", "sample_output_relpath": "derived/input_output/data/p02685/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02685/Fortran/s331115223.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s331115223", "user_id": "u234636620"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,m,k,ans,i,c,f\n integer(int64), allocatable:: frac(:), ifrac(:)\n integer(int64),parameter:: md = 998244353\n\n read*, n,m,k\n\n allocate(frac(0:n), ifrac(0:n))\n frac(0) = 1\n ifrac(0) = 1\n do i=1,n\n frac(i) = mod(frac(i-1)*i,md)\n ifrac(i) = inv(frac(i),md)\n end do\n\n do i=0,k\n f = mod(m*factorial(m-1,n-i-1,md),md)\n c = comb(n-1,i,md)\n ans = mod(ans + mod(f*c,md),md)\n end do\n\n print'(i0)', ans\ncontains\n function comb(a,b,md) result(ret)\n integer(int64):: a,b,md\n integer(int64):: ret\n ret = mod(mod(frac(a)*ifrac(b),md)*ifrac(a-b),md)\n end function\n\n function inv(x,md) result(ret)\n integer(int64),intent(in):: x,md\n integer(int64):: ret\n ret = factorial(x,md-2,md)\n end function\n\n function factorial(a,b,md) result(ret)\n integer(int64):: a,b,md\n integer(int64):: aa,bb,ret\n aa = a\n bb = b\n ret = 1\n do while(bb > 0)\n if (mod(bb,2_8)/=0) ret=mod(ret*aa,md)\n aa=mod(aa*aa,md)\n bb=bb/2\n end do\n end function\nend program main", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "sample_input": "3 2 1\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02685", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N blocks arranged in a row. Let us paint these blocks.\n\nWe will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.\n\nFind the number of ways to paint the blocks under the following conditions:\n\nFor each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.\n\nThere may be at most K pairs of adjacent blocks that are painted in the same color.\n\nSince the count may be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 2 \\times 10^5\n\n0 \\leq K \\leq N - 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2 1\n\nSample Output 1\n\n6\n\nThe following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.\n\nSample Input 2\n\n100 100 0\n\nSample Output 2\n\n73074801\n\nSample Input 3\n\n60522 114575 7559\n\nSample Output 3\n\n479519525", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1219, "cpu_time_ms": 42, "memory_kb": 6056}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s848778083", "group_id": "codeNet:p02687", "input_text": "program main\n implicit none\n character(len=3) :: S\n\n read(*,*) S\n\n if (S == 'ABC') write(*,'(a)') 'ARC'\n if (S == 'ARC') write(*,'(a)') 'ABC'\nend program main\n", "language": "Fortran", "metadata": {"date": 1588554208, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02687/input.txt", "sample_output_relpath": "derived/input_output/data/p02687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02687/Fortran/s848778083.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848778083", "user_id": "u886432251"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "program main\n implicit none\n character(len=3) :: S\n\n read(*,*) S\n\n if (S == 'ABC') write(*,'(a)') 'ARC'\n if (S == 'ARC') write(*,'(a)') 'ABC'\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "sample_input": "ABC\n"}, "reference_outputs": ["ARC\n"], "source_document_id": "p02687", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 164, "cpu_time_ms": 3, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s856568506", "group_id": "codeNet:p02688", "input_text": "program main\n implicit none\n integer :: n, i, j, k, d, a(100)\n integer :: pena(100)\n pena(:) = 0\n read *, n, k\n pena(1:n) = 1\n do i = 1, k\n read *, d\n read *, a(1:d)\n do j = 1, d\n pena(a(j)) = 0\n end do\n end do\n print \"(i0)\", sum(pena)\nend program main\n", "language": "Fortran", "metadata": {"date": 1600916992, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02688/input.txt", "sample_output_relpath": "derived/input_output/data/p02688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02688/Fortran/s856568506.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856568506", "user_id": "u388927326"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, j, k, d, a(100)\n integer :: pena(100)\n pena(:) = 0\n read *, n, k\n pena(1:n) = 1\n do i = 1, k\n read *, d\n read *, a(1:d)\n do j = 1, d\n pena(a(j)) = 0\n end do\n end do\n print \"(i0)\", sum(pena)\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "sample_input": "3 2\n2\n1 3\n1\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02688", "source_text": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2868}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s676473282", "group_id": "codeNet:p02688", "input_text": "program main\n implicit none\n integer :: N, K\n integer,allocatable :: d(:),A(:,:)\n logical,allocatable :: have(:)\n integer :: i,j\n \n read(*,*) N,K\n allocate(d(K))\n allocate(A(K,N))\n allocate(have(N))\n have(:) = .false.\n do i = 1,K\n read(*,*) d(i)\n read(*,*) A(i,1:d(i))\n end do\n \n do i = 1,K\n do j = 1,d(i)\n have(A(i,j)) = .true.\n end do\n end do\n\n write(*,'(i0)') count(.not.have)\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1588554563, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02688/input.txt", "sample_output_relpath": "derived/input_output/data/p02688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02688/Fortran/s676473282.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676473282", "user_id": "u886432251"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer :: N, K\n integer,allocatable :: d(:),A(:,:)\n logical,allocatable :: have(:)\n integer :: i,j\n \n read(*,*) N,K\n allocate(d(K))\n allocate(A(K,N))\n allocate(have(N))\n have(:) = .false.\n do i = 1,K\n read(*,*) d(i)\n read(*,*) A(i,1:d(i))\n end do\n \n do i = 1,K\n do j = 1,d(i)\n have(A(i,j)) = .true.\n end do\n end do\n\n write(*,'(i0)') count(.not.have)\n \nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "sample_input": "3 2\n2\n1 3\n1\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02688", "source_text": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2876}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s064833719", "group_id": "codeNet:p02689", "input_text": " program abc166c\n implicit none\n integer(8)::n,m\n integer(8),allocatable::h(:),a(:),b(:),flag(:)\n integer(8)::i,j,ans\n\n read *, n,m\n allocate(h(n),a(m),b(m),flag(n))\n read *, h(1:n)\n\n do i=1,m\n read *, a(i),b(i)\n end do\n\n flag=1\n do i=1,m\n if ( h(a(i)) < h(b(i)) ) then\n if (flag(b(i))==0 .or. flag(b(i))==1) then\n flag(b(i))=1\n flag(a(i))=0\n end if\n else\n if (flag(a(i))==0 .or. flag(a(i))==1) then\n flag(a(i))=1\n flag(b(i))=0\n end if\n end if\n end do\n\n ans=0\n do i=1,n\n if (flag(i)==1) ans=ans+1\n end do\n\n print *, ans\n\n end program abc166c", "language": "Fortran", "metadata": {"date": 1588560132, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/Fortran/s064833719.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s064833719", "user_id": "u792534719"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": " program abc166c\n implicit none\n integer(8)::n,m\n integer(8),allocatable::h(:),a(:),b(:),flag(:)\n integer(8)::i,j,ans\n\n read *, n,m\n allocate(h(n),a(m),b(m),flag(n))\n read *, h(1:n)\n\n do i=1,m\n read *, a(i),b(i)\n end do\n\n flag=1\n do i=1,m\n if ( h(a(i)) < h(b(i)) ) then\n if (flag(b(i))==0 .or. flag(b(i))==1) then\n flag(b(i))=1\n flag(a(i))=0\n end if\n else\n if (flag(a(i))==0 .or. flag(a(i))==1) then\n flag(a(i))=1\n flag(b(i))=0\n end if\n end if\n end do\n\n ans=0\n do i=1,n\n if (flag(i)==1) ans=ans+1\n end do\n\n print *, ans\n\n end program abc166c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 840, "cpu_time_ms": 79, "memory_kb": 6256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s452263050", "group_id": "codeNet:p02689", "input_text": "program main\n \n implicit none\n integer :: n, m, k, i, j\n integer, allocatable :: h(:), a(:),b(:), cnct(:)\n integer :: ans, maxh\n \n read(*,*) n,m\n allocate(h(n))\n allocate(a(m))\n allocate(b(m))\n allocate(cnct(n))\n read(*,*) h(i)\n cnct = 0\n do i = 1, m\n read(*,*) a(i), b(i)\n cnct(a(i)) = cnct(a(i)) + 1 \n cnct(b(i)) = cnct(b(i)) + 1 \n end do\n \n \n ans = 0\n maxh = maxval(h)\n do i = 1, n\n if( maxh == h(i) .or. cnct(i) == 0 ) ans = ans + 1 \n end do\n\n print*, ans\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1588559983, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/Fortran/s452263050.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s452263050", "user_id": "u675314298"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n \n implicit none\n integer :: n, m, k, i, j\n integer, allocatable :: h(:), a(:),b(:), cnct(:)\n integer :: ans, maxh\n \n read(*,*) n,m\n allocate(h(n))\n allocate(a(m))\n allocate(b(m))\n allocate(cnct(n))\n read(*,*) h(i)\n cnct = 0\n do i = 1, m\n read(*,*) a(i), b(i)\n cnct(a(i)) = cnct(a(i)) + 1 \n cnct(b(i)) = cnct(b(i)) + 1 \n end do\n \n \n ans = 0\n maxh = maxval(h)\n do i = 1, n\n if( maxh == h(i) .or. cnct(i) == 0 ) ans = ans + 1 \n end do\n\n print*, ans\n \nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 515, "cpu_time_ms": 64, "memory_kb": 4820}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s397910912", "group_id": "codeNet:p02689", "input_text": "program main\n implicit none\n integer n,m\n integer, allocatable, dimension(:) :: h, a, b, ex\n integer i,j,k,sum\n\n read(*,*) n, m\n allocate(h(n))\n allocate(a(m))\n allocate(b(m))\n allocate(ex(n))\n\n do i = 1,n\n ex(i) = 0\n end do\n\n read(*,*) h\n do i = 1,m\n read(*,*) a(i), b(i)\n if(h(a(i)) > h(b(i))) then\n ex(b(i)) = 1\n else if (h(a(i)) < h(b(i))) then\n ex(a(i)) = 1\n else if (h(a(i)) == h(b(i))) then\n ex(a(i)) = 1\n ex(b(i)) = 1\n end if\n end do\n\n sum = 0\n do i = 1,n\n sum = sum + ex(i)\n end do\n\n write(*,*) n-sum\n\n\nend program", "language": "Fortran", "metadata": {"date": 1588556383, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/Fortran/s397910912.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397910912", "user_id": "u806372060"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n,m\n integer, allocatable, dimension(:) :: h, a, b, ex\n integer i,j,k,sum\n\n read(*,*) n, m\n allocate(h(n))\n allocate(a(m))\n allocate(b(m))\n allocate(ex(n))\n\n do i = 1,n\n ex(i) = 0\n end do\n\n read(*,*) h\n do i = 1,m\n read(*,*) a(i), b(i)\n if(h(a(i)) > h(b(i))) then\n ex(b(i)) = 1\n else if (h(a(i)) < h(b(i))) then\n ex(a(i)) = 1\n else if (h(a(i)) == h(b(i))) then\n ex(a(i)) = 1\n ex(b(i)) = 1\n end if\n end do\n\n sum = 0\n do i = 1,n\n sum = sum + ex(i)\n end do\n\n write(*,*) n-sum\n\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 670, "cpu_time_ms": 77, "memory_kb": 4592}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s231502032", "group_id": "codeNet:p02689", "input_text": "program ABC166C\n implicit none\n integer(8)::N,M,i,A,B,ans\n integer(8),allocatable,dimension(:)::H,checked,C\n read*,N,M\n allocate(H(N))\n allocate(checked(N))\n allocate(C(N))\n read*,H\n C=0\n checked=0\n ans=0\n\n do i=1,M\n read*,A,B\n checked(A)=1\n checked(B)=1\n if(H(A)>H(B))then\n C(A)=1\n C(B)=0\n else if(H(B)>H(A))then\n C(B)=1\n C(A)=0\n end if\n end do\n\n do i=1,N\n if(C(i)==1.or.checked(i)==0)then\n ans=ans+1\n end if\n end do\n\n print'(i0)',ans\nend program ABC166C", "language": "Fortran", "metadata": {"date": 1588555155, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/Fortran/s231502032.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s231502032", "user_id": "u414699019"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ABC166C\n implicit none\n integer(8)::N,M,i,A,B,ans\n integer(8),allocatable,dimension(:)::H,checked,C\n read*,N,M\n allocate(H(N))\n allocate(checked(N))\n allocate(C(N))\n read*,H\n C=0\n checked=0\n ans=0\n\n do i=1,M\n read*,A,B\n checked(A)=1\n checked(B)=1\n if(H(A)>H(B))then\n C(A)=1\n C(B)=0\n else if(H(B)>H(A))then\n C(B)=1\n C(A)=0\n end if\n end do\n\n do i=1,N\n if(C(i)==1.or.checked(i)==0)then\n ans=ans+1\n end if\n end do\n\n print'(i0)',ans\nend program ABC166C", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 614, "cpu_time_ms": 81, "memory_kb": 5464}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s021563351", "group_id": "codeNet:p02690", "input_text": "program i_hate_factorization\n integer(8) X\n integer(8) i, j\n integer :: ans = 0\n logical :: det = .false.\n read *, X\n do i = -100, 100, 1\n do j = 100, -100, -1\n ans = ((i**5)-(j**5))\n if(x == ans)then\n det = .true.\n print \"('',i0)\", i, j\n exit\n end if\n end do\n if(det .eqv. .true.)exit\n end do\nend program", "language": "Fortran", "metadata": {"date": 1598377563, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02690.html", "problem_id": "p02690", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02690/input.txt", "sample_output_relpath": "derived/input_output/data/p02690/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02690/Fortran/s021563351.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s021563351", "user_id": "u622206408"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "program i_hate_factorization\n integer(8) X\n integer(8) i, j\n integer :: ans = 0\n logical :: det = .false.\n read *, X\n do i = -100, 100, 1\n do j = 100, -100, -1\n ans = ((i**5)-(j**5))\n if(x == ans)then\n det = .true.\n print \"('',i0)\", i, j\n exit\n end if\n end do\n if(det .eqv. .true.)exit\n end do\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "sample_input": "33\n"}, "reference_outputs": ["2 -1\n"], "source_document_id": "p02690", "source_text": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 9, "memory_kb": 2792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s748434047", "group_id": "codeNet:p02690", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: x,n,i,j\n integer(int64), allocatable:: f(:)\n\n read*, x\n n=0\n do while( n**5 <= 100000000000000000_8)\n n=n+1\n end do\n allocate(f(-n:n))\n\n do i=-n,n\n f(i) = i**5\n end do\n\n do i=-n,n\n do j=-n,n\n if (f(i)-f(j) == x) then\n print*, i,j \n stop\n end if\n end do\n end do\nend program name", "language": "Fortran", "metadata": {"date": 1588555970, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02690.html", "problem_id": "p02690", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02690/input.txt", "sample_output_relpath": "derived/input_output/data/p02690/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02690/Fortran/s748434047.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s748434047", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: x,n,i,j\n integer(int64), allocatable:: f(:)\n\n read*, x\n n=0\n do while( n**5 <= 100000000000000000_8)\n n=n+1\n end do\n allocate(f(-n:n))\n\n do i=-n,n\n f(i) = i**5\n end do\n\n do i=-n,n\n do j=-n,n\n if (f(i)-f(j) == x) then\n print*, i,j \n stop\n end if\n end do\n end do\nend program name", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "sample_input": "33\n"}, "reference_outputs": ["2 -1\n"], "source_document_id": "p02690", "source_text": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 476, "cpu_time_ms": 19, "memory_kb": 2836}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s394377212", "group_id": "codeNet:p02691", "input_text": "program abc166e\n use iso_fortran_env\n implicit none\n integer(int64) :: n, i, t\n integer(int64),allocatable :: a(:), x(:), y(:)\n read *, n\n allocate(a(n),x(n),y(n))\n read *, a\n x = 0\n y = 0\n do i = 1,n\n t = min(i+a(i),n)\n x(t) = x(t) + 1\n t = max(i-a(i),0)\n y(t) = y(t) + 1\n end do\n print *, sum(x*y)\nend program abc166e\n", "language": "Fortran", "metadata": {"date": 1588670903, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02691.html", "problem_id": "p02691", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02691/input.txt", "sample_output_relpath": "derived/input_output/data/p02691/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02691/Fortran/s394377212.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394377212", "user_id": "u081445141"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program abc166e\n use iso_fortran_env\n implicit none\n integer(int64) :: n, i, t\n integer(int64),allocatable :: a(:), x(:), y(:)\n read *, n\n allocate(a(n),x(n),y(n))\n read *, a\n x = 0\n y = 0\n do i = 1,n\n t = min(i+a(i),n)\n x(t) = x(t) + 1\n t = max(i-a(i),0)\n y(t) = y(t) + 1\n end do\n print *, sum(x*y)\nend program abc166e\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "sample_input": "6\n2 3 3 1 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02691", "source_text": "Score: 500 points\n\nProblem Statement\n\nYou are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens.\n\nThere are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i.\n\nAccording to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction.\n\nThe absolute difference of their attendee numbers is equal to the sum of their heights.\n\nThere are \\frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above?\n\nP.S.: We cannot let you know the secret.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nPrint the number of pairs satisfying the condition.\n\nSample Input 1\n\n6\n2 3 3 1 3 1\n\nSample Output 1\n\n3\n\nA_1 + A_4 = 3, so the pair of Attendee 1 and 4 satisfy the condition.\n\nA_2 + A_6 = 4, so the pair of Attendee 2 and 6 satisfy the condition.\n\nA_4 + A_6 = 2, so the pair of Attendee 4 and 6 satisfy the condition.\n\nNo other pair satisfies the condition, so you should print 3.\n\nSample Input 2\n\n6\n5 2 4 2 8 8\n\nSample Output 2\n\n0\n\nNo pair satisfies the condition, so you should print 0.\n\nSample Input 3\n\n32\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5\n\nSample Output 3\n\n22", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 348, "cpu_time_ms": 50, "memory_kb": 7808}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s895134476", "group_id": "codeNet:p02692", "input_text": "program main\n implicit none\n INTEGER(8) n,a(3),i,x(2),x2(2),ans(100000),flag,j\n CHARACTER s1*2,s2*2\n read(*,*) n,(a(i),i=1,3)\n flag=1\n!0が二つ含まれる/A+B+C=2の場合\n if ( ((a(1)==0 .and. a(2)==0) .or. (a(2)==0 .and. a(3)==0) .or. (a(3)==0 .and. a(1)==0)) .and. a(1)+a(2)+a(3)/=2 ) then\n do i = 1,n\n call read_s(s1,x)\n if ( a(x(1))+a(x(2))==0 ) then\n write(*,*) \"No\"\n flag=0\n do j = i+1, n\n read(*,*) s1\n end do\n exit\n else\n call nomal(a,ans,x,i)\n end if\n end do\n else if ( ((a(1)==0 .and. a(2)==0) .or. (a(2)==0 .and. a(3)==0) .or. (a(3)==0 .and. a(1)==0)) .and. a(1)+a(2)+a(3)==2 ) then\n do i = 1,n\n if ( i==1 ) then\n call read_s(s1,x) \n end if\n if ( a(x(1))+a(x(2))==0 ) then\n write(*,*) \"No\"\n flag=0\n do j = i+1, n\n read(*,*) s1\n end do\n exit\n else\n if ( i=an(xn(2)) ) then\n an(xn(1))=an(xn(1))-1\n an(xn(2))=an(xn(2))+1\n ansn(in)=xn(2)\n else\n an(xn(1))=an(xn(1))+1\n an(xn(2))=an(xn(2))-1\n ansn(in)=xn(1)\n end if\n end subroutine nomal\n\n subroutine exceptional(ae, anse, xe, x2e,ie)\n implicit none\n INTEGER(8) ae(3),xe(2),x2e(2),anse(100000),ie\n if ( ae(xe(1))>ae(xe(2)) ) then\n ae(xe(1))=ae(xe(1))-1\n ae(xe(2))=ae(xe(2))+1\n anse(ie)=xe(2)\n else if ( a(x(1))=an(xn(2)) ) then\n an(xn(1))=an(xn(1))-1\n an(xn(2))=an(xn(2))+1\n ansn(in)=xn(2)\n else\n an(xn(1))=an(xn(1))+1\n an(xn(2))=an(xn(2))-1\n ansn(in)=xn(1)\n end if\n end subroutine nomal\n\n subroutine exceptional(ae, anse, xe, x2e,ie)\n implicit none\n INTEGER(8) ae(3),xe(2),x2e(2),anse(100000),ie\n if ( ae(xe(1))>ae(xe(2)) ) then\n ae(xe(1))=ae(xe(1))-1\n ae(xe(2))=ae(xe(2))+1\n anse(ie)=xe(2)\n else if ( a(x(1)) r(p(2))) then\n r(p(1)) = r(p(1))-1\n r(p(2)) = r(p(2))+1\n write(*,'(a)') c(p(2))\n else\n r(p(1)) = r(p(1))+1\n r(p(2)) = r(p(2))-1\n write(*,'(a)') c(p(1))\n end if\n end do\ncontains\n integer function hash(s)\n character(2), intent(in) :: s\n select case (s)\n case (\"AB\")\n hash = 3\n case (\"AC\")\n hash = 5\n case (\"BC\")\n hash = 6\n end select\n end\n subroutine get_index(x,p)\n integer, intent(in) :: x\n integer, intent(out) :: p(2)\n integer :: i, k\n i = 0\n do k = 0, 2\n if (.not.btest(x,k)) cycle\n i = i+1\n p(i) = lshift(1,k)\n end do\n end\n subroutine simulate(out)\n logical, intent(in) :: out\n if (out) write(*,'(a)') \"Yes\"\n do i = 1, n\n call get_index(x(i),p)\n if (r(p(1)) /= 0) then\n r(p(1)) = r(p(1))-1\n r(p(2)) = r(p(2))+1\n if (out) write(*,'(a)') c(p(2))\n else if (r(p(2)) /= 0) then\n r(p(1)) = r(p(1))+1\n r(p(2)) = r(p(2))-1\n if (out) write(*,'(a)') c(p(1))\n else\n write(*,'(a)') \"No\"\n stop\n end if\n end do\n end\nend program three_variables_game", "language": "Fortran", "metadata": {"date": 1588548768, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02692.html", "problem_id": "p02692", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02692/input.txt", "sample_output_relpath": "derived/input_output/data/p02692/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02692/Fortran/s735382143.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735382143", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\nA\nC\n", "input_to_evaluate": "program three_variables_game\n implicit none\n integer :: n, r(4) = 0, x(100001) = 0, i, j, p(2) = 0\n character(1) :: c(4) = (/ \"A\", \"B\", \"X\", \"C\" /)\n character(2) :: s\n read(*,*) n, r(1), r(2), r(4)\n if (sum(r) == 0) then\n write(*,'(a)') \"No\"\n stop\n end if\n do i = 1, n\n read(*,*) s\n x(i) = hash(s)\n end do\n if (sum(r) == 1) then\n j = maxloc(r,1)\n call simulate(.false.)\n r = 0\n r(j) = 1\n call simulate(.true.)\n stop\n end if\n call get_index(x(1),p)\n if (r(p(1)) == 0 .and. r(p(2)) == 0) then\n write(*,'(a)') \"No\"\n stop\n else\n write(*,'(a)') \"Yes\"\n end if\n do i = 1, n\n call get_index(x(i),p)\n if (r(p(1)) == 0) then\n r(p(1)) = r(p(1))+1\n r(p(2)) = r(p(2))-1\n write(*,'(a)') c(p(1))\n else if (r(p(2)) == 0) then\n r(p(1)) = r(p(1))-1\n r(p(2)) = r(p(2))+1\n write(*,'(a)') c(p(2))\n else if (sum(r) == 2 .and. r(p(1))*r(p(2)) == 1 .and. i < n .and. x(i) /= x(i+1)) then\n j = 1\n if (p(2) == and(x(i),x(i+1))) j = 2\n r(p(j)) = r(p(j))+1\n r(p(3-j)) = r(p(3-j))-1\n write(*,'(a)') c(p(j))\n else if (r(p(1)) > r(p(2))) then\n r(p(1)) = r(p(1))-1\n r(p(2)) = r(p(2))+1\n write(*,'(a)') c(p(2))\n else\n r(p(1)) = r(p(1))+1\n r(p(2)) = r(p(2))-1\n write(*,'(a)') c(p(1))\n end if\n end do\ncontains\n integer function hash(s)\n character(2), intent(in) :: s\n select case (s)\n case (\"AB\")\n hash = 3\n case (\"AC\")\n hash = 5\n case (\"BC\")\n hash = 6\n end select\n end\n subroutine get_index(x,p)\n integer, intent(in) :: x\n integer, intent(out) :: p(2)\n integer :: i, k\n i = 0\n do k = 0, 2\n if (.not.btest(x,k)) cycle\n i = i+1\n p(i) = lshift(1,k)\n end do\n end\n subroutine simulate(out)\n logical, intent(in) :: out\n if (out) write(*,'(a)') \"Yes\"\n do i = 1, n\n call get_index(x(i),p)\n if (r(p(1)) /= 0) then\n r(p(1)) = r(p(1))-1\n r(p(2)) = r(p(2))+1\n if (out) write(*,'(a)') c(p(2))\n else if (r(p(2)) /= 0) then\n r(p(1)) = r(p(1))+1\n r(p(2)) = r(p(2))-1\n if (out) write(*,'(a)') c(p(1))\n else\n write(*,'(a)') \"No\"\n stop\n end if\n end do\n end\nend program three_variables_game", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a game that involves three variables, denoted A, B, and C.\n\nAs the game progresses, there will be N events where you are asked to make a choice.\nEach of these choices is represented by a string s_i. If s_i is AB, you must add 1 to A or B then subtract 1 from the other; if s_i is AC, you must add 1 to A or C then subtract 1 from the other; if s_i is BC, you must add 1 to B or C then subtract 1 from the other.\n\nAfter each choice, none of A, B, and C should be negative.\n\nDetermine whether it is possible to make N choices under this condition. If it is possible, also give one such way to make the choices.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq A,B,C \\leq 10^9\n\nN, A, B, C are integers.\n\ns_i is AB, AC, or BC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\ns_1\ns_2\n:\ns_N\n\nOutput\n\nIf it is possible to make N choices under the condition, print Yes; otherwise, print No.\n\nAlso, in the former case, show one such way to make the choices in the subsequent N lines. The (i+1)-th line should contain the name of the variable (A, B, or C) to which you add 1 in the i-th choice.\n\nSample Input 1\n\n2 1 3 0\nAB\nAC\n\nSample Output 1\n\nYes\nA\nC\n\nYou can successfully make two choices, as follows:\n\nIn the first choice, add 1 to A and subtract 1 from B. A becomes 2, and B becomes 2.\n\nIn the second choice, add 1 to C and subtract 1 from A. C becomes 1, and A becomes 1.\n\nSample Input 2\n\n3 1 0 0\nAB\nBC\nAB\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1 0 9 0\nAC\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n8 6 9 1\nAC\nBC\nAB\nBC\nAC\nBC\nAB\nAB\n\nSample Output 4\n\nYes\nC\nB\nB\nC\nC\nB\nA\nA", "sample_input": "2 1 3 0\nAB\nAC\n"}, "reference_outputs": ["Yes\nA\nC\n"], "source_document_id": "p02692", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a game that involves three variables, denoted A, B, and C.\n\nAs the game progresses, there will be N events where you are asked to make a choice.\nEach of these choices is represented by a string s_i. If s_i is AB, you must add 1 to A or B then subtract 1 from the other; if s_i is AC, you must add 1 to A or C then subtract 1 from the other; if s_i is BC, you must add 1 to B or C then subtract 1 from the other.\n\nAfter each choice, none of A, B, and C should be negative.\n\nDetermine whether it is possible to make N choices under this condition. If it is possible, also give one such way to make the choices.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq A,B,C \\leq 10^9\n\nN, A, B, C are integers.\n\ns_i is AB, AC, or BC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\ns_1\ns_2\n:\ns_N\n\nOutput\n\nIf it is possible to make N choices under the condition, print Yes; otherwise, print No.\n\nAlso, in the former case, show one such way to make the choices in the subsequent N lines. The (i+1)-th line should contain the name of the variable (A, B, or C) to which you add 1 in the i-th choice.\n\nSample Input 1\n\n2 1 3 0\nAB\nAC\n\nSample Output 1\n\nYes\nA\nC\n\nYou can successfully make two choices, as follows:\n\nIn the first choice, add 1 to A and subtract 1 from B. A becomes 2, and B becomes 2.\n\nIn the second choice, add 1 to C and subtract 1 from A. C becomes 1, and A becomes 1.\n\nSample Input 2\n\n3 1 0 0\nAB\nBC\nAB\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1 0 9 0\nAC\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n8 6 9 1\nAC\nBC\nAB\nBC\nAC\nBC\nAB\nAB\n\nSample Output 4\n\nYes\nC\nB\nB\nC\nC\nB\nA\nA", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2275, "cpu_time_ms": 53, "memory_kb": 3292}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s470582956", "group_id": "codeNet:p02694", "input_text": "program main\nreal :: x,mon = 100\ninteger :: y = 0\nlogical :: ans = .false.\n\nread(*,*)x\ndo while(mon < x)\ny = y + 1\nmon = mon * 1.01\nend do\n\nwrite(*,*)y\n\nend program main", "language": "Fortran", "metadata": {"date": 1589324116, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02694/input.txt", "sample_output_relpath": "derived/input_output/data/p02694/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02694/Fortran/s470582956.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s470582956", "user_id": "u850779832"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\nreal :: x,mon = 100\ninteger :: y = 0\nlogical :: ans = .false.\n\nread(*,*)x\ndo while(mon < x)\ny = y + 1\nmon = mon * 1.01\nend do\n\nwrite(*,*)y\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "sample_input": "103\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02694", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 6, "memory_kb": 2920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s348077932", "group_id": "codeNet:p02694", "input_text": "program ABC165B\n implicit none\n integer(8)::ans=0,X,y\n read*,X\n y=100\n do\n if(y>=X)exit\n y=y+y/100\n ans=ans+1\n end do\n\n print'(i0)',ans\nend program ABC165B", "language": "Fortran", "metadata": {"date": 1588482775, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02694/input.txt", "sample_output_relpath": "derived/input_output/data/p02694/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02694/Fortran/s348077932.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348077932", "user_id": "u414699019"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ABC165B\n implicit none\n integer(8)::ans=0,X,y\n read*,X\n y=100\n do\n if(y>=X)exit\n y=y+y/100\n ans=ans+1\n end do\n\n print'(i0)',ans\nend program ABC165B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "sample_input": "103\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02694", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 197, "cpu_time_ms": 2, "memory_kb": 2916}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s146603704", "group_id": "codeNet:p02694", "input_text": "program sample\nimplicit none\ninteger(16) X,year,Y1,Y2\nread(*,*)X\nY1=100\nY2=100\nyear=0\ndo while (X>Y1)\nY1=Y1+Y2*0.01\nY2=Y1\nyear=year+1\nend do\nwrite(*,*)year\nstop\nend program sample", "language": "Fortran", "metadata": {"date": 1588469799, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02694/input.txt", "sample_output_relpath": "derived/input_output/data/p02694/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02694/Fortran/s146603704.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s146603704", "user_id": "u457263576"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program sample\nimplicit none\ninteger(16) X,year,Y1,Y2\nread(*,*)X\nY1=100\nY2=100\nyear=0\ndo while (X>Y1)\nY1=Y1+Y2*0.01\nY2=Y1\nyear=year+1\nend do\nwrite(*,*)year\nstop\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "sample_input": "103\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02694", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 3, "memory_kb": 2772}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s041808866", "group_id": "codeNet:p02695", "input_text": "program sum\n implicit none\n integer i,j,n,m,q,a(10),d(50,4),c,score,score1,flag\n read(*,*) n,m,q\n c=1\n score=0\n score1=0\n flag=0\n do i = 1, q\n read(*,*) d(i,1),d(i,2),d(i,3),d(i,4)\n end do\n do i = 1, n\n c=c*(11-i)\n end do\n do i = 2, n\n c=c/i\n end do\n do i = 1, n\n a(i)=i\n end do\n do while (a(n)<=10)\n ! do i = 1, n\n ! write(*, fmt='(I4)', advance='no') a(i)\n ! end do\n ! Write(*,*)\n do j = 1, q\n if ( a(d(j,2))-a(d(j,1))==d(j,3) ) then\n score=score+d(j,4)\n end if\n end do\n if ( score>score1 ) then\n score1=score\n end if\n score=0\n a(n-flag)=a(n-flag)+1\n if ( flag==n-1 ) then\n flag=0\n else\n flag=flag+1\n end if\n end do\n write(*,*) score1\nend program sum", "language": "Fortran", "metadata": {"date": 1588473980, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02695.html", "problem_id": "p02695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02695/input.txt", "sample_output_relpath": "derived/input_output/data/p02695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02695/Fortran/s041808866.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s041808866", "user_id": "u727854164"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "program sum\n implicit none\n integer i,j,n,m,q,a(10),d(50,4),c,score,score1,flag\n read(*,*) n,m,q\n c=1\n score=0\n score1=0\n flag=0\n do i = 1, q\n read(*,*) d(i,1),d(i,2),d(i,3),d(i,4)\n end do\n do i = 1, n\n c=c*(11-i)\n end do\n do i = 2, n\n c=c/i\n end do\n do i = 1, n\n a(i)=i\n end do\n do while (a(n)<=10)\n ! do i = 1, n\n ! write(*, fmt='(I4)', advance='no') a(i)\n ! end do\n ! Write(*,*)\n do j = 1, q\n if ( a(d(j,2))-a(d(j,1))==d(j,3) ) then\n score=score+d(j,4)\n end if\n end do\n if ( score>score1 ) then\n score1=score\n end if\n score=0\n a(n-flag)=a(n-flag)+1\n if ( flag==n-1 ) then\n flag=0\n else\n flag=flag+1\n end if\n end do\n write(*,*) score1\nend program sum", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "sample_input": "3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02695", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven are positive integers N, M, Q, and Q quadruples of integers ( a_i , b_i , c_i , d_i ).\n\nConsider a sequence A satisfying the following conditions:\n\nA is a sequence of N positive integers.\n\n1 \\leq A_1 \\leq A_2 \\le \\cdots \\leq A_N \\leq M.\n\nLet us define a score of this sequence as follows:\n\nThe score is the sum of d_i over all indices i such that A_{b_i} - A_{a_i} = c_i. (If there is no such i, the score is 0.)\n\nFind the maximum possible score of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10\n\n1 \\leq M \\leq 10\n\n1 \\leq Q \\leq 50\n\n1 \\leq a_i < b_i \\leq N ( i = 1, 2, ..., Q )\n\n0 \\leq c_i \\leq M - 1 ( i = 1, 2, ..., Q )\n\n(a_i, b_i, c_i) \\neq (a_j, b_j, c_j) (where i \\neq j)\n\n1 \\leq d_i \\leq 10^5 ( i = 1, 2, ..., Q )\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\na_1 b_1 c_1 d_1\n:\na_Q b_Q c_Q d_Q\n\nOutput\n\nPrint the maximum possible score of A.\n\nSample Input 1\n\n3 4 3\n1 3 3 100\n1 2 2 10\n2 3 2 10\n\nSample Output 1\n\n110\n\nWhen A = \\{1, 3, 4\\}, its score is 110. Under these conditions, no sequence has a score greater than 110, so the answer is 110.\n\nSample Input 2\n\n4 6 10\n2 4 1 86568\n1 4 0 90629\n2 3 0 90310\n3 4 1 29211\n3 4 3 78537\n3 4 2 8580\n1 2 1 96263\n1 4 2 2156\n1 2 0 94325\n1 4 3 94328\n\nSample Output 2\n\n357500\n\nSample Input 3\n\n10 10 1\n1 10 9 1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 899, "cpu_time_ms": 7, "memory_kb": 2792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s998495829", "group_id": "codeNet:p02696", "input_text": " PROGRAM piyo\n IMPLICIT NONE\n integer(16) :: A,B,N\n integer(16) :: maxB,i,ans,buffer,x\n real(16) :: reA,reB,reX\n \n read*,A,B,N\n \n maxB = (N/B) * B\n ! maxB = maxB - B !念のため\n if( maxB<0 ) maxB = 0\n \n ans = 0\n ! do i = maxB,0,-\n \n ! buffer = floor( real(A*i)/real(B) ) - A*floor(real(i)/real(B))\n ! if( buffer>ans )then\n ! ans = buffer\n ! end if\n ! end do\n \n reA = real(A)\n reB = real(B)\n \n reX = real(maxB)\n buffer = int( floor( reA*reX/reB) - A*floor( reX/reB ) )\n ans = max( ans,buffer )\n reX = real(N)\n buffer = int( floor( reA*reX/reB) - A*floor( reX/reB ) )\n ans = max( ans,buffer )\n print*,ans\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1588472785, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02696.html", "problem_id": "p02696", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02696/input.txt", "sample_output_relpath": "derived/input_output/data/p02696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02696/Fortran/s998495829.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998495829", "user_id": "u171356453"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": " PROGRAM piyo\n IMPLICIT NONE\n integer(16) :: A,B,N\n integer(16) :: maxB,i,ans,buffer,x\n real(16) :: reA,reB,reX\n \n read*,A,B,N\n \n maxB = (N/B) * B\n ! maxB = maxB - B !念のため\n if( maxB<0 ) maxB = 0\n \n ans = 0\n ! do i = maxB,0,-\n \n ! buffer = floor( real(A*i)/real(B) ) - A*floor(real(i)/real(B))\n ! if( buffer>ans )then\n ! ans = buffer\n ! end if\n ! end do\n \n reA = real(A)\n reB = real(B)\n \n reX = real(maxB)\n buffer = int( floor( reA*reX/reB) - A*floor( reX/reB ) )\n ans = max( ans,buffer )\n reX = real(N)\n buffer = int( floor( reA*reX/reB) - A*floor( reX/reB ) )\n ans = max( ans,buffer )\n print*,ans\n \n END PROGRAM", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 790, "cpu_time_ms": 10, "memory_kb": 2784}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s235927643", "group_id": "codeNet:p02697", "input_text": "program em\nimplicit none\ninteger::N,M\ninteger::i\nread*,N,M\ndo i=1,M\nselect case(mod(i,2))\ncase(0)\n print\"(i0,A,i0)\",M/2+1-i/2,\" \",M/2+1+i/2\ncase(1)\n print\"(i0,A,i0)\",(3*M)/2+1-i/2,\" \",(3*M)/2+2+i/2\nend select\nend do\ncontains\nend program em", "language": "Fortran", "metadata": {"date": 1588476279, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02697.html", "problem_id": "p02697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02697/input.txt", "sample_output_relpath": "derived/input_output/data/p02697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02697/Fortran/s235927643.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s235927643", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "program em\nimplicit none\ninteger::N,M\ninteger::i\nread*,N,M\ndo i=1,M\nselect case(mod(i,2))\ncase(0)\n print\"(i0,A,i0)\",M/2+1-i/2,\" \",M/2+1+i/2\ncase(1)\n print\"(i0,A,i0)\",(3*M)/2+1-i/2,\" \",(3*M)/2+2+i/2\nend select\nend do\ncontains\nend program em", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "sample_input": "4 1\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02697", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 53, "memory_kb": 2924}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s315715505", "group_id": "codeNet:p02697", "input_text": "program rotation_matching\n implicit none\n integer :: n, m, i = 0, j, cnt = 0, maxm\n read(*,*) n, m\n maxm = (n-1)/2\n do\n write(*,'(i0,x,i0)') i+1, maxm+1-i\n cnt = cnt+1\n if (cnt == m) stop\n write(*,'(i0,x,i0)') maxm+2+i, n-i\n cnt = cnt+1\n if (cnt == m) stop\n i = i+1\n end do\nend program rotation_matching", "language": "Fortran", "metadata": {"date": 1588471656, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02697.html", "problem_id": "p02697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02697/input.txt", "sample_output_relpath": "derived/input_output/data/p02697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02697/Fortran/s315715505.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s315715505", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "program rotation_matching\n implicit none\n integer :: n, m, i = 0, j, cnt = 0, maxm\n read(*,*) n, m\n maxm = (n-1)/2\n do\n write(*,'(i0,x,i0)') i+1, maxm+1-i\n cnt = cnt+1\n if (cnt == m) stop\n write(*,'(i0,x,i0)') maxm+2+i, n-i\n cnt = cnt+1\n if (cnt == m) stop\n i = i+1\n end do\nend program rotation_matching", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "sample_input": "4 1\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02697", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 52, "memory_kb": 2868}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s056062406", "group_id": "codeNet:p02699", "input_text": "program sample\nimplicit none\ninteger S,W\nread(*,*)S,W\nIf (S>W) then\nwrite(*,*) \"safe\"\nelse\nwrite(*,*) \"unsafe\"\nend if\nstop\nend program sample\n", "language": "Fortran", "metadata": {"date": 1588129494, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/Fortran/s056062406.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056062406", "user_id": "u457263576"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program sample\nimplicit none\ninteger S,W\nread(*,*)S,W\nIf (S>W) then\nwrite(*,*) \"safe\"\nelse\nwrite(*,*) \"unsafe\"\nend if\nstop\nend program sample\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s936808532", "group_id": "codeNet:p02699", "input_text": "program atcoder\n implicit none\n integer S, W\n read *, S, W\n \n if (S >W) then\n print *,'safe'\n else\n print *,'unsafe'\n end if\nend program atcoder", "language": "Fortran", "metadata": {"date": 1588093918, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/Fortran/s936808532.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s936808532", "user_id": "u190743932"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program atcoder\n implicit none\n integer S, W\n read *, S, W\n \n if (S >W) then\n print *,'safe'\n else\n print *,'unsafe'\n end if\nend program atcoder", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 12, "memory_kb": 2840}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s539312062", "group_id": "codeNet:p02699", "input_text": "program sheep_and_wolves\n implicit none\n integer :: s, w\n read(*,*) s, w\n if (s > w) then\n write(*,'(a)') \"safe\"\n else\n write(*,'(a)') \"unsafe\"\n end if\nend program sheep_and_wolves", "language": "Fortran", "metadata": {"date": 1587949820, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/Fortran/s539312062.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539312062", "user_id": "u506403362"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program sheep_and_wolves\n implicit none\n integer :: s, w\n read(*,*) s, w\n if (s > w) then\n write(*,'(a)') \"safe\"\n else\n write(*,'(a)') \"unsafe\"\n end if\nend program sheep_and_wolves", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 192, "cpu_time_ms": 4, "memory_kb": 2948}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s465633999", "group_id": "codeNet:p02701", "input_text": "program main\n implicit none\n integer n\n character(len=10),allocatable, dimension(:) :: s\n integer i,j,k,l,sum,minus,up\n\n type mytype\n integer :: number\n character(len=10),dimension(100000) :: word\n end type mytype\n\n type(mytype) :: alpha(26,10)\n\n read(*,*) n\n allocate(s(n))\n\n do i = 1,26\n do j = 1,10\n alpha(i,j)%number = 0\n end do\n end do\n\n do i = 1,n\n read(*,*) s(i)\n if (s(i)(1:1) == \"a\") then\n k = 1\n else if (s(i)(1:1) == \"b\") then\n k = 2\n else if (s(i)(1:1) == \"c\") then\n k = 3\n else if (s(i)(1:1) == \"d\") then\n k = 4\n else if (s(i)(1:1) == \"e\") then\n k = 5\n else if (s(i)(1:1) == \"f\") then\n k = 6\n else if (s(i)(1:1) == \"g\") then\n k = 7\n else if (s(i)(1:1) == \"h\") then\n k = 8\n else if (s(i)(1:1) == \"i\") then\n k = 9\n else if (s(i)(1:1) == \"j\") then\n k = 10\n else if (s(i)(1:1) == \"k\") then\n k = 11\n else if (s(i)(1:1) == \"l\") then\n k = 12\n else if (s(i)(1:1) == \"m\") then\n k = 13\n else if (s(i)(1:1) == \"n\") then\n k = 14\n else if (s(i)(1:1) == \"o\") then\n k = 15\n else if (s(i)(1:1) == \"p\") then\n k = 16\n else if (s(i)(1:1) == \"q\") then\n k = 17\n else if (s(i)(1:1) == \"r\") then\n k = 18\n else if (s(i)(1:1) == \"s\") then\n k = 19\n else if (s(i)(1:1) == \"t\") then\n k = 20\n else if (s(i)(1:1) == \"u\") then\n k = 21\n else if (s(i)(1:1) == \"v\") then\n k = 22\n else if (s(i)(1:1) == \"w\") then\n k = 23\n else if (s(i)(1:1) == \"x\") then\n k = 24\n else if (s(i)(1:1) == \"y\") then\n k = 25\n else if (s(i)(1:1) == \"z\") then\n k = 26\n end if\n l = len_trim(s(i))\n alpha(k,l)%number = alpha(k,l)%number + 1\n alpha(k,l)%word(alpha(k,l)%number) = s(i)\n end do\n\n sum = n\n\n do i = 1,26\n do j = 1,10\n\n minus = 0\n up = alpha(i,j)%number\n if (up <= 1) then\n go to 20\n end if\n do k = 1,up\n if (alpha(i,j)%word(k) == \"0\") then\n go to 10\n end if\n do l = k + 1, up\n if(alpha(i,j)%word(k) == alpha(i,j)%word(l)) then\n minus = minus + 1\n alpha(i,j)%word(l) = \"0\"\n end if\n end do\n 10 continue\n end do\n 20 continue\n\n sum = sum - minus\n\n end do\n end do\n\n write(*,*) sum\n\n\nend program", "language": "Fortran", "metadata": {"date": 1587957239, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02701/input.txt", "sample_output_relpath": "derived/input_output/data/p02701/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02701/Fortran/s465633999.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s465633999", "user_id": "u806372060"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n\n character(len=10),allocatable, dimension(:) :: s\n integer i,j,k,l,sum,minus,up\n\n type mytype\n integer :: number\n character(len=10),dimension(100000) :: word\n end type mytype\n\n type(mytype) :: alpha(26,10)\n\n read(*,*) n\n allocate(s(n))\n\n do i = 1,26\n do j = 1,10\n alpha(i,j)%number = 0\n end do\n end do\n\n do i = 1,n\n read(*,*) s(i)\n if (s(i)(1:1) == \"a\") then\n k = 1\n else if (s(i)(1:1) == \"b\") then\n k = 2\n else if (s(i)(1:1) == \"c\") then\n k = 3\n else if (s(i)(1:1) == \"d\") then\n k = 4\n else if (s(i)(1:1) == \"e\") then\n k = 5\n else if (s(i)(1:1) == \"f\") then\n k = 6\n else if (s(i)(1:1) == \"g\") then\n k = 7\n else if (s(i)(1:1) == \"h\") then\n k = 8\n else if (s(i)(1:1) == \"i\") then\n k = 9\n else if (s(i)(1:1) == \"j\") then\n k = 10\n else if (s(i)(1:1) == \"k\") then\n k = 11\n else if (s(i)(1:1) == \"l\") then\n k = 12\n else if (s(i)(1:1) == \"m\") then\n k = 13\n else if (s(i)(1:1) == \"n\") then\n k = 14\n else if (s(i)(1:1) == \"o\") then\n k = 15\n else if (s(i)(1:1) == \"p\") then\n k = 16\n else if (s(i)(1:1) == \"q\") then\n k = 17\n else if (s(i)(1:1) == \"r\") then\n k = 18\n else if (s(i)(1:1) == \"s\") then\n k = 19\n else if (s(i)(1:1) == \"t\") then\n k = 20\n else if (s(i)(1:1) == \"u\") then\n k = 21\n else if (s(i)(1:1) == \"v\") then\n k = 22\n else if (s(i)(1:1) == \"w\") then\n k = 23\n else if (s(i)(1:1) == \"x\") then\n k = 24\n else if (s(i)(1:1) == \"y\") then\n k = 25\n else if (s(i)(1:1) == \"z\") then\n k = 26\n end if\n l = len_trim(s(i))\n alpha(k,l)%number = alpha(k,l)%number + 1\n alpha(k,l)%word(alpha(k,l)%number) = s(i)\n end do\n\n sum = n\n\n do i = 1,26\n do j = 1,10\n\n minus = 0\n up = alpha(i,j)%number\n if (up <= 1) then\n go to 20\n end if\n do k = 1,up\n if (alpha(i,j)%word(k) == \"0\") then\n go to 10\n end if\n do l = k + 1, up\n if(alpha(i,j)%word(k) == alpha(i,j)%word(l)) then\n minus = minus + 1\n alpha(i,j)%word(l) = \"0\"\n end if\n end do\n 10 continue\n end do\n 20 continue\n\n sum = sum - minus\n\n end do\n end do\n\n write(*,*) sum\n\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "sample_input": "3\napple\norange\napple\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02701", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2841, "cpu_time_ms": 708, "memory_kb": 7856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s167284325", "group_id": "codeNet:p02701", "input_text": "program main\n implicit none\n integer n\n character(len=10),allocatable, dimension(:) :: s\n integer i,j,k,l,sum,minus,up\n\n type mytype\n integer :: number\n character(len=10),dimension(10000) :: word\n end type mytype\n\n type(mytype) :: alpha(26,10)\n\n read(*,*) n\n allocate(s(n))\n\n do i = 1,26\n do j = 1,10\n alpha(i,j)%number = 0\n end do\n end do\n\n do i = 1,n\n read(*,*) s(i)\n if (s(i)(1:1) == \"a\") then\n k = 1\n else if (s(i)(1:1) == \"b\") then\n k = 2\n else if (s(i)(1:1) == \"c\") then\n k = 3\n else if (s(i)(1:1) == \"d\") then\n k = 4\n else if (s(i)(1:1) == \"e\") then\n k = 5\n else if (s(i)(1:1) == \"f\") then\n k = 6\n else if (s(i)(1:1) == \"g\") then\n k = 7\n else if (s(i)(1:1) == \"h\") then\n k = 8\n else if (s(i)(1:1) == \"i\") then\n k = 9\n else if (s(i)(1:1) == \"j\") then\n k = 10\n else if (s(i)(1:1) == \"k\") then\n k = 11\n else if (s(i)(1:1) == \"l\") then\n k = 12\n else if (s(i)(1:1) == \"m\") then\n k = 13\n else if (s(i)(1:1) == \"n\") then\n k = 14\n else if (s(i)(1:1) == \"o\") then\n k = 15\n else if (s(i)(1:1) == \"p\") then\n k = 16\n else if (s(i)(1:1) == \"q\") then\n k = 17\n else if (s(i)(1:1) == \"r\") then\n k = 18\n else if (s(i)(1:1) == \"s\") then\n k = 19\n else if (s(i)(1:1) == \"t\") then\n k = 20\n else if (s(i)(1:1) == \"u\") then\n k = 21\n else if (s(i)(1:1) == \"v\") then\n k = 22\n else if (s(i)(1:1) == \"w\") then\n k = 23\n else if (s(i)(1:1) == \"x\") then\n k = 24\n else if (s(i)(1:1) == \"y\") then\n k = 25\n else if (s(i)(1:1) == \"z\") then\n k = 26\n end if\n l = len_trim(s(i))\n alpha(k,l)%number = alpha(k,l)%number + 1\n alpha(k,l)%word(alpha(k,l)%number) = s(i)\n end do\n\n sum = n\n\n do i = 1,26\n do j = 1,10\n\n minus = 0\n up = alpha(i,j)%number\n if (up <= 1) then\n go to 20\n end if\n do k = 1,up\n if (alpha(i,j)%word(k) == \"0\") then\n go to 10\n end if\n do l = k + 1, up\n if(alpha(i,j)%word(k) == alpha(i,j)%word(l)) then\n minus = minus + 1\n alpha(i,j)%word(l) = \"0\"\n end if\n end do\n 10 continue\n end do\n 20 continue\n\n sum = sum - minus\n\n end do\n end do\n\n write(*,*) sum\n\n\nend program", "language": "Fortran", "metadata": {"date": 1587957166, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02701/input.txt", "sample_output_relpath": "derived/input_output/data/p02701/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02701/Fortran/s167284325.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s167284325", "user_id": "u806372060"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n\n character(len=10),allocatable, dimension(:) :: s\n integer i,j,k,l,sum,minus,up\n\n type mytype\n integer :: number\n character(len=10),dimension(10000) :: word\n end type mytype\n\n type(mytype) :: alpha(26,10)\n\n read(*,*) n\n allocate(s(n))\n\n do i = 1,26\n do j = 1,10\n alpha(i,j)%number = 0\n end do\n end do\n\n do i = 1,n\n read(*,*) s(i)\n if (s(i)(1:1) == \"a\") then\n k = 1\n else if (s(i)(1:1) == \"b\") then\n k = 2\n else if (s(i)(1:1) == \"c\") then\n k = 3\n else if (s(i)(1:1) == \"d\") then\n k = 4\n else if (s(i)(1:1) == \"e\") then\n k = 5\n else if (s(i)(1:1) == \"f\") then\n k = 6\n else if (s(i)(1:1) == \"g\") then\n k = 7\n else if (s(i)(1:1) == \"h\") then\n k = 8\n else if (s(i)(1:1) == \"i\") then\n k = 9\n else if (s(i)(1:1) == \"j\") then\n k = 10\n else if (s(i)(1:1) == \"k\") then\n k = 11\n else if (s(i)(1:1) == \"l\") then\n k = 12\n else if (s(i)(1:1) == \"m\") then\n k = 13\n else if (s(i)(1:1) == \"n\") then\n k = 14\n else if (s(i)(1:1) == \"o\") then\n k = 15\n else if (s(i)(1:1) == \"p\") then\n k = 16\n else if (s(i)(1:1) == \"q\") then\n k = 17\n else if (s(i)(1:1) == \"r\") then\n k = 18\n else if (s(i)(1:1) == \"s\") then\n k = 19\n else if (s(i)(1:1) == \"t\") then\n k = 20\n else if (s(i)(1:1) == \"u\") then\n k = 21\n else if (s(i)(1:1) == \"v\") then\n k = 22\n else if (s(i)(1:1) == \"w\") then\n k = 23\n else if (s(i)(1:1) == \"x\") then\n k = 24\n else if (s(i)(1:1) == \"y\") then\n k = 25\n else if (s(i)(1:1) == \"z\") then\n k = 26\n end if\n l = len_trim(s(i))\n alpha(k,l)%number = alpha(k,l)%number + 1\n alpha(k,l)%word(alpha(k,l)%number) = s(i)\n end do\n\n sum = n\n\n do i = 1,26\n do j = 1,10\n\n minus = 0\n up = alpha(i,j)%number\n if (up <= 1) then\n go to 20\n end if\n do k = 1,up\n if (alpha(i,j)%word(k) == \"0\") then\n go to 10\n end if\n do l = k + 1, up\n if(alpha(i,j)%word(k) == alpha(i,j)%word(l)) then\n minus = minus + 1\n alpha(i,j)%word(l) = \"0\"\n end if\n end do\n 10 continue\n end do\n 20 continue\n\n sum = sum - minus\n\n end do\n end do\n\n write(*,*) sum\n\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "sample_input": "3\napple\norange\napple\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02701", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2840, "cpu_time_ms": 703, "memory_kb": 7812}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s551844607", "group_id": "codeNet:p02704", "input_text": "program i_hate_matrix_construction\n implicit none\n integer :: n, i, j, k\n integer(8) :: x\n integer, dimension(500) :: s = 0, t = 0\n integer(8), dimension(500) :: u = 0, v = 0\n integer(8), dimension(500, 500) :: a = 0\n read(*,*) n\n read(*,*) s(1:n)\n read(*,*) t(1:n)\n read(*,*) u(1:n)\n read(*,*) v(1:n)\n do k = 0, 62\n do i = 1, n\n if (s(i) == merge(1, 0, btest(u(i), k))) cycle\n do j = 1, n\n a(i, j) = set(a(i, j), k, s(i) == 0)\n end do\n end do\n do j = 1, n\n if (t(j) == merge(1, 0, btest(v(j), k))) cycle\n do i = 1, n\n a(i, j) = set(a(i, j), k, t(j) == 0)\n end do\n end do\n do i = 1, n\n if (s(i) == 0) cycle\n if (.not.btest(u(i), k)) cycle\n do j = 1, n\n !if (t(j) == 1) cycle\n if (btest(a(i, j), k)) cycle\n a(i, j) = ibset(a(i, j), k)\n if (all(btest(a(i, 1:n), k))) then\n a(i, j) = ibclr(a(i, j), k)\n else\n exit\n end if\n end do\n end do\n do j = 1, n\n if (t(j) == 0) cycle\n if (.not.btest(v(j), k)) cycle\n do i = 1, n\n !if (s(i) == 1) cycle\n if (btest(a(i, j), k)) cycle\n a(i, j) = ibset(a(i, j), k)\n if (all(btest(a(1:n, j), k))) then\n a(i, j) = ibclr(a(i, j), k)\n else\n exit\n end if\n end do\n end do\n end do\n do i = 1, n\n x = a(i, 1)\n do j = 2, n\n x = operate(x, a(i, j), s(i) == 0)\n end do\n if (x /= u(i)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n do j = 1, n\n x = a(1, j)\n do i = 2, n\n x = operate(x, a(i, j), t(j) == 0)\n end do\n if (x /= v(j)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n do i = 1, n\n write(*,'(i0)',advance='no') a(i, 1)\n do j = 2, n\n write(*,'(x,i0)',advance='no') a(i, j)\n end do\n write(*,*)\n end do\ncontains\n integer(8) function set(a, k, b) result(res)\n integer(8), intent(in) :: a\n integer, intent(in) :: k\n logical, intent(in) :: b\n res = merge(ibset(a, k), ibclr(a, k), b)\n end\n integer(8) function operate(a1, a2, b) result(res)\n integer(8), intent(in) :: a1, a2\n logical, intent(in) :: b\n res = merge(and(a1, a2), or(a1, a2), b)\n end\nend program i_hate_matrix_construction", "language": "Fortran", "metadata": {"date": 1596610086, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02704.html", "problem_id": "p02704", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02704/input.txt", "sample_output_relpath": "derived/input_output/data/p02704/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02704/Fortran/s551844607.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s551844607", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1 1\n1 0\n", "input_to_evaluate": "program i_hate_matrix_construction\n implicit none\n integer :: n, i, j, k\n integer(8) :: x\n integer, dimension(500) :: s = 0, t = 0\n integer(8), dimension(500) :: u = 0, v = 0\n integer(8), dimension(500, 500) :: a = 0\n read(*,*) n\n read(*,*) s(1:n)\n read(*,*) t(1:n)\n read(*,*) u(1:n)\n read(*,*) v(1:n)\n do k = 0, 62\n do i = 1, n\n if (s(i) == merge(1, 0, btest(u(i), k))) cycle\n do j = 1, n\n a(i, j) = set(a(i, j), k, s(i) == 0)\n end do\n end do\n do j = 1, n\n if (t(j) == merge(1, 0, btest(v(j), k))) cycle\n do i = 1, n\n a(i, j) = set(a(i, j), k, t(j) == 0)\n end do\n end do\n do i = 1, n\n if (s(i) == 0) cycle\n if (.not.btest(u(i), k)) cycle\n do j = 1, n\n !if (t(j) == 1) cycle\n if (btest(a(i, j), k)) cycle\n a(i, j) = ibset(a(i, j), k)\n if (all(btest(a(i, 1:n), k))) then\n a(i, j) = ibclr(a(i, j), k)\n else\n exit\n end if\n end do\n end do\n do j = 1, n\n if (t(j) == 0) cycle\n if (.not.btest(v(j), k)) cycle\n do i = 1, n\n !if (s(i) == 1) cycle\n if (btest(a(i, j), k)) cycle\n a(i, j) = ibset(a(i, j), k)\n if (all(btest(a(1:n, j), k))) then\n a(i, j) = ibclr(a(i, j), k)\n else\n exit\n end if\n end do\n end do\n end do\n do i = 1, n\n x = a(i, 1)\n do j = 2, n\n x = operate(x, a(i, j), s(i) == 0)\n end do\n if (x /= u(i)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n do j = 1, n\n x = a(1, j)\n do i = 2, n\n x = operate(x, a(i, j), t(j) == 0)\n end do\n if (x /= v(j)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n do i = 1, n\n write(*,'(i0)',advance='no') a(i, 1)\n do j = 2, n\n write(*,'(x,i0)',advance='no') a(i, j)\n end do\n write(*,*)\n end do\ncontains\n integer(8) function set(a, k, b) result(res)\n integer(8), intent(in) :: a\n integer, intent(in) :: k\n logical, intent(in) :: b\n res = merge(ibset(a, k), ibclr(a, k), b)\n end\n integer(8) function operate(a1, a2, b) result(res)\n integer(8), intent(in) :: a1, a2\n logical, intent(in) :: b\n res = merge(and(a1, a2), or(a1, a2), b)\n end\nend program i_hate_matrix_construction", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are an integer N and arrays S, T, U, and V, each of length N.\nConstruct an N×N matrix a that satisfy the following conditions:\n\na_{i,j} is an integer.\n\n0 \\leq a_{i,j} \\lt 2^{64}.\n\nIf S_{i} = 0, the bitwise AND of the elements in the i-th row is U_{i}.\n\nIf S_{i} = 1, the bitwise OR of the elements in the i-th row is U_{i}.\n\nIf T_{i} = 0, the bitwise AND of the elements in the i-th column is V_{i}.\n\nIf T_{i} = 1, the bitwise OR of the elements in the i-th column is V_{i}.\n\nHowever, there may be cases where no matrix satisfies the conditions.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 500\n\n0 \\leq S_{i} \\leq 1\n\n0 \\leq T_{i} \\leq 1\n\n0 \\leq U_{i} \\lt 2^{64}\n\n0 \\leq V_{i} \\lt 2^{64}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1} S_{2} ... S_{N}\nT_{1} T_{2} ... T_{N}\nU_{1} U_{2} ... U_{N}\nV_{1} V_{2} ... V_{N}\n\nOutput\n\nIf there exists a matrix that satisfies the conditions, print one such matrix in the following format:\n\na_{1,1} ... a_{1,N}\n:\na_{N,1} ... a_{N,N}\n\nNote that any matrix satisfying the conditions is accepted.\n\nIf no matrix satisfies the conditions, print -1.\n\nSample Input 1\n\n2\n0 1\n1 0\n1 1\n1 0\n\nSample Output 1\n\n1 1\n1 0\n\nIn Sample Input 1, we need to find a matrix such that:\n\nthe bitwise AND of the elements in the 1-st row is 1;\n\nthe bitwise OR of the elements in the 2-nd row is 1;\n\nthe bitwise OR of the elements in the 1-st column is 1;\n\nthe bitwise AND of the elements in the 2-nd column is 0.\n\nSample Input 2\n\n2\n1 1\n1 0\n15 15\n15 11\n\nSample Output 2\n\n15 11\n15 11", "sample_input": "2\n0 1\n1 0\n1 1\n1 0\n"}, "reference_outputs": ["1 1\n1 0\n"], "source_document_id": "p02704", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are an integer N and arrays S, T, U, and V, each of length N.\nConstruct an N×N matrix a that satisfy the following conditions:\n\na_{i,j} is an integer.\n\n0 \\leq a_{i,j} \\lt 2^{64}.\n\nIf S_{i} = 0, the bitwise AND of the elements in the i-th row is U_{i}.\n\nIf S_{i} = 1, the bitwise OR of the elements in the i-th row is U_{i}.\n\nIf T_{i} = 0, the bitwise AND of the elements in the i-th column is V_{i}.\n\nIf T_{i} = 1, the bitwise OR of the elements in the i-th column is V_{i}.\n\nHowever, there may be cases where no matrix satisfies the conditions.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 500\n\n0 \\leq S_{i} \\leq 1\n\n0 \\leq T_{i} \\leq 1\n\n0 \\leq U_{i} \\lt 2^{64}\n\n0 \\leq V_{i} \\lt 2^{64}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1} S_{2} ... S_{N}\nT_{1} T_{2} ... T_{N}\nU_{1} U_{2} ... U_{N}\nV_{1} V_{2} ... V_{N}\n\nOutput\n\nIf there exists a matrix that satisfies the conditions, print one such matrix in the following format:\n\na_{1,1} ... a_{1,N}\n:\na_{N,1} ... a_{N,N}\n\nNote that any matrix satisfying the conditions is accepted.\n\nIf no matrix satisfies the conditions, print -1.\n\nSample Input 1\n\n2\n0 1\n1 0\n1 1\n1 0\n\nSample Output 1\n\n1 1\n1 0\n\nIn Sample Input 1, we need to find a matrix such that:\n\nthe bitwise AND of the elements in the 1-st row is 1;\n\nthe bitwise OR of the elements in the 2-nd row is 1;\n\nthe bitwise OR of the elements in the 1-st column is 1;\n\nthe bitwise AND of the elements in the 2-nd column is 0.\n\nSample Input 2\n\n2\n1 1\n1 0\n15 15\n15 11\n\nSample Output 2\n\n15 11\n15 11", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2258, "cpu_time_ms": 14, "memory_kb": 3192}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s558939295", "group_id": "codeNet:p02706", "input_text": "program sample\nimplicit none\ninteger(8) N,M,A(10000),count,S,i\nread(*,*) N,M\nread(*,*) (A(i),i=1,M)\nS=0\ndo i=1,M\nS=A(i)+S\nend do\ncount=N-S\nif(count>=0) then\n write(*,*) count\nelse\n write(*,*) -1\nend if\n\nstop\nend program sample", "language": "Fortran", "metadata": {"date": 1587345410, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02706/input.txt", "sample_output_relpath": "derived/input_output/data/p02706/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02706/Fortran/s558939295.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558939295", "user_id": "u457263576"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program sample\nimplicit none\ninteger(8) N,M,A(10000),count,S,i\nread(*,*) N,M\nread(*,*) (A(i),i=1,M)\nS=0\ndo i=1,M\nS=A(i)+S\nend do\ncount=N-S\nif(count>=0) then\n write(*,*) count\nelse\n write(*,*) -1\nend if\n\nstop\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 5, "memory_kb": 2916}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s276618547", "group_id": "codeNet:p02707", "input_text": "program main\n implicit none\n integer n,i\n integer ,ALLOCATABLE :: a(:), ans(:)\n read(*,*) n\n allocate (a(n),ans(n))\n read(*,*)a(2:n)\n ans=0\n do i=1,n\n ans(a(i))=ans(a(i))+1\n enddo\n do i=1,n\n write(*,*) ans(i)\n enddo\nend program main", "language": "Fortran", "metadata": {"date": 1597004057, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02707/input.txt", "sample_output_relpath": "derived/input_output/data/p02707/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02707/Fortran/s276618547.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s276618547", "user_id": "u176979814"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "program main\n implicit none\n integer n,i\n integer ,ALLOCATABLE :: a(:), ans(:)\n read(*,*) n\n allocate (a(n),ans(n))\n read(*,*)a(2:n)\n ans=0\n do i=1,n\n ans(a(i))=ans(a(i))+1\n enddo\n do i=1,n\n write(*,*) ans(i)\n enddo\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "sample_input": "5\n1 1 2 2\n"}, "reference_outputs": ["2\n2\n0\n0\n0\n"], "source_document_id": "p02707", "source_text": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 89, "memory_kb": 5784}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s109081162", "group_id": "codeNet:p02707", "input_text": "program main\n implicit none\n\n integer :: n, i, j, s\n integer, allocatable :: a(:), b(:)\n\n read *, n\n allocate(a(2:n), b(n))\n read *, a\n b = 0\n\n do i = 2, n\n b(a(i)) = b(a(i)) + 1\n end do\n\n do i = 1, n\n print *, b(i)\n end do\n \n stop\nend program main\n", "language": "Fortran", "metadata": {"date": 1587345409, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02707/input.txt", "sample_output_relpath": "derived/input_output/data/p02707/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02707/Fortran/s109081162.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s109081162", "user_id": "u822666951"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "program main\n implicit none\n\n integer :: n, i, j, s\n integer, allocatable :: a(:), b(:)\n\n read *, n\n allocate(a(2:n), b(n))\n read *, a\n b = 0\n\n do i = 2, n\n b(a(i)) = b(a(i)) + 1\n end do\n\n do i = 1, n\n print *, b(i)\n end do\n \n stop\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "sample_input": "5\n1 1 2 2\n"}, "reference_outputs": ["2\n2\n0\n0\n0\n"], "source_document_id": "p02707", "source_text": "Score : 300 points\n\nProblem Statement\n\nA company has N members, who are assigned ID numbers 1, ..., N.\n\nEvery member, except the member numbered 1, has exactly one immediate boss with a smaller ID number.\n\nWhen a person X is the immediate boss of a person Y, the person Y is said to be an immediate subordinate of the person X.\n\nYou are given the information that the immediate boss of the member numbered i is the member numbered A_i. For each member, find how many immediate subordinates it has.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i < i\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_2 ... A_N\n\nOutput\n\nFor each of the members numbered 1, 2, ..., N, print the number of immediate subordinates it has, in its own line.\n\nSample Input 1\n\n5\n1 1 2 2\n\nSample Output 1\n\n2\n2\n0\n0\n0\n\nThe member numbered 1 has two immediate subordinates: the members numbered 2 and 3.\n\nThe member numbered 2 has two immediate subordinates: the members numbered 4 and 5.\n\nThe members numbered 3, 4, and 5 do not have immediate subordinates.\n\nSample Input 2\n\n10\n1 1 1 1 1 1 1 1 1\n\nSample Output 2\n\n9\n0\n0\n0\n0\n0\n0\n0\n0\n0\n\nSample Input 3\n\n7\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n1\n1\n1\n1\n1\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 82, "memory_kb": 5084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s330019085", "group_id": "codeNet:p02708", "input_text": "program sum_of_large_numbers\n implicit none\n integer(8) :: n, k\n read(*,*) n, k\n write(*,'(i0)') mod(((n+1)*(n+k+1)*(n-k+2)*3+(n-k+2)*6-(n+1)*(n+2)*(2*n+3)+(k-1)*k*(2*k-1))/6,1000000007)\nend program sum_of_large_numbers", "language": "Fortran", "metadata": {"date": 1587360871, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/Fortran/s330019085.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s330019085", "user_id": "u506403362"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program sum_of_large_numbers\n implicit none\n integer(8) :: n, k\n read(*,*) n, k\n write(*,'(i0)') mod(((n+1)*(n+k+1)*(n-k+2)*3+(n-k+2)*6-(n+1)*(n+2)*(2*n+3)+(k-1)*k*(2*k-1))/6,1000000007)\nend program sum_of_large_numbers", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 2, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s734078043", "group_id": "codeNet:p02708", "input_text": "program main\n implicit none\n integer(8) :: n, k, i, j\n integer(16) :: sta, fin\n integer(16) :: cnt\n\n read *, n, k\n\n cnt = 0\n do j = k, n+1\n sta = j*(j-1)/2\n fin = 0\n do i = 1, j\n fin = fin + (n+1-i)\n end do\n cnt = cnt + fin-sta+1\n end do\n\n print *, mod(cnt,1000000007)\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1587349802, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/Fortran/s734078043.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s734078043", "user_id": "u353721260"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: n, k, i, j\n integer(16) :: sta, fin\n integer(16) :: cnt\n\n read *, n, k\n\n cnt = 0\n do j = k, n+1\n sta = j*(j-1)/2\n fin = 0\n do i = 1, j\n fin = fin + (n+1-i)\n end do\n cnt = cnt + fin-sta+1\n end do\n\n print *, mod(cnt,1000000007)\n\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 2772}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s381473729", "group_id": "codeNet:p02708", "input_text": "program main\n implicit none\n integer n,k,j,p,q,x\n read(*,*) n,k\n p=0\n q=0\n x=0\n do j=k,n+1\n p=j*(j-1)/2\n q=n*j-p\n x=x+q-p+1\n end do\n write(*,*) x\nend program main\n", "language": "Fortran", "metadata": {"date": 1587348811, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02708/input.txt", "sample_output_relpath": "derived/input_output/data/p02708/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02708/Fortran/s381473729.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381473729", "user_id": "u440779866"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer n,k,j,p,q,x\n read(*,*) n,k\n p=0\n q=0\n x=0\n do j=k,n+1\n p=j*(j-1)/2\n q=n*j-p\n x=x+q-p+1\n end do\n write(*,*) x\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02708", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N+1 integers: 10^{100}, 10^{100}+1, ..., 10^{100}+N.\n\nWe will choose K or more of these integers. Find the number of possible values of the sum of the chosen numbers, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq N+1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible values of the sum, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nThe sum can take 10 values, as follows:\n\n(10^{100})+(10^{100}+1)=2\\times 10^{100}+1\n\n(10^{100})+(10^{100}+2)=2\\times 10^{100}+2\n\n(10^{100})+(10^{100}+3)=(10^{100}+1)+(10^{100}+2)=2\\times 10^{100}+3\n\n(10^{100}+1)+(10^{100}+3)=2\\times 10^{100}+4\n\n(10^{100}+2)+(10^{100}+3)=2\\times 10^{100}+5\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)=3\\times 10^{100}+3\n\n(10^{100})+(10^{100}+1)+(10^{100}+3)=3\\times 10^{100}+4\n\n(10^{100})+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+5\n\n(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=3\\times 10^{100}+6\n\n(10^{100})+(10^{100}+1)+(10^{100}+2)+(10^{100}+3)=4\\times 10^{100}+6\n\nSample Input 2\n\n200000 200001\n\nSample Output 2\n\n1\n\nWe must choose all of the integers, so the sum can take just 1 value.\n\nSample Input 3\n\n141421 35623\n\nSample Output 3\n\n220280457", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 14, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s380732691", "group_id": "codeNet:p02709", "input_text": "program test\n\ninteger(8) :: n,a(3000),b(3000),i,j,k,dp(0:3000,0:3000)=0,left,right,total,max_dp\n\nread(*,*) n\nread(*,*) (a(i),i=1,n)\ndo i=1,n\n b(i) = i\nenddo\n\ncall heapsort_down(n,a(1:n),b(1:n))\n\n! aが活発度、bが幼児の初期位置(x)\ndo total=1,n\n do left=0,total-1\n right=total-1-left \n !左詰め\n dp(left+1,right) = max(dp(left+1,right),dp(left,right)+a(total)*abs(b(total)-(left+1)))\n !右詰め\n dp(left,right+1) = max(dp(left,right+1),dp(left,right)+a(total)*abs(b(total)-(n-right)))\n enddo\nenddo\n\nmax_dp = 0\ndo left=0,n\n max_dp = max(max_dp,dp(left,n-left))\nenddo\n\nwrite(*,*) max_dp\n\ncontains\nsubroutine heapsort_down(n,y1,y2)\n\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: y1(1:n)\n integer(8),intent(inout) :: y2(1:n)\n integer(8) :: i,k,j,l\n integer(8) :: t1,t2\n \n l = n/2+1\n k = n\n\n do while (k /= 1)\n if(l > 1) then\n l = l-1\n t1 = y1(l)\n t2 = y2(l)\n \n else\n t1 = y1(k)\n t2 = y2(k)\n y1(k) = y1(1)\n y2(k) = y2(1)\n k = k-1\n if(k == 1) then\n y1(1) = t1\n y2(1) = t2\n exit\n endif\n endif\n\n i = l\n j = l+l\n\n do while(j <= k)\n if(j < k) then\n if(y1(j) > y1(j+1)) j = j+1\n endif\n \n if (t1 > y1(j)) then\n y1(i) = y1(j)\n y2(i) = y2(j)\n i = j\n j = j+j\n else\n j = k+1\n endif\n \n enddo\n \n y1(i) = t1\n y2(i) = t2\n \n enddo\n return\n\nend subroutine heapsort_down\n\n\n\nend program", "language": "Fortran", "metadata": {"date": 1587368372, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02709.html", "problem_id": "p02709", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02709/input.txt", "sample_output_relpath": "derived/input_output/data/p02709/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02709/Fortran/s380732691.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380732691", "user_id": "u454703763"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "program test\n\ninteger(8) :: n,a(3000),b(3000),i,j,k,dp(0:3000,0:3000)=0,left,right,total,max_dp\n\nread(*,*) n\nread(*,*) (a(i),i=1,n)\ndo i=1,n\n b(i) = i\nenddo\n\ncall heapsort_down(n,a(1:n),b(1:n))\n\n! aが活発度、bが幼児の初期位置(x)\ndo total=1,n\n do left=0,total-1\n right=total-1-left \n !左詰め\n dp(left+1,right) = max(dp(left+1,right),dp(left,right)+a(total)*abs(b(total)-(left+1)))\n !右詰め\n dp(left,right+1) = max(dp(left,right+1),dp(left,right)+a(total)*abs(b(total)-(n-right)))\n enddo\nenddo\n\nmax_dp = 0\ndo left=0,n\n max_dp = max(max_dp,dp(left,n-left))\nenddo\n\nwrite(*,*) max_dp\n\ncontains\nsubroutine heapsort_down(n,y1,y2)\n\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: y1(1:n)\n integer(8),intent(inout) :: y2(1:n)\n integer(8) :: i,k,j,l\n integer(8) :: t1,t2\n \n l = n/2+1\n k = n\n\n do while (k /= 1)\n if(l > 1) then\n l = l-1\n t1 = y1(l)\n t2 = y2(l)\n \n else\n t1 = y1(k)\n t2 = y2(k)\n y1(k) = y1(1)\n y2(k) = y2(1)\n k = k-1\n if(k == 1) then\n y1(1) = t1\n y2(1) = t2\n exit\n endif\n endif\n\n i = l\n j = l+l\n\n do while(j <= k)\n if(j < k) then\n if(y1(j) > y1(j+1)) j = j+1\n endif\n \n if (t1 > y1(j)) then\n y1(i) = y1(j)\n y2(i) = y2(j)\n i = j\n j = j+j\n else\n j = k+1\n endif\n \n enddo\n \n y1(i) = t1\n y2(i) = t2\n \n enddo\n return\n\nend subroutine heapsort_down\n\n\n\nend program", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N children standing in a line from left to right. The activeness of the i-th child from the left is A_i.\n\nYou can rearrange these children just one time in any order you like.\n\nWhen a child who originally occupies the x-th position from the left in the line moves to the y-th position from the left, that child earns A_x \\times |x-y| happiness points.\n\nFind the maximum total happiness points the children can earn.\n\nConstraints\n\n2 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum total happiness points the children can earn.\n\nSample Input 1\n\n4\n1 3 4 2\n\nSample Output 1\n\n20\n\nIf we move the 1-st child from the left to the 3-rd position from the left, the 2-nd child to the 4-th position, the 3-rd child to the 1-st position, and the 4-th child to the 2-nd position, the children earns 1 \\times |1-3|+3 \\times |2-4|+4 \\times |3-1|+2 \\times |4-2|=20 happiness points in total.\n\nSample Input 2\n\n6\n5 5 6 1 1 1\n\nSample Output 2\n\n58\n\nSample Input 3\n\n6\n8 6 9 1 2 1\n\nSample Output 3\n\n85", "sample_input": "4\n1 3 4 2\n"}, "reference_outputs": ["20\n"], "source_document_id": "p02709", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N children standing in a line from left to right. The activeness of the i-th child from the left is A_i.\n\nYou can rearrange these children just one time in any order you like.\n\nWhen a child who originally occupies the x-th position from the left in the line moves to the y-th position from the left, that child earns A_x \\times |x-y| happiness points.\n\nFind the maximum total happiness points the children can earn.\n\nConstraints\n\n2 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum total happiness points the children can earn.\n\nSample Input 1\n\n4\n1 3 4 2\n\nSample Output 1\n\n20\n\nIf we move the 1-st child from the left to the 3-rd position from the left, the 2-nd child to the 4-th position, the 3-rd child to the 1-st position, and the 4-th child to the 2-nd position, the children earns 1 \\times |1-3|+3 \\times |2-4|+4 \\times |3-1|+2 \\times |4-2|=20 happiness points in total.\n\nSample Input 2\n\n6\n5 5 6 1 1 1\n\nSample Output 2\n\n58\n\nSample Input 3\n\n6\n8 6 9 1 2 1\n\nSample Output 3\n\n85", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1589, "cpu_time_ms": 36, "memory_kb": 26568}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s116694167", "group_id": "codeNet:p02712", "input_text": "program FizzBuzz\n implicit none\n \n integer(8) N,S,i\n read(*,*) N\n S=0\n do i =1, N\n if (mod(i,5)==0.or.mod(i,3)==0) then\n go to 1\n else\n S=S+i\n 1 end if\n end do\n \n write(*,'(i0)') S\n stop \n end program FizzBuzz\n\n\n", "language": "Fortran", "metadata": {"date": 1587185674, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02712/input.txt", "sample_output_relpath": "derived/input_output/data/p02712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02712/Fortran/s116694167.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116694167", "user_id": "u457263576"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program FizzBuzz\n implicit none\n \n integer(8) N,S,i\n read(*,*) N\n S=0\n do i =1, N\n if (mod(i,5)==0.or.mod(i,3)==0) then\n go to 1\n else\n S=S+i\n 1 end if\n end do\n \n write(*,'(i0)') S\n stop \n end program FizzBuzz\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "sample_input": "15\n"}, "reference_outputs": ["60\n"], "source_document_id": "p02712", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet us define the FizzBuzz sequence a_1,a_2,... as follows:\n\nIf both 3 and 5 divides i, a_i=\\mbox{FizzBuzz}.\n\nIf the above does not hold but 3 divides i, a_i=\\mbox{Fizz}.\n\nIf none of the above holds but 5 divides i, a_i=\\mbox{Buzz}.\n\nIf none of the above holds, a_i=i.\n\nFind the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of all numbers among the first N terms of the FizzBuzz sequence.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n60\n\nThe first 15 terms of the FizzBuzz sequence are:\n\n1,2,\\mbox{Fizz},4,\\mbox{Buzz},\\mbox{Fizz},7,8,\\mbox{Fizz},\\mbox{Buzz},11,\\mbox{Fizz},13,14,\\mbox{FizzBuzz}\n\nAmong them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.\n\nSample Input 2\n\n1000000\n\nSample Output 2\n\n266666333332\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2928}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s809360768", "group_id": "codeNet:p02715", "input_text": "program main\n implicit none\n integer(8) :: m = 10 ** 9 + 7\n integer(8) :: n, k, i, g, res\n integer(8), allocatable :: s(:), t(:)\n read *, n, k\n allocate (s(k), t(k))\n do i = 1, k\n t(i) = get_t(i)\n end do\n s(:) = t(:)\n do g = k, 1, -1\n do i = 2, k / g\n s(g) = s(g) - s(i * g)\n s(g) = modulo(s(g), m)\n end do\n end do\n res = 0\n do g = 1, k\n res = res + g * s(g)\n res = modulo(res, m)\n end do\n print \"(i0)\", res\n\n contains\n\n integer(8) function get_t(f)\n integer(8), intent(in) :: f\n integer(8) :: ng\n ng = k / f\n get_t = pow(ng, n)\n end function get_t\n\n function pow(n, p) result(res)\n integer(8), intent(in) :: n, p\n integer(8) :: res, i, imax, buf(0:63)\n imax = bit_size(p) - leadz(p) - 1\n buf(0) = modulo(n, m)\n do i = 1, imax\n buf(i) = modulo(buf(i - 1) ** 2, m)\n end do\n res = 1\n do i = 0, imax\n if (btest(p, i)) then\n res = res * buf(i)\n res = modulo(res, m)\n end if\n end do\n end function pow\nend program main\n", "language": "Fortran", "metadata": {"date": 1588412123, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02715.html", "problem_id": "p02715", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02715/input.txt", "sample_output_relpath": "derived/input_output/data/p02715/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02715/Fortran/s809360768.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s809360768", "user_id": "u388927326"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: m = 10 ** 9 + 7\n integer(8) :: n, k, i, g, res\n integer(8), allocatable :: s(:), t(:)\n read *, n, k\n allocate (s(k), t(k))\n do i = 1, k\n t(i) = get_t(i)\n end do\n s(:) = t(:)\n do g = k, 1, -1\n do i = 2, k / g\n s(g) = s(g) - s(i * g)\n s(g) = modulo(s(g), m)\n end do\n end do\n res = 0\n do g = 1, k\n res = res + g * s(g)\n res = modulo(res, m)\n end do\n print \"(i0)\", res\n\n contains\n\n integer(8) function get_t(f)\n integer(8), intent(in) :: f\n integer(8) :: ng\n ng = k / f\n get_t = pow(ng, n)\n end function get_t\n\n function pow(n, p) result(res)\n integer(8), intent(in) :: n, p\n integer(8) :: res, i, imax, buf(0:63)\n imax = bit_size(p) - leadz(p) - 1\n buf(0) = modulo(n, m)\n do i = 1, imax\n buf(i) = modulo(buf(i - 1) ** 2, m)\n end do\n res = 1\n do i = 0, imax\n if (btest(p, i)) then\n res = res * buf(i)\n res = modulo(res, m)\n end if\n end do\n end function pow\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nConsider sequences \\{A_1,...,A_N\\} of length N consisting of integers between 1 and K (inclusive).\n\nThere are K^N such sequences. Find the sum of \\gcd(A_1, ..., A_N) over all of them.\n\nSince this sum can be enormous, print the value modulo (10^9+7).\n\nHere \\gcd(A_1, ..., A_N) denotes the greatest common divisor of A_1, ..., A_N.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the sum of \\gcd(A_1, ..., A_N) over all K^N sequences, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n3 200\n\nSample Output 2\n\n10813692\n\nSample Input 3\n\n100000 100000\n\nSample Output 3\n\n742202979\n\nBe sure to print the sum modulo (10^9+7).", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02715", "source_text": "Score : 500 points\n\nProblem Statement\n\nConsider sequences \\{A_1,...,A_N\\} of length N consisting of integers between 1 and K (inclusive).\n\nThere are K^N such sequences. Find the sum of \\gcd(A_1, ..., A_N) over all of them.\n\nSince this sum can be enormous, print the value modulo (10^9+7).\n\nHere \\gcd(A_1, ..., A_N) denotes the greatest common divisor of A_1, ..., A_N.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the sum of \\gcd(A_1, ..., A_N) over all K^N sequences, modulo (10^9+7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n\\gcd(1,1,1)+\\gcd(1,1,2)+\\gcd(1,2,1)+\\gcd(1,2,2)\n+\\gcd(2,1,1)+\\gcd(2,1,2)+\\gcd(2,2,1)+\\gcd(2,2,2)\n=1+1+1+1+1+1+1+2=9\n\nThus, the answer is 9.\n\nSample Input 2\n\n3 200\n\nSample Output 2\n\n10813692\n\nSample Input 3\n\n100000 100000\n\nSample Output 3\n\n742202979\n\nBe sure to print the sum modulo (10^9+7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 19, "memory_kb": 4272}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s651915881", "group_id": "codeNet:p02716", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,i,ans, tn\n integer(int64), allocatable:: a(:), ind(:)\n logical,allocatable:: take(:)\n\n read*, n\n allocate(a(n), ind(n),take(0:n+1))\n\n read*, a(:)\n do i=1,n\n ind(i) = i\n end do\n\n call double_sort(a, ind, 1_8, n)\n take(:) = .false.\n\n ans=0 \n tn=0\n do i=1,n\n if ((.not. take(ind(i)-1)) .and. (.not. take(ind(i)+1))) then\n ans=ans+a(i)\n take(ind(i)) = .true.\n tn=tn+1\n end if\n if (tn >= n/2) exit\n end do\n\n print*, ans\n\n\n\ncontains\n recursive subroutine double_sort(ar1, ar2, fst, lst)\n integer(8),intent(inout):: ar1(:),ar2(:)\n integer(8),intent(in):: fst,lst\n integer(8):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) < ar1(lst)) then\n call swap(ar1(fst), ar1(lst))\n call swap(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call double_sort(ar1,ar2,fst,mdl)\n call double_sort(ar1,ar2,mdl+1,lst)\n call double_merge_(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine double_merge_(ar1,ar2,fst,mdl,lst)\n integer(8),intent(inout):: ar1(:),ar2(:)\n integer(8),intent(in):: fst,mdl,lst\n integer(8),allocatable:: t1(:),t2(:)\n integer(8):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) >= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n \n subroutine swap(x,y)\n integer(8),intent(inout):: x,y\n integer(8):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n \nend program name", "language": "Fortran", "metadata": {"date": 1586742641, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02716.html", "problem_id": "p02716", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02716/input.txt", "sample_output_relpath": "derived/input_output/data/p02716/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02716/Fortran/s651915881.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s651915881", "user_id": "u234636620"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,i,ans, tn\n integer(int64), allocatable:: a(:), ind(:)\n logical,allocatable:: take(:)\n\n read*, n\n allocate(a(n), ind(n),take(0:n+1))\n\n read*, a(:)\n do i=1,n\n ind(i) = i\n end do\n\n call double_sort(a, ind, 1_8, n)\n take(:) = .false.\n\n ans=0 \n tn=0\n do i=1,n\n if ((.not. take(ind(i)-1)) .and. (.not. take(ind(i)+1))) then\n ans=ans+a(i)\n take(ind(i)) = .true.\n tn=tn+1\n end if\n if (tn >= n/2) exit\n end do\n\n print*, ans\n\n\n\ncontains\n recursive subroutine double_sort(ar1, ar2, fst, lst)\n integer(8),intent(inout):: ar1(:),ar2(:)\n integer(8),intent(in):: fst,lst\n integer(8):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) < ar1(lst)) then\n call swap(ar1(fst), ar1(lst))\n call swap(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call double_sort(ar1,ar2,fst,mdl)\n call double_sort(ar1,ar2,mdl+1,lst)\n call double_merge_(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine double_merge_(ar1,ar2,fst,mdl,lst)\n integer(8),intent(inout):: ar1(:),ar2(:)\n integer(8),intent(in):: fst,mdl,lst\n integer(8),allocatable:: t1(:),t2(:)\n integer(8):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) >= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n \n subroutine swap(x,y)\n integer(8),intent(inout):: x,y\n integer(8):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n \nend program name", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence A_1, ..., A_N of length N.\n\nWe will choose exactly \\left\\lfloor \\frac{N}{2} \\right\\rfloor elements from this sequence so that no two adjacent elements are chosen.\n\nFind the maximum possible sum of the chosen elements.\n\nHere \\lfloor x \\rfloor denotes the greatest integer not greater than x.\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n|A_i|\\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the maximum possible sum of the chosen elements.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n12\n\nChoosing 2, 4, and 6 makes the sum 12, which is the maximum possible value.\n\nSample Input 2\n\n5\n-1000 -100 -10 0 10\n\nSample Output 2\n\n0\n\nChoosing -10 and 10 makes the sum 0, which is the maximum possible value.\n\nSample Input 3\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n5000000000\n\nWatch out for overflow.\n\nSample Input 4\n\n27\n18 -28 18 28 -45 90 -45 23 -53 60 28 -74 -71 35 -26 -62 49 -77 57 24 -70 -93 69 -99 59 57 -49\n\nSample Output 4\n\n295", "sample_input": "6\n1 2 3 4 5 6\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02716", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is an integer sequence A_1, ..., A_N of length N.\n\nWe will choose exactly \\left\\lfloor \\frac{N}{2} \\right\\rfloor elements from this sequence so that no two adjacent elements are chosen.\n\nFind the maximum possible sum of the chosen elements.\n\nHere \\lfloor x \\rfloor denotes the greatest integer not greater than x.\n\nConstraints\n\n2 \\leq N \\leq 2\\times 10^5\n\n|A_i|\\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the maximum possible sum of the chosen elements.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n12\n\nChoosing 2, 4, and 6 makes the sum 12, which is the maximum possible value.\n\nSample Input 2\n\n5\n-1000 -100 -10 0 10\n\nSample Output 2\n\n0\n\nChoosing -10 and 10 makes the sum 0, which is the maximum possible value.\n\nSample Input 3\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n5000000000\n\nWatch out for overflow.\n\nSample Input 4\n\n27\n18 -28 18 28 -45 90 -45 23 -53 60 28 -74 -71 35 -26 -62 49 -77 57 24 -70 -93 69 -99 59 57 -49\n\nSample Output 4\n\n295", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2327, "cpu_time_ms": 91, "memory_kb": 9296}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s682505046", "group_id": "codeNet:p02719", "input_text": " PROGRAM replacingInteger\n IMPLICIT NONE\n integer(16) :: n,k\n integer(16) :: numK\n \n read*,n,k\n \n numK = n/K\n \n n = n - numK*k\n \n print*,min( n,abs(n-k) )\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1586049396, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02719/input.txt", "sample_output_relpath": "derived/input_output/data/p02719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02719/Fortran/s682505046.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s682505046", "user_id": "u171356453"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": " PROGRAM replacingInteger\n IMPLICIT NONE\n integer(16) :: n,k\n integer(16) :: numK\n \n read*,n,k\n \n numK = n/K\n \n n = n - numK*k\n \n print*,min( n,abs(n-k) )\n \n END PROGRAM", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s949026428", "group_id": "codeNet:p02719", "input_text": "program replacing_integer\n implicit none\n integer(8) :: n, k\n read(*,*) n, k\n n = mod(n,k)\n write(*,'(i0)') min(n,k-n)\nend program replacing_integer", "language": "Fortran", "metadata": {"date": 1586049103, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02719/input.txt", "sample_output_relpath": "derived/input_output/data/p02719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02719/Fortran/s949026428.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s949026428", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program replacing_integer\n implicit none\n integer(8) :: n, k\n read(*,*) n, k\n n = mod(n,k)\n write(*,'(i0)') min(n,k-n)\nend program replacing_integer", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "sample_input": "7 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02719", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven any integer x, Aoki can do the operation below.\n\nOperation: Replace x with the absolute difference of x and K.\n\nYou are given the initial value of an integer N. Find the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nConstraints\n\n0 ≤ N ≤ 10^{18}\n\n1 ≤ K ≤ 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible value taken by N after Aoki does the operation zero or more times.\n\nSample Input 1\n\n7 4\n\nSample Output 1\n\n1\n\nInitially, N=7.\n\nAfter one operation, N becomes |7-4| = 3.\n\nAfter two operations, N becomes |3-4| = 1, which is the minimum value taken by N.\n\nSample Input 2\n\n2 6\n\nSample Output 2\n\n2\n\nN=2 after zero operations is the minimum.\n\nSample Input 3\n\n1000000000000000000 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s980275093", "group_id": "codeNet:p02721", "input_text": "program test\nimplicit none\ninteger(8) :: n,k,c,i,j,dp_left(0:200000)=10**6,dp_right(0:200000)=10**6,workday=0\ncharacter(len=200000) :: s\n\nread(*,*) n,k,c\nread(*,*) s(1:n)\n\n!dp_leftは,左から見たときにi日目の最速の労働日\nworkday = 0\ndp_left(0) = 0\ndp_right(0) = 0\n\ndo i=1,n\n if(s(i:i)=='x')then\n continue\n else\n if(workday == 0)then\n workday = workday + 1\n dp_left(workday) = i\n else\n if(i > dp_left(workday) + c) then\n workday = workday + 1\n dp_left(workday) = i\n endif\n endif\n endif\nenddo\n\n!dp_rightは,右から見たときにi日目の最遅の労働日\nworkday = 0\ndo i=n,1,-1\n if(s(i:i)=='x')then\n continue\n else\n if(workday == 0)then\n workday = workday + 1\n dp_right(workday) = i\n else\n if(i < dp_right(workday) - c) then\n workday = workday + 1\n dp_right(workday) = i\n endif\n endif\n endif\nenddo\n\ndo i=1,k\n if(dp_left(i)==dp_right(k+1-i)) then\n write(*,*) dp_left(i)\n endif\nenddo\n\nend", "language": "Fortran", "metadata": {"date": 1587432202, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02721.html", "problem_id": "p02721", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02721/input.txt", "sample_output_relpath": "derived/input_output/data/p02721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02721/Fortran/s980275093.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s980275093", "user_id": "u454703763"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: n,k,c,i,j,dp_left(0:200000)=10**6,dp_right(0:200000)=10**6,workday=0\ncharacter(len=200000) :: s\n\nread(*,*) n,k,c\nread(*,*) s(1:n)\n\n!dp_leftは,左から見たときにi日目の最速の労働日\nworkday = 0\ndp_left(0) = 0\ndp_right(0) = 0\n\ndo i=1,n\n if(s(i:i)=='x')then\n continue\n else\n if(workday == 0)then\n workday = workday + 1\n dp_left(workday) = i\n else\n if(i > dp_left(workday) + c) then\n workday = workday + 1\n dp_left(workday) = i\n endif\n endif\n endif\nenddo\n\n!dp_rightは,右から見たときにi日目の最遅の労働日\nworkday = 0\ndo i=n,1,-1\n if(s(i:i)=='x')then\n continue\n else\n if(workday == 0)then\n workday = workday + 1\n dp_right(workday) = i\n else\n if(i < dp_right(workday) - c) then\n workday = workday + 1\n dp_right(workday) = i\n endif\n endif\n endif\nenddo\n\ndo i=1,k\n if(dp_left(i)==dp_right(k+1-i)) then\n write(*,*) dp_left(i)\n endif\nenddo\n\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has decided to work on K days of his choice from the N days starting with tomorrow.\n\nYou are given an integer C and a string S. Takahashi will choose his workdays as follows:\n\nAfter working for a day, he will refrain from working on the subsequent C days.\n\nIf the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.\n\nFind all days on which Takahashi is bound to work.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq N\n\n0 \\leq C \\leq N\n\nThe length of S is N.\n\nEach character of S is o or x.\n\nTakahashi can choose his workdays so that the conditions in Problem Statement are satisfied.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K C\nS\n\nOutput\n\nPrint all days on which Takahashi is bound to work in ascending order, one per line.\n\nSample Input 1\n\n11 3 2\nooxxxoxxxoo\n\nSample Output 1\n\n6\n\nTakahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.\n\nThere are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.\n\nThus, he is bound to work on Day 6.\n\nSample Input 2\n\n5 2 3\nooxoo\n\nSample Output 2\n\n1\n5\n\nThere is only one possible choice for his workdays: Day 1,5.\n\nSample Input 3\n\n5 1 0\nooooo\n\nSample Output 3\n\nThere may be no days on which he is bound to work.\n\nSample Input 4\n\n16 4 3\nooxxoxoxxxoxoxxo\n\nSample Output 4\n\n11\n16", "sample_input": "11 3 2\nooxxxoxxxoo\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02721", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has decided to work on K days of his choice from the N days starting with tomorrow.\n\nYou are given an integer C and a string S. Takahashi will choose his workdays as follows:\n\nAfter working for a day, he will refrain from working on the subsequent C days.\n\nIf the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.\n\nFind all days on which Takahashi is bound to work.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq N\n\n0 \\leq C \\leq N\n\nThe length of S is N.\n\nEach character of S is o or x.\n\nTakahashi can choose his workdays so that the conditions in Problem Statement are satisfied.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K C\nS\n\nOutput\n\nPrint all days on which Takahashi is bound to work in ascending order, one per line.\n\nSample Input 1\n\n11 3 2\nooxxxoxxxoo\n\nSample Output 1\n\n6\n\nTakahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.\n\nThere are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.\n\nThus, he is bound to work on Day 6.\n\nSample Input 2\n\n5 2 3\nooxoo\n\nSample Output 2\n\n1\n5\n\nThere is only one possible choice for his workdays: Day 1,5.\n\nSample Input 3\n\n5 1 0\nooooo\n\nSample Output 3\n\nThere may be no days on which he is bound to work.\n\nSample Input 4\n\n16 4 3\nooxxoxoxxxoxoxxo\n\nSample Output 4\n\n11\n16", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1009, "cpu_time_ms": 66, "memory_kb": 8204}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s650916225", "group_id": "codeNet:p02722", "input_text": "program division_or_substraction\n implicit none\n integer(8) :: n, r, k, x = 2_8\n read(*,*) n\n if (n == 2_8) then\n write(*,'(i0)') 1\n stop\n end if\n r = sqrt(real(n,8)+0.5d0)\n do k = 2_8, r\n if (ok(n,k)) then\n x = x+1_8\n else\n if (mod(n-1_8,k) == 0_8) x = x+1_8\n if (k*k /= n-1_8) x = x+1_8\n end if\n end do\n write(*,'(i0)') x\ncontains\n logical function ok(n,k)\n integer(8), intent(in) :: n, k\n integer(8) :: m\n m = n\n do while (m >= k)\n if (mod(m,k) == 0) then\n m = m/k\n else\n m = mod(m,k)\n end if\n end do\n ok = m == 1\n end\nend program division_or_substraction", "language": "Fortran", "metadata": {"date": 1586054796, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02722.html", "problem_id": "p02722", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02722/input.txt", "sample_output_relpath": "derived/input_output/data/p02722/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02722/Fortran/s650916225.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650916225", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program division_or_substraction\n implicit none\n integer(8) :: n, r, k, x = 2_8\n read(*,*) n\n if (n == 2_8) then\n write(*,'(i0)') 1\n stop\n end if\n r = sqrt(real(n,8)+0.5d0)\n do k = 2_8, r\n if (ok(n,k)) then\n x = x+1_8\n else\n if (mod(n-1_8,k) == 0_8) x = x+1_8\n if (k*k /= n-1_8) x = x+1_8\n end if\n end do\n write(*,'(i0)') x\ncontains\n logical function ok(n,k)\n integer(8), intent(in) :: n, k\n integer(8) :: m\n m = n\n do while (m >= k)\n if (mod(m,k) == 0) then\n m = m/k\n else\n m = mod(m,k)\n end if\n end do\n ok = m == 1\n end\nend program division_or_substraction", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nWe will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.\n\nOperation: if K divides N, replace N with N/K; otherwise, replace N with N-K.\n\nIn how many choices of K will N become 1 in the end?\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of choices of K in which N becomes 1 in the end.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThere are three choices of K in which N becomes 1 in the end: 2, 5, and 6.\n\nIn each of these choices, N will change as follows:\n\nWhen K=2: 6 \\to 3 \\to 1\n\nWhen K=5: 6 \\to 1\n\nWhen K=6: 6 \\to 1\n\nSample Input 2\n\n3141\n\nSample Output 2\n\n13\n\nSample Input 3\n\n314159265358\n\nSample Output 3\n\n9", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02722", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nWe will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.\n\nOperation: if K divides N, replace N with N/K; otherwise, replace N with N-K.\n\nIn how many choices of K will N become 1 in the end?\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of choices of K in which N becomes 1 in the end.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThere are three choices of K in which N becomes 1 in the end: 2, 5, and 6.\n\nIn each of these choices, N will change as follows:\n\nWhen K=2: 6 \\to 3 \\to 1\n\nWhen K=5: 6 \\to 1\n\nWhen K=6: 6 \\to 1\n\nSample Input 2\n\n3141\n\nSample Output 2\n\n13\n\nSample Input 3\n\n314159265358\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 29, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s258621532", "group_id": "codeNet:p02722", "input_text": "program division_or_substraction\n implicit none\n integer(8) :: n, r, i, x = 0_8\n read(*,*) n\n r = sqrt(real(n,8)+0.5d0)\n do i = 2_8, r\n if (ok(n,i)) x = x+1_8\n end do\n write(*,'(i0)') 2_8*x+1_8\ncontains\n logical function ok(n,k)\n integer(8), intent(in) :: n, k\n integer(8) :: m\n m = n\n do while (m >= k)\n if (mod(m,k) == 0) then\n m = m/k\n else\n m = mod(m,k)\n end if\n end do\n ok = m == 1\n end\nend program division_or_substraction", "language": "Fortran", "metadata": {"date": 1586052746, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02722.html", "problem_id": "p02722", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02722/input.txt", "sample_output_relpath": "derived/input_output/data/p02722/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02722/Fortran/s258621532.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s258621532", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program division_or_substraction\n implicit none\n integer(8) :: n, r, i, x = 0_8\n read(*,*) n\n r = sqrt(real(n,8)+0.5d0)\n do i = 2_8, r\n if (ok(n,i)) x = x+1_8\n end do\n write(*,'(i0)') 2_8*x+1_8\ncontains\n logical function ok(n,k)\n integer(8), intent(in) :: n, k\n integer(8) :: m\n m = n\n do while (m >= k)\n if (mod(m,k) == 0) then\n m = m/k\n else\n m = mod(m,k)\n end if\n end do\n ok = m == 1\n end\nend program division_or_substraction", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nWe will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.\n\nOperation: if K divides N, replace N with N/K; otherwise, replace N with N-K.\n\nIn how many choices of K will N become 1 in the end?\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of choices of K in which N becomes 1 in the end.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThere are three choices of K in which N becomes 1 in the end: 2, 5, and 6.\n\nIn each of these choices, N will change as follows:\n\nWhen K=2: 6 \\to 3 \\to 1\n\nWhen K=5: 6 \\to 1\n\nWhen K=6: 6 \\to 1\n\nSample Input 2\n\n3141\n\nSample Output 2\n\n13\n\nSample Input 3\n\n314159265358\n\nSample Output 3\n\n9", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02722", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nWe will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.\n\nOperation: if K divides N, replace N with N/K; otherwise, replace N with N-K.\n\nIn how many choices of K will N become 1 in the end?\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of choices of K in which N becomes 1 in the end.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThere are three choices of K in which N becomes 1 in the end: 2, 5, and 6.\n\nIn each of these choices, N will change as follows:\n\nWhen K=2: 6 \\to 3 \\to 1\n\nWhen K=5: 6 \\to 1\n\nWhen K=6: 6 \\to 1\n\nSample Input 2\n\n3141\n\nSample Output 2\n\n13\n\nSample Input 3\n\n314159265358\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s892101512", "group_id": "codeNet:p02723", "input_text": "program coffee\n\n character,dimension(1:6)::s\n \n do i=1,6\n read*,s(i)\n end do\n\n if(s(3)==s(4) .and. s(5)==s(6)) then\n print*,'Yes'\n else\n print*,'No'\n end if\n\nend program coffee\n\n ", "language": "Fortran", "metadata": {"date": 1588533662, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02723.html", "problem_id": "p02723", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02723/input.txt", "sample_output_relpath": "derived/input_output/data/p02723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02723/Fortran/s892101512.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s892101512", "user_id": "u882765852"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program coffee\n\n character,dimension(1:6)::s\n \n do i=1,6\n read*,s(i)\n end do\n\n if(s(3)==s(4) .and. s(5)==s(6)) then\n print*,'Yes'\n else\n print*,'No'\n end if\n\nend program coffee\n\n ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "sample_input": "sippuu\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02723", "source_text": "Score : 100 points\n\nProblem Statement\n\nA string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.\n\nGiven a string S, determine whether it is coffee-like.\n\nConstraints\n\nS is a string of length 6 consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is coffee-like, print Yes; otherwise, print No.\n\nSample Input 1\n\nsippuu\n\nSample Output 1\n\nYes\n\nIn sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.\n\nSample Input 2\n\niphone\n\nSample Output 2\n\nNo\n\nSample Input 3\n\ncoffee\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s507498096", "group_id": "codeNet:p02724", "input_text": "program main\n implicit none\n integer :: x, uresi\n read(*,*) x\n \n uresi = int(real(x)/real(500)) * 1000 + int(real(mod(x,500))/real(5)) * 5\n\n print *, uresi\nend program main\n", "language": "Fortran", "metadata": {"date": 1586140231, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Fortran/s507498096.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s507498096", "user_id": "u353721260"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "program main\n implicit none\n integer :: x, uresi\n read(*,*) x\n \n uresi = int(real(x)/real(500)) * 1000 + int(real(mod(x,500))/real(5)) * 5\n\n print *, uresi\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s362147340", "group_id": "codeNet:p02724", "input_text": "program abc\n\timplicit none\n\tinteger(8) :: n\n integer :: a,b,c,d\n\n\tread(*,*) n\n\t\n\ta = n / 500\n b = n - a * 500\n c = b / 5\n d = 1000 * a + 5 * c\n \n\twrite(*,*) d\n \nend program abc", "language": "Fortran", "metadata": {"date": 1585444539, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02724.html", "problem_id": "p02724", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02724/input.txt", "sample_output_relpath": "derived/input_output/data/p02724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02724/Fortran/s362147340.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s362147340", "user_id": "u459127065"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "program abc\n\timplicit none\n\tinteger(8) :: n\n integer :: a,b,c,d\n\n\tread(*,*) n\n\t\n\ta = n / 500\n b = n - a * 500\n c = b / 5\n d = 1000 * a + 5 * c\n \n\twrite(*,*) d\n \nend program abc", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s022589871", "group_id": "codeNet:p02725", "input_text": " program abc160c\n implicit none\n integer(8)::K,N,i,j,m,p,q,Cmin=100000000\n integer(8),allocatable,dimension(:)::A,R,L\n\n read *,K,N\n allocate(A(N),R(N),L(N))\n read *,A\n\n R=0\n L=0\n do i=1,N\n\n do j=i,N-1\n R(i)=R(i)+(A(j+1)-A(j))\n end do\n do m=1,i-2\n R(i)=R(i)+(A(m+1)-A(m))\n end do\n if (i/=1) then\n R(i)=R(i)+(K-A(N))+A(1)\n end if\n\n do p=i,2,-1\n L(i)=L(i)+(A(p)-A(p-1))\n end do\n do q=N-1,i+1,-1\n L(i)=L(i)+(A(q+1)-A(q))\n end do\n if (i/=N) then\n L(i)=L(i)+(K-A(N))+A(1)\n end if\n\n end do\n\n do i=1,N\n if (Cmin>R(i)) then\n Cmin=R(i)\n end if\n end do\n\n do j=1,N\n if (Cmin>L(i)) then\n Cmin=L(i)\n end if\n end do\n\n print *,Cmin\n stop\n\n end program abc160c", "language": "Fortran", "metadata": {"date": 1585448764, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02725.html", "problem_id": "p02725", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02725/input.txt", "sample_output_relpath": "derived/input_output/data/p02725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02725/Fortran/s022589871.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s022589871", "user_id": "u792534719"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": " program abc160c\n implicit none\n integer(8)::K,N,i,j,m,p,q,Cmin=100000000\n integer(8),allocatable,dimension(:)::A,R,L\n\n read *,K,N\n allocate(A(N),R(N),L(N))\n read *,A\n\n R=0\n L=0\n do i=1,N\n\n do j=i,N-1\n R(i)=R(i)+(A(j+1)-A(j))\n end do\n do m=1,i-2\n R(i)=R(i)+(A(m+1)-A(m))\n end do\n if (i/=1) then\n R(i)=R(i)+(K-A(N))+A(1)\n end if\n\n do p=i,2,-1\n L(i)=L(i)+(A(p)-A(p-1))\n end do\n do q=N-1,i+1,-1\n L(i)=L(i)+(A(q+1)-A(q))\n end do\n if (i/=N) then\n L(i)=L(i)+(K-A(N))+A(1)\n end if\n\n end do\n\n do i=1,N\n if (Cmin>R(i)) then\n Cmin=R(i)\n end if\n end do\n\n do j=1,N\n if (Cmin>L(i)) then\n Cmin=L(i)\n end if\n end do\n\n print *,Cmin\n stop\n\n end program abc160c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "sample_input": "20 3\n5 10 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02725", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1054, "cpu_time_ms": 2104, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s791666394", "group_id": "codeNet:p02726", "input_text": "program main\n implicit none\n integer :: N, X, Y\n integer :: i, j, distance\n integer, allocatable :: npath(:)\n\n read(*,*) N, X, Y\n allocate(npath(N-1))\n npath(:) = 0\n\n do j = 1, N-1\n do i = j+1, N\n if(i<=X)then\n distance = i - j\n elseif(j>=Y)then\n distance = i - j\n elseif(j <=X .and. Y<=i)then\n distance = i - j -(Y-X-1)\n elseif(X <=j .and. i<=Y)then\n distance = min(i-j, (j-X)+(Y-i)+1)\n elseif(j<= X .and. X < i .and. i <= Y)then\n distance = (X-j) + min(i-X, Y-i+1)\n else\n distance = (i-Y) + min(Y-j, j-X+1)\n endif\n npath(distance) = npath(distance) + 1\n enddo\n enddo\n\n do i = 1, N-1\n write(*,*) npath(i)\n enddo\n\nend program main", "language": "Fortran", "metadata": {"date": 1585449473, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02726.html", "problem_id": "p02726", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02726/input.txt", "sample_output_relpath": "derived/input_output/data/p02726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02726/Fortran/s791666394.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791666394", "user_id": "u310855433"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "program main\n implicit none\n integer :: N, X, Y\n integer :: i, j, distance\n integer, allocatable :: npath(:)\n\n read(*,*) N, X, Y\n allocate(npath(N-1))\n npath(:) = 0\n\n do j = 1, N-1\n do i = j+1, N\n if(i<=X)then\n distance = i - j\n elseif(j>=Y)then\n distance = i - j\n elseif(j <=X .and. Y<=i)then\n distance = i - j -(Y-X-1)\n elseif(X <=j .and. i<=Y)then\n distance = min(i-j, (j-X)+(Y-i)+1)\n elseif(j<= X .and. X < i .and. i <= Y)then\n distance = (X-j) + min(i-X, Y-i+1)\n else\n distance = (i-Y) + min(Y-j, j-X+1)\n endif\n npath(distance) = npath(distance) + 1\n enddo\n enddo\n\n do i = 1, N-1\n write(*,*) npath(i)\n enddo\n\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "sample_input": "5 2 4\n"}, "reference_outputs": ["5\n4\n1\n0\n"], "source_document_id": "p02726", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 732, "cpu_time_ms": 5, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s686576478", "group_id": "codeNet:p02726", "input_text": "program line_plus_plus\n implicit none\n integer :: n, x, y, i, j, k\n integer :: d(2001,2001) = 1e8, c(2000) = 0\n read(*,*) n, x, y\n do i = 1, n\n d(i,i) = 0\n d(i,i+1) = 1\n d(i+1,i) = 1\n end do\n d(x,y) = 1\n d(y,x) = 1\n do k = 1, n\n do i = 1, n\n do j = 1, n\n d(i,j) = min(d(i,j),d(i,k)+d(k,j))\n if (k == n) c(d(i,j)) = c(d(i,j))+1\n end do\n end do\n end do\n do k = 1, n-1\n write(*,'(i0)') c(k)/2\n end do\nend program line_plus_plus", "language": "Fortran", "metadata": {"date": 1585446651, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02726.html", "problem_id": "p02726", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02726/input.txt", "sample_output_relpath": "derived/input_output/data/p02726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02726/Fortran/s686576478.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s686576478", "user_id": "u506403362"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "program line_plus_plus\n implicit none\n integer :: n, x, y, i, j, k\n integer :: d(2001,2001) = 1e8, c(2000) = 0\n read(*,*) n, x, y\n do i = 1, n\n d(i,i) = 0\n d(i,i+1) = 1\n d(i+1,i) = 1\n end do\n d(x,y) = 1\n d(y,x) = 1\n do k = 1, n\n do i = 1, n\n do j = 1, n\n d(i,j) = min(d(i,j),d(i,k)+d(k,j))\n if (k == n) c(d(i,j)) = c(d(i,j))+1\n end do\n end do\n end do\n do k = 1, n-1\n write(*,'(i0)') c(k)/2\n end do\nend program line_plus_plus", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "sample_input": "5 2 4\n"}, "reference_outputs": ["5\n4\n1\n0\n"], "source_document_id": "p02726", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 478, "cpu_time_ms": 2104, "memory_kb": 15872}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s227068535", "group_id": "codeNet:p02729", "input_text": "program main\n\timplicit none\n integer::n,m\n read(*,*)n,m\n write(*,*) n*(n-1)/2 +m*(m-1)/2\n stop\nend program main", "language": "Fortran", "metadata": {"date": 1592637838, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02729.html", "problem_id": "p02729", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02729/input.txt", "sample_output_relpath": "derived/input_output/data/p02729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02729/Fortran/s227068535.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s227068535", "user_id": "u884601206"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n\timplicit none\n integer::n,m\n read(*,*)n,m\n write(*,*) n*(n-1)/2 +m*(m-1)/2\n stop\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "sample_input": "2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02729", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2772}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s024572791", "group_id": "codeNet:p02729", "input_text": "program no1\n\ninteger N,M,sum\n\nread *,N,M\nsum = (N*(N-1)+M*(M-1))/2\n\nprint *,sum\n\nend program no1", "language": "Fortran", "metadata": {"date": 1584975082, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02729.html", "problem_id": "p02729", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02729/input.txt", "sample_output_relpath": "derived/input_output/data/p02729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02729/Fortran/s024572791.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s024572791", "user_id": "u167877432"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program no1\n\ninteger N,M,sum\n\nread *,N,M\nsum = (N*(N-1)+M*(M-1))/2\n\nprint *,sum\n\nend program no1", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "sample_input": "2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02729", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s283511462", "group_id": "codeNet:p02729", "input_text": "program beg\nimplicit none\ninteger N,M,sum\nread * ,N,M\nsum = N+M\nprint *,sum\nend program beg\n", "language": "Fortran", "metadata": {"date": 1584927254, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02729.html", "problem_id": "p02729", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02729/input.txt", "sample_output_relpath": "derived/input_output/data/p02729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02729/Fortran/s283511462.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s283511462", "user_id": "u167877432"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program beg\nimplicit none\ninteger N,M,sum\nread * ,N,M\nsum = N+M\nprint *,sum\nend program beg\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "sample_input": "2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02729", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s690423992", "group_id": "codeNet:p02730", "input_text": " Program ABC159B\n implicit none\n integer::n,m,l,i,j,k\n character(100)::s,t,u\n\n read(*,*) s\n n=len_trim(s)\n t=s(1:(n-1)/2)\n u=s((n+3)/2:n)\n m=len_trim(t)\n l=len_trim(u)\n\n A:do i=1,(n+1)/2\n if (s(i:i)/=s(n-i+1:n-i+1)) then\n print *,'No'\n exit A\n else\n B:do j=1,(m+1)/2\n if (t(j:j)/=t(m-j+1:m-j+1)) then\n print *,'No'\n exit A\n else\n C:do k=1,(l+1)/2\n if (u(k:k)/=u(l-k+1:l-k+1)) then\n print *,'No'\n exit A\n else\n print *,'Yes'\n exit A\n end if\n end do C\n end if\n end do B\n end if\n end do A\n\n stop\n\n End program ABC159B", "language": "Fortran", "metadata": {"date": 1584934896, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Fortran/s690423992.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s690423992", "user_id": "u792534719"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " Program ABC159B\n implicit none\n integer::n,m,l,i,j,k\n character(100)::s,t,u\n\n read(*,*) s\n n=len_trim(s)\n t=s(1:(n-1)/2)\n u=s((n+3)/2:n)\n m=len_trim(t)\n l=len_trim(u)\n\n A:do i=1,(n+1)/2\n if (s(i:i)/=s(n-i+1:n-i+1)) then\n print *,'No'\n exit A\n else\n B:do j=1,(m+1)/2\n if (t(j:j)/=t(m-j+1:m-j+1)) then\n print *,'No'\n exit A\n else\n C:do k=1,(l+1)/2\n if (u(k:k)/=u(l-k+1:l-k+1)) then\n print *,'No'\n exit A\n else\n print *,'Yes'\n exit A\n end if\n end do C\n end if\n end do B\n end if\n end do A\n\n stop\n\n End program ABC159B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 899, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s603106021", "group_id": "codeNet:p02730", "input_text": " Program ABC159B\n implicit none\n integer::n,m,l,i,j,k\n character(100)::s,t,u\n\n read(*,*) s\n n=len_trim(s)\n t=s(1:(n-1)/2)\n u=s((n+3)/2:n)\n m=len_trim(t)\n l=len_trim(u)\n\n A:do i=1,n\n if (s(i:i)/=s(n-i+1:n-i+1)) then\n print *,'No'\n exit A\n else\n B:do j=1,m\n if (t(j:j)/=t(m-j+1:m-j+1)) then\n print *,'No'\n exit A\n else\n C:do k=1,l\n if (u(k:k)/=u(l-k+1:l-k+1)) then\n print *,'No'\n exit A\n else\n print *,'Yes'\n exit A\n end if\n end do C\n end if\n end do B\n end if\n end do A\n\n stop\n\n End program ABC159B", "language": "Fortran", "metadata": {"date": 1584934308, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Fortran/s603106021.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s603106021", "user_id": "u792534719"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " Program ABC159B\n implicit none\n integer::n,m,l,i,j,k\n character(100)::s,t,u\n\n read(*,*) s\n n=len_trim(s)\n t=s(1:(n-1)/2)\n u=s((n+3)/2:n)\n m=len_trim(t)\n l=len_trim(u)\n\n A:do i=1,n\n if (s(i:i)/=s(n-i+1:n-i+1)) then\n print *,'No'\n exit A\n else\n B:do j=1,m\n if (t(j:j)/=t(m-j+1:m-j+1)) then\n print *,'No'\n exit A\n else\n C:do k=1,l\n if (u(k:k)/=u(l-k+1:l-k+1)) then\n print *,'No'\n exit A\n else\n print *,'Yes'\n exit A\n end if\n end do C\n end if\n end do B\n end if\n end do A\n\n stop\n\n End program ABC159B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 881, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s458945876", "group_id": "codeNet:p02730", "input_text": "program example\n\timplicit none\n \n character(100) S,A,B\n integer :: N,i,countA=0,countB=0,countS=0\n \n read(*,*) S\n \n S=adjustl(S)\n \n N=len_trim(S)\n \n\tdo i=1,N\n \n \tif(S(i:i)==S(N+1-i:N+1-i)) then\n \tcountS=countS+1\n end if\n \n end do\n \n if(countS/=N) then\n \twrite(*,*) \"No\"\n goto 1\n end if\n \n A=S(1:(N-1)/2)\n \n B=S((N+3)/2:N)\n\n\tdo i=1,(N-1)/2\n \n \tif(A(i:i)==A(((N-1)/2)+1-i:((N-1)/2)+1-i)) then\n \tcountA=countA+1\n end if\n \n end do\n \n do i=(N+3)/2,N\n \n \tif(B(i:i)==B(N+((N+3)/2)-i:N+((N+3)/2)-i)) then\n \tcountB=countB+1\n end if\n \n end do\n \n if(countA==((N-1)/2) .and. countB==((N-1)/2)) then\n \twrite(*,*) \"Yes\"\n else\n \twrite(*,*) \"No\"\n \n end if\n \n1 end program", "language": "Fortran", "metadata": {"date": 1584927184, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02730.html", "problem_id": "p02730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02730/input.txt", "sample_output_relpath": "derived/input_output/data/p02730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02730/Fortran/s458945876.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458945876", "user_id": "u374107737"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program example\n\timplicit none\n \n character(100) S,A,B\n integer :: N,i,countA=0,countB=0,countS=0\n \n read(*,*) S\n \n S=adjustl(S)\n \n N=len_trim(S)\n \n\tdo i=1,N\n \n \tif(S(i:i)==S(N+1-i:N+1-i)) then\n \tcountS=countS+1\n end if\n \n end do\n \n if(countS/=N) then\n \twrite(*,*) \"No\"\n goto 1\n end if\n \n A=S(1:(N-1)/2)\n \n B=S((N+3)/2:N)\n\n\tdo i=1,(N-1)/2\n \n \tif(A(i:i)==A(((N-1)/2)+1-i:((N-1)/2)+1-i)) then\n \tcountA=countA+1\n end if\n \n end do\n \n do i=(N+3)/2,N\n \n \tif(B(i:i)==B(N+((N+3)/2)-i:N+((N+3)/2)-i)) then\n \tcountB=countB+1\n end if\n \n end do\n \n if(countA==((N-1)/2) .and. countB==((N-1)/2)) then\n \twrite(*,*) \"Yes\"\n else\n \twrite(*,*) \"No\"\n \n end if\n \n1 end program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s897809642", "group_id": "codeNet:p02731", "input_text": "program MaximumVolume\n implicit none\n\n real(8) :: l\n\n read *, l\n\n print *, (l/3.0d0)**3\n\n stop\nend program MaximumVolume\n", "language": "Fortran", "metadata": {"date": 1585151946, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02731.html", "problem_id": "p02731", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02731/input.txt", "sample_output_relpath": "derived/input_output/data/p02731/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02731/Fortran/s897809642.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s897809642", "user_id": "u822666951"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "program MaximumVolume\n implicit none\n\n real(8) :: l\n\n read *, l\n\n print *, (l/3.0d0)**3\n\n stop\nend program MaximumVolume\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "sample_input": "3\n"}, "reference_outputs": ["1.000000000000\n"], "source_document_id": "p02731", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 5, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s044450488", "group_id": "codeNet:p02731", "input_text": "program main\n \n implicit none\n \n integer(8) :: l \n \n read(*,*) l\n \n print*, ( real( l ) / 3d0 )**3d0\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1585008320, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02731.html", "problem_id": "p02731", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02731/input.txt", "sample_output_relpath": "derived/input_output/data/p02731/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02731/Fortran/s044450488.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s044450488", "user_id": "u675314298"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "program main\n \n implicit none\n \n integer(8) :: l \n \n read(*,*) l\n \n print*, ( real( l ) / 3d0 )**3d0\n \nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "sample_input": "3\n"}, "reference_outputs": ["1.000000000000\n"], "source_document_id": "p02731", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer L.\nFind the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\n\nConstraints\n\n1 ≤ L ≤ 1000\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nPrint the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.\nYour output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1.000000000000\n\nFor example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.\n\nOn the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n36926037.000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s773220747", "group_id": "codeNet:p02732", "input_text": "program BannedK\n implicit none\n\n integer(kind=8) :: n, i, j, k, s, t\n integer(kind=8), allocatable :: a(:), b(:,:), c(:,:)\n\n read *, n\n allocate(a(n))\n read *, a\n\n call count(a, b)\n s = 0_8\n do i = 1, n\n call combi(b(2,i),2_8,t)\n s = s + t\n end do\n\n do k = 1, n\n print *, s-b(2,a(k))+1 !!!!\n end do\n\n deallocate(a)\n\n stop\ncontains\n\n subroutine count(array, dtb)\n implicit none\n integer(8), intent(in) :: array(:)\n integer(8), allocatable, intent(out) :: dtb(:,:)\n integer(8) :: n, i, j, s\n\n n = size(array)\n allocate(dtb(2_8,n))\n dtb = 0_8\n \n do i = 1, n\n dtb(1,i) = i\n dtb(2,array(i)) = dtb(2,array(i)) + 1\n end do\n \n return\n end subroutine count\n\n subroutine combi(n, m, rslt)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8), intent(out) :: rslt\n integer(8) :: i\n\n rslt = 1_8\n do i = 1, m\n rslt = rslt*(n-i+1_8)\n end do\n do i = 1, m\n rslt = rslt/(m-i+1_8)\n end do\n\n return\n end subroutine combi\n \nend program BannedK\n\n\n\n \n", "language": "Fortran", "metadata": {"date": 1585279494, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02732.html", "problem_id": "p02732", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02732/input.txt", "sample_output_relpath": "derived/input_output/data/p02732/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02732/Fortran/s773220747.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773220747", "user_id": "u822666951"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "program BannedK\n implicit none\n\n integer(kind=8) :: n, i, j, k, s, t\n integer(kind=8), allocatable :: a(:), b(:,:), c(:,:)\n\n read *, n\n allocate(a(n))\n read *, a\n\n call count(a, b)\n s = 0_8\n do i = 1, n\n call combi(b(2,i),2_8,t)\n s = s + t\n end do\n\n do k = 1, n\n print *, s-b(2,a(k))+1 !!!!\n end do\n\n deallocate(a)\n\n stop\ncontains\n\n subroutine count(array, dtb)\n implicit none\n integer(8), intent(in) :: array(:)\n integer(8), allocatable, intent(out) :: dtb(:,:)\n integer(8) :: n, i, j, s\n\n n = size(array)\n allocate(dtb(2_8,n))\n dtb = 0_8\n \n do i = 1, n\n dtb(1,i) = i\n dtb(2,array(i)) = dtb(2,array(i)) + 1\n end do\n \n return\n end subroutine count\n\n subroutine combi(n, m, rslt)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8), intent(out) :: rslt\n integer(8) :: i\n\n rslt = 1_8\n do i = 1, m\n rslt = rslt*(n-i+1_8)\n end do\n do i = 1, m\n rslt = rslt/(m-i+1_8)\n end do\n\n return\n end subroutine combi\n \nend program BannedK\n\n\n\n \n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "sample_input": "5\n1 1 2 1 2\n"}, "reference_outputs": ["2\n2\n3\n2\n3\n"], "source_document_id": "p02732", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1059, "cpu_time_ms": 136, "memory_kb": 9728}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s030802541", "group_id": "codeNet:p02732", "input_text": "program example\n\timplicit none\n\n\tinteger :: N,i,j,k,B,wa=0\n integer,allocatable :: A(:)\n \n read(*,*) N\n \n allocate(A(N))\n \n! do i=1,N\n read(*,*) A\n! end do\n \n! write(*,*) A\n\n do i=1,N\n \t\n B=A(i)\n \tA(i)=N+1\n! write(*,*) A \n! if(i==1) then\n \n! \tdo j=2,N\n! \tdo k=j+1,N\n \n! \tif(A(j)==A(k)) then\n \n! \t\twa=wa+1\n! \tend if\n! \tend do\n! end do\n \n! write(*,*) wa\n! wa=0\n \n! else if(i/=1 .and. i/=N) then\n \n do j=1,N\n \n do k=j+1,N\n \n if(A(j)==A(k)) then\n \n wa=wa+1\n end if\n end do\n end do\n \n write(*,*) wa\n \n! else if(i==N) then\n! \tdo j=1,N-1\n! \tdo k=j+1,N-1\n \n! if(A(j)==A(k)) then\n \n! \t wa=wa+1\n! end if\n! end do\n! end do\n\n! write(*,*) wa\n! wa=0\n! end if\n\n \tA(i)=B\n wa=0\n end do\n\nend program example\n", "language": "Fortran", "metadata": {"date": 1584933354, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02732.html", "problem_id": "p02732", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02732/input.txt", "sample_output_relpath": "derived/input_output/data/p02732/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02732/Fortran/s030802541.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s030802541", "user_id": "u374107737"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tinteger :: N,i,j,k,B,wa=0\n integer,allocatable :: A(:)\n \n read(*,*) N\n \n allocate(A(N))\n \n! do i=1,N\n read(*,*) A\n! end do\n \n! write(*,*) A\n\n do i=1,N\n \t\n B=A(i)\n \tA(i)=N+1\n! write(*,*) A \n! if(i==1) then\n \n! \tdo j=2,N\n! \tdo k=j+1,N\n \n! \tif(A(j)==A(k)) then\n \n! \t\twa=wa+1\n! \tend if\n! \tend do\n! end do\n \n! write(*,*) wa\n! wa=0\n \n! else if(i/=1 .and. i/=N) then\n \n do j=1,N\n \n do k=j+1,N\n \n if(A(j)==A(k)) then\n \n wa=wa+1\n end if\n end do\n end do\n \n write(*,*) wa\n \n! else if(i==N) then\n! \tdo j=1,N-1\n! \tdo k=j+1,N-1\n \n! if(A(j)==A(k)) then\n \n! \t wa=wa+1\n! end if\n! end do\n! end do\n\n! write(*,*) wa\n! wa=0\n! end if\n\n \tA(i)=B\n wa=0\n end do\n\nend program example\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "sample_input": "5\n1 1 2 1 2\n"}, "reference_outputs": ["2\n2\n3\n2\n3\n"], "source_document_id": "p02732", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N balls. The i-th ball has an integer A_i written on it.\n\nFor each k=1, 2, ..., N, solve the following problem and print the answer.\n\nFind the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor each k=1,2,...,N, print a line containing the answer.\n\nSample Input 1\n\n5\n1 1 2 1 2\n\nSample Output 1\n\n2\n2\n3\n2\n3\n\nConsider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.\n\nFrom these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.\n\nThus, the answer for k=1 is 2.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n0\n0\n0\n\nNo two balls have equal numbers written on them.\n\nSample Input 3\n\n5\n3 3 3 3 3\n\nSample Output 3\n\n6\n6\n6\n6\n6\n\nAny two balls have equal numbers written on them.\n\nSample Input 4\n\n8\n1 2 1 4 2 1 4 1\n\nSample Output 4\n\n5\n7\n5\n7\n7\n5\n7\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1279, "cpu_time_ms": 2103, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s559593024", "group_id": "codeNet:p02733", "input_text": " PROGRAM DividingChocolate\n IMPLICIT NONE\n integer :: h,w,k\n integer,allocatable :: choco(:,:)\n integer,allocatable :: memo1(:),memo2(:),counter2(:),this(:)\n character(1000) :: s\n integer :: i,j,buffer,piyo\n \n \n read*,h,w,k\n allocate( choco(h,w),memo1(h-1),memo2(w-1) )\n choco = 0\n memo1 = 0\n memo2 = 0\n do i = 1,h\n read*,s\n do j = 1,w\n if( s(j:j)=='1' )then\n choco(i,j) = 1\n end if\n end do\n end do\n \n !tate\n buffer = sum( choco(1,:) )\n do i = 2,h\n if( buffer+sum(choco(i,:))>k )then\n buffer = sum( choco(i,:) )\n memo1(i-1) = 1\n end if\n end do\n \n \n \n !yoko\n allocate( counter2(sum(memo1)),this(sum(memo1)) )\n counter2 = 0\n piyo = 1\n do i = 1,h\n counter2(piyo) = counter2(piyo) + choco(i,1)\n if(memo1(i)==1) piyo = piyo + 1\n end do\n this = 0\n do j = 2,w\n piyo = 1\n \n do i = 1,h\n this(piyo) = this(piyo) + choco(i,j)\n \n if(memo1(i)==1)then\n piyo = piyo + 1\n end if\n end do\n \n if( maxval(counter2+this)>k )then\n counter2 = this\n memo2(j-1) = 1\n end if\n end do\n \n print*,sum(memo1) + sum(memo2)\n \n \n !debugg\n ! print*,trim(s)\n ! do i = 1,h\n ! print*,choco(i,:)\n ! end do\n ! \n ! print*,memo1\n ! print*,memo2\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1584931082, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02733.html", "problem_id": "p02733", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02733/input.txt", "sample_output_relpath": "derived/input_output/data/p02733/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02733/Fortran/s559593024.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s559593024", "user_id": "u171356453"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": " PROGRAM DividingChocolate\n IMPLICIT NONE\n integer :: h,w,k\n integer,allocatable :: choco(:,:)\n integer,allocatable :: memo1(:),memo2(:),counter2(:),this(:)\n character(1000) :: s\n integer :: i,j,buffer,piyo\n \n \n read*,h,w,k\n allocate( choco(h,w),memo1(h-1),memo2(w-1) )\n choco = 0\n memo1 = 0\n memo2 = 0\n do i = 1,h\n read*,s\n do j = 1,w\n if( s(j:j)=='1' )then\n choco(i,j) = 1\n end if\n end do\n end do\n \n !tate\n buffer = sum( choco(1,:) )\n do i = 2,h\n if( buffer+sum(choco(i,:))>k )then\n buffer = sum( choco(i,:) )\n memo1(i-1) = 1\n end if\n end do\n \n \n \n !yoko\n allocate( counter2(sum(memo1)),this(sum(memo1)) )\n counter2 = 0\n piyo = 1\n do i = 1,h\n counter2(piyo) = counter2(piyo) + choco(i,1)\n if(memo1(i)==1) piyo = piyo + 1\n end do\n this = 0\n do j = 2,w\n piyo = 1\n \n do i = 1,h\n this(piyo) = this(piyo) + choco(i,j)\n \n if(memo1(i)==1)then\n piyo = piyo + 1\n end if\n end do\n \n if( maxval(counter2+this)>k )then\n counter2 = this\n memo2(j-1) = 1\n end if\n end do\n \n print*,sum(memo1) + sum(memo2)\n \n \n !debugg\n ! print*,trim(s)\n ! do i = 1,h\n ! print*,choco(i,:)\n ! end do\n ! \n ! print*,memo1\n ! print*,memo2\n \n END PROGRAM", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a chocolate bar partitioned into H horizontal rows and W vertical columns of squares.\n\nThe square (i, j) at the i-th row from the top and the j-th column from the left is dark if S_{i,j} is 0, and white if S_{i,j} is 1.\n\nWe will cut the bar some number of times to divide it into some number of blocks. In each cut, we cut the whole bar by a line running along some boundaries of squares from end to end of the bar.\n\nHow many times do we need to cut the bar so that every block after the cuts has K or less white squares?\n\nConstraints\n\n1 \\leq H \\leq 10\n\n1 \\leq W \\leq 1000\n\n1 \\leq K \\leq H \\times W\n\nS_{i,j} is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nS_{1,1}S_{1,2}...S_{1,W}\n:\nS_{H,1}S_{H,2}...S_{H,W}\n\nOutput\n\nPrint the number of minimum times the bar needs to be cut so that every block after the cuts has K or less white squares.\n\nSample Input 1\n\n3 5 4\n11100\n10001\n00111\n\nSample Output 1\n\n2\n\nFor example, cutting between the 1-st and 2-nd rows and between the 3-rd and 4-th columns - as shown in the figure to the left - works.\n\nNote that we cannot cut the bar in the ways shown in the two figures to the right.\n\nSample Input 2\n\n3 5 8\n11100\n10001\n00111\n\nSample Output 2\n\n0\n\nNo cut is needed.\n\nSample Input 3\n\n4 10 4\n1110010010\n1000101110\n0011101001\n1101000111\n\nSample Output 3\n\n3", "sample_input": "3 5 4\n11100\n10001\n00111\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02733", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a chocolate bar partitioned into H horizontal rows and W vertical columns of squares.\n\nThe square (i, j) at the i-th row from the top and the j-th column from the left is dark if S_{i,j} is 0, and white if S_{i,j} is 1.\n\nWe will cut the bar some number of times to divide it into some number of blocks. In each cut, we cut the whole bar by a line running along some boundaries of squares from end to end of the bar.\n\nHow many times do we need to cut the bar so that every block after the cuts has K or less white squares?\n\nConstraints\n\n1 \\leq H \\leq 10\n\n1 \\leq W \\leq 1000\n\n1 \\leq K \\leq H \\times W\n\nS_{i,j} is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nS_{1,1}S_{1,2}...S_{1,W}\n:\nS_{H,1}S_{H,2}...S_{H,W}\n\nOutput\n\nPrint the number of minimum times the bar needs to be cut so that every block after the cuts has K or less white squares.\n\nSample Input 1\n\n3 5 4\n11100\n10001\n00111\n\nSample Output 1\n\n2\n\nFor example, cutting between the 1-st and 2-nd rows and between the 3-rd and 4-th columns - as shown in the figure to the left - works.\n\nNote that we cannot cut the bar in the ways shown in the two figures to the right.\n\nSample Input 2\n\n3 5 8\n11100\n10001\n00111\n\nSample Output 2\n\n0\n\nNo cut is needed.\n\nSample Input 3\n\n4 10 4\n1110010010\n1000101110\n0011101001\n1101000111\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1557, "cpu_time_ms": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s615925709", "group_id": "codeNet:p02735", "input_text": "module ch\n implicit none\n type char\n character(100) :: n\n end type char\n type(char),allocatable :: s(:)\nend module ch\nprogram main\n \n use ch, only : s\n implicit none\n \n integer :: h, w \n integer :: i, j, ans\n integer,allocatable :: ss(:,:)\n\n read(*,*) h, w\n allocate( s(h) )\n allocate( ss(h,w) )\n do i = 1, h\n read(*,*) s(i)%n\n end do\n \n ss = 0\n do i = 1, h\n do j = 1, w\n if( s(i)%n(j:j) == \"#\" ) then\n ss(i,j) = ss(i,j) + 1\n end if\n if( i == 1 .and. j == 1 ) then \n cycle\n end if\n \n if( i == 1 .and. j /= 1 ) then\n ss(i,j) = ss(i,j) + ss(i,j-1) \n end if\n\n if( i /= 1 .and. j == 1 ) then\n ss(i,j) = ss(i,j) + ss(i-1,j)\n end if\n\n if( i /= 1 .and. j /= 1 ) then\n if( ss(i,j-1) <= ss(i-1,j) ) then \n ss(i,j) = ss(i,j) + ss(i,j-1) \n else\n ss(i,j) = ss(i,j) + ss(i-1,j)\n end if\n end if\n\n end do\n end do\n \n if( ss(h-1,w) <= ss(h,w-1) ) then\n ans = ss(h-1,w)\n else\n ans = ss(h,w-1)\n end if\n\n if( s(h)%n(w:w) == \"#\" ) then\n ans = ans + 1 \n end if\n print*, ans\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1584841648, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02735.html", "problem_id": "p02735", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02735/input.txt", "sample_output_relpath": "derived/input_output/data/p02735/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02735/Fortran/s615925709.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s615925709", "user_id": "u675314298"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module ch\n implicit none\n type char\n character(100) :: n\n end type char\n type(char),allocatable :: s(:)\nend module ch\nprogram main\n \n use ch, only : s\n implicit none\n \n integer :: h, w \n integer :: i, j, ans\n integer,allocatable :: ss(:,:)\n\n read(*,*) h, w\n allocate( s(h) )\n allocate( ss(h,w) )\n do i = 1, h\n read(*,*) s(i)%n\n end do\n \n ss = 0\n do i = 1, h\n do j = 1, w\n if( s(i)%n(j:j) == \"#\" ) then\n ss(i,j) = ss(i,j) + 1\n end if\n if( i == 1 .and. j == 1 ) then \n cycle\n end if\n \n if( i == 1 .and. j /= 1 ) then\n ss(i,j) = ss(i,j) + ss(i,j-1) \n end if\n\n if( i /= 1 .and. j == 1 ) then\n ss(i,j) = ss(i,j) + ss(i-1,j)\n end if\n\n if( i /= 1 .and. j /= 1 ) then\n if( ss(i,j-1) <= ss(i-1,j) ) then \n ss(i,j) = ss(i,j) + ss(i,j-1) \n else\n ss(i,j) = ss(i,j) + ss(i-1,j)\n end if\n end if\n\n end do\n end do\n \n if( ss(h-1,w) <= ss(h,w-1) ) then\n ans = ss(h-1,w)\n else\n ans = ss(h,w-1)\n end if\n\n if( s(h)%n(w:w) == \"#\" ) then\n ans = ans + 1 \n end if\n print*, ans\n\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nConsider a grid with H rows and W columns of squares. Let (r, c) denote the square at the r-th row from the top and the c-th column from the left.\nEach square is painted black or white.\n\nThe grid is said to be good if and only if the following condition is satisfied:\n\nFrom (1, 1), we can reach (H, W) by moving one square right or down repeatedly, while always being on a white square.\n\nNote that (1, 1) and (H, W) must be white if the grid is good.\n\nYour task is to make the grid good by repeating the operation below. Find the minimum number of operations needed to complete the task. It can be proved that you can always complete the task in a finite number of operations.\n\nChoose four integers r_0, c_0, r_1, c_1(1 \\leq r_0 \\leq r_1 \\leq H, 1 \\leq c_0 \\leq c_1 \\leq W). For each pair r, c (r_0 \\leq r \\leq r_1, c_0 \\leq c \\leq c_1), invert the color of (r, c) - that is, from white to black and vice versa.\n\nConstraints\n\n2 \\leq H, W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{11} s_{12} \\cdots s_{1W}\ns_{21} s_{22} \\cdots s_{2W}\n\\vdots\ns_{H1} s_{H2} \\cdots s_{HW}\n\nHere s_{rc} represents the color of (r, c) - # stands for black, and . stands for white.\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3 3\n.##\n.#.\n##.\n\nSample Output 1\n\n1\n\nDo the operation with (r_0, c_0, r_1, c_1) = (2, 2, 2, 2) to change just the color of (2, 2), and we are done.\n\nSample Input 2\n\n2 2\n#.\n.#\n\nSample Output 2\n\n2\n\nSample Input 3\n\n4 4\n..##\n#...\n###.\n###.\n\nSample Output 3\n\n0\n\nNo operation may be needed.\n\nSample Input 4\n\n5 5\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n\nSample Output 4\n\n4", "sample_input": "3 3\n.##\n.#.\n##.\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02735", "source_text": "Score : 400 points\n\nProblem Statement\n\nConsider a grid with H rows and W columns of squares. Let (r, c) denote the square at the r-th row from the top and the c-th column from the left.\nEach square is painted black or white.\n\nThe grid is said to be good if and only if the following condition is satisfied:\n\nFrom (1, 1), we can reach (H, W) by moving one square right or down repeatedly, while always being on a white square.\n\nNote that (1, 1) and (H, W) must be white if the grid is good.\n\nYour task is to make the grid good by repeating the operation below. Find the minimum number of operations needed to complete the task. It can be proved that you can always complete the task in a finite number of operations.\n\nChoose four integers r_0, c_0, r_1, c_1(1 \\leq r_0 \\leq r_1 \\leq H, 1 \\leq c_0 \\leq c_1 \\leq W). For each pair r, c (r_0 \\leq r \\leq r_1, c_0 \\leq c \\leq c_1), invert the color of (r, c) - that is, from white to black and vice versa.\n\nConstraints\n\n2 \\leq H, W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{11} s_{12} \\cdots s_{1W}\ns_{21} s_{22} \\cdots s_{2W}\n\\vdots\ns_{H1} s_{H2} \\cdots s_{HW}\n\nHere s_{rc} represents the color of (r, c) - # stands for black, and . stands for white.\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3 3\n.##\n.#.\n##.\n\nSample Output 1\n\n1\n\nDo the operation with (r_0, c_0, r_1, c_1) = (2, 2, 2, 2) to change just the color of (2, 2), and we are done.\n\nSample Input 2\n\n2 2\n#.\n.#\n\nSample Output 2\n\n2\n\nSample Input 3\n\n4 4\n..##\n#...\n###.\n###.\n\nSample Output 3\n\n0\n\nNo operation may be needed.\n\nSample Input 4\n\n5 5\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n\nSample Output 4\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1179, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s690384233", "group_id": "codeNet:p02736", "input_text": "program main\n implicit none\n integer n\n integer, allocatable, dimension(:) :: x\n integer i, j, d\n character s*1000000\n\n read(*,*) n\n read(*,*) s\n allocate(x(n))\n \n do i = 1,n\n read(s(i:i),*) x(i)\n end do\n\n do j = 2, n\n do i = 1, n+1-j\n d = x(i) - x(i+1)\n x(i) = xor(d,rshift(d,31))-rshift(d,31)\n end do\n end do\n\n write(*,*) x(1)\n\n deallocate(x)\n\nend program", "language": "Fortran", "metadata": {"date": 1584847731, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02736.html", "problem_id": "p02736", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02736/input.txt", "sample_output_relpath": "derived/input_output/data/p02736/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02736/Fortran/s690384233.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s690384233", "user_id": "u806372060"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer n\n integer, allocatable, dimension(:) :: x\n integer i, j, d\n character s*1000000\n\n read(*,*) n\n read(*,*) s\n allocate(x(n))\n \n do i = 1,n\n read(s(i:i),*) x(i)\n end do\n\n do j = 2, n\n do i = 1, n+1-j\n d = x(i) - x(i+1)\n x(i) = xor(d,rshift(d,31))-rshift(d,31)\n end do\n end do\n\n write(*,*) x(1)\n\n deallocate(x)\n\nend program", "problem_context": "Score : 700 points\n\nProblem Statement\n\nGiven is a sequence of N digits a_1a_2\\ldots a_N, where each element is 1, 2, or 3.\nLet x_{i,j} defined as follows:\n\nx_{1,j} := a_j \\quad (1 \\leq j \\leq N)\n\nx_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \\quad (2 \\leq i \\leq N and 1 \\leq j \\leq N+1-i)\n\nFind x_{N,1}.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\na_i = 1,2,3 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1a_2\\ldotsa_N\n\nOutput\n\nPrint x_{N,1}.\n\nSample Input 1\n\n4\n1231\n\nSample Output 1\n\n1\n\nx_{1,1},x_{1,2},x_{1,3},x_{1,4} are respectively 1,2,3,1.\n\nx_{2,1},x_{2,2},x_{2,3} are respectively |1-2| = 1,|2-3| = 1,|3-1| = 2.\n\nx_{3,1},x_{3,2} are respectively |1-1| = 0,|1-2| = 1.\n\nFinally, x_{4,1} = |0-1| = 1, so the answer is 1.\n\nSample Input 2\n\n10\n2311312312\n\nSample Output 2\n\n0", "sample_input": "4\n1231\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02736", "source_text": "Score : 700 points\n\nProblem Statement\n\nGiven is a sequence of N digits a_1a_2\\ldots a_N, where each element is 1, 2, or 3.\nLet x_{i,j} defined as follows:\n\nx_{1,j} := a_j \\quad (1 \\leq j \\leq N)\n\nx_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \\quad (2 \\leq i \\leq N and 1 \\leq j \\leq N+1-i)\n\nFind x_{N,1}.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\na_i = 1,2,3 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1a_2\\ldotsa_N\n\nOutput\n\nPrint x_{N,1}.\n\nSample Input 1\n\n4\n1231\n\nSample Output 1\n\n1\n\nx_{1,1},x_{1,2},x_{1,3},x_{1,4} are respectively 1,2,3,1.\n\nx_{2,1},x_{2,2},x_{2,3} are respectively |1-2| = 1,|2-3| = 1,|3-1| = 2.\n\nx_{3,1},x_{3,2} are respectively |1-1| = 0,|1-2| = 1.\n\nFinally, x_{4,1} = |0-1| = 1, so the answer is 1.\n\nSample Input 2\n\n10\n2311312312\n\nSample Output 2\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 2104, "memory_kb": 6280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s425537711", "group_id": "codeNet:p02742", "input_text": "program main\n implicit none\n integer(8) :: H,W,out\n integer(8) :: a,b, i,j\n\n read(*,*) H,W\n if (H == 1 .or. W == 1) then\n write(*,'(i0)') 1\n stop\n end if\n if (mod(W,2) == 0) then\n a = W/2\n b = W/2\n else\n a = W/2 + 1\n b = W/2\n end if\n out = 0\n if ( mod(H,2) == 0 ) then\n out = H/2*a + H/2*b\n else\n out = (H/2+1)*a + H/2*b\n end if\n write(*,'(i0)') out \nend program main", "language": "Fortran", "metadata": {"date": 1584235486, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02742.html", "problem_id": "p02742", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02742/input.txt", "sample_output_relpath": "derived/input_output/data/p02742/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02742/Fortran/s425537711.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s425537711", "user_id": "u886432251"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: H,W,out\n integer(8) :: a,b, i,j\n\n read(*,*) H,W\n if (H == 1 .or. W == 1) then\n write(*,'(i0)') 1\n stop\n end if\n if (mod(W,2) == 0) then\n a = W/2\n b = W/2\n else\n a = W/2 + 1\n b = W/2\n end if\n out = 0\n if ( mod(H,2) == 0 ) then\n out = H/2*a + H/2*b\n else\n out = (H/2+1)*a + H/2*b\n end if\n write(*,'(i0)') out \nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "sample_input": "4 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02742", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 413, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s241787461", "group_id": "codeNet:p02742", "input_text": "program main\n implicit none\n integer(8) :: H,W,out\n integer(8) :: a,b, i,j\n\n read(*,*) H,W\n if (mod(W,2) == 0) then\n a = W/2\n b = W/2\n else\n a = W/2 + 1\n b = W/2 \n end if\n out = 0\n\n if ( mod(H,2) == 0 ) then\n out = H/2*a + H/2*b\n else\n out = (H/2+1)*a + H/2*b\n end if\n write(*,'(i0)') out \nend program main\n", "language": "Fortran", "metadata": {"date": 1584234623, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02742.html", "problem_id": "p02742", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02742/input.txt", "sample_output_relpath": "derived/input_output/data/p02742/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02742/Fortran/s241787461.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s241787461", "user_id": "u886432251"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: H,W,out\n integer(8) :: a,b, i,j\n\n read(*,*) H,W\n if (mod(W,2) == 0) then\n a = W/2\n b = W/2\n else\n a = W/2 + 1\n b = W/2 \n end if\n out = 0\n\n if ( mod(H,2) == 0 ) then\n out = H/2*a + H/2*b\n else\n out = (H/2+1)*a + H/2*b\n end if\n write(*,'(i0)') out \nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "sample_input": "4 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02742", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s982132174", "group_id": "codeNet:p02747", "input_text": "program main\n implicit none\n integer i,flag\n integer length\n character s*10\n\n flag = 0\n\n read(*,*) s\n \n length = len_trim(s)\n\n do i = 1,length\n if (mod(i,2) == 1) then\n if (s(i:i) == \"h\") then\n flag = 0\n else \n flag = 1\n end if\n else if (mod(i,2) == 0) then\n if (s(i:i) == \"i\") then\n flag = 0\n else \n flag = 1\n end if\n end if\n\n if (flag == 1) then\n write(*,*) \"No\"\n exit\n end if\n\n end do\n\n if (length >= 2) then\n if(flag == 0) then\n write(*,*) \"Yes\"\n end if\n else \n write(*,*) \"No\"\n end if\n\n\nend program", "language": "Fortran", "metadata": {"date": 1583716702, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02747.html", "problem_id": "p02747", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02747/input.txt", "sample_output_relpath": "derived/input_output/data/p02747/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02747/Fortran/s982132174.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s982132174", "user_id": "u806372060"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n integer i,flag\n integer length\n character s*10\n\n flag = 0\n\n read(*,*) s\n \n length = len_trim(s)\n\n do i = 1,length\n if (mod(i,2) == 1) then\n if (s(i:i) == \"h\") then\n flag = 0\n else \n flag = 1\n end if\n else if (mod(i,2) == 0) then\n if (s(i:i) == \"i\") then\n flag = 0\n else \n flag = 1\n end if\n end if\n\n if (flag == 1) then\n write(*,*) \"No\"\n exit\n end if\n\n end do\n\n if (length >= 2) then\n if(flag == 0) then\n write(*,*) \"Yes\"\n end if\n else \n write(*,*) \"No\"\n end if\n\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "sample_input": "hihi\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02747", "source_text": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 757, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s713244766", "group_id": "codeNet:p02748", "input_text": "program main\n implicit none\n integer a, b, m\n integer, allocatable, dimension(:) :: ai, bi, x, y, c\n integer i, value\n integer a_min, b_min, value_min\n\n read(*,*) a, b, m\n\n allocate(ai(a))\n allocate(bi(b))\n allocate(x(m))\n allocate(y(m))\n allocate(c(m))\n\n read(*,*) ai\n read(*,*) bi\n do i = 1,m\n read(*,*) x(i),y(i),c(i)\n end do\n\n a_min = ai(1)\n b_min = bi(1)\n \n do i = 1,a\n if(ai(i) <= a_min) then\n a_min = ai(i)\n end if\n end do\n\n do i = 1,b\n if(bi(i) <= b_min) then\n b_min = bi(i)\n end if\n end do\n\n value_min = a_min + b_min\n\n do i = 1,m\n value = ai(x(i)) + bi(y(i)) - c(i)\n if(value <= value_min) then\n value_min = value\n end if\n end do\n\n write(*,*) value_min\n\n\nend program", "language": "Fortran", "metadata": {"date": 1583717944, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/Fortran/s713244766.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s713244766", "user_id": "u806372060"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer a, b, m\n integer, allocatable, dimension(:) :: ai, bi, x, y, c\n integer i, value\n integer a_min, b_min, value_min\n\n read(*,*) a, b, m\n\n allocate(ai(a))\n allocate(bi(b))\n allocate(x(m))\n allocate(y(m))\n allocate(c(m))\n\n read(*,*) ai\n read(*,*) bi\n do i = 1,m\n read(*,*) x(i),y(i),c(i)\n end do\n\n a_min = ai(1)\n b_min = bi(1)\n \n do i = 1,a\n if(ai(i) <= a_min) then\n a_min = ai(i)\n end if\n end do\n\n do i = 1,b\n if(bi(i) <= b_min) then\n b_min = bi(i)\n end if\n end do\n\n value_min = a_min + b_min\n\n do i = 1,m\n value = ai(x(i)) + bi(y(i)) - c(i)\n if(value <= value_min) then\n value_min = value\n end if\n end do\n\n write(*,*) value_min\n\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 843, "cpu_time_ms": 132, "memory_kb": 2816}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s817532692", "group_id": "codeNet:p02750", "input_text": "module mod_two_dim_merge_sort\n implicit none\n integer, private, parameter :: intkind = 8\ncontains\n logical function less(a, b) result(res)\n integer(intkind), intent(in) :: a(:), b(:)\n real(8) :: a1, b1\n a1 = a(1) / real(a(2) + 1, 8)\n b1 = b(1) / real(b(2) + 1, 8)\n res = a1 > b1 .or. (a1 == b1 .and. a(2) >= b(2))\n end\n subroutine merge_sort(a)\n integer(intkind), intent(inout) :: a(:, :)\n integer :: n, m, l, i, u\n n = size(a, 1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m / 2\n u = min(2 * i * l, n)\n call merger(a(2 * (i - 1) * l + 1:(2 * i - 1) * l, :), &\n a((2 * i - 1) * l + 1:u, :))\n end do\n l = 2 * l\n m = (m + 1) / 2\n end do\n end\n subroutine merger(a1, a2)\n integer(intkind), intent(inout) :: a1(:, :), a2(:, :)\n integer(intkind) :: a(size(a1, 1) + size(a2, 1), size(a1, 2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1, 1)\n n2 = size(a2, 1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (less(a1(i1, :), a2(i2, :))) then\n a(i1 + i2 - 1, :) = a1(i1, :)\n i1 = i1 + 1\n else\n a(i1 + i2 - 1, :) = a2(i2, :)\n i2 = i2 + 1\n end if\n end do\n if (i1 <= n1) then\n a(i1 + i2 - 1:n1 + n2, :) = a1(i1:n1, :)\n else\n a(i1 + i2 - 1:n1 + n2, :) = a2(i2:n2, :)\n end if\n a1 = a(1:n1, :)\n a2 = a(n1 + 1:n1 + n2, :)\n end\nend module mod_two_dim_merge_sort\nprogram manga_market\n use mod_two_dim_merge_sort\n implicit none\n integer(8), parameter :: inf = 3e18\n integer :: n, l, i, j, m = 0, p, q, h\n integer(8) :: t, r\n integer(8), allocatable :: c(:, :), dp(:, :), s(:)\n read(*,*) n, t\n allocate(c(n, 2))\n do i = 1, n\n read(*,*) c(i, :)\n end do\n call merge_sort(c(1:n, 1:2))\n l = n + 1\n do while (c(l - 1, 1) == 0)\n l = l - 1\n end do\n allocate(dp(0:28, 0:l - 1), s(0:n - 1 + 1))\n dp = inf\n dp(0, :) = 0\n do i = 1, l - 1\n do j = 1, min(28, i)\n dp(j, i) = dp(j, i - 1)\n if (dp(j - 1, i - 1) == inf) cycle\n dp(j, i) = min(dp(j, i), 1 + dp(j - 1, i - 1) + c(i, 1) * dp(j - 1, i - 1) + c(i, 2))\n end do\n end do\n s(0) = 0\n do i = n, l, -1\n s(n - i + 1) = s(n - i) + c(i, 2)\n end do\n do i = 0, min(28, l - 1)\n r = t - dp(i, l - 1)\n if (r < 0) cycle\n p = -1\n q = n - l + 1\n do while (q - p > 1)\n h = (p + q) / 2\n if (s(h) < r - h) then\n p = h\n else\n q = h\n end if\n end do\n m = max(m, i + q)\n end do\n write(*,'(i0)') m\nend program manga_market", "language": "Fortran", "metadata": {"date": 1598386680, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02750.html", "problem_id": "p02750", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02750/input.txt", "sample_output_relpath": "derived/input_output/data/p02750/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02750/Fortran/s817532692.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s817532692", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module mod_two_dim_merge_sort\n implicit none\n integer, private, parameter :: intkind = 8\ncontains\n logical function less(a, b) result(res)\n integer(intkind), intent(in) :: a(:), b(:)\n real(8) :: a1, b1\n a1 = a(1) / real(a(2) + 1, 8)\n b1 = b(1) / real(b(2) + 1, 8)\n res = a1 > b1 .or. (a1 == b1 .and. a(2) >= b(2))\n end\n subroutine merge_sort(a)\n integer(intkind), intent(inout) :: a(:, :)\n integer :: n, m, l, i, u\n n = size(a, 1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m / 2\n u = min(2 * i * l, n)\n call merger(a(2 * (i - 1) * l + 1:(2 * i - 1) * l, :), &\n a((2 * i - 1) * l + 1:u, :))\n end do\n l = 2 * l\n m = (m + 1) / 2\n end do\n end\n subroutine merger(a1, a2)\n integer(intkind), intent(inout) :: a1(:, :), a2(:, :)\n integer(intkind) :: a(size(a1, 1) + size(a2, 1), size(a1, 2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1, 1)\n n2 = size(a2, 1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (less(a1(i1, :), a2(i2, :))) then\n a(i1 + i2 - 1, :) = a1(i1, :)\n i1 = i1 + 1\n else\n a(i1 + i2 - 1, :) = a2(i2, :)\n i2 = i2 + 1\n end if\n end do\n if (i1 <= n1) then\n a(i1 + i2 - 1:n1 + n2, :) = a1(i1:n1, :)\n else\n a(i1 + i2 - 1:n1 + n2, :) = a2(i2:n2, :)\n end if\n a1 = a(1:n1, :)\n a2 = a(n1 + 1:n1 + n2, :)\n end\nend module mod_two_dim_merge_sort\nprogram manga_market\n use mod_two_dim_merge_sort\n implicit none\n integer(8), parameter :: inf = 3e18\n integer :: n, l, i, j, m = 0, p, q, h\n integer(8) :: t, r\n integer(8), allocatable :: c(:, :), dp(:, :), s(:)\n read(*,*) n, t\n allocate(c(n, 2))\n do i = 1, n\n read(*,*) c(i, :)\n end do\n call merge_sort(c(1:n, 1:2))\n l = n + 1\n do while (c(l - 1, 1) == 0)\n l = l - 1\n end do\n allocate(dp(0:28, 0:l - 1), s(0:n - 1 + 1))\n dp = inf\n dp(0, :) = 0\n do i = 1, l - 1\n do j = 1, min(28, i)\n dp(j, i) = dp(j, i - 1)\n if (dp(j - 1, i - 1) == inf) cycle\n dp(j, i) = min(dp(j, i), 1 + dp(j - 1, i - 1) + c(i, 1) * dp(j - 1, i - 1) + c(i, 2))\n end do\n end do\n s(0) = 0\n do i = n, l, -1\n s(n - i + 1) = s(n - i) + c(i, 2)\n end do\n do i = 0, min(28, l - 1)\n r = t - dp(i, l - 1)\n if (r < 0) cycle\n p = -1\n q = n - l + 1\n do while (q - p > 1)\n h = (p + q) / 2\n if (s(h) < r - h) then\n p = h\n else\n q = h\n end if\n end do\n m = max(m, i + q)\n end do\n write(*,'(i0)') m\nend program manga_market", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere are N stores called Store 1, Store 2, \\cdots, Store N. Takahashi, who is at his house at time 0, is planning to visit some of these stores.\n\nIt takes Takahashi one unit of time to travel from his house to one of the stores, or between any two stores.\n\nIf Takahashi reaches Store i at time t, he can do shopping there after standing in a queue for a_i \\times t + b_i units of time. (We assume that it takes no time other than waiting.)\n\nAll the stores close at time T + 0.5. If Takahashi is standing in a queue for some store then, he cannot do shopping there.\n\nTakahashi does not do shopping more than once in the same store.\n\nFind the maximum number of times he can do shopping before time T + 0.5.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\n0 \\leq b_i \\leq 10^9\n\n0 \\leq T \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\na_1 b_1\na_2 b_2\n\\vdots\na_N b_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 7\n2 0\n3 2\n0 3\n\nSample Output 1\n\n2\n\nHere is one possible way to visit stores:\n\nFrom time 0 to time 1: in 1 unit of time, he travels from his house to Store 1.\n\nFrom time 1 to time 3: for 2 units of time, he stands in a queue for Store 1 to do shopping.\n\nFrom time 3 to time 4: in 1 unit of time, he travels from Store 1 to Store 3.\n\nFrom time 4 to time 7: for 3 units of time, he stands in a queue for Store 3 to do shopping.\n\nIn this way, he can do shopping twice before time 7.5.\n\nSample Input 2\n\n1 3\n0 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 21600\n2 14\n3 22\n1 3\n1 10\n1 9\n\nSample Output 3\n\n5\n\nSample Input 4\n\n7 57\n0 25\n3 10\n2 4\n5 15\n3 22\n2 14\n1 15\n\nSample Output 4\n\n3", "sample_input": "3 7\n2 0\n3 2\n0 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02750", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere are N stores called Store 1, Store 2, \\cdots, Store N. Takahashi, who is at his house at time 0, is planning to visit some of these stores.\n\nIt takes Takahashi one unit of time to travel from his house to one of the stores, or between any two stores.\n\nIf Takahashi reaches Store i at time t, he can do shopping there after standing in a queue for a_i \\times t + b_i units of time. (We assume that it takes no time other than waiting.)\n\nAll the stores close at time T + 0.5. If Takahashi is standing in a queue for some store then, he cannot do shopping there.\n\nTakahashi does not do shopping more than once in the same store.\n\nFind the maximum number of times he can do shopping before time T + 0.5.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\n0 \\leq b_i \\leq 10^9\n\n0 \\leq T \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\na_1 b_1\na_2 b_2\n\\vdots\na_N b_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 7\n2 0\n3 2\n0 3\n\nSample Output 1\n\n2\n\nHere is one possible way to visit stores:\n\nFrom time 0 to time 1: in 1 unit of time, he travels from his house to Store 1.\n\nFrom time 1 to time 3: for 2 units of time, he stands in a queue for Store 1 to do shopping.\n\nFrom time 3 to time 4: in 1 unit of time, he travels from Store 1 to Store 3.\n\nFrom time 4 to time 7: for 3 units of time, he stands in a queue for Store 3 to do shopping.\n\nIn this way, he can do shopping twice before time 7.5.\n\nSample Input 2\n\n1 3\n0 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 21600\n2 14\n3 22\n1 3\n1 10\n1 9\n\nSample Output 3\n\n5\n\nSample Input 4\n\n7 57\n0 25\n3 10\n2 4\n5 15\n3 22\n2 14\n1 15\n\nSample Output 4\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2516, "cpu_time_ms": 197, "memory_kb": 52320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s036740713", "group_id": "codeNet:p02753", "input_text": "program main\n implicit none\n integer i\n character(3) S \n read(*, *) S\n !read(*, *) (L(i), i = 1,N)\n if (S == 'AAA') then\n write(*, *) 'No'\n elseif (S == 'BBB') then\n write(*, *) 'No'\n else\n write(*, *) 'Yes'\n endif\nend program main\n", "language": "Fortran", "metadata": {"date": 1584838482, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02753.html", "problem_id": "p02753", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02753/input.txt", "sample_output_relpath": "derived/input_output/data/p02753/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02753/Fortran/s036740713.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s036740713", "user_id": "u050276949"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n integer i\n character(3) S \n read(*, *) S\n !read(*, *) (L(i), i = 1,N)\n if (S == 'AAA') then\n write(*, *) 'No'\n elseif (S == 'BBB') then\n write(*, *) 'No'\n else\n write(*, *) 'Yes'\n endif\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "sample_input": "ABA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02753", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s156111876", "group_id": "codeNet:p02753", "input_text": "program station_and_bus\n implicit none\n character(3) :: s\n integer :: n = 0, i\n read(*,*) s\n do i = 1, 3\n n = n+ichar(s(i:i))-65\n end do\n if (n == 0 .or. n == 3) then\n write(*,'(a)') \"No\"\n else\n write(*,'(a)') \"Yes\"\n end if\nend program station_and_bus", "language": "Fortran", "metadata": {"date": 1583632986, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02753.html", "problem_id": "p02753", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02753/input.txt", "sample_output_relpath": "derived/input_output/data/p02753/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02753/Fortran/s156111876.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156111876", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program station_and_bus\n implicit none\n character(3) :: s\n integer :: n = 0, i\n read(*,*) s\n do i = 1, 3\n n = n+ichar(s(i:i))-65\n end do\n if (n == 0 .or. n == 3) then\n write(*,'(a)') \"No\"\n else\n write(*,'(a)') \"Yes\"\n end if\nend program station_and_bus", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "sample_input": "ABA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02753", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s671578901", "group_id": "codeNet:p02754", "input_text": "program main\n implicit none\n integer(8) :: n, a, b, i, j\n\n read(*,*) n, a, b\n\n i = mod(n, a+b)\n j = n/(a+b)\n\n if ( i < a ) then\n print *, j*a + i\n else\n print *, j*a + a\n end if\n\nend program main\n\n", "language": "Fortran", "metadata": {"date": 1586711992, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Fortran/s671578901.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s671578901", "user_id": "u353721260"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: n, a, b, i, j\n\n read(*,*) n, a, b\n\n i = mod(n, a+b)\n j = n/(a+b)\n\n if ( i < a ) then\n print *, j*a + i\n else\n print *, j*a + a\n end if\n\nend program main\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s371454904", "group_id": "codeNet:p02754", "input_text": "program main\n implicit none\n integer :: a,b,n\n read *, n,a,b\n if (n<=a+b) then\n if (mod(n,a+b)==0) then\n write(*,'(i0)') b\n else if (mod(n,a+b)<=a) then\n write(*,'(i0)') 0\n else if (mod(n,a+b)>a) then\n write(*,'(i0)') mod(n,a+b)-a\n end if\n else if (n>a+b) then\n if (mod(n,a+b)==0) then\n write(*,'(i0)') b*n/(a+b)\n else if (mod(n,a+b)<=a) then\n write(*,'(i0)') (n-mod(n,a+b))/(a+b)\n else if (mod(n,a+b)>a) then\n write(*,'(i0)') b*(n-mod(n,a+b))/(a+b)+mod(n,a+b)-a\n end if\n end if\n stop\nend program main", "language": "Fortran", "metadata": {"date": 1584606825, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Fortran/s371454904.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s371454904", "user_id": "u821071900"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer :: a,b,n\n read *, n,a,b\n if (n<=a+b) then\n if (mod(n,a+b)==0) then\n write(*,'(i0)') b\n else if (mod(n,a+b)<=a) then\n write(*,'(i0)') 0\n else if (mod(n,a+b)>a) then\n write(*,'(i0)') mod(n,a+b)-a\n end if\n else if (n>a+b) then\n if (mod(n,a+b)==0) then\n write(*,'(i0)') b*n/(a+b)\n else if (mod(n,a+b)<=a) then\n write(*,'(i0)') (n-mod(n,a+b))/(a+b)\n else if (mod(n,a+b)>a) then\n write(*,'(i0)') b*(n-mod(n,a+b))/(a+b)+mod(n,a+b)-a\n end if\n end if\n stop\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s892627196", "group_id": "codeNet:p02754", "input_text": "program main\n implicit none\n integer(8) N, A, B\n integer :: ao=0\n integer(8) i,ii\n\n read *, N, A, B\n\ndo i=1,1000000000\n if (N>(A+B)) then\n N=N-(A+B)\n ao=ao+A\n end if\n\n if (N<=(A+B)) then\n if (A==0) goto 100\n do ii=1,A\n if ((N-ii)>=0) ao=ao+1\n if ((N-ii)==0) goto 100\n end do\n goto 100\n end if\nend do\n\n100 continue\n print '(i0)', ao\n\nendprogram main\n", "language": "Fortran", "metadata": {"date": 1583634410, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Fortran/s892627196.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s892627196", "user_id": "u838994321"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer(8) N, A, B\n integer :: ao=0\n integer(8) i,ii\n\n read *, N, A, B\n\ndo i=1,1000000000\n if (N>(A+B)) then\n N=N-(A+B)\n ao=ao+A\n end if\n\n if (N<=(A+B)) then\n if (A==0) goto 100\n do ii=1,A\n if ((N-ii)>=0) ao=ao+1\n if ((N-ii)==0) goto 100\n end do\n goto 100\n end if\nend do\n\n100 continue\n print '(i0)', ao\n\nendprogram main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 2103, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s821130538", "group_id": "codeNet:p02754", "input_text": "program abc\n\timplicit none\n\tinteger :: n,a,b,c,d,e,x\n\n\tread(*,*) n,a,b\n\n\tc = a + b\n \n d = mod(n,c)\n \n e = (n - d) / c\n \n if(d < a) then\n \tx = a * e + d\n else\n \tx = a * e + a\n endif\n \n\twrite(*,*) x\n \nend program abc", "language": "Fortran", "metadata": {"date": 1583633839, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02754.html", "problem_id": "p02754", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02754/input.txt", "sample_output_relpath": "derived/input_output/data/p02754/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02754/Fortran/s821130538.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s821130538", "user_id": "u459127065"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program abc\n\timplicit none\n\tinteger :: n,a,b,c,d,e,x\n\n\tread(*,*) n,a,b\n\n\tc = a + b\n \n d = mod(n,c)\n \n e = (n - d) / c\n \n if(d < a) then\n \tx = a * e + d\n else\n \tx = a * e + a\n endif\n \n\twrite(*,*) x\n \nend program abc", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s845419577", "group_id": "codeNet:p02755", "input_text": "program abc\n\timplicit none\n\tinteger :: a,b,n,na,nb,x\n double precision :: an,bn\n\n\tread(*,*) a,b\n\t\n x = -1\n \n do n = 1, 1000\n \tan = n * 0.08\n na = int(an)\n if(na /= a) goto 100\n bn = n * 0.1\n nb = int(bn)\n if(nb /= b) goto 100\n x = n\n goto 200\n100\t\tcontinue\n\tenddo\n\n200\tcontinue\n \n\twrite(*,*) x\n \nend program abc", "language": "Fortran", "metadata": {"date": 1583635696, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02755.html", "problem_id": "p02755", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02755/input.txt", "sample_output_relpath": "derived/input_output/data/p02755/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02755/Fortran/s845419577.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845419577", "user_id": "u459127065"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "program abc\n\timplicit none\n\tinteger :: a,b,n,na,nb,x\n double precision :: an,bn\n\n\tread(*,*) a,b\n\t\n x = -1\n \n do n = 1, 1000\n \tan = n * 0.08\n na = int(an)\n if(na /= a) goto 100\n bn = n * 0.1\n nb = int(bn)\n if(nb /= b) goto 100\n x = n\n goto 200\n100\t\tcontinue\n\tenddo\n\n200\tcontinue\n \n\twrite(*,*) x\n \nend program abc", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)\n\nHere, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.\n\nIf multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n25\n\nIf the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 25 \\times 0.08 \\rfloor = \\lfloor 2 \\rfloor = 2 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 25 \\times 0.1 \\rfloor = \\lfloor 2.5 \\rfloor = 2 yen.\n\nThus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.\n\nSample Input 2\n\n8 10\n\nSample Output 2\n\n100\n\nIf the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 100 \\times 0.08 \\rfloor = 8 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 100 \\times 0.1 \\rfloor = 10 yen.\n\nSample Input 3\n\n19 99\n\nSample Output 3\n\n-1\n\nThere is no price before tax satisfying this condition, so print -1.", "sample_input": "2 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02755", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)\n\nHere, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.\n\nIf multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n25\n\nIf the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 25 \\times 0.08 \\rfloor = \\lfloor 2 \\rfloor = 2 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 25 \\times 0.1 \\rfloor = \\lfloor 2.5 \\rfloor = 2 yen.\n\nThus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.\n\nSample Input 2\n\n8 10\n\nSample Output 2\n\n100\n\nIf the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 100 \\times 0.08 \\rfloor = 8 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 100 \\times 0.1 \\rfloor = 10 yen.\n\nSample Input 3\n\n19 99\n\nSample Output 3\n\n-1\n\nThere is no price before tax satisfying this condition, so print -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s488302395", "group_id": "codeNet:p02757", "input_text": "program main\n implicit none\n integer(8) :: n, m, i, dig, res\n integer(8), allocatable :: d(:), cnt(:)\n character(200000) :: s\n read *, n, m\n read *, s\n allocate (d(n), cnt(0:m - 1))\n\n if (m == 2 .or. m == 5) then\n res = 0\n do i = 1, n\n read (s(i:i), *) dig\n if (modulo(dig, m) == 0) res = res + i\n end do\n else\n read (s(n:n), *) dig\n cnt = 0\n cnt(0) = 1\n d(n) = modulo(dig, m)\n cnt(d(n)) = cnt(d(n)) + 1\n do i = n - 1, 1, -1\n read (s(i:i), *) dig\n d(i) = d(i + 1) + pow(10_8, n - i) * dig\n d(i) = modulo(d(i), m)\n cnt(d(i)) = cnt(d(i)) + 1\n end do\n\n res = 0\n do i = 0, m - 1\n res = res + cnt(i) * (cnt(i) - 1) / 2\n end do\n end if\n print \"(i0)\", res\n contains\n\n recursive function pow(n, p) result(res)\n integer(8), intent(in) :: n, p\n integer(8) :: res\n if (p == 0) then\n res = 1\n else if (modulo(p, 2_8) == 0) then\n res = modulo(pow(n, p / 2) ** 2, m)\n else\n res = modulo(pow(n, p - 1) * n, m)\n end if\n end function pow\nend program main\n", "language": "Fortran", "metadata": {"date": 1588414995, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02757.html", "problem_id": "p02757", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02757/input.txt", "sample_output_relpath": "derived/input_output/data/p02757/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02757/Fortran/s488302395.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488302395", "user_id": "u388927326"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: n, m, i, dig, res\n integer(8), allocatable :: d(:), cnt(:)\n character(200000) :: s\n read *, n, m\n read *, s\n allocate (d(n), cnt(0:m - 1))\n\n if (m == 2 .or. m == 5) then\n res = 0\n do i = 1, n\n read (s(i:i), *) dig\n if (modulo(dig, m) == 0) res = res + i\n end do\n else\n read (s(n:n), *) dig\n cnt = 0\n cnt(0) = 1\n d(n) = modulo(dig, m)\n cnt(d(n)) = cnt(d(n)) + 1\n do i = n - 1, 1, -1\n read (s(i:i), *) dig\n d(i) = d(i + 1) + pow(10_8, n - i) * dig\n d(i) = modulo(d(i), m)\n cnt(d(i)) = cnt(d(i)) + 1\n end do\n\n res = 0\n do i = 0, m - 1\n res = res + cnt(i) * (cnt(i) - 1) / 2\n end do\n end if\n print \"(i0)\", res\n contains\n\n recursive function pow(n, p) result(res)\n integer(8), intent(in) :: n, p\n integer(8) :: res\n if (p == 0) then\n res = 1\n else if (modulo(p, 2_8) == 0) then\n res = modulo(pow(n, p / 2) ** 2, m)\n else\n res = modulo(pow(n, p - 1) * n, m)\n end if\n end function pow\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "sample_input": "4 3\n3543\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02757", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1059, "cpu_time_ms": 203, "memory_kb": 2316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s734320485", "group_id": "codeNet:p02759", "input_text": "program prob33\n implicit none\n integer :: n\n\n read(*,*) n\n\n write(*,*) (n+1)/2\n stop\ncontains\nend program prob33", "language": "Fortran", "metadata": {"date": 1592630042, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02759.html", "problem_id": "p02759", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02759/input.txt", "sample_output_relpath": "derived/input_output/data/p02759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02759/Fortran/s734320485.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s734320485", "user_id": "u478462004"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program prob33\n implicit none\n integer :: n\n\n read(*,*) n\n\n write(*,*) (n+1)/2\n stop\ncontains\nend program prob33", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.\n\nAt least how many sheets of paper does he need?\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3\n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n50", "sample_input": "5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02759", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.\n\nAt least how many sheets of paper does he need?\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3\n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n50", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s806678917", "group_id": "codeNet:p02759", "input_text": "program example\n\timplicit none\n\n\tinteger N\n \n read(*,*) N\n \n if(mod(N,2)==0) then\n \twrite(*,*) N/2\n else \n \twrite(*,*) (N/2)+1\n end if\n\nend program example", "language": "Fortran", "metadata": {"date": 1583114568, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02759.html", "problem_id": "p02759", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02759/input.txt", "sample_output_relpath": "derived/input_output/data/p02759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02759/Fortran/s806678917.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s806678917", "user_id": "u374107737"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tinteger N\n \n read(*,*) N\n \n if(mod(N,2)==0) then\n \twrite(*,*) N/2\n else \n \twrite(*,*) (N/2)+1\n end if\n\nend program example", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.\n\nAt least how many sheets of paper does he need?\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3\n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n50", "sample_input": "5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02759", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.\n\nAt least how many sheets of paper does he need?\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3\n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n50", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 10, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s224257890", "group_id": "codeNet:p02760", "input_text": "program Bingo\n implicit none\n integer(4):: bng(3,3), num\n integer(4):: i,j,k, n\n logical:: is_open(3,3) = .false.\n\n do i=1, 3\n read*, bng(:,i)\n end do\n\n read*, n\n\n do i=1, n\n read*, num\n\n do j=1,3\n do k=1,3\n if (bng(k,j) == num) is_open(k,j) = .true. \n end do\n end do\n end do\n\n if (check_bingo(is_open)) then\n print*, 'Yes'\n else\n print*, 'No'\n end if\n\n contains\n function check_bingo(is_open) result(is_bingo)\n integer(4):: i,j\n logical:: is_open(3,3), is_bingo\n\n is_bingo = .false.\n\n do i=1, 3\n if (is_open(1,i) .and. is_open(2,i) .and. is_open(3,i)) is_bingo = .true.\n if (is_open(i,1) .and. is_open(i,2) .and. is_open(i,3)) is_bingo = .true.\n end do\n\n if (is_open(1,1) .and. is_open(2,2) .and. is_open(3,3)) is_bingo = .true.\n if (is_open(1,3) .and. is_open(2,2) .and. is_open(3,1)) is_bingo = .true.\n \n end function\nend program Bingo", "language": "Fortran", "metadata": {"date": 1584505461, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/Fortran/s224257890.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s224257890", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Bingo\n implicit none\n integer(4):: bng(3,3), num\n integer(4):: i,j,k, n\n logical:: is_open(3,3) = .false.\n\n do i=1, 3\n read*, bng(:,i)\n end do\n\n read*, n\n\n do i=1, n\n read*, num\n\n do j=1,3\n do k=1,3\n if (bng(k,j) == num) is_open(k,j) = .true. \n end do\n end do\n end do\n\n if (check_bingo(is_open)) then\n print*, 'Yes'\n else\n print*, 'No'\n end if\n\n contains\n function check_bingo(is_open) result(is_bingo)\n integer(4):: i,j\n logical:: is_open(3,3), is_bingo\n\n is_bingo = .false.\n\n do i=1, 3\n if (is_open(1,i) .and. is_open(2,i) .and. is_open(3,i)) is_bingo = .true.\n if (is_open(i,1) .and. is_open(i,2) .and. is_open(i,3)) is_bingo = .true.\n end do\n\n if (is_open(1,1) .and. is_open(2,2) .and. is_open(3,3)) is_bingo = .true.\n if (is_open(1,3) .and. is_open(2,2) .and. is_open(3,1)) is_bingo = .true.\n \n end function\nend program Bingo", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s659843340", "group_id": "codeNet:p02760", "input_text": "program Bingo\n implicit none\n integer(4):: bng(3,3), num\n integer(4):: i,j,k, n\n logical:: is_open(3,3) = .false.\n\n do i=1, 3\n read*, bng(:,i)\n end do\n\n read*, n\n\n do i=1, n\n read*, num\n\n do j=1,3\n do k=1,3\n if (bng(k,j) == num) is_open(k,j) = .true. \n end do\n end do\n \n if (check_bingo(is_open)) then\n print*, 'Yes'\n stop\n end if\n end do\n \n print*, 'No'\n\n contains\n function check_bingo(is_open) result(is_bingo)\n integer(4):: i,j\n logical:: is_open(3,3), is_bingo\n\n is_bingo = .false.\n\n do i=1, 3\n if (is_open(1,i) .and. is_open(2,i) .and. is_open(3,i)) is_bingo = .true.\n if (is_open(i,1) .and. is_open(i,2) .and. is_open(i,3)) is_bingo = .true.\n end do\n\n if (is_open(1,1) .and. is_open(2,2) .and. is_open(3,3)) is_bingo = .true.\n \n end function\nend program Bingo", "language": "Fortran", "metadata": {"date": 1584505323, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/Fortran/s659843340.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s659843340", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Bingo\n implicit none\n integer(4):: bng(3,3), num\n integer(4):: i,j,k, n\n logical:: is_open(3,3) = .false.\n\n do i=1, 3\n read*, bng(:,i)\n end do\n\n read*, n\n\n do i=1, n\n read*, num\n\n do j=1,3\n do k=1,3\n if (bng(k,j) == num) is_open(k,j) = .true. \n end do\n end do\n \n if (check_bingo(is_open)) then\n print*, 'Yes'\n stop\n end if\n end do\n \n print*, 'No'\n\n contains\n function check_bingo(is_open) result(is_bingo)\n integer(4):: i,j\n logical:: is_open(3,3), is_bingo\n\n is_bingo = .false.\n\n do i=1, 3\n if (is_open(1,i) .and. is_open(2,i) .and. is_open(3,i)) is_bingo = .true.\n if (is_open(i,1) .and. is_open(i,2) .and. is_open(i,3)) is_bingo = .true.\n end do\n\n if (is_open(1,1) .and. is_open(2,2) .and. is_open(3,3)) is_bingo = .true.\n \n end function\nend program Bingo", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 988, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s661935650", "group_id": "codeNet:p02763", "input_text": "program main\n implicit none\n type arr_list\n integer :: N\n integer,allocatable :: point(:)\n end type arr_list\n type(arr_list),allocatable :: data(:)\n integer :: num(97:122)\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b,c2\n integer,allocatable :: tmp2(:)\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n allocate(data(97:122))\n allocate(tmp2(0:N-1))\n data(:)%N = 0\n num(:) = 0\n do i = 1,N\n data(ichar(S(i:i)))%N = data(ichar(S(i:i)))%N+1\n end do\n do i = 97,122\n if (data(i)%N > 0) allocate(data(i)%point(0:data(i)%N-1))\n end do\n do i = 1,N\n data(ichar(S(i:i)))%point( num(ichar(S(i:i))) ) = i-1\n num(ichar(S(i:i))) = num(ichar(S(i:i))) + 1\n end do\n! do i = 97,97+4\n! write(*,*) data(i)%point\n! end do\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n c2 = S(j:j)\n call insert_delete(data,j-1,c,c2,tmp2,n)\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n call count_char(data,l-1,r-1,out)\n write(*,'(i0)') out\n !deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine insert_delete(data,key,c,c2,tmp,n2)\n implicit none\n type(arr_list),intent(inout) :: data(97:122)\n integer,intent(in) :: key ! key\n character,intent(in) :: c,c2 ! char\n integer,intent(in) :: n2\n integer :: tmp(0:n2-1)\n integer :: i,i2\n integer :: j\n integer :: n\n\n i = ichar(c)\n i2 = ichar(c2)\n if ( i /= i2) then ! insert and delete\n if ( data(i)%N > 0) then\n j = found_point(data(i)%point(:),data(i)%n, key)\n if ( j == data(i)%N) then ! out bound\n n = data(i)%n\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n data(i)%point(0:n-1) = tmp(0:n-1)\n data(i)%point(n) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n if ( j == 0 ) then\n data(i2)%point(j:) = tmp(j+1:n-1) \n else if (j == N-1 ) then\n data(i2)%point(0:j-1) = tmp(0:j-1)\n else \n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n end if\n else\n deallocate( data(i2)%point )\n end if\n return\n else\n n = data(i)%n\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n if ( j == 0 ) then\n data(i)%point(0:0) = key\n data(i)%point(j+1:) = tmp(0:n-1)\n else \n data(i)%point(0:j-1) = tmp(0:j-1)\n data(i)%point(j) = key\n data(i)%point(j+1:) = tmp(j:n-1)\n end if\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n !allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n if ( j == 0 ) then\n data(i2)%point(j:) = tmp(j+1:n-1)\n else if (j == N-1 ) then\n data(i2)%point(0:j-1) = tmp(0:j-1)\n else\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n end if\n !deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n end if\n else ! N == 0\n data(i)%N = data(i)%N + 1\n allocate(data(i)%point(0:data(i)%N-1))\n data(i)%point(0) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n if ( j == 0 ) then\n data(i2)%point(j:) = tmp(j+1:n-1)\n else if (j == N-1 ) then\n data(i2)%point(0:j-1) = tmp(0:j-1)\n else \n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n end if\n else\n deallocate( data(i2)%point )\n end if\n end if\n end if\n return\n end subroutine insert_delete\n\n function found_point(a,n,key) result(ok)\n integer,intent(in) :: n\n integer,intent(in) :: a(0:n-1)\n integer,intent(in) :: key\n integer :: ng\n integer :: ok\n integer :: mid\n integer :: test\n ng = -1\n ok = n\n !do while( )\n test = 0\n do\n mid = (ok + ng)/2\n if (isOK(mid,key,a,n)) then\n ok = mid\n else\n ng = mid\n end if\n if (abs(ok-ng) <= 1) exit\n test = test + 1\n if ( test > log(real(n)) + 1 ) write(*,*) \"over?\"\n end do\n end function found_point\n\n function isOK (index, key,a,n) result(out)\n integer,intent(in):: n\n integer,intent(in) :: a(0:n-1)\n integer,intent(in) :: index, key\n logical :: out\n if ( a(index) >= key) then\n out = .true.\n else \n out = .false.\n end if\n end function isOK\n\n subroutine count_char(data,l,r,out)\n type(arr_list) :: data(97:122)\n integer :: l,r\n integer :: out\n integer :: N\n integer :: i, j, tmp\n out = 0\n do i = 97,122\n if ( data(i)%n > 0) then\n j = found_point(data(i)%point(:),data(i)%n,l)\n if ( j < data(i)%N) then\n if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n out = out + 1\n end if\n end if\n end if\n end do\n end subroutine count_char\n \n subroutine count_char2(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n do i = 1,N\n tmp = ichar(S(i:i))\n c (tmp) = c(tmp) + 1\n end do\n out = count(c /=0)\n end subroutine count_char2\nend program main\n", "language": "Fortran", "metadata": {"date": 1583177921, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/Fortran/s661935650.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s661935650", "user_id": "u886432251"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "program main\n implicit none\n type arr_list\n integer :: N\n integer,allocatable :: point(:)\n end type arr_list\n type(arr_list),allocatable :: data(:)\n integer :: num(97:122)\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b,c2\n integer,allocatable :: tmp2(:)\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n allocate(data(97:122))\n allocate(tmp2(0:N-1))\n data(:)%N = 0\n num(:) = 0\n do i = 1,N\n data(ichar(S(i:i)))%N = data(ichar(S(i:i)))%N+1\n end do\n do i = 97,122\n if (data(i)%N > 0) allocate(data(i)%point(0:data(i)%N-1))\n end do\n do i = 1,N\n data(ichar(S(i:i)))%point( num(ichar(S(i:i))) ) = i-1\n num(ichar(S(i:i))) = num(ichar(S(i:i))) + 1\n end do\n! do i = 97,97+4\n! write(*,*) data(i)%point\n! end do\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n c2 = S(j:j)\n call insert_delete(data,j-1,c,c2,tmp2,n)\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n call count_char(data,l-1,r-1,out)\n write(*,'(i0)') out\n !deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine insert_delete(data,key,c,c2,tmp,n2)\n implicit none\n type(arr_list),intent(inout) :: data(97:122)\n integer,intent(in) :: key ! key\n character,intent(in) :: c,c2 ! char\n integer,intent(in) :: n2\n integer :: tmp(0:n2-1)\n integer :: i,i2\n integer :: j\n integer :: n\n\n i = ichar(c)\n i2 = ichar(c2)\n if ( i /= i2) then ! insert and delete\n if ( data(i)%N > 0) then\n j = found_point(data(i)%point(:),data(i)%n, key)\n if ( j == data(i)%N) then ! out bound\n n = data(i)%n\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n data(i)%point(0:n-1) = tmp(0:n-1)\n data(i)%point(n) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n if ( j == 0 ) then\n data(i2)%point(j:) = tmp(j+1:n-1) \n else if (j == N-1 ) then\n data(i2)%point(0:j-1) = tmp(0:j-1)\n else \n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n end if\n else\n deallocate( data(i2)%point )\n end if\n return\n else\n n = data(i)%n\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n if ( j == 0 ) then\n data(i)%point(0:0) = key\n data(i)%point(j+1:) = tmp(0:n-1)\n else \n data(i)%point(0:j-1) = tmp(0:j-1)\n data(i)%point(j) = key\n data(i)%point(j+1:) = tmp(j:n-1)\n end if\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n !allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n if ( j == 0 ) then\n data(i2)%point(j:) = tmp(j+1:n-1)\n else if (j == N-1 ) then\n data(i2)%point(0:j-1) = tmp(0:j-1)\n else\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n end if\n !deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n end if\n else ! N == 0\n data(i)%N = data(i)%N + 1\n allocate(data(i)%point(0:data(i)%N-1))\n data(i)%point(0) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n if ( j == 0 ) then\n data(i2)%point(j:) = tmp(j+1:n-1)\n else if (j == N-1 ) then\n data(i2)%point(0:j-1) = tmp(0:j-1)\n else \n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n end if\n else\n deallocate( data(i2)%point )\n end if\n end if\n end if\n return\n end subroutine insert_delete\n\n function found_point(a,n,key) result(ok)\n integer,intent(in) :: n\n integer,intent(in) :: a(0:n-1)\n integer,intent(in) :: key\n integer :: ng\n integer :: ok\n integer :: mid\n integer :: test\n ng = -1\n ok = n\n !do while( )\n test = 0\n do\n mid = (ok + ng)/2\n if (isOK(mid,key,a,n)) then\n ok = mid\n else\n ng = mid\n end if\n if (abs(ok-ng) <= 1) exit\n test = test + 1\n if ( test > log(real(n)) + 1 ) write(*,*) \"over?\"\n end do\n end function found_point\n\n function isOK (index, key,a,n) result(out)\n integer,intent(in):: n\n integer,intent(in) :: a(0:n-1)\n integer,intent(in) :: index, key\n logical :: out\n if ( a(index) >= key) then\n out = .true.\n else \n out = .false.\n end if\n end function isOK\n\n subroutine count_char(data,l,r,out)\n type(arr_list) :: data(97:122)\n integer :: l,r\n integer :: out\n integer :: N\n integer :: i, j, tmp\n out = 0\n do i = 97,122\n if ( data(i)%n > 0) then\n j = found_point(data(i)%point(:),data(i)%n,l)\n if ( j < data(i)%N) then\n if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n out = out + 1\n end if\n end if\n end if\n end do\n end subroutine count_char\n \n subroutine count_char2(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n do i = 1,N\n tmp = ichar(S(i:i))\n c (tmp) = c(tmp) + 1\n end do\n out = count(c /=0)\n end subroutine count_char2\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6947, "cpu_time_ms": 2104, "memory_kb": 14944}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s085859166", "group_id": "codeNet:p02763", "input_text": "program main\n implicit none\n type arr_list\n integer :: N\n integer,allocatable :: point(:)\n end type arr_list\n type(arr_list),allocatable :: data(:)\n integer :: num(97:122)\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b,c2\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n allocate(data(97:122))\n data(:)%N = 0\n num(:) = 0\n do i = 1,N\n data(ichar(S(i:i)))%N = data(ichar(S(i:i)))%N+1\n end do\n do i = 97,122\n if (data(i)%N > 0) allocate(data(i)%point(0:data(i)%N-1))\n end do\n do i = 1,N\n data(ichar(S(i:i)))%point( num(ichar(S(i:i))) ) = i-1\n num(ichar(S(i:i))) = num(ichar(S(i:i))) + 1\n end do\n! do i = 97,97+4\n! write(*,*) data(i)%point\n! end do\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n if (Q> 19999) then\n c2 = S(j:j)\n call insert_delete(data,j-1,c,c2)\n end if\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n !tmp = S(l:r)\n !call count_char(S(l:r),out)\n if (Q> 19999) then\n call count_char(data,l-1,r-1,out)\n else\n tmp = S(l:r)\n call count_char2(tmp,out)\n deallocate(tmp)\n end if\n write(*,'(i0)') out\n !deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine insert_delete(data,key,c,c2)\n implicit none\n type(arr_list) :: data(97:122)\n integer :: key ! key\n character :: c,c2 ! char\n integer,allocatable :: tmp(:)\n integer :: i,i2\n integer :: j\n integer :: n\n\n i = ichar(c)\n i2 = ichar(c2)\n if ( i /= i2) then ! insert and delete\n if (data(i)%N > 0) then\n j = found_point(data(i)%point(:),data(i)%n, key)\n else\n data(i)%N=data(i)%N+1\n allocate(data(i)%point(0:data(i)%N-1))\n data(i)%point(0:0) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n end if\n if ( j == data(i)%N) then ! out bound\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n data(i)%point(0:n-1) = tmp(0:n-1)\n data(i)%point(n) = key\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n else\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n if ( j == 0 ) then\n data(i)%point(0:0) = key\n data(i)%point(j+1:) = tmp(0:n-1)\n else \n data(i)%point(0:j-1) = tmp(0:j-1)\n data(i)%point(j) = key\n data(i)%point(j+1:) = tmp(j:n-1)\n end if\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n end if\n end if\n return\n end subroutine insert_delete\n\n function found_point(a,n,key) result(ok)\n integer :: n\n integer :: a(0:n-1)\n integer :: key\n integer :: ng \n integer :: ok\n integer :: mid\n ng = -1\n ok = n\n do while( abs(ok-ng) > 1) \n mid = (ok + ng)/2\n if (isOK(mid,key,a,n)) then\n ok = mid\n else\n ng = mid\n end if\n end do\n end function found_point\n\n \n function isOK (index, key,a,n) result(out)\n integer :: n\n integer :: a(0:n-1)\n integer :: index, key\n logical :: out\n if ( a(index) >= key) then\n out = .true.\n else \n out = .false.\n end if\n end function isOK\n subroutine count_char(data,l,r,out)\n type(arr_list) :: data(97:122)\n integer :: l,r\n integer :: out\n integer :: N\n integer :: i, j, tmp\n out = 0\n do i = 97,122\n if ( data(i)%n > 0) then\n j = found_point(data(i)%point(:),data(i)%n,l)\n if ( j < data(i)%N) then\n if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n out = out + 1\n end if\n!! if ( j+1 < data(i)%N) then\n!! if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n!! out = out + 1\n!! cycle\n!! end if\n!! if ( data(i)%point(j) < l .and. data(i)%point(j+1) <= r) then\n!! out = out + 1\n!! end if\n!! else\n!! end if\n end if\n end if\n end do\n end subroutine count_char\n \n subroutine count_char2(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n do i = 1,N\n tmp = ichar(S(i:i))\n c (tmp) = c(tmp) + 1\n end do\n out = count(c /=0)\n end subroutine count_char2\nend program main\n", "language": "Fortran", "metadata": {"date": 1583167817, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/Fortran/s085859166.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s085859166", "user_id": "u886432251"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "program main\n implicit none\n type arr_list\n integer :: N\n integer,allocatable :: point(:)\n end type arr_list\n type(arr_list),allocatable :: data(:)\n integer :: num(97:122)\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b,c2\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n allocate(data(97:122))\n data(:)%N = 0\n num(:) = 0\n do i = 1,N\n data(ichar(S(i:i)))%N = data(ichar(S(i:i)))%N+1\n end do\n do i = 97,122\n if (data(i)%N > 0) allocate(data(i)%point(0:data(i)%N-1))\n end do\n do i = 1,N\n data(ichar(S(i:i)))%point( num(ichar(S(i:i))) ) = i-1\n num(ichar(S(i:i))) = num(ichar(S(i:i))) + 1\n end do\n! do i = 97,97+4\n! write(*,*) data(i)%point\n! end do\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n if (Q> 19999) then\n c2 = S(j:j)\n call insert_delete(data,j-1,c,c2)\n end if\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n !tmp = S(l:r)\n !call count_char(S(l:r),out)\n if (Q> 19999) then\n call count_char(data,l-1,r-1,out)\n else\n tmp = S(l:r)\n call count_char2(tmp,out)\n deallocate(tmp)\n end if\n write(*,'(i0)') out\n !deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine insert_delete(data,key,c,c2)\n implicit none\n type(arr_list) :: data(97:122)\n integer :: key ! key\n character :: c,c2 ! char\n integer,allocatable :: tmp(:)\n integer :: i,i2\n integer :: j\n integer :: n\n\n i = ichar(c)\n i2 = ichar(c2)\n if ( i /= i2) then ! insert and delete\n if (data(i)%N > 0) then\n j = found_point(data(i)%point(:),data(i)%n, key)\n else\n data(i)%N=data(i)%N+1\n allocate(data(i)%point(0:data(i)%N-1))\n data(i)%point(0:0) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n end if\n if ( j == data(i)%N) then ! out bound\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n data(i)%point(0:n-1) = tmp(0:n-1)\n data(i)%point(n) = key\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n else\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n if ( j == 0 ) then\n data(i)%point(0:0) = key\n data(i)%point(j+1:) = tmp(0:n-1)\n else \n data(i)%point(0:j-1) = tmp(0:j-1)\n data(i)%point(j) = key\n data(i)%point(j+1:) = tmp(j:n-1)\n end if\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n end if\n end if\n return\n end subroutine insert_delete\n\n function found_point(a,n,key) result(ok)\n integer :: n\n integer :: a(0:n-1)\n integer :: key\n integer :: ng \n integer :: ok\n integer :: mid\n ng = -1\n ok = n\n do while( abs(ok-ng) > 1) \n mid = (ok + ng)/2\n if (isOK(mid,key,a,n)) then\n ok = mid\n else\n ng = mid\n end if\n end do\n end function found_point\n\n \n function isOK (index, key,a,n) result(out)\n integer :: n\n integer :: a(0:n-1)\n integer :: index, key\n logical :: out\n if ( a(index) >= key) then\n out = .true.\n else \n out = .false.\n end if\n end function isOK\n subroutine count_char(data,l,r,out)\n type(arr_list) :: data(97:122)\n integer :: l,r\n integer :: out\n integer :: N\n integer :: i, j, tmp\n out = 0\n do i = 97,122\n if ( data(i)%n > 0) then\n j = found_point(data(i)%point(:),data(i)%n,l)\n if ( j < data(i)%N) then\n if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n out = out + 1\n end if\n!! if ( j+1 < data(i)%N) then\n!! if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n!! out = out + 1\n!! cycle\n!! end if\n!! if ( data(i)%point(j) < l .and. data(i)%point(j+1) <= r) then\n!! out = out + 1\n!! end if\n!! else\n!! end if\n end if\n end if\n end do\n end subroutine count_char\n \n subroutine count_char2(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n do i = 1,N\n tmp = ichar(S(i:i))\n c (tmp) = c(tmp) + 1\n end do\n out = count(c /=0)\n end subroutine count_char2\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6634, "cpu_time_ms": 2103, "memory_kb": 7104}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s607119925", "group_id": "codeNet:p02763", "input_text": "program main\n implicit none\n type arr_list\n integer :: N\n integer,allocatable :: point(:)\n end type arr_list\n type(arr_list),allocatable :: data(:)\n integer :: num(97:122)\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b,c2\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n allocate(data(97:122))\n data(:)%N = 0\n num(:) = 0\n do i = 1,N\n data(ichar(S(i:i)))%N = data(ichar(S(i:i)))%N+1\n end do\n do i = 97,122\n if (data(i)%N > 0) allocate(data(i)%point(0:data(i)%N-1))\n end do\n do i = 1,N\n data(ichar(S(i:i)))%point( num(ichar(S(i:i))) ) = i-1\n num(ichar(S(i:i))) = num(ichar(S(i:i))) + 1\n end do\n! do i = 97,97+4\n! write(*,*) data(i)%point\n! end do\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n \n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n if (Q> 1000) then\n c2 = S(j:j)\n call insert_delete(data,j-1,c,c2)\n end if\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n !tmp = S(l:r)\n !call count_char(S(l:r),out)\n if (Q> 10000) then\n call count_char(data,l-1,r-1,out)\n else\n call count_char2(S,out)\n end if\n write(*,'(i0)') out\n !deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine insert_delete(data,key,c,c2)\n implicit none\n type(arr_list) :: data(97:122)\n integer :: key ! key\n character :: c,c2 ! char\n integer,allocatable :: tmp(:)\n integer :: i,i2\n integer :: j\n integer :: n\n\n i = ichar(c)\n i2 = ichar(c2)\n if ( i /= i2) then ! insert and delete\n if (data(i)%N > 0) then\n j = found_point(data(i)%point(:),data(i)%n, key)\n else\n data(i)%N=data(i)%N+1\n allocate(data(i)%point(0:data(i)%N-1))\n data(i)%point(0:0) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n end if\n if ( j == data(i)%N) then ! out bound\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n data(i)%point(0:n-1) = tmp(0:n-1)\n data(i)%point(n) = key\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n else\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n if ( j == 0 ) then\n data(i)%point(0:0) = key\n data(i)%point(j+1:) = tmp(0:n-1)\n else \n data(i)%point(0:j-1) = tmp(0:j-1)\n data(i)%point(j) = key\n data(i)%point(j+1:) = tmp(j:n-1)\n end if\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n end if\n end if\n return\n end subroutine insert_delete\n\n function found_point(a,n,key) result(ok)\n integer :: n\n integer :: a(0:n-1)\n integer :: key\n integer :: ng \n integer :: ok\n integer :: mid\n ng = -1\n ok = n\n do while( abs(ok-ng) > 1) \n mid = (ok + ng)/2\n if (isOK(mid,key,a,n)) then\n ok = mid\n else\n ng = mid\n end if\n end do\n end function found_point\n\n \n function isOK (index, key,a,n) result(out)\n integer :: n\n integer :: a(0:n-1)\n integer :: index, key\n logical :: out\n if ( a(index) >= key) then\n out = .true.\n else \n out = .false.\n end if\n end function isOK\n subroutine count_char(data,l,r,out)\n type(arr_list) :: data(97:122)\n integer :: l,r\n integer :: out\n integer :: N\n integer :: i, j, tmp\n out = 0\n do i = 97,122\n if ( data(i)%n > 0) then\n j = found_point(data(i)%point(:),data(i)%n,l)\n if ( j < data(i)%N) then\n if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n out = out + 1\n end if\n!! if ( j+1 < data(i)%N) then\n!! if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n!! out = out + 1\n!! cycle\n!! end if\n!! if ( data(i)%point(j) < l .and. data(i)%point(j+1) <= r) then\n!! out = out + 1\n!! end if\n!! else\n!! end if\n end if\n end if\n end do\n end subroutine count_char\n \n subroutine count_char2(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n \n do i = 97, 122\n c(i) = index(S,char(i))\n end do\n out = count(c /=0)\n end subroutine count_char2\nend program main\n", "language": "Fortran", "metadata": {"date": 1583167435, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/Fortran/s607119925.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s607119925", "user_id": "u886432251"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "program main\n implicit none\n type arr_list\n integer :: N\n integer,allocatable :: point(:)\n end type arr_list\n type(arr_list),allocatable :: data(:)\n integer :: num(97:122)\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b,c2\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n allocate(data(97:122))\n data(:)%N = 0\n num(:) = 0\n do i = 1,N\n data(ichar(S(i:i)))%N = data(ichar(S(i:i)))%N+1\n end do\n do i = 97,122\n if (data(i)%N > 0) allocate(data(i)%point(0:data(i)%N-1))\n end do\n do i = 1,N\n data(ichar(S(i:i)))%point( num(ichar(S(i:i))) ) = i-1\n num(ichar(S(i:i))) = num(ichar(S(i:i))) + 1\n end do\n! do i = 97,97+4\n! write(*,*) data(i)%point\n! end do\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n \n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n if (Q> 1000) then\n c2 = S(j:j)\n call insert_delete(data,j-1,c,c2)\n end if\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n !tmp = S(l:r)\n !call count_char(S(l:r),out)\n if (Q> 10000) then\n call count_char(data,l-1,r-1,out)\n else\n call count_char2(S,out)\n end if\n write(*,'(i0)') out\n !deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine insert_delete(data,key,c,c2)\n implicit none\n type(arr_list) :: data(97:122)\n integer :: key ! key\n character :: c,c2 ! char\n integer,allocatable :: tmp(:)\n integer :: i,i2\n integer :: j\n integer :: n\n\n i = ichar(c)\n i2 = ichar(c2)\n if ( i /= i2) then ! insert and delete\n if (data(i)%N > 0) then\n j = found_point(data(i)%point(:),data(i)%n, key)\n else\n data(i)%N=data(i)%N+1\n allocate(data(i)%point(0:data(i)%N-1))\n data(i)%point(0:0) = key\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n end if\n if ( j == data(i)%N) then ! out bound\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n data(i)%point(0:n-1) = tmp(0:n-1)\n data(i)%point(n) = key\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n return\n else\n n = data(i)%n\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i)%point(0:n-1)\n deallocate( data(i)%point )\n data(i)%n = data(i)%n + 1\n allocate( data(i)%point(0:data(i)%n-1) )\n if ( j == 0 ) then\n data(i)%point(0:0) = key\n data(i)%point(j+1:) = tmp(0:n-1)\n else \n data(i)%point(0:j-1) = tmp(0:j-1)\n data(i)%point(j) = key\n data(i)%point(j+1:) = tmp(j:n-1)\n end if\n deallocate(tmp)\n !\n ! delete\n !\n n = data(i2)%n\n data(i2)%n = data(i2)%n - 1\n if ( data(i2)%n > 0) then\n j = found_point(data(i2)%point(:),n, key)\n allocate(tmp(0:n-1))\n tmp(0:n-1) = data(i2)%point(0:n-1)\n deallocate( data(i2)%point )\n allocate( data(i2)%point(0:data(i2)%n-1) )\n data(i2)%point(0:j-1) = tmp(0:j-1)\n data(i2)%point(j:) = tmp(j+1:n-1)\n deallocate(tmp)\n else\n deallocate( data(i2)%point )\n end if\n end if\n end if\n return\n end subroutine insert_delete\n\n function found_point(a,n,key) result(ok)\n integer :: n\n integer :: a(0:n-1)\n integer :: key\n integer :: ng \n integer :: ok\n integer :: mid\n ng = -1\n ok = n\n do while( abs(ok-ng) > 1) \n mid = (ok + ng)/2\n if (isOK(mid,key,a,n)) then\n ok = mid\n else\n ng = mid\n end if\n end do\n end function found_point\n\n \n function isOK (index, key,a,n) result(out)\n integer :: n\n integer :: a(0:n-1)\n integer :: index, key\n logical :: out\n if ( a(index) >= key) then\n out = .true.\n else \n out = .false.\n end if\n end function isOK\n subroutine count_char(data,l,r,out)\n type(arr_list) :: data(97:122)\n integer :: l,r\n integer :: out\n integer :: N\n integer :: i, j, tmp\n out = 0\n do i = 97,122\n if ( data(i)%n > 0) then\n j = found_point(data(i)%point(:),data(i)%n,l)\n if ( j < data(i)%N) then\n if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n out = out + 1\n end if\n!! if ( j+1 < data(i)%N) then\n!! if ( l<=data(i)%point(j) .and. data(i)%point(j) <= r) then\n!! out = out + 1\n!! cycle\n!! end if\n!! if ( data(i)%point(j) < l .and. data(i)%point(j+1) <= r) then\n!! out = out + 1\n!! end if\n!! else\n!! end if\n end if\n end if\n end do\n end subroutine count_char\n \n subroutine count_char2(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n \n do i = 97, 122\n c(i) = index(S,char(i))\n end do\n out = count(c /=0)\n end subroutine count_char2\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6571, "cpu_time_ms": 2103, "memory_kb": 7104}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s483842216", "group_id": "codeNet:p02763", "input_text": "program main\n implicit none\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n \n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n tmp = S(l:r)\n call count_char(tmp,out)\n write(*,'(i0)') out\n deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine count_char(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n do i = 1,N\n tmp = ichar(S(i:i))\n c (tmp) = c(tmp) + 1\n end do\n out = count(c /=0)\n end subroutine count_char\nend program main\n", "language": "Fortran", "metadata": {"date": 1583119601, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/Fortran/s483842216.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s483842216", "user_id": "u886432251"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "program main\n implicit none\n integer :: N, Q\n character(len=500000) :: S\n character(:),allocatable :: tmp\n character(len=1) :: c,b\n integer :: a\n integer :: i,j, l,r\n integer :: out\n read(*,*) N\n read(*,*) S\n read(*,*) Q\n\n do i = 1, Q\n read(*,'(i1,1x,a,1x,a)') a,b,c\n \n if (a == 1) then\n backspace(5)\n !read(*,'(i1,1x,g0,1x,a)') a,j,c\n read(*,*) a,j,c\n S(j:j) = c\n else\n backspace(5)\n! read(*,'(i1,1x,g0,1x,g0)') a,l,r\n read(*,*) a,l,r\n tmp = S(l:r)\n call count_char(tmp,out)\n write(*,'(i0)') out\n deallocate(tmp)\n end if\n\n end do\ncontains\n subroutine count_char(S,out)\n character(*) :: S\n integer :: out\n integer :: N\n integer :: i, tmp\n integer :: c(97:122)\n N = len_trim(S)\n c(97:122) = 0\n do i = 1,N\n tmp = ichar(S(i:i))\n c (tmp) = c(tmp) + 1\n end do\n out = count(c /=0)\n end subroutine count_char\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 973, "cpu_time_ms": 2103, "memory_kb": 2144}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s920845295", "group_id": "codeNet:p02764", "input_text": "program yakiniku_optimization_problem\n implicit none\n real(8), parameter :: tol = 1e-7\n integer :: n, k, i, j\n real(8) :: l = 0.d0, r = 1e6, m, xc, yc, s, t, u, v, w, z, ri, rj\n real(8), dimension(60) :: x = 0.d0, y = 0.d0, c = 0.d0\n character(64) :: ans\n read(*,*) n, k\n do i = 1, n\n read(*,*) x(i), y(i), c(i)\n c(i) = 1.d0 / c(i)\n end do\n do while (r - l > tol)\n m = 0.5 * (l + r)\n do i = 1, n\n if (ok(x(i), y(i))) then\n r = m\n goto 100\n end if\n ri = m * c(i)\n do j = i + 1, n\n rj = m * c(j)\n z = d(x(i), x(j), y(i), y(j))\n if (z > ri + rj .or. z < abs(rj - ri)) cycle\n s = 2 * (x(j) - x(i))\n t = 2 * (y(j) - y(i))\n u = x(i) * x(i) - x(j) * x(j) + y(i) * y(i) - y(j) * y(j) + rj * rj - ri * ri\n v = s * s + t * t\n w = abs(s * x(i) + t * y(i) + u)\n z = sqrt(v * ri * ri - w * w)\n xc = (s * w - t * z) / v + x(i)\n yc = (t * w + s * z) / v + y(i)\n if (ok(xc, yc)) then\n r = m\n goto 100\n end if\n xc = (s * w + t * z) / v + x(i)\n yc = (t * w - s * z) / v + y(i)\n if (ok(xc, yc)) then\n r = m\n goto 100\n end if\n end do\n end do\n l = m\n 100 end do\n write(ans,'(f32.16)') r\n write(*,'(a)') trim(adjustl(ans))\ncontains\n real(8) function d(x1, x2, y1, y2) result(res)\n real(8), intent(in) :: x1, x2, y1, y2\n real(8) :: dx, dy\n dx = x2 - x1\n dy = y2 - y1\n res = sqrt(dx * dx + dy * dy)\n end\n logical function ok(xd, yd) result(res)\n real(8), intent(in) :: xd, yd\n integer :: i, cnt\n cnt = 0\n do i = 1, n\n if (d(xd, x(i), yd, y(i)) <= m * c(i)) cnt = cnt + 1\n end do\n res = cnt >= k\n end\nend program yakiniku_optimization_problem", "language": "Fortran", "metadata": {"date": 1596181967, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02764.html", "problem_id": "p02764", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02764/input.txt", "sample_output_relpath": "derived/input_output/data/p02764/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02764/Fortran/s920845295.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s920845295", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "program yakiniku_optimization_problem\n implicit none\n real(8), parameter :: tol = 1e-7\n integer :: n, k, i, j\n real(8) :: l = 0.d0, r = 1e6, m, xc, yc, s, t, u, v, w, z, ri, rj\n real(8), dimension(60) :: x = 0.d0, y = 0.d0, c = 0.d0\n character(64) :: ans\n read(*,*) n, k\n do i = 1, n\n read(*,*) x(i), y(i), c(i)\n c(i) = 1.d0 / c(i)\n end do\n do while (r - l > tol)\n m = 0.5 * (l + r)\n do i = 1, n\n if (ok(x(i), y(i))) then\n r = m\n goto 100\n end if\n ri = m * c(i)\n do j = i + 1, n\n rj = m * c(j)\n z = d(x(i), x(j), y(i), y(j))\n if (z > ri + rj .or. z < abs(rj - ri)) cycle\n s = 2 * (x(j) - x(i))\n t = 2 * (y(j) - y(i))\n u = x(i) * x(i) - x(j) * x(j) + y(i) * y(i) - y(j) * y(j) + rj * rj - ri * ri\n v = s * s + t * t\n w = abs(s * x(i) + t * y(i) + u)\n z = sqrt(v * ri * ri - w * w)\n xc = (s * w - t * z) / v + x(i)\n yc = (t * w + s * z) / v + y(i)\n if (ok(xc, yc)) then\n r = m\n goto 100\n end if\n xc = (s * w + t * z) / v + x(i)\n yc = (t * w - s * z) / v + y(i)\n if (ok(xc, yc)) then\n r = m\n goto 100\n end if\n end do\n end do\n l = m\n 100 end do\n write(ans,'(f32.16)') r\n write(*,'(a)') trim(adjustl(ans))\ncontains\n real(8) function d(x1, x2, y1, y2) result(res)\n real(8), intent(in) :: x1, x2, y1, y2\n real(8) :: dx, dy\n dx = x2 - x1\n dy = y2 - y1\n res = sqrt(dx * dx + dy * dy)\n end\n logical function ok(xd, yd) result(res)\n real(8), intent(in) :: xd, yd\n integer :: i, cnt\n cnt = 0\n do i = 1, n\n if (d(xd, x(i), yd, y(i)) <= m * c(i)) cnt = cnt + 1\n end do\n res = cnt >= k\n end\nend program yakiniku_optimization_problem", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "sample_input": "4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n"}, "reference_outputs": ["2.4\n"], "source_document_id": "p02764", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1784, "cpu_time_ms": 19, "memory_kb": 3032}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s561323093", "group_id": "codeNet:p02765", "input_text": "program main\n implicit none\n integer N, R\n \n read *, N, R\n \n if ( N>= 10 ) then\n print '(i0)', R\n else\n print '(i0)', R+100*(10-N)\n end if\n \nendprogram main", "language": "Fortran", "metadata": {"date": 1583091111, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02765.html", "problem_id": "p02765", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02765/input.txt", "sample_output_relpath": "derived/input_output/data/p02765/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02765/Fortran/s561323093.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s561323093", "user_id": "u838994321"}, "prompt_components": {"gold_output": "3719\n", "input_to_evaluate": "program main\n implicit none\n integer N, R\n \n read *, N, R\n \n if ( N>= 10 ) then\n print '(i0)', R\n else\n print '(i0)', R+100*(10-N)\n end if\n \nendprogram main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "sample_input": "2 2919\n"}, "reference_outputs": ["3719\n"], "source_document_id": "p02765", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a member of a programming competition site, ButCoder.\n\nEach member of ButCoder is assigned two values: Inner Rating and Displayed Rating.\n\nThe Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \\times (10 - K) when the member has participated in K contests.\n\nTakahashi has participated in N contests, and his Displayed Rating is R. Find his Inner Rating.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq R \\leq 4111\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN R\n\nOutput\n\nPrint his Inner Rating.\n\nSample Input 1\n\n2 2919\n\nSample Output 1\n\n3719\n\nTakahashi has participated in 2 contests, which is less than 10, so his Displayed Rating is his Inner Rating minus 100 \\times (10 - 2) = 800.\n\nThus, Takahashi's Inner Rating is 2919 + 800 = 3719.\n\nSample Input 2\n\n22 3051\n\nSample Output 2\n\n3051", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 158, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s372549800", "group_id": "codeNet:p02766", "input_text": "program ABC156b\n implicit none\n integer::N,K\n integer::cnt\n read*,N,K\n cnt=0\n do while(N/=0)\n N=N/K\n cnt=cnt+1\n end do\n print\"(i0)\",cnt\nend program ABC156b", "language": "Fortran", "metadata": {"date": 1582423601, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02766.html", "problem_id": "p02766", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02766/input.txt", "sample_output_relpath": "derived/input_output/data/p02766/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02766/Fortran/s372549800.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s372549800", "user_id": "u598073939"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program ABC156b\n implicit none\n integer::N,K\n integer::cnt\n read*,N,K\n cnt=0\n do while(N/=0)\n N=N/K\n cnt=cnt+1\n end do\n print\"(i0)\",cnt\nend program ABC156b", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of digits that N has in base K.\n\nNotes\n\nFor information on base-K representation, see Positional notation - Wikipedia.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^9\n\n2 \\leq K \\leq 10\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of digits that N has in base K.\n\nSample Input 1\n\n11 2\n\nSample Output 1\n\n4\n\nIn binary, 11 is represented as 1011.\n\nSample Input 2\n\n1010101 10\n\nSample Output 2\n\n7\n\nSample Input 3\n\n314159265 3\n\nSample Output 3\n\n18", "sample_input": "11 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02766", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of digits that N has in base K.\n\nNotes\n\nFor information on base-K representation, see Positional notation - Wikipedia.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^9\n\n2 \\leq K \\leq 10\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of digits that N has in base K.\n\nSample Input 1\n\n11 2\n\nSample Output 1\n\n4\n\nIn binary, 11 is represented as 1011.\n\nSample Input 2\n\n1010101 10\n\nSample Output 2\n\n7\n\nSample Input 3\n\n314159265 3\n\nSample Output 3\n\n18", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s072325746", "group_id": "codeNet:p02767", "input_text": " program abc156c\n implicit none\n integer::N,i,p\n integer(8)::sumX,sumA=100000\n integer,allocatable,dimension(:)::X\n\n read *,N\n allocate(X(N))\n read *,X(1:N)\n\n do p=1,100\n sumX=0\n do i=1,N\n sumX=sumX+(X(i)-p)**2\n end do\n if (sumX O(1)\n!combinationN( n,k )\n! O(N*logModulus) ==> O( k )\n! for larger N\n!initialize( setSize!optional )\n!inv( x )\n!pow( x,n )\n!modSum( a,b ) => .plus.\n!modSub( a,b ) => .minus.\n!modMulti( a,b ) => .times.\n implicit none\n public\n integer(16),parameter :: modulus = 10**9 + 7\n !sz : max limit of NandK(arg of comb),default is 10**6\n private :: sz, factorial, reciproF\n integer(16) :: sz \n integer(16),allocatable :: factorial(:),reciproF(:)\n\n interface operator (.plus.)\n module procedure :: modSum\n end interface\n interface operator (.minus.)\n module procedure :: modSub\n end interface\n interface operator (.times.)\n module procedure :: modMulti\n end interface\n\n contains\n pure function combination( n,k ) result( ans )\n implicit none\n integer(16),intent(in) :: n,k\n integer(16) :: ans, a, b, c, bc\n \n a = factorial(n)\n b = reciproF(n-k)\n c = reciproF(k)\n \n bc = b .times. c\n \n ans = a .times. bc\n end function combination\n\n\n pure function combinationN( n,k ) result( ans )\n implicit none\n integer(16),intent(in) :: n,k\n integer(16) :: ans,denominator,numerator !(nu/de)\n integer(16) :: i,nn\n \n nn = n\n numerator = 1\n do i = 1,k\n numerator = numerator .times. nn\n nn = nn - 1\n end do\n denominator = reciproF(k)\n ans = numerator .times. denominator\n end function combinationN\n\n\n subroutine initialize( setSize )\n implicit none\n integer(16),intent(in),optional :: setSize\n integer(16) :: i\n \n sz = 10**6\n if(present(setSize)) sz = setSize\n allocate( factorial(0:sz),reciproF(0:sz) )\n \n !calc factrial\n factorial(0) = 1\n do i = 1,sz\n factorial(i) = factorial(i-1) .times. i\n end do\n !calc reciprocal of factorial\n do i = 0,sz\n reciproF(i) = inv( factorial(i) )\n end do\n end subroutine initialize\n\n\n pure function inv( x ) result( ans )\n implicit none\n integer(16),intent(in) :: x\n integer(16) :: ans,i\n \n ans = pow( x,modulus-2 )\n end function inv\n\n\n!calc x**n (mod)\n pure function pow( x,n ) result( ans )\n implicit none\n integer(16),intent(in) :: x,n\n integer(16) :: ans, k, y\n \n ans = 1\n k = n\n y = x\n do while( k/=0 )\n if( iand(k,1)==1 )then\n ans = ans .times. y\n end if\n y = y .times. y\n k = k / 2\n end do\n end function pow\n\n\n !operators\n pure function modSum( a,b ) result( res )\n implicit none\n integer(16),intent(in) :: a,b\n integer(16) :: res\n \n res = mod( a+b,modulus )\n end function\n pure function modSub( a,b ) result( res )\n implicit none\n integer(16),intent(in) :: a,b\n integer(16) :: res\n \n res = mod( a-b+modulus,modulus )\n end function\n pure function modMulti( a,b ) result( res )\n implicit none\n integer(16),intent(in) :: a,b\n integer(16) :: res\n \n res = mod( a*b,modulus )\n end function\n \n END MODULE combinationMod\n\n\n\n PROGRAM bouquet\n use combinationMod\n IMPLICIT NONE\n integer(16) :: ans,n,a,b\n integer(16) :: subA,subB\n \n read*,n,a,b\n \n ans = pow(2_16,n) - 1\n \n call initialize()\n \n print*,ans\n subA = combinationN(n,a)\n print*,subA\n subB = combinationN(n,b)\n print*,subB\n ans = ans .minus. subA .minus. subB\n \n print*,ans\n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1582419350, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02768.html", "problem_id": "p02768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02768/input.txt", "sample_output_relpath": "derived/input_output/data/p02768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02768/Fortran/s699325240.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s699325240", "user_id": "u171356453"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": " MODULE combinationMod\n!ref\n!https://www.hamayanhamayan.com/entry/2018/06/06/210256\n\n!!!!! procedure list !!!!!\n!combination( n,k )\n! O(N*logModulus) ==> O(1)\n!combinationN( n,k )\n! O(N*logModulus) ==> O( k )\n! for larger N\n!initialize( setSize!optional )\n!inv( x )\n!pow( x,n )\n!modSum( a,b ) => .plus.\n!modSub( a,b ) => .minus.\n!modMulti( a,b ) => .times.\n implicit none\n public\n integer(16),parameter :: modulus = 10**9 + 7\n !sz : max limit of NandK(arg of comb),default is 10**6\n private :: sz, factorial, reciproF\n integer(16) :: sz \n integer(16),allocatable :: factorial(:),reciproF(:)\n\n interface operator (.plus.)\n module procedure :: modSum\n end interface\n interface operator (.minus.)\n module procedure :: modSub\n end interface\n interface operator (.times.)\n module procedure :: modMulti\n end interface\n\n contains\n pure function combination( n,k ) result( ans )\n implicit none\n integer(16),intent(in) :: n,k\n integer(16) :: ans, a, b, c, bc\n \n a = factorial(n)\n b = reciproF(n-k)\n c = reciproF(k)\n \n bc = b .times. c\n \n ans = a .times. bc\n end function combination\n\n\n pure function combinationN( n,k ) result( ans )\n implicit none\n integer(16),intent(in) :: n,k\n integer(16) :: ans,denominator,numerator !(nu/de)\n integer(16) :: i,nn\n \n nn = n\n numerator = 1\n do i = 1,k\n numerator = numerator .times. nn\n nn = nn - 1\n end do\n denominator = reciproF(k)\n ans = numerator .times. denominator\n end function combinationN\n\n\n subroutine initialize( setSize )\n implicit none\n integer(16),intent(in),optional :: setSize\n integer(16) :: i\n \n sz = 10**6\n if(present(setSize)) sz = setSize\n allocate( factorial(0:sz),reciproF(0:sz) )\n \n !calc factrial\n factorial(0) = 1\n do i = 1,sz\n factorial(i) = factorial(i-1) .times. i\n end do\n !calc reciprocal of factorial\n do i = 0,sz\n reciproF(i) = inv( factorial(i) )\n end do\n end subroutine initialize\n\n\n pure function inv( x ) result( ans )\n implicit none\n integer(16),intent(in) :: x\n integer(16) :: ans,i\n \n ans = pow( x,modulus-2 )\n end function inv\n\n\n!calc x**n (mod)\n pure function pow( x,n ) result( ans )\n implicit none\n integer(16),intent(in) :: x,n\n integer(16) :: ans, k, y\n \n ans = 1\n k = n\n y = x\n do while( k/=0 )\n if( iand(k,1)==1 )then\n ans = ans .times. y\n end if\n y = y .times. y\n k = k / 2\n end do\n end function pow\n\n\n !operators\n pure function modSum( a,b ) result( res )\n implicit none\n integer(16),intent(in) :: a,b\n integer(16) :: res\n \n res = mod( a+b,modulus )\n end function\n pure function modSub( a,b ) result( res )\n implicit none\n integer(16),intent(in) :: a,b\n integer(16) :: res\n \n res = mod( a-b+modulus,modulus )\n end function\n pure function modMulti( a,b ) result( res )\n implicit none\n integer(16),intent(in) :: a,b\n integer(16) :: res\n \n res = mod( a*b,modulus )\n end function\n \n END MODULE combinationMod\n\n\n\n PROGRAM bouquet\n use combinationMod\n IMPLICIT NONE\n integer(16) :: ans,n,a,b\n integer(16) :: subA,subB\n \n read*,n,a,b\n \n ans = pow(2_16,n) - 1\n \n call initialize()\n \n print*,ans\n subA = combinationN(n,a)\n print*,subA\n subB = combinationN(n,b)\n print*,subB\n ans = ans .minus. subA .minus. subB\n \n print*,ans\n \n \n END PROGRAM", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "sample_input": "4 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02768", "source_text": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3972, "cpu_time_ms": 826, "memory_kb": 31488}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s267230308", "group_id": "codeNet:p02768", "input_text": "module Factwithmod\n implicit none\n integer(16),allocatable,dimension(:)::Kaijo\n contains\nsubroutine initiationFactorial(maxnum,mo)\n implicit none\n integer(16)::maxnum\n integer(16)::mo\n integer(16)::i\n\n allocate(Kaijo(0:maxnum))\n Kaijo(0)=1\n do i=1,maxnum\n Kaijo(i)=mod(Kaijo(i-1)*i,mo)\n end do\nend subroutine\n\nfunction combination(n,k,l)\nimplicit none\ninteger(16),intent(in)::n,k,l\ninteger(16) combination\n\ncombination=mod(Kaijo(N)*inv(Kaijo(K),l)*inv(Kaijo(N-K),l),l)\n\nend function\n\nfunction inv(K,L)\ninteger(16),intent(in)::k,l\ninteger(16) l2,y\ninteger(16) inv\ninv=1\nl2=l-2\ny=k\ndo\n if(mod(l2,2)==1)inv=mod(inv*y,l)\n y=mod(y*y,l)\n l2=l2/2\n if(l2==0)exit\nend do\nend function\n\nfunction permutation(n,k,mo)\nimplicit none\n integer(16)::n,k\n integer(16)::mo,permutation\n permutation=mod(Kaijo(N)*inv(Kaijo(N-K),mo),mo)\nend function\nend module Factwithmod\nprogram ABC156b\n use Factwithmod\n implicit none\n integer(16)::N\n integer(16)::a,b\n integer(16)::mo=10**9+7\n integer(16)::allc\n integer(16)::ans\n read*,N,a,b\n allc=1\n call initiationFactorial(N,mo)\n allc=power_func(2_16,N,mo)-1\n ans=allc-combination(N,a,mo)-combination(N,b,mo)\n ans=mod(ans,mo)\n if(ans<0)ans=ans+mo\n print\"(i0)\",ans\ncontains\ninteger(16) function power_func(a,n,mo)\n integer(16)::a,n,mo\n integer(16)::l2,y\n power_func=1\n l2=N\n y=a\n do\n if(mod(l2,2)==1)power_func=mod(power_func*y,mo)\n y=mod(y*y,mo)\n l2=l2/2\n if(l2==0)exit\n end do\nend function power_func\nend program ABC156b", "language": "Fortran", "metadata": {"date": 1582404401, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02768.html", "problem_id": "p02768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02768/input.txt", "sample_output_relpath": "derived/input_output/data/p02768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02768/Fortran/s267230308.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s267230308", "user_id": "u598073939"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "module Factwithmod\n implicit none\n integer(16),allocatable,dimension(:)::Kaijo\n contains\nsubroutine initiationFactorial(maxnum,mo)\n implicit none\n integer(16)::maxnum\n integer(16)::mo\n integer(16)::i\n\n allocate(Kaijo(0:maxnum))\n Kaijo(0)=1\n do i=1,maxnum\n Kaijo(i)=mod(Kaijo(i-1)*i,mo)\n end do\nend subroutine\n\nfunction combination(n,k,l)\nimplicit none\ninteger(16),intent(in)::n,k,l\ninteger(16) combination\n\ncombination=mod(Kaijo(N)*inv(Kaijo(K),l)*inv(Kaijo(N-K),l),l)\n\nend function\n\nfunction inv(K,L)\ninteger(16),intent(in)::k,l\ninteger(16) l2,y\ninteger(16) inv\ninv=1\nl2=l-2\ny=k\ndo\n if(mod(l2,2)==1)inv=mod(inv*y,l)\n y=mod(y*y,l)\n l2=l2/2\n if(l2==0)exit\nend do\nend function\n\nfunction permutation(n,k,mo)\nimplicit none\n integer(16)::n,k\n integer(16)::mo,permutation\n permutation=mod(Kaijo(N)*inv(Kaijo(N-K),mo),mo)\nend function\nend module Factwithmod\nprogram ABC156b\n use Factwithmod\n implicit none\n integer(16)::N\n integer(16)::a,b\n integer(16)::mo=10**9+7\n integer(16)::allc\n integer(16)::ans\n read*,N,a,b\n allc=1\n call initiationFactorial(N,mo)\n allc=power_func(2_16,N,mo)-1\n ans=allc-combination(N,a,mo)-combination(N,b,mo)\n ans=mod(ans,mo)\n if(ans<0)ans=ans+mo\n print\"(i0)\",ans\ncontains\ninteger(16) function power_func(a,n,mo)\n integer(16)::a,n,mo\n integer(16)::l2,y\n power_func=1\n l2=N\n y=a\n do\n if(mod(l2,2)==1)power_func=mod(power_func*y,mo)\n y=mod(y*y,mo)\n l2=l2/2\n if(l2==0)exit\n end do\nend function power_func\nend program ABC156b", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "sample_input": "4 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02768", "source_text": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1555, "cpu_time_ms": 2108, "memory_kb": 1584896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s472431975", "group_id": "codeNet:p02770", "input_text": "program modularness\n implicit none\n integer :: k, q, n, p, r, s, i, j\n integer(8) :: d(0:5000) = 0, x, m, dj, dn, a\n read(*,*) k, q\n read(*,*) d(0:k - 1)\n do i = 1, q\n read(*,*) n, x, m\n p = (n - 1) / k\n r = mod(n - 1, k)\n dn = x\n a = n - 1\n do j = 0, k - 1\n s = p + merge(1, 0, j < r)\n dj = mod(d(j), m)\n if (dj == 0) a = a - s\n dn = dn + dj * s\n end do\n a = a - dn / m + x / m\n write(*,'(i0)') a\n end do\nend program modularness", "language": "Fortran", "metadata": {"date": 1596071603, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02770.html", "problem_id": "p02770", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02770/input.txt", "sample_output_relpath": "derived/input_output/data/p02770/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02770/Fortran/s472431975.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s472431975", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program modularness\n implicit none\n integer :: k, q, n, p, r, s, i, j\n integer(8) :: d(0:5000) = 0, x, m, dj, dn, a\n read(*,*) k, q\n read(*,*) d(0:k - 1)\n do i = 1, q\n read(*,*) n, x, m\n p = (n - 1) / k\n r = mod(n - 1, k)\n dn = x\n a = n - 1\n do j = 0, k - 1\n s = p + merge(1, 0, j < r)\n dj = mod(d(j), m)\n if (dj == 0) a = a - s\n dn = dn + dj * s\n end do\n a = a - dn / m + x / m\n write(*,'(i0)') a\n end do\nend program modularness", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of k numbers: d_0,d_1,...,d_{k - 1}.\n\nProcess the following q queries in order:\n\nThe i-th query contains three integers n_i, x_i, and m_i.\nLet a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \\begin{eqnarray} a_j = \\begin{cases} x_i & ( j = 0 ) \\\\ a_{j - 1} + d_{(j - 1)~\\textrm{mod}~k} & ( 0 < j \\leq n_i - 1 ) \\end{cases}\\end{eqnarray}\nPrint the number of j~(0 \\leq j < n_i - 1) such that (a_j~\\textrm{mod}~m_i) < (a_{j + 1}~\\textrm{mod}~m_i).\n\nHere (y~\\textrm{mod}~z) denotes the remainder of y divided by z, for two integers y and z~(z > 0).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq k, q \\leq 5000\n\n0 \\leq d_i \\leq 10^9\n\n2 \\leq n_i \\leq 10^9\n\n0 \\leq x_i \\leq 10^9\n\n2 \\leq m_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nk q\nd_0 d_1 ... d_{k - 1}\nn_1 x_1 m_1\nn_2 x_2 m_2\n:\nn_q x_q m_q\n\nOutput\n\nPrint q lines.\n\nThe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3 1\n3 1 4\n5 3 2\n\nSample Output 1\n\n1\n\nFor the first query, the sequence {a_j} will be 3,6,7,11,14.\n\n(a_0~\\textrm{mod}~2) > (a_1~\\textrm{mod}~2)\n\n(a_1~\\textrm{mod}~2) < (a_2~\\textrm{mod}~2)\n\n(a_2~\\textrm{mod}~2) = (a_3~\\textrm{mod}~2)\n\n(a_3~\\textrm{mod}~2) > (a_4~\\textrm{mod}~2)\n\nThus, the response to this query should be 1.\n\nSample Input 2\n\n7 3\n27 18 28 18 28 46 1000000000\n1000000000 1 7\n1000000000 2 10\n1000000000 3 12\n\nSample Output 2\n\n224489796\n214285714\n559523809", "sample_input": "3 1\n3 1 4\n5 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02770", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of k numbers: d_0,d_1,...,d_{k - 1}.\n\nProcess the following q queries in order:\n\nThe i-th query contains three integers n_i, x_i, and m_i.\nLet a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \\begin{eqnarray} a_j = \\begin{cases} x_i & ( j = 0 ) \\\\ a_{j - 1} + d_{(j - 1)~\\textrm{mod}~k} & ( 0 < j \\leq n_i - 1 ) \\end{cases}\\end{eqnarray}\nPrint the number of j~(0 \\leq j < n_i - 1) such that (a_j~\\textrm{mod}~m_i) < (a_{j + 1}~\\textrm{mod}~m_i).\n\nHere (y~\\textrm{mod}~z) denotes the remainder of y divided by z, for two integers y and z~(z > 0).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq k, q \\leq 5000\n\n0 \\leq d_i \\leq 10^9\n\n2 \\leq n_i \\leq 10^9\n\n0 \\leq x_i \\leq 10^9\n\n2 \\leq m_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nk q\nd_0 d_1 ... d_{k - 1}\nn_1 x_1 m_1\nn_2 x_2 m_2\n:\nn_q x_q m_q\n\nOutput\n\nPrint q lines.\n\nThe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3 1\n3 1 4\n5 3 2\n\nSample Output 1\n\n1\n\nFor the first query, the sequence {a_j} will be 3,6,7,11,14.\n\n(a_0~\\textrm{mod}~2) > (a_1~\\textrm{mod}~2)\n\n(a_1~\\textrm{mod}~2) < (a_2~\\textrm{mod}~2)\n\n(a_2~\\textrm{mod}~2) = (a_3~\\textrm{mod}~2)\n\n(a_3~\\textrm{mod}~2) > (a_4~\\textrm{mod}~2)\n\nThus, the response to this query should be 1.\n\nSample Input 2\n\n7 3\n27 18 28 18 28 46 1000000000\n1000000000 1 7\n1000000000 2 10\n1000000000 3 12\n\nSample Output 2\n\n224489796\n214285714\n559523809", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 483, "cpu_time_ms": 216, "memory_kb": 2928}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s980939815", "group_id": "codeNet:p02771", "input_text": "program poor\n integer(4):: a,b,c\n read*, a,b,c\n\n if (((a/=b) .and. (a/=c) .and. (b/=c)) .or. ((a==b) .and.(a==c))) then\n print*, \"No\"\n else\n print*, \"Yes\"\n end if\nend program poor", "language": "Fortran", "metadata": {"date": 1581891730, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/Fortran/s980939815.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s980939815", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program poor\n integer(4):: a,b,c\n read*, a,b,c\n\n if (((a/=b) .and. (a/=c) .and. (b/=c)) .or. ((a==b) .and.(a==c))) then\n print*, \"No\"\n else\n print*, \"Yes\"\n end if\nend program poor", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s364987313", "group_id": "codeNet:p02771", "input_text": "program main\n\n implicit none\n \n !character(10) :: s, t, u\n integer :: a, b, c, n\n \n\n read(*,*) a, b, c\n \n n = 0\n if( a == b ) then\n n = n + 1\n end if\n if( a == c ) then\n n = n + 1\n end if\n if( b == c ) then\n n = n + 1\n end if\n\n if ( n == 1 ) then\n print*, \"Yes\"\n else\n print*, \"No\"\n end if\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1581883482, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02771/input.txt", "sample_output_relpath": "derived/input_output/data/p02771/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02771/Fortran/s364987313.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364987313", "user_id": "u675314298"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n\n implicit none\n \n !character(10) :: s, t, u\n integer :: a, b, c, n\n \n\n read(*,*) a, b, c\n \n n = 0\n if( a == b ) then\n n = n + 1\n end if\n if( a == c ) then\n n = n + 1\n end if\n if( b == c ) then\n n = n + 1\n end if\n\n if ( n == 1 ) then\n print*, \"Yes\"\n else\n print*, \"No\"\n end if\n \nend program main\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "sample_input": "5 7 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02771", "source_text": "Score: 100 points\n\nProblem Statement\n\nA triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.\n\nYou will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.\n\nConstraints\n\nA, B, and C are all integers between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the given triple is poor, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\nYes\n\nA and C are equal, but B is different from those two numbers, so this triple is poor.\n\nSample Input 2\n\n4 4 4\n\nSample Output 2\n\nNo\n\nA, B, and C are all equal, so this triple is not poor.\n\nSample Input 3\n\n4 9 6\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3 3 4\n\nSample Output 4\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s745525916", "group_id": "codeNet:p02773", "input_text": " module charaSort\n implicit none\n \n contains\n recursive function sort( s ) result( r )\n implicit none\n character(10),intent(in) :: s(:)\n character(10) :: r( size(s) )\n \n if( size(s)>1 )then\n ! r = [sort( pack(s, ss(1)) )]\n r = [sort( pack(s, s< s(1)) ), &\n sort( pack(s, s>=s(1)) )]\n else\n r = s\n end if\n end function\n end module\n\n\n PROGRAM Poll\n use charaSort\n IMPLICIT NONE\n integer(16) :: n\n character(10),allocatable :: s(:)\n character(10),allocatable :: note1(:)\n integer(16) :: i,counter\n integer(16),allocatable :: note2(:)\n logical,allocatable :: flag(:)\n \n \n read*,n\n allocate( s(1:n) )\n allocate(note1(n),note2(n),flag(n))\n do i = 1,n\n read*,s(i)\n end do\n \n s = sort(s)\n \n counter = 1\n note1(1) = s(1)\n note2(:) = 0\n do i = 2,n\n if(note1(counter)==s(i))then\n note2(counter) = note2(counter) + 1\n else\n counter = counter + 1\n note1(counter) = s(i)\n end if\n end do\n \n flag = note2==maxval(note2)\n \n do i = 1,counter\n if(flag(i))then\n print*,note1(i)\n end if\n end do\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1581886683, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02773.html", "problem_id": "p02773", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02773/input.txt", "sample_output_relpath": "derived/input_output/data/p02773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02773/Fortran/s745525916.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s745525916", "user_id": "u171356453"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": " module charaSort\n implicit none\n \n contains\n recursive function sort( s ) result( r )\n implicit none\n character(10),intent(in) :: s(:)\n character(10) :: r( size(s) )\n \n if( size(s)>1 )then\n ! r = [sort( pack(s, ss(1)) )]\n r = [sort( pack(s, s< s(1)) ), &\n sort( pack(s, s>=s(1)) )]\n else\n r = s\n end if\n end function\n end module\n\n\n PROGRAM Poll\n use charaSort\n IMPLICIT NONE\n integer(16) :: n\n character(10),allocatable :: s(:)\n character(10),allocatable :: note1(:)\n integer(16) :: i,counter\n integer(16),allocatable :: note2(:)\n logical,allocatable :: flag(:)\n \n \n read*,n\n allocate( s(1:n) )\n allocate(note1(n),note2(n),flag(n))\n do i = 1,n\n read*,s(i)\n end do\n \n s = sort(s)\n \n counter = 1\n note1(1) = s(1)\n note2(:) = 0\n do i = 2,n\n if(note1(counter)==s(i))then\n note2(counter) = note2(counter) + 1\n else\n counter = counter + 1\n note1(counter) = s(i)\n end if\n end do\n \n flag = note2==maxval(note2)\n \n do i = 1,counter\n if(flag(i))then\n print*,note1(i)\n end if\n end do\n \n END PROGRAM", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1423, "cpu_time_ms": 2211, "memory_kb": 1654252}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s240612720", "group_id": "codeNet:p02776", "input_text": "module mod_unweighted_graph\n implicit none\n type t_list\n integer, allocatable :: at(:, :)\n end type\n type unweighted_graph\n type(t_list), allocatable :: list(:)\n end type\n interface unweighted_graph\n module procedure :: newug0\n end interface unweighted_graph\ncontains\n type(unweighted_graph) function newug0(n, m, a, b, e, undirected) result(res)\n integer, intent(in) :: n, m, a(:), b(:), e(:)\n logical, optional, intent(in) :: undirected\n logical :: u\n integer :: c(n), i\n u = merge(undirected, .true., present(undirected))\n c = 0\n do i = 1, m\n c(a(i)) = c(a(i)) + 1\n if (u) c(b(i)) = c(b(i)) + 1\n end do\n allocate(res%list(n))\n do i = 1, n\n allocate(res%list(i)%at(c(i), 2))\n end do\n do i = m, 1, -1\n res%list(a(i))%at(c(a(i)), 1) = b(i)\n res%list(a(i))%at(c(a(i)), 2) = e(i)\n c(a(i)) = c(a(i)) - 1\n if (u) then\n res%list(b(i))%at(c(b(i)), 1) = a(i)\n res%list(b(i))%at(c(b(i)), 2) = e(i)\n c(b(i)) = c(b(i)) - 1\n end if\n end do\n end\nend module mod_unweighted_graph\nmodule mod_two_dim_merge_sort\n implicit none\n integer, private, parameter :: intkind = 4\ncontains\n logical function less(a, b) result(res)\n integer(intkind), intent(in) :: a(:), b(:)\n res = a(1) < b(1)\n end\n subroutine merge_sort(a)\n integer(intkind), intent(inout) :: a(:, :)\n integer :: n, m, l, i, u\n n = size(a, 1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m / 2\n u = min(2 * i * l, n)\n call merger(a(2 * (i - 1) * l + 1:(2 * i - 1) * l, :), &\n a((2 * i - 1) * l + 1:u, :))\n end do\n l = 2 * l\n m = (m + 1) / 2\n end do\n end\n subroutine merger(a1, a2)\n integer(intkind), intent(inout) :: a1(:, :), a2(:, :)\n integer(intkind) :: a(size(a1, 1) + size(a2, 1), size(a1, 2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1, 1)\n n2 = size(a2, 1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (less(a1(i1, :), a2(i2, :))) then\n a(i1 + i2 - 1, :) = a1(i1, :)\n i1 = i1 + 1\n else\n a(i1 + i2 - 1, :) = a2(i2, :)\n i2 = i2 + 1\n end if\n end do\n if (i1 <= n1) then\n a(i1 + i2 - 1:n1 + n2, :) = a1(i1:n1, :)\n else\n a(i1 + i2 - 1:n1 + n2, :) = a2(i2:n2, :)\n end if\n a1 = a(1:n1, :)\n a2 = a(n1 + 1:n1 + n2, :)\n end\nend module mod_two_dim_merge_sort\nprogram perils_in_parallel\n use mod_unweighted_graph\n use mod_two_dim_merge_sort\n implicit none\n integer :: n, m, cnt = 0, i, j, l, r, p\n integer :: a(100000, 2) = 0, x(200000, 3) = 0, y(200000, 1) = 0, z(100001) = 0\n logical :: used(100001) = .false.\n type(unweighted_graph) :: g\n read(*,*) n, m\n do i = 1, n\n read(*,*) a(i, :)\n end do\n call merge_sort(a(1:n, :))\n z(1) = a(1, 2)\n do i = 2, n\n z(i) = xor(a(i, 2), a(i - 1, 2))\n end do\n z(n + 1) = a(n, 2)\n do i = 1, m\n j = cnt + 1\n read(*,*) x(j, 1:2)\n x(j, 3) = i\n if (x(j, 1) > a(n, 1)) cycle\n if (x(j, 2) < a(1, 1)) cycle\n l = 0\n r = n\n do while (r - l > 1)\n p = (l + r) / 2\n if (x(j, 1) <= a(p, 1)) then\n r = p\n else\n l = p\n end if\n end do\n x(j, 1) = r\n l = 1\n r = n + 1\n do while (r - l > 1)\n p = (l + r) / 2\n if (x(j, 2) >= a(p, 1)) then\n l = p\n else\n r = p\n end if\n end do\n x(j, 2) = r\n if (x(j, 1) < x(j, 2)) cnt = cnt + 1\n end do\n m = cnt\n g = unweighted_graph(n + 1, m, x(1:m, 1), x(1:m, 2), x(1:m, 3))\n p = 0\n do i = 1, n + 1\n if (used(i)) cycle\n if (btest(dfs(g, i), 0)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n write(*,'(i0)') p\n if (p > 0) then\n call merge_sort(y(1:p, :))\n write(*,'(i0)',advance='no') y(1, 1)\n do i = 2, p\n write(*,'(x,i0)',advance='no') y(i, 1)\n end do\n end if\n write(*,*)\ncontains\n recursive integer function dfs(this, v) result(res)\n type(unweighted_graph), intent(in) :: this\n integer, intent(in) :: v\n integer :: i, u, tmp\n used(v) = .true.\n res = z(v)\n do i = 1, size(this%list(v)%at, 1)\n u = this%list(v)%at(i, 1)\n if (used(u)) cycle\n tmp = dfs(this, u)\n if (btest(tmp, 0)) then\n p = p + 1\n y(p, 1) = this%list(v)%at(i, 2)\n end if\n res = xor(res, tmp)\n end do\n end\nend program perils_in_parallel", "language": "Fortran", "metadata": {"date": 1595904950, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02776.html", "problem_id": "p02776", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02776/input.txt", "sample_output_relpath": "derived/input_output/data/p02776/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02776/Fortran/s240612720.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240612720", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n1 4\n", "input_to_evaluate": "module mod_unweighted_graph\n implicit none\n type t_list\n integer, allocatable :: at(:, :)\n end type\n type unweighted_graph\n type(t_list), allocatable :: list(:)\n end type\n interface unweighted_graph\n module procedure :: newug0\n end interface unweighted_graph\ncontains\n type(unweighted_graph) function newug0(n, m, a, b, e, undirected) result(res)\n integer, intent(in) :: n, m, a(:), b(:), e(:)\n logical, optional, intent(in) :: undirected\n logical :: u\n integer :: c(n), i\n u = merge(undirected, .true., present(undirected))\n c = 0\n do i = 1, m\n c(a(i)) = c(a(i)) + 1\n if (u) c(b(i)) = c(b(i)) + 1\n end do\n allocate(res%list(n))\n do i = 1, n\n allocate(res%list(i)%at(c(i), 2))\n end do\n do i = m, 1, -1\n res%list(a(i))%at(c(a(i)), 1) = b(i)\n res%list(a(i))%at(c(a(i)), 2) = e(i)\n c(a(i)) = c(a(i)) - 1\n if (u) then\n res%list(b(i))%at(c(b(i)), 1) = a(i)\n res%list(b(i))%at(c(b(i)), 2) = e(i)\n c(b(i)) = c(b(i)) - 1\n end if\n end do\n end\nend module mod_unweighted_graph\nmodule mod_two_dim_merge_sort\n implicit none\n integer, private, parameter :: intkind = 4\ncontains\n logical function less(a, b) result(res)\n integer(intkind), intent(in) :: a(:), b(:)\n res = a(1) < b(1)\n end\n subroutine merge_sort(a)\n integer(intkind), intent(inout) :: a(:, :)\n integer :: n, m, l, i, u\n n = size(a, 1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m / 2\n u = min(2 * i * l, n)\n call merger(a(2 * (i - 1) * l + 1:(2 * i - 1) * l, :), &\n a((2 * i - 1) * l + 1:u, :))\n end do\n l = 2 * l\n m = (m + 1) / 2\n end do\n end\n subroutine merger(a1, a2)\n integer(intkind), intent(inout) :: a1(:, :), a2(:, :)\n integer(intkind) :: a(size(a1, 1) + size(a2, 1), size(a1, 2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1, 1)\n n2 = size(a2, 1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (less(a1(i1, :), a2(i2, :))) then\n a(i1 + i2 - 1, :) = a1(i1, :)\n i1 = i1 + 1\n else\n a(i1 + i2 - 1, :) = a2(i2, :)\n i2 = i2 + 1\n end if\n end do\n if (i1 <= n1) then\n a(i1 + i2 - 1:n1 + n2, :) = a1(i1:n1, :)\n else\n a(i1 + i2 - 1:n1 + n2, :) = a2(i2:n2, :)\n end if\n a1 = a(1:n1, :)\n a2 = a(n1 + 1:n1 + n2, :)\n end\nend module mod_two_dim_merge_sort\nprogram perils_in_parallel\n use mod_unweighted_graph\n use mod_two_dim_merge_sort\n implicit none\n integer :: n, m, cnt = 0, i, j, l, r, p\n integer :: a(100000, 2) = 0, x(200000, 3) = 0, y(200000, 1) = 0, z(100001) = 0\n logical :: used(100001) = .false.\n type(unweighted_graph) :: g\n read(*,*) n, m\n do i = 1, n\n read(*,*) a(i, :)\n end do\n call merge_sort(a(1:n, :))\n z(1) = a(1, 2)\n do i = 2, n\n z(i) = xor(a(i, 2), a(i - 1, 2))\n end do\n z(n + 1) = a(n, 2)\n do i = 1, m\n j = cnt + 1\n read(*,*) x(j, 1:2)\n x(j, 3) = i\n if (x(j, 1) > a(n, 1)) cycle\n if (x(j, 2) < a(1, 1)) cycle\n l = 0\n r = n\n do while (r - l > 1)\n p = (l + r) / 2\n if (x(j, 1) <= a(p, 1)) then\n r = p\n else\n l = p\n end if\n end do\n x(j, 1) = r\n l = 1\n r = n + 1\n do while (r - l > 1)\n p = (l + r) / 2\n if (x(j, 2) >= a(p, 1)) then\n l = p\n else\n r = p\n end if\n end do\n x(j, 2) = r\n if (x(j, 1) < x(j, 2)) cnt = cnt + 1\n end do\n m = cnt\n g = unweighted_graph(n + 1, m, x(1:m, 1), x(1:m, 2), x(1:m, 3))\n p = 0\n do i = 1, n + 1\n if (used(i)) cycle\n if (btest(dfs(g, i), 0)) then\n write(*,'(i0)') -1\n stop\n end if\n end do\n write(*,'(i0)') p\n if (p > 0) then\n call merge_sort(y(1:p, :))\n write(*,'(i0)',advance='no') y(1, 1)\n do i = 2, p\n write(*,'(x,i0)',advance='no') y(i, 1)\n end do\n end if\n write(*,*)\ncontains\n recursive integer function dfs(this, v) result(res)\n type(unweighted_graph), intent(in) :: this\n integer, intent(in) :: v\n integer :: i, u, tmp\n used(v) = .true.\n res = z(v)\n do i = 1, size(this%list(v)%at, 1)\n u = this%list(v)%at(i, 1)\n if (used(u)) cycle\n tmp = dfs(this, u)\n if (btest(tmp, 0)) then\n p = p + 1\n y(p, 1) = this%list(v)%at(i, 2)\n end if\n res = xor(res, tmp)\n end do\n end\nend program perils_in_parallel", "problem_context": "Score: 600 points\n\nProblem Statement\n\nAfter being invaded by the Kingdom of AlDebaran, bombs are planted throughout our country, AtCoder Kingdom.\n\nFortunately, our military team called ABC has managed to obtain a device that is a part of the system controlling the bombs.\n\nThere are N bombs, numbered 1 to N, planted in our country. Bomb i is planted at the coordinate A_i. It is currently activated if B_i=1, and deactivated if B_i=0.\n\nThe device has M cords numbered 1 to M. If we cut Cord j, the states of all the bombs planted between the coordinates L_j and R_j (inclusive) will be switched - from activated to deactivated, and vice versa.\n\nDetermine whether it is possible to deactivate all the bombs at the same time. If the answer is yes, output a set of cords that should be cut.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nA_i are pairwise distinct.\n\nB_i is 0 or 1. (1 \\leq i \\leq N)\n\n1 \\leq M \\leq 2 \\times 10^5\n\n1 \\leq L_j \\leq R_j \\leq 10^9\\ (1 \\leq j \\leq M)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_N B_N\nL_1 R_1\n:\nL_M R_M\n\nOutput\n\nIf it is impossible to deactivate all the bombs at the same time, print -1. If it is possible to do so, print a set of cords that should be cut, as follows:\n\nk\nc_1 c_2 \\dots c_k\n\nHere, k is the number of cords (possibly 0), and c_1, c_2, \\dots, c_k represent the cords that should be cut. 1 \\leq c_1 < c_2 < \\dots < c_k \\leq M must hold.\n\nSample Input 1\n\n3 4\n5 1\n10 1\n8 0\n1 10\n4 5\n6 7\n8 9\n\nSample Output 1\n\n2\n1 4\n\nThere are two activated bombs at the coordinates 5, 10, and one deactivated bomb at the coordinate 8.\n\nCutting Cord 1 switches the states of all the bombs planted between the coordinates 1 and 10, that is, all of the three bombs.\n\nCutting Cord 4 switches the states of all the bombs planted between the coordinates 8 and 9, that is, Bomb 3.\n\nThus, we can deactivate all the bombs by cutting Cord 1 and Cord 4.\n\nSample Input 2\n\n4 2\n2 0\n3 1\n5 1\n7 0\n1 4\n4 7\n\nSample Output 2\n\n-1\n\nCutting any set of cords will not deactivate all the bombs at the same time.\n\nSample Input 3\n\n3 2\n5 0\n10 0\n8 0\n6 9\n66 99\n\nSample Output 3\n\n0\n\nAll the bombs are already deactivated, so we do not need to cut any cord.\n\nSample Input 4\n\n12 20\n536130100 1\n150049660 1\n79245447 1\n132551741 0\n89484841 1\n328129089 0\n623467741 0\n248785745 0\n421631475 0\n498966877 0\n43768791 1\n112237273 0\n21499042 142460201\n58176487 384985131\n88563042 144788076\n120198276 497115965\n134867387 563350571\n211946499 458996604\n233934566 297258009\n335674184 555985828\n414601661 520203502\n101135608 501051309\n90972258 300372385\n255474956 630621190\n436210625 517850028\n145652401 192476406\n377607297 520655694\n244404406 304034433\n112237273 359737255\n392593015 463983307\n150586788 504362212\n54772353 83124235\n\nSample Output 4\n\n5\n1 7 8 9 11\n\nIf there are multiple sets of cords that deactivate all the bombs when cut, any of them can be printed.", "sample_input": "3 4\n5 1\n10 1\n8 0\n1 10\n4 5\n6 7\n8 9\n"}, "reference_outputs": ["2\n1 4\n"], "source_document_id": "p02776", "source_text": "Score: 600 points\n\nProblem Statement\n\nAfter being invaded by the Kingdom of AlDebaran, bombs are planted throughout our country, AtCoder Kingdom.\n\nFortunately, our military team called ABC has managed to obtain a device that is a part of the system controlling the bombs.\n\nThere are N bombs, numbered 1 to N, planted in our country. Bomb i is planted at the coordinate A_i. It is currently activated if B_i=1, and deactivated if B_i=0.\n\nThe device has M cords numbered 1 to M. If we cut Cord j, the states of all the bombs planted between the coordinates L_j and R_j (inclusive) will be switched - from activated to deactivated, and vice versa.\n\nDetermine whether it is possible to deactivate all the bombs at the same time. If the answer is yes, output a set of cords that should be cut.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\\ (1 \\leq i \\leq N)\n\nA_i are pairwise distinct.\n\nB_i is 0 or 1. (1 \\leq i \\leq N)\n\n1 \\leq M \\leq 2 \\times 10^5\n\n1 \\leq L_j \\leq R_j \\leq 10^9\\ (1 \\leq j \\leq M)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_N B_N\nL_1 R_1\n:\nL_M R_M\n\nOutput\n\nIf it is impossible to deactivate all the bombs at the same time, print -1. If it is possible to do so, print a set of cords that should be cut, as follows:\n\nk\nc_1 c_2 \\dots c_k\n\nHere, k is the number of cords (possibly 0), and c_1, c_2, \\dots, c_k represent the cords that should be cut. 1 \\leq c_1 < c_2 < \\dots < c_k \\leq M must hold.\n\nSample Input 1\n\n3 4\n5 1\n10 1\n8 0\n1 10\n4 5\n6 7\n8 9\n\nSample Output 1\n\n2\n1 4\n\nThere are two activated bombs at the coordinates 5, 10, and one deactivated bomb at the coordinate 8.\n\nCutting Cord 1 switches the states of all the bombs planted between the coordinates 1 and 10, that is, all of the three bombs.\n\nCutting Cord 4 switches the states of all the bombs planted between the coordinates 8 and 9, that is, Bomb 3.\n\nThus, we can deactivate all the bombs by cutting Cord 1 and Cord 4.\n\nSample Input 2\n\n4 2\n2 0\n3 1\n5 1\n7 0\n1 4\n4 7\n\nSample Output 2\n\n-1\n\nCutting any set of cords will not deactivate all the bombs at the same time.\n\nSample Input 3\n\n3 2\n5 0\n10 0\n8 0\n6 9\n66 99\n\nSample Output 3\n\n0\n\nAll the bombs are already deactivated, so we do not need to cut any cord.\n\nSample Input 4\n\n12 20\n536130100 1\n150049660 1\n79245447 1\n132551741 0\n89484841 1\n328129089 0\n623467741 0\n248785745 0\n421631475 0\n498966877 0\n43768791 1\n112237273 0\n21499042 142460201\n58176487 384985131\n88563042 144788076\n120198276 497115965\n134867387 563350571\n211946499 458996604\n233934566 297258009\n335674184 555985828\n414601661 520203502\n101135608 501051309\n90972258 300372385\n255474956 630621190\n436210625 517850028\n145652401 192476406\n377607297 520655694\n244404406 304034433\n112237273 359737255\n392593015 463983307\n150586788 504362212\n54772353 83124235\n\nSample Output 4\n\n5\n1 7 8 9 11\n\nIf there are multiple sets of cords that deactivate all the bombs when cut, any of them can be printed.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4336, "cpu_time_ms": 279, "memory_kb": 26624}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s551577201", "group_id": "codeNet:p02777", "input_text": "program main\n\timplicit none\n character(10)::s,t,u\n integer::a,b\n read(*,*) s,t\n read(*,*)a,b\n read(*,*)u\n \n if(s==u)then\n \twrite(*,*) a-1,b\n else\n \twrite(*,*) a,b-1\n end if\n stop\nend program main\n\n\n\n", "language": "Fortran", "metadata": {"date": 1592616634, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02777/input.txt", "sample_output_relpath": "derived/input_output/data/p02777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02777/Fortran/s551577201.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s551577201", "user_id": "u884601206"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "program main\n\timplicit none\n character(10)::s,t,u\n integer::a,b\n read(*,*) s,t\n read(*,*)a,b\n read(*,*)u\n \n if(s==u)then\n \twrite(*,*) a-1,b\n else\n \twrite(*,*) a,b-1\n end if\n stop\nend program main\n\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s976608011", "group_id": "codeNet:p02777", "input_text": "program main\n implicit none\n character(10) :: s, t, u\n integer :: a, b\n\n read *, s, t\n read *, a, b\n read *, u\n\n if ( u == s ) then\n print *, a-1, b\n else\n print *, a, b-1\n end if\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1588705487, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02777/input.txt", "sample_output_relpath": "derived/input_output/data/p02777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02777/Fortran/s976608011.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s976608011", "user_id": "u353721260"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "program main\n implicit none\n character(10) :: s, t, u\n integer :: a, b\n\n read *, s, t\n read *, a, b\n read *, u\n\n if ( u == s ) then\n print *, a-1, b\n else\n print *, a, b-1\n end if\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s765632425", "group_id": "codeNet:p02777", "input_text": " Program Main\n\n Implicit None\n Character :: S*10,T*10,U*10\n Integer :: A,B\n\n Read(*,*) S,T\n Read(*,*) A,B\n Read(*,*) U\n\n If(S==U) A=A-1\n If(T==U) B=B-1\n\n Write(*,\"(I0,x,I0)\") A,B\n\n End Program\n", "language": "Fortran", "metadata": {"date": 1581279517, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02777/input.txt", "sample_output_relpath": "derived/input_output/data/p02777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02777/Fortran/s765632425.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s765632425", "user_id": "u718634931"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": " Program Main\n\n Implicit None\n Character :: S*10,T*10,U*10\n Integer :: A,B\n\n Read(*,*) S,T\n Read(*,*) A,B\n Read(*,*) U\n\n If(S==U) A=A-1\n If(T==U) B=B-1\n\n Write(*,\"(I0,x,I0)\") A,B\n\n End Program\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 246, "cpu_time_ms": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s925630684", "group_id": "codeNet:p02779", "input_text": "! 2020.2.9\n!\n program answer\n implicit none\n integer :: N\n integer,allocatable,dimension(:) :: A\n integer :: i\n character(len=3) :: ans\n!\n ans = 'YES'\n read(*,*) N\n allocate(A(N))\n read(*,*) (A(i),i=1,N)\n!\n call quicksort(N,A,1,N)\n do i=1,N-1\n if(A(i) == A(i+1)) ans='NO'\n end do\n!\n write(*,*) ans\n!\n end program answer\n!\n!-------------------------------------------------\n recursive subroutine quicksort(n,x,l,r)\n!-------------------------------------------------\n! Variables I/O\n!-------------------------------------------------\n! n ... the number of data (IN) : integer\n! x(i) ... data (INOUT) : integer\n! l ... the smallest label in a sorted region\n! (compute label)\n! r ... the largest label in a sorted region\n! (compute label)\n!-------------------------------------------------\n! Variables (The others)\n!-------------------------------------------------\n! c ... the average of l and r : (l+r)/2\n! ls ... the smallest label in a sorted region\n! (Input label)\n! i ... the largest label in a sorted region\n! (Input label)\n!-------------------------------------------------\n! Contain\n!-------------------------------------------------\n! Subroutine : swap(a,b) : swaping a for b\n!-------------------------------------------------\n implicit none\n integer,intent(in) :: n,l,r\n integer,dimension(n),intent(inout) :: x\n integer :: c,ls,i\n!\n if(l < r) then\n c = (l+r) / 2 ! representative value\n call swap(x(l),x(c))\n ls = l\n do i=l+1,r\n if(x(i) < x(l)) then\n ls = ls + 1\n call swap(x(ls),x(i))\n end if\n end do\n call swap(x(ls),x(l))\n call quicksort(n,x,l,ls-1)\n call quicksort(n,x,ls+1,r)\n end if\n contains\n!-------------------------------------------------\n subroutine swap(a,b)\n!-------------------------------------------------\n integer,intent(inout) :: a,b\n integer :: w\n w=a\n a=b\n b=w\n end subroutine swap\n end subroutine quicksort\n!", "language": "Fortran", "metadata": {"date": 1581281286, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02779.html", "problem_id": "p02779", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02779/input.txt", "sample_output_relpath": "derived/input_output/data/p02779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02779/Fortran/s925630684.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s925630684", "user_id": "u954587078"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "! 2020.2.9\n!\n program answer\n implicit none\n integer :: N\n integer,allocatable,dimension(:) :: A\n integer :: i\n character(len=3) :: ans\n!\n ans = 'YES'\n read(*,*) N\n allocate(A(N))\n read(*,*) (A(i),i=1,N)\n!\n call quicksort(N,A,1,N)\n do i=1,N-1\n if(A(i) == A(i+1)) ans='NO'\n end do\n!\n write(*,*) ans\n!\n end program answer\n!\n!-------------------------------------------------\n recursive subroutine quicksort(n,x,l,r)\n!-------------------------------------------------\n! Variables I/O\n!-------------------------------------------------\n! n ... the number of data (IN) : integer\n! x(i) ... data (INOUT) : integer\n! l ... the smallest label in a sorted region\n! (compute label)\n! r ... the largest label in a sorted region\n! (compute label)\n!-------------------------------------------------\n! Variables (The others)\n!-------------------------------------------------\n! c ... the average of l and r : (l+r)/2\n! ls ... the smallest label in a sorted region\n! (Input label)\n! i ... the largest label in a sorted region\n! (Input label)\n!-------------------------------------------------\n! Contain\n!-------------------------------------------------\n! Subroutine : swap(a,b) : swaping a for b\n!-------------------------------------------------\n implicit none\n integer,intent(in) :: n,l,r\n integer,dimension(n),intent(inout) :: x\n integer :: c,ls,i\n!\n if(l < r) then\n c = (l+r) / 2 ! representative value\n call swap(x(l),x(c))\n ls = l\n do i=l+1,r\n if(x(i) < x(l)) then\n ls = ls + 1\n call swap(x(ls),x(i))\n end if\n end do\n call swap(x(ls),x(l))\n call quicksort(n,x,l,ls-1)\n call quicksort(n,x,ls+1,r)\n end if\n contains\n!-------------------------------------------------\n subroutine swap(a,b)\n!-------------------------------------------------\n integer,intent(inout) :: a,b\n integer :: w\n w=a\n a=b\n b=w\n end subroutine swap\n end subroutine quicksort\n!", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2180, "cpu_time_ms": 82, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s776916706", "group_id": "codeNet:p02779", "input_text": "subroutine heapsort(n,array) \n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n\n integer ::i,k,j,l\n double precision :: t\n\n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort\n\nprogram Beg3\n implicit none\n integer :: N, i, j\n integer, allocatable :: A(:)\n\n\n read(*,*) N\n allocate(A(N))\n read(*,*) (A(i), i=1,N)\n\n call heapsort(N,A)\n\n do i=1,N-1\n if(A(i).eq.A(i+1)) goto 500\n enddo\n\n\n print*, 'YES'\n stop\n\n 500 print *, 'NO'\n\n\n\nend program Beg3\n\n", "language": "Fortran", "metadata": {"date": 1581280658, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02779.html", "problem_id": "p02779", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02779/input.txt", "sample_output_relpath": "derived/input_output/data/p02779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02779/Fortran/s776916706.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776916706", "user_id": "u878839832"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "subroutine heapsort(n,array) \n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n\n integer ::i,k,j,l\n double precision :: t\n\n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort\n\nprogram Beg3\n implicit none\n integer :: N, i, j\n integer, allocatable :: A(:)\n\n\n read(*,*) N\n allocate(A(N))\n read(*,*) (A(i), i=1,N)\n\n call heapsort(N,A)\n\n do i=1,N-1\n if(A(i).eq.A(i+1)) goto 500\n enddo\n\n\n print*, 'YES'\n stop\n\n 500 print *, 'NO'\n\n\n\nend program Beg3\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1177, "cpu_time_ms": 90, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s936816243", "group_id": "codeNet:p02780", "input_text": "program ABC154_D\n integer::N,K\n double precision,allocatable::p(:),a(:),b(:)\n read(*,*)N,K\n allocate(p(N),a(N),b(N))\n read(*,*)p\n do i=1,N\n a(i)=(p(i)+1.0)/2.0\n end do\n b=0\n do i=1,N-K+1\n b(i)=sum(a(i:i+K-1))\n end do\n ans=maxval(b)\n write(*,*)ans\nend program ABC154_D", "language": "Fortran", "metadata": {"date": 1590012267, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02780.html", "problem_id": "p02780", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02780/input.txt", "sample_output_relpath": "derived/input_output/data/p02780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02780/Fortran/s936816243.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s936816243", "user_id": "u359178469"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "program ABC154_D\n integer::N,K\n double precision,allocatable::p(:),a(:),b(:)\n read(*,*)N,K\n allocate(p(N),a(N),b(N))\n read(*,*)p\n do i=1,N\n a(i)=(p(i)+1.0)/2.0\n end do\n b=0\n do i=1,N-K+1\n b(i)=sum(a(i:i+K-1))\n end do\n ans=maxval(b)\n write(*,*)ans\nend program ABC154_D", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "sample_input": "5 3\n1 2 2 4 5\n"}, "reference_outputs": ["7.000000000000\n"], "source_document_id": "p02780", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 287, "cpu_time_ms": 2104, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s817893039", "group_id": "codeNet:p02783", "input_text": "program main\n\timplicit none\n integer::h,a\n read(*,*) h,a\n if(mod(h,a)==0)then\n \twrite(*,*)h/a\n else\n \twrite(*,*)h/a +1\n end if\n stop\nend program main", "language": "Fortran", "metadata": {"date": 1592605309, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Fortran/s817893039.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817893039", "user_id": "u884601206"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n\timplicit none\n integer::h,a\n read(*,*) h,a\n if(mod(h,a)==0)then\n \twrite(*,*)h/a\n else\n \twrite(*,*)h/a +1\n end if\n stop\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 5, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s529220934", "group_id": "codeNet:p02783", "input_text": "program example\n\timplicit none\n\n\tinteger(8) :: N,K,i,wa=0\n integer(8),allocatable :: H(:)\n \n read(*,*) N,K\n \n allocate(H(N))\n \n read(*,*) H(:)\n \n if (K==0) then\n \tgoto 1\n end if\n \n do i=1,K\n \n if (sum(H)==0) then\n \texit\n else\n H(maxloc(H(:),1))=0\n end if\n end do\n \n1 wa=wa+sum(H(:))\n \n write(*,*) wa\n\nend program example\n", "language": "Fortran", "metadata": {"date": 1583602580, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Fortran/s529220934.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s529220934", "user_id": "u374107737"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tinteger(8) :: N,K,i,wa=0\n integer(8),allocatable :: H(:)\n \n read(*,*) N,K\n \n allocate(H(N))\n \n read(*,*) H(:)\n \n if (K==0) then\n \tgoto 1\n end if\n \n do i=1,K\n \n if (sum(H)==0) then\n \texit\n else\n H(maxloc(H(:),1))=0\n end if\n end do\n \n1 wa=wa+sum(H(:))\n \n write(*,*) wa\n\nend program example\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s331769945", "group_id": "codeNet:p02783", "input_text": "program main\n implicit none\n integer h,a,n\n read(*,*) h,a\n n=h/a+1\n write(*,'(i0)') n\nend program main", "language": "Fortran", "metadata": {"date": 1580634299, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Fortran/s331769945.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s331769945", "user_id": "u172620302"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer h,a,n\n read(*,*) h,a\n n=h/a+1\n write(*,'(i0)') n\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s368572857", "group_id": "codeNet:p02783", "input_text": "program main\n\n implicit none\n\n integer :: n, k, i, j\n integer(8),allocatable :: h(:)\n integer(8) :: sumh\n \n read(*,*) n,k\n allocate( h(n) )\n read(*,*) h\n\n if ( k == 0 ) then\n sumh = 0\n do i = 1 ,n\n sumh = sumh + h(i)\n end do\n print*, sumh\n stop\n end if\n\n if ( k >= n ) then \n print*, \"0\"\n else\n call quick_sort( h, 1, n ) \n sumh = 0\n do i = 1 ,n-k\n sumh = sumh + h(i)\n end do\n print \"(i0)\", sumh\n end if\n\nend program main\n recursive subroutine quick_sort( a, i, j )\n\n implicit none\n integer, intent(in) :: i,j\n integer(8), intent(inout) :: a(i:j)\n integer :: p, k\n\n if( i == j ) return\n \n p = pivot(a,i,j)\n \n if( p /= -1 ) then\n call partition(a(i:j),i,j,a(p),k)\n call quick_sort(a(i:k-p),i,k-1)\n call quick_sort(a(k:j),k,j)\n end if\n\ncontains \n\nsubroutine partition( a, i, j, x, l ) \n \n implicit none\n integer, intent(in) :: i,j\n integer(8), intent(in) :: x\n integer(8), intent(inout) :: a(i:j)\n integer, intent(out) :: l\n integer :: r\n integer(8) :: t\n \n l = i \n r = j \n\n do while( l<=r )\n do while( l<=j .and. a(l) < x ) \n l = l+1\n end do\n do while( r> i .and. a(r) >= x ) \n r = r-1\n end do\n if(l>r) exit\n t = a(l)\n a(l) = a(r)\n a(r) = t\n l = l+1\n r = r-1\n end do\n \nend subroutine partition\n\nfunction pivot( a, i, j ) result( k )\n\n implicit none\n integer, intent(in) :: i,j\n integer:: k\n integer(8), intent(in) :: a(i:j)\n\n k = i + 1\n\n do while( k<=j .and. a(i) == a(k) ) \n k = k + 1\n end do\n\n if(k>j) k = -1\n\n if(a(i)>a(k)) k = i\n\nend function pivot\n\nend subroutine quick_sort \n\n", "language": "Fortran", "metadata": {"date": 1580075516, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02783/input.txt", "sample_output_relpath": "derived/input_output/data/p02783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02783/Fortran/s368572857.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s368572857", "user_id": "u675314298"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n\n implicit none\n\n integer :: n, k, i, j\n integer(8),allocatable :: h(:)\n integer(8) :: sumh\n \n read(*,*) n,k\n allocate( h(n) )\n read(*,*) h\n\n if ( k == 0 ) then\n sumh = 0\n do i = 1 ,n\n sumh = sumh + h(i)\n end do\n print*, sumh\n stop\n end if\n\n if ( k >= n ) then \n print*, \"0\"\n else\n call quick_sort( h, 1, n ) \n sumh = 0\n do i = 1 ,n-k\n sumh = sumh + h(i)\n end do\n print \"(i0)\", sumh\n end if\n\nend program main\n recursive subroutine quick_sort( a, i, j )\n\n implicit none\n integer, intent(in) :: i,j\n integer(8), intent(inout) :: a(i:j)\n integer :: p, k\n\n if( i == j ) return\n \n p = pivot(a,i,j)\n \n if( p /= -1 ) then\n call partition(a(i:j),i,j,a(p),k)\n call quick_sort(a(i:k-p),i,k-1)\n call quick_sort(a(k:j),k,j)\n end if\n\ncontains \n\nsubroutine partition( a, i, j, x, l ) \n \n implicit none\n integer, intent(in) :: i,j\n integer(8), intent(in) :: x\n integer(8), intent(inout) :: a(i:j)\n integer, intent(out) :: l\n integer :: r\n integer(8) :: t\n \n l = i \n r = j \n\n do while( l<=r )\n do while( l<=j .and. a(l) < x ) \n l = l+1\n end do\n do while( r> i .and. a(r) >= x ) \n r = r-1\n end do\n if(l>r) exit\n t = a(l)\n a(l) = a(r)\n a(r) = t\n l = l+1\n r = r-1\n end do\n \nend subroutine partition\n\nfunction pivot( a, i, j ) result( k )\n\n implicit none\n integer, intent(in) :: i,j\n integer:: k\n integer(8), intent(in) :: a(i:j)\n\n k = i + 1\n\n do while( k<=j .and. a(i) == a(k) ) \n k = k + 1\n end do\n\n if(k>j) k = -1\n\n if(a(i)>a(k)) k = i\n\nend function pivot\n\nend subroutine quick_sort \n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1626, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s426172628", "group_id": "codeNet:p02785", "input_text": "program example\n\timplicit none\n\n\tinteger(8) :: N,K,i,wa=0,j,kari\n integer(8),allocatable :: H(:)\n \n read(*,*) N,K\n \n allocate(H(N))\n \n read(*,*) H(:)\n \n if (K==0) then\n \tgoto 1\n end if\n \n do i=1,N\n \tdo j=i+1,N\n \n \tif(H(j)>=H(i)) then\n \tkari=H(i)\n \tH(i)=H(j)\n H(j)=kari\n \n end if\n \n end do\n end do\n \n1 \twrite(*,*) sum(H(K+1:))\n \nend program example", "language": "Fortran", "metadata": {"date": 1583602505, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s426172628.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s426172628", "user_id": "u374107737"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tinteger(8) :: N,K,i,wa=0,j,kari\n integer(8),allocatable :: H(:)\n \n read(*,*) N,K\n \n allocate(H(N))\n \n read(*,*) H(:)\n \n if (K==0) then\n \tgoto 1\n end if\n \n do i=1,N\n \tdo j=i+1,N\n \n \tif(H(j)>=H(i)) then\n \tkari=H(i)\n \tH(i)=H(j)\n H(j)=kari\n \n end if\n \n end do\n end do\n \n1 \twrite(*,*) sum(H(K+1:))\n \nend program example", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 2103, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s050518888", "group_id": "codeNet:p02785", "input_text": "program example\n\timplicit none\n\n\tinteger(8) :: N,K,i,wa=0,location\n integer(8),allocatable :: H(:)\n \n read(*,*) N,K\n \n allocate(H(N))\n \n read(*,*) H(:)\n \n do i=1,K\n \n if (sum(H)==0) then\n \texit\n else\n \tlocation=maxloc(H(:),1)\n H(location)=0\n end if\n end do\n \n wa=wa+sum(H(:))\n \n write(*,*) wa\n\nend program example", "language": "Fortran", "metadata": {"date": 1583600421, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s050518888.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s050518888", "user_id": "u374107737"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tinteger(8) :: N,K,i,wa=0,location\n integer(8),allocatable :: H(:)\n \n read(*,*) N,K\n \n allocate(H(N))\n \n read(*,*) H(:)\n \n do i=1,K\n \n if (sum(H)==0) then\n \texit\n else\n \tlocation=maxloc(H(:),1)\n H(location)=0\n end if\n end do\n \n wa=wa+sum(H(:))\n \n write(*,*) wa\n\nend program example", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 2103, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s508966384", "group_id": "codeNet:p02785", "input_text": " Program Main\n\n Implicit None\n\n Integer, Allocatable :: H(:) \n Integer(8) :: i,j,N,K,s,Hmax\n\n N = 0 ; K = 0 ; s = 0 ; Hmax = 0\n Read(*,*) N,K\n Allocate (H(N)); H(:) = 0.0d0 \n Read(*,*)(H(i),i=1,N)\n\n If (K < N) then\n Do i = 1,K\n Hmax = Maxval(H(:))\n Check:Do j = 1,N\n If (H(j) == Hmax) then\n H(j) = 0\n Exit Check\n Endif\n Enddo Check\n Enddo\n Do i = 1,N\n s = s + H(i)\n Enddo\n Endif\n\n\n Write(*,\"(I0)\") s\n Deallocate(H)\n\n End Program\n", "language": "Fortran", "metadata": {"date": 1580468299, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s508966384.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s508966384", "user_id": "u718634931"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": " Program Main\n\n Implicit None\n\n Integer, Allocatable :: H(:) \n Integer(8) :: i,j,N,K,s,Hmax\n\n N = 0 ; K = 0 ; s = 0 ; Hmax = 0\n Read(*,*) N,K\n Allocate (H(N)); H(:) = 0.0d0 \n Read(*,*)(H(i),i=1,N)\n\n If (K < N) then\n Do i = 1,K\n Hmax = Maxval(H(:))\n Check:Do j = 1,N\n If (H(j) == Hmax) then\n H(j) = 0\n Exit Check\n Endif\n Enddo Check\n Enddo\n Do i = 1,N\n s = s + H(i)\n Enddo\n Endif\n\n\n Write(*,\"(I0)\") s\n Deallocate(H)\n\n End Program\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 618, "cpu_time_ms": 2103, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s184917263", "group_id": "codeNet:p02785", "input_text": "program main\n implicit none\n integer(8), allocatable:: h(:)\n integer(8):: n, k, one, ans, i\n one =1\n read*, n, k\n \n if (k >= n)then\n print*, 0\n stop\n end if\n \n allocate(h(n))\n read*, h(:)\n call marge_sort(h(:), one, n)\n h(1:k) = 0\n print*, sum(h(:))\ncontains\nrecursive subroutine marge_sort(arr,first,last)\n integer(8):: arr(:), tmp\n integer(8):: first, last, mean\n\n if (last - first <= 2) then\n if (arr(first) <= arr(last))then\n tmp = arr(first)\n arr(first) = arr(last)\n arr(last) = tmp\n end if\n return\n end if\n \n mean = (first + last) / 2\n call marge_sort(arr, first, mean)\n call marge_sort(arr, mean+1, last)\n call marge(arr, first, mean, last)\n\nend subroutine\n\n\nsubroutine marge(arr, first, mean, last)\n integer(8):: arr(:)\n integer(8), allocatable:: tmp(:)\n integer(8):: first, mean, last\n integer(8):: i, i_left, i_right\n \n allocate(tmp(last-first+1))\n i_left = first\n i_right = mean + 1\n i = 0\n do while((i_left <= mean) .and. (i_right <= last))\n i = i + 1\n if (arr(i_left) >= arr(i_right))then\n tmp(i) = arr(i_left)\n i_left = i_left + 1\n else\n tmp(i) = arr(i_right)\n i_right = i_right + 1\n end if\n end do\n\n if (i_left > mean)then\n tmp(i+1:) = arr(i_right:last)\n else\n tmp(i+1:) = arr(i_left:mean)\n end if\n arr(first:last) = tmp(:)\n\nend subroutine\nend program main", "language": "Fortran", "metadata": {"date": 1580182583, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s184917263.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s184917263", "user_id": "u234636620"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer(8), allocatable:: h(:)\n integer(8):: n, k, one, ans, i\n one =1\n read*, n, k\n \n if (k >= n)then\n print*, 0\n stop\n end if\n \n allocate(h(n))\n read*, h(:)\n call marge_sort(h(:), one, n)\n h(1:k) = 0\n print*, sum(h(:))\ncontains\nrecursive subroutine marge_sort(arr,first,last)\n integer(8):: arr(:), tmp\n integer(8):: first, last, mean\n\n if (last - first <= 2) then\n if (arr(first) <= arr(last))then\n tmp = arr(first)\n arr(first) = arr(last)\n arr(last) = tmp\n end if\n return\n end if\n \n mean = (first + last) / 2\n call marge_sort(arr, first, mean)\n call marge_sort(arr, mean+1, last)\n call marge(arr, first, mean, last)\n\nend subroutine\n\n\nsubroutine marge(arr, first, mean, last)\n integer(8):: arr(:)\n integer(8), allocatable:: tmp(:)\n integer(8):: first, mean, last\n integer(8):: i, i_left, i_right\n \n allocate(tmp(last-first+1))\n i_left = first\n i_right = mean + 1\n i = 0\n do while((i_left <= mean) .and. (i_right <= last))\n i = i + 1\n if (arr(i_left) >= arr(i_right))then\n tmp(i) = arr(i_left)\n i_left = i_left + 1\n else\n tmp(i) = arr(i_right)\n i_right = i_right + 1\n end if\n end do\n\n if (i_left > mean)then\n tmp(i+1:) = arr(i_right:last)\n else\n tmp(i+1:) = arr(i_left:mean)\n end if\n arr(first:last) = tmp(:)\n\nend subroutine\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1539, "cpu_time_ms": 89, "memory_kb": 4644}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s714101494", "group_id": "codeNet:p02785", "input_text": "program main\n implicit none\n integer(8), allocatable:: h(:)\n integer(8):: n, k, one\n one =1\n read*,n,k\n \n if (k >= n)then\n print*, 0\n stop\n end if\n \n allocate(h(n))\n read*, h(:)\n\n call marge_sort(h(:), one, n)\n\n print*, sum(h(k+1:))\ncontains\nrecursive subroutine marge_sort(arr,first,last)\n integer(8):: arr(:), tmp\n integer(8):: first, last, mean\n\n if (last - first <= 2) then\n if (arr(first) <= arr(last))then\n tmp = arr(first)\n arr(first) = arr(last)\n arr(last) = tmp\n end if\n return\n end if\n \n mean = (first + last) / 2\n call marge_sort(arr, first, mean)\n call marge_sort(arr, mean+1, last)\n call marge(arr, first, mean, last)\n\nend subroutine\n\n\nsubroutine marge(arr, first, mean, last)\n integer(8):: arr(:)\n integer(8), allocatable:: tmp(:)\n integer(8):: first, mean, last\n integer(8):: i, i_left, i_right\n \n allocate(tmp(last-first+1))\n i_left = first\n i_right = mean + 1\n i = 0\n do while((i_left <= mean) .and. (i_right <= last))\n i = i + 1\n if (arr(i_left) >= arr(i_right))then\n tmp(i) = arr(i_left)\n i_left = i_left + 1\n else\n tmp(i) = arr(i_right)\n i_right = i_right + 1\n end if\n end do\n\n if (i_left > mean)then\n tmp(i+1:) = arr(i_right:last)\n else\n tmp(i+1:) = arr(i_left:mean)\n end if\n arr(first:last) = tmp(:)\n\nend subroutine\nend program main", "language": "Fortran", "metadata": {"date": 1580181373, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s714101494.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s714101494", "user_id": "u234636620"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer(8), allocatable:: h(:)\n integer(8):: n, k, one\n one =1\n read*,n,k\n \n if (k >= n)then\n print*, 0\n stop\n end if\n \n allocate(h(n))\n read*, h(:)\n\n call marge_sort(h(:), one, n)\n\n print*, sum(h(k+1:))\ncontains\nrecursive subroutine marge_sort(arr,first,last)\n integer(8):: arr(:), tmp\n integer(8):: first, last, mean\n\n if (last - first <= 2) then\n if (arr(first) <= arr(last))then\n tmp = arr(first)\n arr(first) = arr(last)\n arr(last) = tmp\n end if\n return\n end if\n \n mean = (first + last) / 2\n call marge_sort(arr, first, mean)\n call marge_sort(arr, mean+1, last)\n call marge(arr, first, mean, last)\n\nend subroutine\n\n\nsubroutine marge(arr, first, mean, last)\n integer(8):: arr(:)\n integer(8), allocatable:: tmp(:)\n integer(8):: first, mean, last\n integer(8):: i, i_left, i_right\n \n allocate(tmp(last-first+1))\n i_left = first\n i_right = mean + 1\n i = 0\n do while((i_left <= mean) .and. (i_right <= last))\n i = i + 1\n if (arr(i_left) >= arr(i_right))then\n tmp(i) = arr(i_left)\n i_left = i_left + 1\n else\n tmp(i) = arr(i_right)\n i_right = i_right + 1\n end if\n end do\n\n if (i_left > mean)then\n tmp(i+1:) = arr(i_right:last)\n else\n tmp(i+1:) = arr(i_left:mean)\n end if\n arr(first:last) = tmp(:)\n\nend subroutine\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1519, "cpu_time_ms": 89, "memory_kb": 4644}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s661712231", "group_id": "codeNet:p02785", "input_text": "program main\n implicit none\n integer(8), allocatable:: h(:)\n integer(4):: n, k\n\n read*,n,k\n allocate(h(n))\n read*, h(:)\n\n call marge_sort(h(:), 1, n)\n\n print*, sum(h(k+1:))\ncontains\nrecursive subroutine marge_sort(arr,first,last)\n integer(8):: arr(:), tmp\n integer(4):: first, last, mean\n\n if (last - first <= 2) then\n if (arr(first) <= arr(last))then\n tmp = arr(first)\n arr(first) = arr(last)\n arr(last) = tmp\n end if\n return\n end if\n \n mean = (first + last) / 2\n call marge_sort(arr, first, mean)\n call marge_sort(arr, mean+1, last)\n call marge(arr, first, mean, last)\n\nend subroutine\n\n\nsubroutine marge(arr, first, mean, last)\n integer(8):: arr(:)\n integer(8), allocatable:: tmp(:)\n integer(4):: first, mean, last\n integer(4):: i, i_left, i_right\n \n allocate(tmp(last-first+1))\n i_left = first\n i_right = mean + 1\n i = 0\n do while((i_left <= mean) .and. (i_right <= last))\n i = i + 1\n if (arr(i_left) >= arr(i_right))then\n tmp(i) = arr(i_left)\n i_left = i_left + 1\n else\n tmp(i) = arr(i_right)\n i_right = i_right + 1\n end if\n end do\n\n if (i_left > mean)then\n tmp(i+1:) = arr(i_right:last)\n else\n tmp(i+1:) = arr(i_left:mean)\n end if\n arr(first:last) = tmp(:)\n\nend subroutine\nend program main", "language": "Fortran", "metadata": {"date": 1580181130, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s661712231.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s661712231", "user_id": "u234636620"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer(8), allocatable:: h(:)\n integer(4):: n, k\n\n read*,n,k\n allocate(h(n))\n read*, h(:)\n\n call marge_sort(h(:), 1, n)\n\n print*, sum(h(k+1:))\ncontains\nrecursive subroutine marge_sort(arr,first,last)\n integer(8):: arr(:), tmp\n integer(4):: first, last, mean\n\n if (last - first <= 2) then\n if (arr(first) <= arr(last))then\n tmp = arr(first)\n arr(first) = arr(last)\n arr(last) = tmp\n end if\n return\n end if\n \n mean = (first + last) / 2\n call marge_sort(arr, first, mean)\n call marge_sort(arr, mean+1, last)\n call marge(arr, first, mean, last)\n\nend subroutine\n\n\nsubroutine marge(arr, first, mean, last)\n integer(8):: arr(:)\n integer(8), allocatable:: tmp(:)\n integer(4):: first, mean, last\n integer(4):: i, i_left, i_right\n \n allocate(tmp(last-first+1))\n i_left = first\n i_right = mean + 1\n i = 0\n do while((i_left <= mean) .and. (i_right <= last))\n i = i + 1\n if (arr(i_left) >= arr(i_right))then\n tmp(i) = arr(i_left)\n i_left = i_left + 1\n else\n tmp(i) = arr(i_right)\n i_right = i_right + 1\n end if\n end do\n\n if (i_left > mean)then\n tmp(i+1:) = arr(i_right:last)\n else\n tmp(i+1:) = arr(i_left:mean)\n end if\n arr(first:last) = tmp(:)\n\nend subroutine\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1430, "cpu_time_ms": 91, "memory_kb": 4772}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s885762751", "group_id": "codeNet:p02785", "input_text": " module sortMod\n implicit none\n \n contains\n \n subroutine bSort( a ,kk )\n implicit none\n integer(16) :: a(:)\n integer(16) :: n,i,k,buffer,kk\n \n n = size(a)\n if( n==1 ) return\n if( kk==n ) kk = kk -1\n \n do i = 1,kk\n do k = i+1,n\n if( a(i)n) k = n\n h(1:k) = 0\n end if\n \n \n print*,sum(h)\n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1580080547, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s885762751.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s885762751", "user_id": "u171356453"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": " module sortMod\n implicit none\n \n contains\n \n subroutine bSort( a ,kk )\n implicit none\n integer(16) :: a(:)\n integer(16) :: n,i,k,buffer,kk\n \n n = size(a)\n if( n==1 ) return\n if( kk==n ) kk = kk -1\n \n do i = 1,kk\n do k = i+1,n\n if( a(i)n) k = n\n h(1:k) = 0\n end if\n \n \n print*,sum(h)\n \n \n \n END PROGRAM", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 995, "cpu_time_ms": 2107, "memory_kb": 5632}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s290423128", "group_id": "codeNet:p02785", "input_text": " module sortMod\n implicit none\n \n contains\n \n subroutine bSort( a ,kk )\n implicit none\n integer(16) :: a(:)\n integer(16) :: n,i,k,buffer,kk\n \n n = size(a)\n if( kk==n ) kk = kk -1\n \n do i = 1,n\n do k = i+1,n\n if( a(i)k))]\n end if\n end function qSort\n end module\n \n PROGRAM piyo\n use sortMod\n IMPLICIT NONE\n integer(16) :: n,k\n integer(16),allocatable :: h(:),sh(:)\n \n read*,n,k\n allocate(h(n),sh(n))\n read*,h(:)\n \n call bsort( h,k )\n !sh = qSort( h )\n \n if( k/=0 )then\n h(1:k) = 0\n end if\n \n \n print*,sum(h)\n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1580074199, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02785/input.txt", "sample_output_relpath": "derived/input_output/data/p02785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02785/Fortran/s290423128.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s290423128", "user_id": "u171356453"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": " module sortMod\n implicit none\n \n contains\n \n subroutine bSort( a ,kk )\n implicit none\n integer(16) :: a(:)\n integer(16) :: n,i,k,buffer,kk\n \n n = size(a)\n if( kk==n ) kk = kk -1\n \n do i = 1,n\n do k = i+1,n\n if( a(i)k))]\n end if\n end function qSort\n end module\n \n PROGRAM piyo\n use sortMod\n IMPLICIT NONE\n integer(16) :: n,k\n integer(16),allocatable :: h(:),sh(:)\n \n read*,n,k\n allocate(h(n),sh(n))\n read*,h(:)\n \n call bsort( h,k )\n !sh = qSort( h )\n \n if( k/=0 )then\n h(1:k) = 0\n end if\n \n \n print*,sum(h)\n \n \n \n END PROGRAM", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1310, "cpu_time_ms": 2103, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s889492494", "group_id": "codeNet:p02786", "input_text": "program main\n implicit none\n integer(16) :: h\n integer(8) :: k, a, ppow\n\n read *, h\n\n if ( h == 1 ) then\n print *, '1'\n else\n k = 0\n do\n h = h/2\n k = k + 1\n if ( h == 1 ) exit\n end do\n a = 2\n call pow(a,k+1,ppow)\n print *, ppow - 1 \n end if\n\ncontains\nsubroutine pow(a, n, ppow)\n implicit none\n integer(8), intent(in) :: a, n\n integer(8), intent(out) :: ppow\n integer(8) :: ntmp, atmp\n\n ppow = 1\n atmp = a\n ntmp = n\n do while ( ntmp > 0 )\n if ( iand(ntmp,1) > 0 ) then\n ppow = ppow * atmp\n end if\n atmp = atmp * atmp\n ntmp = ishft( ntmp, -1 )\n end do\n\nend subroutine pow\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1588773346, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/Fortran/s889492494.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s889492494", "user_id": "u353721260"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer(16) :: h\n integer(8) :: k, a, ppow\n\n read *, h\n\n if ( h == 1 ) then\n print *, '1'\n else\n k = 0\n do\n h = h/2\n k = k + 1\n if ( h == 1 ) exit\n end do\n a = 2\n call pow(a,k+1,ppow)\n print *, ppow - 1 \n end if\n\ncontains\nsubroutine pow(a, n, ppow)\n implicit none\n integer(8), intent(in) :: a, n\n integer(8), intent(out) :: ppow\n integer(8) :: ntmp, atmp\n\n ppow = 1\n atmp = a\n ntmp = n\n do while ( ntmp > 0 )\n if ( iand(ntmp,1) > 0 ) then\n ppow = ppow * atmp\n end if\n atmp = atmp * atmp\n ntmp = ishft( ntmp, -1 )\n end do\n\nend subroutine pow\n\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 810, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s596422413", "group_id": "codeNet:p02786", "input_text": "program BegD\n implicit none\n integer(8) :: H, cnt\n integer(8) ::i!,amr,Hnew\n \n read(*,*) H\n i=0\n cnt=0\n do\n i=i+1 \n H=H/2\n cnt=cnt+2**(i-1)\n if(H.eq.1) goto 500\n enddo\n 500 continue\n print*, cnt+2**i\n \nend program BegD", "language": "Fortran", "metadata": {"date": 1580072651, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/Fortran/s596422413.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s596422413", "user_id": "u878839832"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program BegD\n implicit none\n integer(8) :: H, cnt\n integer(8) ::i!,amr,Hnew\n \n read(*,*) H\n i=0\n cnt=0\n do\n i=i+1 \n H=H/2\n cnt=cnt+2**(i-1)\n if(H.eq.1) goto 500\n enddo\n 500 continue\n print*, cnt+2**i\n \nend program BegD", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s547188241", "group_id": "codeNet:p02786", "input_text": "program ddd\nimplicit none\n\ninteger(8) :: h, enm, atk\n\nread*, h\n\natk = 0\nenm = 1\n\ndo while(h/=1)\n\natk = atk + enm\nenm = enm*2\nh = h/2\n\nend do\n\natk = atk + enm\nprint*, atk\n\nend program", "language": "Fortran", "metadata": {"date": 1580070117, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/Fortran/s547188241.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s547188241", "user_id": "u039189422"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ddd\nimplicit none\n\ninteger(8) :: h, enm, atk\n\nread*, h\n\natk = 0\nenm = 1\n\ndo while(h/=1)\n\natk = atk + enm\nenm = enm*2\nh = h/2\n\nend do\n\natk = atk + enm\nprint*, atk\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s948150503", "group_id": "codeNet:p02788", "input_text": "program main\n implicit none\n integer(8):: n, d, a, i, num, adble\n integer(8), allocatable:: x(:), h(:)\n integer(8), parameter:: one = 1\n\n read*, n, d, a\n allocate(x(n), h(n))\n\n do i = 1, n\n read*, x(i), h(i)\n end do\n\n call marge_sort(x(:), h(:), one, n)\n\n num = 0\n do i=1,n\n num = num + h(i)/a\n if (mod(h(i),a) /= 0) num = num + 1\n where (x < x(i)+2*d )\n h = h - num*a\n end where\n \n where (h(:) < 0)\n h = 0\n end where\n\n if (sum(h) == 0) exit\n end do\n\n print*, num\n\n\n\ncontains\nrecursive subroutine marge_sort(x,h, first, last)\n integer(8):: x(:), h(:), first, last\n integer(8):: tmp, mean\n\n if (last-first <= 1) then\n if (x(last) < x(first)) then\n tmp = x(last)\n x(last) = x(first)\n x(first) = tmp\n\n tmp = h(last)\n h(last) = h(first)\n h(first) = tmp \n end if\n\n else\n mean = (first+last)/2\n call marge_sort(x(:), h(:), first, mean)\n call marge_sort(x(:), h(:), mean+1, last)\n call marge(x(:), h(:), first, mean, last)\n\n end if\nend subroutine\n\n\nsubroutine marge(x,h,first,mean,last)\n integer(8):: x(:), h(:), first, mean, last\n integer(8), allocatable:: tmpx(:), tmph(:)\n integer(8):: r, l, i\n\n allocate(tmpx(last-first+1), tmph(last-first+1))\n r = first\n l = mean + 1\n i = 1\n\n do while(r <= mean .and. l <= last)\n if (x(r) <= x(l)) then\n tmpx(i) = x(r)\n tmph(i) = h(r)\n i = i+1\n r = r+1\n else\n tmpx(i) = x(l)\n tmph(i) = h(l)\n i = i+1\n l = l+1\n end if\n end do\n\n if (r > mean)then\n tmpx(i:) = x(l:last)\n tmph(i:) = h(l:last)\n else\n tmpx(i:) = x(r:mean)\n tmph(i:) = h(r:mean)\n end if\n\n x(first:last) = tmpx(:)\n h(first:last) = tmph(:)\n \nend subroutine\nend program main", "language": "Fortran", "metadata": {"date": 1580261927, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02788.html", "problem_id": "p02788", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02788/input.txt", "sample_output_relpath": "derived/input_output/data/p02788/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02788/Fortran/s948150503.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s948150503", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer(8):: n, d, a, i, num, adble\n integer(8), allocatable:: x(:), h(:)\n integer(8), parameter:: one = 1\n\n read*, n, d, a\n allocate(x(n), h(n))\n\n do i = 1, n\n read*, x(i), h(i)\n end do\n\n call marge_sort(x(:), h(:), one, n)\n\n num = 0\n do i=1,n\n num = num + h(i)/a\n if (mod(h(i),a) /= 0) num = num + 1\n where (x < x(i)+2*d )\n h = h - num*a\n end where\n \n where (h(:) < 0)\n h = 0\n end where\n\n if (sum(h) == 0) exit\n end do\n\n print*, num\n\n\n\ncontains\nrecursive subroutine marge_sort(x,h, first, last)\n integer(8):: x(:), h(:), first, last\n integer(8):: tmp, mean\n\n if (last-first <= 1) then\n if (x(last) < x(first)) then\n tmp = x(last)\n x(last) = x(first)\n x(first) = tmp\n\n tmp = h(last)\n h(last) = h(first)\n h(first) = tmp \n end if\n\n else\n mean = (first+last)/2\n call marge_sort(x(:), h(:), first, mean)\n call marge_sort(x(:), h(:), mean+1, last)\n call marge(x(:), h(:), first, mean, last)\n\n end if\nend subroutine\n\n\nsubroutine marge(x,h,first,mean,last)\n integer(8):: x(:), h(:), first, mean, last\n integer(8), allocatable:: tmpx(:), tmph(:)\n integer(8):: r, l, i\n\n allocate(tmpx(last-first+1), tmph(last-first+1))\n r = first\n l = mean + 1\n i = 1\n\n do while(r <= mean .and. l <= last)\n if (x(r) <= x(l)) then\n tmpx(i) = x(r)\n tmph(i) = h(r)\n i = i+1\n r = r+1\n else\n tmpx(i) = x(l)\n tmph(i) = h(l)\n i = i+1\n l = l+1\n end if\n end do\n\n if (r > mean)then\n tmpx(i:) = x(l:last)\n tmph(i:) = h(l:last)\n else\n tmpx(i:) = x(r:mean)\n tmph(i:) = h(r:mean)\n end if\n\n x(first:last) = tmpx(:)\n h(first:last) = tmph(:)\n \nend subroutine\nend program main", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSilver Fox is fighting with N monsters.\n\nThe monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i.\n\nSilver Fox can use bombs to attack the monsters.\nUsing a bomb at the coordinate x decreases the healths of all monsters between the coordinates x-D and x+D (inclusive) by A.\nThere is no way other than bombs to decrease the monster's health.\n\nSilver Fox wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of bombs needed to win.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq D \\leq 10^9\n\n1 \\leq A \\leq 10^9\n\n0 \\leq X_i \\leq 10^9\n\n1 \\leq H_i \\leq 10^9\n\nX_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 D A\nX_1 H_1\n:\nX_N H_N\n\nOutput\n\nPrint the minimum number of bombs needed to win.\n\nSample Input 1\n\n3 3 2\n1 2\n5 4\n9 2\n\nSample Output 1\n\n2\n\nFirst, let us use a bomb at the coordinate 4 to decrease the first and second monsters' health by 2.\n\nThen, use a bomb at the coordinate 6 to decrease the second and third monsters' health by 2.\n\nNow, all the monsters' healths are 0.\nWe cannot make all the monsters' health drop to 0 or below with just one bomb.\n\nSample Input 2\n\n9 4 1\n1 5\n2 4\n3 3\n4 2\n5 1\n6 2\n7 3\n8 4\n9 5\n\nSample Output 2\n\n5\n\nWe should use five bombs at the coordinate 5.\n\nSample Input 3\n\n3 0 1\n300000000 1000000000\n100000000 1000000000\n200000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 3 2\n1 2\n5 4\n9 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02788", "source_text": "Score : 600 points\n\nProblem Statement\n\nSilver Fox is fighting with N monsters.\n\nThe monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i.\n\nSilver Fox can use bombs to attack the monsters.\nUsing a bomb at the coordinate x decreases the healths of all monsters between the coordinates x-D and x+D (inclusive) by A.\nThere is no way other than bombs to decrease the monster's health.\n\nSilver Fox wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of bombs needed to win.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq D \\leq 10^9\n\n1 \\leq A \\leq 10^9\n\n0 \\leq X_i \\leq 10^9\n\n1 \\leq H_i \\leq 10^9\n\nX_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 D A\nX_1 H_1\n:\nX_N H_N\n\nOutput\n\nPrint the minimum number of bombs needed to win.\n\nSample Input 1\n\n3 3 2\n1 2\n5 4\n9 2\n\nSample Output 1\n\n2\n\nFirst, let us use a bomb at the coordinate 4 to decrease the first and second monsters' health by 2.\n\nThen, use a bomb at the coordinate 6 to decrease the second and third monsters' health by 2.\n\nNow, all the monsters' healths are 0.\nWe cannot make all the monsters' health drop to 0 or below with just one bomb.\n\nSample Input 2\n\n9 4 1\n1 5\n2 4\n3 3\n4 2\n5 1\n6 2\n7 3\n8 4\n9 5\n\nSample Output 2\n\n5\n\nWe should use five bombs at the coordinate 5.\n\nSample Input 3\n\n3 0 1\n300000000 1000000000\n100000000 1000000000\n200000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2003, "cpu_time_ms": 2104, "memory_kb": 6560}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s367867513", "group_id": "codeNet:p02788", "input_text": "program silver_fox_vs_monster\n implicit none\n integer(8), parameter :: inf = 1001001001001_8\n integer :: n, i, l, r, m\n integer(8) :: d, a, x(0:200001,2) = 0, p = 0, t\n read(*,*) n, d, a\n do i = 1, n\n read(*,*) x(i,:)\n end do\n call merge_sort(x(1:n,:))\n x(0,1) = -inf\n x(n+1,1) = inf\n i = 1\n do while (i <= n)\n do while (x(i,2) <= 0 .and. i <= n)\n i = i+1\n end do\n if (i > n) exit\n l = i\n r = n+1\n do while (r-l > 1)\n m = (l+r)/2\n if (x(m,1) > x(i,1)+d*2) then\n r = m\n else\n l = m\n end if\n end do\n t = (x(i,2)+a-1)/a\n p = p+t\n x(i:l,2) = x(i:l,2)-t*a\n end do\n write(*,'(i0)') p\ncontains\n subroutine merge_sort(a)\n integer(8), intent(inout) :: a(:,:)\n integer :: n, m, l, i, u\n n = size(a,1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(a(2*(i-1)*l+1:(2*i-1)*l,:),a((2*i-1)*l+1:u,:))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n end\n subroutine merger(a1,a2)\n integer(8), intent(inout) :: a1(:,:), a2(:,:)\n integer(8) :: a(size(a1,1)+size(a2,1),size(a1,2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1,1)\n n2 = size(a2,1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (a1(i1,1) < a2(i2,1)) then\n a(i1+i2-1,:) = a1(i1,:)\n i1 = i1+1\n else\n a(i1+i2-1,:) = a2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n a(i1+i2-1:n1+n2,:) = a1(i1:n1,:)\n else\n a(i1+i2-1:n1+n2,:) = a2(i2:n2,:)\n end if\n a1 = a(1:n1,:)\n a2 = a(n1+1:n1+n2,:)\n end\nend program silver_fox_vs_monster", "language": "Fortran", "metadata": {"date": 1580074378, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02788.html", "problem_id": "p02788", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02788/input.txt", "sample_output_relpath": "derived/input_output/data/p02788/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02788/Fortran/s367867513.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s367867513", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program silver_fox_vs_monster\n implicit none\n integer(8), parameter :: inf = 1001001001001_8\n integer :: n, i, l, r, m\n integer(8) :: d, a, x(0:200001,2) = 0, p = 0, t\n read(*,*) n, d, a\n do i = 1, n\n read(*,*) x(i,:)\n end do\n call merge_sort(x(1:n,:))\n x(0,1) = -inf\n x(n+1,1) = inf\n i = 1\n do while (i <= n)\n do while (x(i,2) <= 0 .and. i <= n)\n i = i+1\n end do\n if (i > n) exit\n l = i\n r = n+1\n do while (r-l > 1)\n m = (l+r)/2\n if (x(m,1) > x(i,1)+d*2) then\n r = m\n else\n l = m\n end if\n end do\n t = (x(i,2)+a-1)/a\n p = p+t\n x(i:l,2) = x(i:l,2)-t*a\n end do\n write(*,'(i0)') p\ncontains\n subroutine merge_sort(a)\n integer(8), intent(inout) :: a(:,:)\n integer :: n, m, l, i, u\n n = size(a,1)\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(a(2*(i-1)*l+1:(2*i-1)*l,:),a((2*i-1)*l+1:u,:))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n end\n subroutine merger(a1,a2)\n integer(8), intent(inout) :: a1(:,:), a2(:,:)\n integer(8) :: a(size(a1,1)+size(a2,1),size(a1,2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(a1,1)\n n2 = size(a2,1)\n do while (i1 <= n1 .and. i2 <= n2)\n if (a1(i1,1) < a2(i2,1)) then\n a(i1+i2-1,:) = a1(i1,:)\n i1 = i1+1\n else\n a(i1+i2-1,:) = a2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n a(i1+i2-1:n1+n2,:) = a1(i1:n1,:)\n else\n a(i1+i2-1:n1+n2,:) = a2(i2:n2,:)\n end if\n a1 = a(1:n1,:)\n a2 = a(n1+1:n1+n2,:)\n end\nend program silver_fox_vs_monster", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSilver Fox is fighting with N monsters.\n\nThe monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i.\n\nSilver Fox can use bombs to attack the monsters.\nUsing a bomb at the coordinate x decreases the healths of all monsters between the coordinates x-D and x+D (inclusive) by A.\nThere is no way other than bombs to decrease the monster's health.\n\nSilver Fox wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of bombs needed to win.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq D \\leq 10^9\n\n1 \\leq A \\leq 10^9\n\n0 \\leq X_i \\leq 10^9\n\n1 \\leq H_i \\leq 10^9\n\nX_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 D A\nX_1 H_1\n:\nX_N H_N\n\nOutput\n\nPrint the minimum number of bombs needed to win.\n\nSample Input 1\n\n3 3 2\n1 2\n5 4\n9 2\n\nSample Output 1\n\n2\n\nFirst, let us use a bomb at the coordinate 4 to decrease the first and second monsters' health by 2.\n\nThen, use a bomb at the coordinate 6 to decrease the second and third monsters' health by 2.\n\nNow, all the monsters' healths are 0.\nWe cannot make all the monsters' health drop to 0 or below with just one bomb.\n\nSample Input 2\n\n9 4 1\n1 5\n2 4\n3 3\n4 2\n5 1\n6 2\n7 3\n8 4\n9 5\n\nSample Output 2\n\n5\n\nWe should use five bombs at the coordinate 5.\n\nSample Input 3\n\n3 0 1\n300000000 1000000000\n100000000 1000000000\n200000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 3 2\n1 2\n5 4\n9 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02788", "source_text": "Score : 600 points\n\nProblem Statement\n\nSilver Fox is fighting with N monsters.\n\nThe monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i.\n\nSilver Fox can use bombs to attack the monsters.\nUsing a bomb at the coordinate x decreases the healths of all monsters between the coordinates x-D and x+D (inclusive) by A.\nThere is no way other than bombs to decrease the monster's health.\n\nSilver Fox wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of bombs needed to win.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq D \\leq 10^9\n\n1 \\leq A \\leq 10^9\n\n0 \\leq X_i \\leq 10^9\n\n1 \\leq H_i \\leq 10^9\n\nX_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 D A\nX_1 H_1\n:\nX_N H_N\n\nOutput\n\nPrint the minimum number of bombs needed to win.\n\nSample Input 1\n\n3 3 2\n1 2\n5 4\n9 2\n\nSample Output 1\n\n2\n\nFirst, let us use a bomb at the coordinate 4 to decrease the first and second monsters' health by 2.\n\nThen, use a bomb at the coordinate 6 to decrease the second and third monsters' health by 2.\n\nNow, all the monsters' healths are 0.\nWe cannot make all the monsters' health drop to 0 or below with just one bomb.\n\nSample Input 2\n\n9 4 1\n1 5\n2 4\n3 3\n4 2\n5 1\n6 2\n7 3\n8 4\n9 5\n\nSample Output 2\n\n5\n\nWe should use five bombs at the coordinate 5.\n\nSample Input 3\n\n3 0 1\n300000000 1000000000\n100000000 1000000000\n200000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1640, "cpu_time_ms": 2103, "memory_kb": 7536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s726013325", "group_id": "codeNet:p02789", "input_text": "program sample\n\timplicit none\n integer :: x,y\n \n read(*,*) x,y\n \n if (x==y) then\n \twrite(*,*) 'Yes'\n else\n \twrite(*,*) 'No'\n end if\n\n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1592608172, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Fortran/s726013325.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726013325", "user_id": "u323210830"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program sample\n\timplicit none\n integer :: x,y\n \n read(*,*) x,y\n \n if (x==y) then\n \twrite(*,*) 'Yes'\n else\n \twrite(*,*) 'No'\n end if\n\n stop\nend program sample", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 7, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s277109519", "group_id": "codeNet:p02789", "input_text": "program test03\n implicit none\n integer,allocatable :: a(:)\n integer N\n integer i, j, jj\n integer :: js=1\n integer :: yesf=0\n integer :: no=0\n\n read(5,*) N\n allocate(a(N))\n\n read(5,*) (a(i), i=1,N)\n\n if ( N >= 190000 ) then\n js=120000\n end if\n\n do j=js,N\n if ( j/=1 ) then\n do jj=js,j-1 \n if ( a(jj) < a(j) ) then\n no = 1\n continue\n end if\n end do\n end if\n!print *,no\n if ( no==0 ) then\n yesf=yesf+1\n end if\n no=0\nend do\n\n write (*,fmt='(i0)',advance='no') yesf\n\nendprogram test03\n", "language": "Fortran", "metadata": {"date": 1579689766, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Fortran/s277109519.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s277109519", "user_id": "u838994321"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program test03\n implicit none\n integer,allocatable :: a(:)\n integer N\n integer i, j, jj\n integer :: js=1\n integer :: yesf=0\n integer :: no=0\n\n read(5,*) N\n allocate(a(N))\n\n read(5,*) (a(i), i=1,N)\n\n if ( N >= 190000 ) then\n js=120000\n end if\n\n do j=js,N\n if ( j/=1 ) then\n do jj=js,j-1 \n if ( a(jj) < a(j) ) then\n no = 1\n continue\n end if\n end do\n end if\n!print *,no\n if ( no==0 ) then\n yesf=yesf+1\n end if\n no=0\nend do\n\n write (*,fmt='(i0)',advance='no') yesf\n\nendprogram test03\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 506, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s972682386", "group_id": "codeNet:p02789", "input_text": "program test01\n implicit none\n integer a, b\n\n read(5,*) a, b\n\n if ( a == b ) then\n print *, 'Yes'\n else\n print *, 'No'\n end if\n\nendprogram test01\n", "language": "Fortran", "metadata": {"date": 1579684470, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02789.html", "problem_id": "p02789", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02789/input.txt", "sample_output_relpath": "derived/input_output/data/p02789/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02789/Fortran/s972682386.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972682386", "user_id": "u838994321"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program test01\n implicit none\n integer a, b\n\n read(5,*) a, b\n\n if ( a == b ) then\n print *, 'Yes'\n else\n print *, 'No'\n end if\n\nendprogram test01\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 148, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s367027914", "group_id": "codeNet:p02790", "input_text": "program bbb\nimplicit none\n\ninteger(8) :: a, b, i, p, q, res\n\nread*, a, b\n\np = max(a,b)\nq = min(a,b)\n\nres = 0\ndo i = 1, p\nres = res + q*10**(i-1)\nend do\n\nprint*, res\n\nend program", "language": "Fortran", "metadata": {"date": 1579464479, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02790.html", "problem_id": "p02790", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02790/input.txt", "sample_output_relpath": "derived/input_output/data/p02790/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02790/Fortran/s367027914.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s367027914", "user_id": "u039189422"}, "prompt_components": {"gold_output": "3333\n", "input_to_evaluate": "program bbb\nimplicit none\n\ninteger(8) :: a, b, i, p, q, res\n\nread*, a, b\n\np = max(a,b)\nq = min(a,b)\n\nres = 0\ndo i = 1, p\nres = res + q*10**(i-1)\nend do\n\nprint*, res\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?\n\nConstraints\n\n1 \\leq a \\leq 9\n\n1 \\leq b \\leq 9\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)\n\nSample Input 1\n\n4 3\n\nSample Output 1\n\n3333\n\nWe have two strings 444 and 3333. Between them, 3333 is the lexicographically smaller.\n\nSample Input 2\n\n7 7\n\nSample Output 2\n\n7777777", "sample_input": "4 3\n"}, "reference_outputs": ["3333\n"], "source_document_id": "p02790", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?\n\nConstraints\n\n1 \\leq a \\leq 9\n\n1 \\leq b \\leq 9\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)\n\nSample Input 1\n\n4 3\n\nSample Output 1\n\n3333\n\nWe have two strings 444 and 3333. Between them, 3333 is the lexicographically smaller.\n\nSample Input 2\n\n7 7\n\nSample Output 2\n\n7777777", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s984802680", "group_id": "codeNet:p02791", "input_text": "program test03_2\n implicit none\n integer,allocatable :: a(:)\n integer,allocatable :: b(:)\n integer N\n integer i, j, jj\n integer :: js(1)\n integer :: yesf=0\n integer :: no=0\n\n read(5,*) N\n allocate(a(N))\n\n read(5,*) (a(i), i=1,N)\n\n\n do j=1,N\n allocate(b(j))\n do jj=1,j\n b(jj)=a(jj)\n end do\n\n!print *, minloc(b)\n js=minloc(b)\n if ( j == js(1) ) then\n yesf=yesf+1\n end if\n\n deallocate(b)\n end do\n\n write (*,fmt='(i0)',advance='no') yesf\n\nendprogram test03_2\n", "language": "Fortran", "metadata": {"date": 1579690590, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02791.html", "problem_id": "p02791", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02791/input.txt", "sample_output_relpath": "derived/input_output/data/p02791/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02791/Fortran/s984802680.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s984802680", "user_id": "u838994321"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program test03_2\n implicit none\n integer,allocatable :: a(:)\n integer,allocatable :: b(:)\n integer N\n integer i, j, jj\n integer :: js(1)\n integer :: yesf=0\n integer :: no=0\n\n read(5,*) N\n allocate(a(N))\n\n read(5,*) (a(i), i=1,N)\n\n\n do j=1,N\n allocate(b(j))\n do jj=1,j\n b(jj)=a(jj)\n end do\n\n!print *, minloc(b)\n js=minloc(b)\n if ( j == js(1) ) then\n yesf=yesf+1\n end if\n\n deallocate(b)\n end do\n\n write (*,fmt='(i0)',advance='no') yesf\n\nendprogram test03_2\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "sample_input": "5\n4 2 5 1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02791", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a permutation P_1, \\ldots, P_N of 1, \\ldots, N.\nFind the number of integers i (1 \\leq i \\leq N) that satisfy the following condition:\n\nFor any integer j (1 \\leq j \\leq i), P_i \\leq P_j.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nP_1, \\ldots, P_N is a permutation of 1, \\ldots, N.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 ... P_N\n\nOutput\n\nPrint the number of integers i that satisfy the condition.\n\nSample Input 1\n\n5\n4 2 5 1 3\n\nSample Output 1\n\n3\n\ni=1, 2, and 4 satisfy the condition, but i=3 does not - for example, P_i > P_j holds for j = 1.\n\nSimilarly, i=5 does not satisfy the condition, either. Thus, there are three integers that satisfy the condition.\n\nSample Input 2\n\n4\n4 3 2 1\n\nSample Output 2\n\n4\n\nAll integers i (1 \\leq i \\leq N) satisfy the condition.\n\nSample Input 3\n\n6\n1 2 3 4 5 6\n\nSample Output 3\n\n1\n\nOnly i=1 satisfies the condition.\n\nSample Input 4\n\n8\n5 7 4 2 6 8 1 3\n\nSample Output 4\n\n4\n\nSample Input 5\n\n1\n1\n\nSample Output 5\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s294589435", "group_id": "codeNet:p02792", "input_text": "program ddd\nimplicit none\n\ninteger :: n, i, p, q, r, x, y, res, chk, co\ninteger,dimension(99) :: t\ncharacter(10) :: c\n\nt = 0\nread*, n\n\n\nif(n<10) then\nprint*, n\nreturn\nend if\n\ndo i = 10, n\n\nwrite(c,'(i10)') i\n\nc = adjustl(c)\nr = len_trim(c)\nread(c(1:1),*) x\nread(c(r:r),*) y\np = max(x,y)\nq = min(x,y)\n\nif (q==0) cycle\nt(10*x+y) = t(10*x+y) + 1\n\nend do\n\nchk = 0\nres = 9\ndo i = 1, 9\nco = 11*i\nif (t(co)>0) then\nt(co) = t(co) + 1\nchk = chk + 1\nres = res + t(co)**2\nend if\nend do\n\ndo i = 12, 99\n\nif (t(i)==0) cycle\nx = int(i*0.1)\ny = i - 10*x\n\nif (y==0) cycle\nif (mod(i,11)==0) cycle\n\np = t((10*x) + y)\nq = t((10*y) + x)\nres = res + p*q\nend do\n\nprint*, res - chk\n\nend program", "language": "Fortran", "metadata": {"date": 1579469198, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02792.html", "problem_id": "p02792", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02792/input.txt", "sample_output_relpath": "derived/input_output/data/p02792/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02792/Fortran/s294589435.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s294589435", "user_id": "u039189422"}, "prompt_components": {"gold_output": "17\n", "input_to_evaluate": "program ddd\nimplicit none\n\ninteger :: n, i, p, q, r, x, y, res, chk, co\ninteger,dimension(99) :: t\ncharacter(10) :: c\n\nt = 0\nread*, n\n\n\nif(n<10) then\nprint*, n\nreturn\nend if\n\ndo i = 10, n\n\nwrite(c,'(i10)') i\n\nc = adjustl(c)\nr = len_trim(c)\nread(c(1:1),*) x\nread(c(r:r),*) y\np = max(x,y)\nq = min(x,y)\n\nif (q==0) cycle\nt(10*x+y) = t(10*x+y) + 1\n\nend do\n\nchk = 0\nres = 9\ndo i = 1, 9\nco = 11*i\nif (t(co)>0) then\nt(co) = t(co) + 1\nchk = chk + 1\nres = res + t(co)**2\nend if\nend do\n\ndo i = 12, 99\n\nif (t(i)==0) cycle\nx = int(i*0.1)\ny = i - 10*x\n\nif (y==0) cycle\nif (mod(i,11)==0) cycle\n\np = t((10*x) + y)\nq = t((10*y) + x)\nres = res + p*q\nend do\n\nprint*, res - chk\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "sample_input": "25\n"}, "reference_outputs": ["17\n"], "source_document_id": "p02792", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 670, "cpu_time_ms": 361, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s054215642", "group_id": "codeNet:p02793", "input_text": "module mod_tree_map\n implicit none\n\n type t_entry\n private\n integer :: key\n integer :: val\n end type t_entry\n\n type t_node\n private\n type(t_node), pointer :: left => null(), right => null()\n integer :: level = 1\n type(t_entry), pointer :: e => null()\n end type t_node\n\n type t_tree_map\n private\n type(t_node), pointer :: root => null()\n integer :: deflt = 0\n end type t_tree_map\n\ncontains\n\n function new_entry(key,val) result(e)\n integer, intent(in) :: key\n integer, intent(in) :: val\n type(t_entry), pointer :: e\n e => null()\n allocate(e)\n e%key = key\n e%val = val\n end\n\n function new_node(e) result(n)\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n n => null()\n allocate(n)\n n%e => e\n end\n\n integer function level(n)\n type(t_node), pointer, intent(in) :: n\n level = 0\n if (.not.associated(n)) return\n level = n%level\n end\n\n logical function is_leaf(n)\n type(t_node), pointer, intent(in) :: n\n is_leaf = associated(n) .and. .not.associated(n%left) .and. &\n & .not.associated(n%right)\n end\n\n recursive function tree_size(n) result(s)\n type(t_node), pointer, intent(in) :: n\n integer :: s\n s = 0\n if (.not.associated(n)) return\n s = 1+tree_size(n%left)+tree_size(n%right)\n end\n\n function skew(n) result(l)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: l\n l => n\n if (.not.(associated(n) .and. associated(n%left) .and. &\n & n%left%level == n%level)) return\n l => n%left\n n%left => l%right\n l%right => n\n end\n\n function split(n) result(r)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: r\n r => n\n if (.not.(associated(n) .and. associated(n%right) .and. &\n & associated(n%right%right) .and. n%right%right%level == n%level)) return\n r => n%right\n n%right => r%left\n r%left => n\n r%level = r%level+1\n end\n\n function predecessor(n) result(p)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: p\n p => null()\n if (.not.associated(n%left)) return\n p => n%left\n do while (associated(p%right))\n p => p%right\n end do\n end\n\n function successor(n) result(s)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: s\n s => null()\n if (.not.associated(n%right)) return\n s => n%right\n do while (associated(s%left))\n s => s%left\n end do\n end\n\n recursive function insert(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t\n t => new_node(e)\n if (.not.associated(n)) return\n t => n\n if (e%key < t%e%key) then\n t%left => insert(t%left,e)\n else if (e%key > t%e%key) then\n t%right => insert(t%right,e)\n else\n t%e => e\n end if\n t => skew(t)\n t => split(t)\n end\n\n recursive function delete(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t, l\n t => n\n if (.not.associated(n)) return\n if (e%key < t%e%key) then\n t%left => delete(t%left,e)\n else if (e%key > t%e%key) then\n t%right => delete(t%right,e)\n else\n if (is_leaf(t)) return\n if (.not.associated(t%left)) then\n l => successor(t)\n t%right => delete(t%right,l%e)\n t%e => l%e\n else\n l => predecessor(t)\n t%left => delete(t%left,l%e)\n t%e => l%e\n end if\n end if\n t => decrease_level(t)\n t => skew(t)\n t%right => skew(t%right)\n if (associated(t%right)) t%right%right => skew(t%right%right)\n t => split(t)\n t%right => split(t%right)\n end\n\n function decrease_level(n) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: t\n integer :: should_be\n t => n\n should_be = min(level(t%left),level(t%right))+1\n if (t%level > should_be) then\n t%level = should_be\n if (level(t%right) > should_be) t%right%level = should_be\n end if\n end\n\n recursive subroutine release_tree(t)\n type(t_node), pointer, intent(inout) :: t\n if (.not.associated(t)) return\n call release_tree(t%left)\n call release_tree(t%right)\n deallocate(t)\n end\n\n recursive subroutine get_keys_list(t,keys,num)\n type(t_node), pointer, intent(in) :: t\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n if (.not.associated(t)) return\n call get_keys_list(t%left,keys,num)\n num = num+1\n keys(num) = t%e%key\n call get_keys_list(t%right,keys,num)\n end\n\n integer function size_of(map)\n type(t_tree_map), intent(in) :: map\n size_of = tree_size(map%root)\n end\n\n subroutine clear(map)\n type(t_tree_map), intent(inout) :: map\n call release_tree(map%root)\n map%root => null()\n end\n\n subroutine set_default(map,deflt)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: deflt\n map%deflt = deflt\n end\n\n subroutine put_entry(map,e)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n map%root => insert(map%root,e)\n end\n\n subroutine remove_entry(map,e)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n map%root => delete(map%root,e)\n end\n\n function get_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n\n function contain_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n logical :: ret\n ret = .false.\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret = .true.\n return\n end if\n end do\n end\n\n function get_first_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n end\n\n function poll_first_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n map%root => delete(map%root,ret)\n end\n\n function get_last_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n end\n\n function poll_last_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n map%root => delete(map%root,ret)\n end\n\n function floor_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key > e%key-n%e%key) ret => n%e\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n\n function lower_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => floor_entry(map,new_entry(e%key-1,0))\n end\n\n function ceiling_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key < e%key-n%e%key) ret => n%e\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n\n function higher_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => ceiling_entry(map,new_entry(e%key+1,0))\n end\n\n subroutine get_keys(map,keys,num)\n type(t_tree_map), intent(inout) :: map\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n keys = 0\n num = 0\n call get_keys_list(map%root,keys,num)\n end\n\n subroutine put(map,key,val)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n integer, intent(in) :: val\n call put_entry(map,new_entry(key,val))\n end\n\n subroutine remove(map,key)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n call remove_entry(map,new_entry(key,0))\n end\n\n function get(map,key) result(val)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: val\n val = map%deflt\n tmp => get_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n val = tmp%val\n end\n\n logical function contain(map,key)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n contain = contain_entry(map,new_entry(key,0))\n end\n\n function get_first_key(map) result(key)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer :: tmp\n integer :: key\n key = map%deflt\n tmp => get_first_entry(map)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n\n function get_last_key(map) result(key)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer :: tmp\n integer :: key\n key = map%deflt\n tmp => get_last_entry(map)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n\n function floor_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => floor_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\n function lower_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => lower_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\n function ceiling_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => ceiling_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\n function higher_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => higher_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\nend module mod_tree_map\nprogram ABC152E\n use mod_tree_map\n implicit none\n integer::N\n integer,allocatable,dimension(:)::A\n type(t_tree_map),allocatable,dimension(:)::AYK\n type(t_tree_map)::KYK\n integer::i,j,k,cnt,JOU\n integer(16)::PLUS,KAKE\n integer::ans=0,mo=10**9+7\n read*,N\n allocate(A(N),AYK(N))\n read*,A\n do i=1,N\n do j=2,int(sqrt(real(A(i))))\n if(A(i)/j/=0)cycle\n cnt=0\n do while(mod(A(i),j)==0)\n cnt=cnt+1\n A(i)=A(i)/j\n end do\n if(cnt/=0)then\n call put(AYK(i),j,cnt)\n if(get(KYK,j)=mo)KAKE=mod(KAKE,mo)\n end do\n PLUS=mod(PLUS*KAKE,mo)\n j=higher_key(KYK,j)\n end do\n ANS=mod(ANS+PLUS,mo)\n end do\n print\"(i0)\",ANS\ncontains\nend program ABC152E", "language": "Fortran", "metadata": {"date": 1579474524, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02793.html", "problem_id": "p02793", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02793/input.txt", "sample_output_relpath": "derived/input_output/data/p02793/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02793/Fortran/s054215642.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s054215642", "user_id": "u598073939"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "module mod_tree_map\n implicit none\n\n type t_entry\n private\n integer :: key\n integer :: val\n end type t_entry\n\n type t_node\n private\n type(t_node), pointer :: left => null(), right => null()\n integer :: level = 1\n type(t_entry), pointer :: e => null()\n end type t_node\n\n type t_tree_map\n private\n type(t_node), pointer :: root => null()\n integer :: deflt = 0\n end type t_tree_map\n\ncontains\n\n function new_entry(key,val) result(e)\n integer, intent(in) :: key\n integer, intent(in) :: val\n type(t_entry), pointer :: e\n e => null()\n allocate(e)\n e%key = key\n e%val = val\n end\n\n function new_node(e) result(n)\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n n => null()\n allocate(n)\n n%e => e\n end\n\n integer function level(n)\n type(t_node), pointer, intent(in) :: n\n level = 0\n if (.not.associated(n)) return\n level = n%level\n end\n\n logical function is_leaf(n)\n type(t_node), pointer, intent(in) :: n\n is_leaf = associated(n) .and. .not.associated(n%left) .and. &\n & .not.associated(n%right)\n end\n\n recursive function tree_size(n) result(s)\n type(t_node), pointer, intent(in) :: n\n integer :: s\n s = 0\n if (.not.associated(n)) return\n s = 1+tree_size(n%left)+tree_size(n%right)\n end\n\n function skew(n) result(l)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: l\n l => n\n if (.not.(associated(n) .and. associated(n%left) .and. &\n & n%left%level == n%level)) return\n l => n%left\n n%left => l%right\n l%right => n\n end\n\n function split(n) result(r)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: r\n r => n\n if (.not.(associated(n) .and. associated(n%right) .and. &\n & associated(n%right%right) .and. n%right%right%level == n%level)) return\n r => n%right\n n%right => r%left\n r%left => n\n r%level = r%level+1\n end\n\n function predecessor(n) result(p)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: p\n p => null()\n if (.not.associated(n%left)) return\n p => n%left\n do while (associated(p%right))\n p => p%right\n end do\n end\n\n function successor(n) result(s)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: s\n s => null()\n if (.not.associated(n%right)) return\n s => n%right\n do while (associated(s%left))\n s => s%left\n end do\n end\n\n recursive function insert(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t\n t => new_node(e)\n if (.not.associated(n)) return\n t => n\n if (e%key < t%e%key) then\n t%left => insert(t%left,e)\n else if (e%key > t%e%key) then\n t%right => insert(t%right,e)\n else\n t%e => e\n end if\n t => skew(t)\n t => split(t)\n end\n\n recursive function delete(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t, l\n t => n\n if (.not.associated(n)) return\n if (e%key < t%e%key) then\n t%left => delete(t%left,e)\n else if (e%key > t%e%key) then\n t%right => delete(t%right,e)\n else\n if (is_leaf(t)) return\n if (.not.associated(t%left)) then\n l => successor(t)\n t%right => delete(t%right,l%e)\n t%e => l%e\n else\n l => predecessor(t)\n t%left => delete(t%left,l%e)\n t%e => l%e\n end if\n end if\n t => decrease_level(t)\n t => skew(t)\n t%right => skew(t%right)\n if (associated(t%right)) t%right%right => skew(t%right%right)\n t => split(t)\n t%right => split(t%right)\n end\n\n function decrease_level(n) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: t\n integer :: should_be\n t => n\n should_be = min(level(t%left),level(t%right))+1\n if (t%level > should_be) then\n t%level = should_be\n if (level(t%right) > should_be) t%right%level = should_be\n end if\n end\n\n recursive subroutine release_tree(t)\n type(t_node), pointer, intent(inout) :: t\n if (.not.associated(t)) return\n call release_tree(t%left)\n call release_tree(t%right)\n deallocate(t)\n end\n\n recursive subroutine get_keys_list(t,keys,num)\n type(t_node), pointer, intent(in) :: t\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n if (.not.associated(t)) return\n call get_keys_list(t%left,keys,num)\n num = num+1\n keys(num) = t%e%key\n call get_keys_list(t%right,keys,num)\n end\n\n integer function size_of(map)\n type(t_tree_map), intent(in) :: map\n size_of = tree_size(map%root)\n end\n\n subroutine clear(map)\n type(t_tree_map), intent(inout) :: map\n call release_tree(map%root)\n map%root => null()\n end\n\n subroutine set_default(map,deflt)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: deflt\n map%deflt = deflt\n end\n\n subroutine put_entry(map,e)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n map%root => insert(map%root,e)\n end\n\n subroutine remove_entry(map,e)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n map%root => delete(map%root,e)\n end\n\n function get_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n\n function contain_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n logical :: ret\n ret = .false.\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret = .true.\n return\n end if\n end do\n end\n\n function get_first_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n end\n\n function poll_first_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n map%root => delete(map%root,ret)\n end\n\n function get_last_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n end\n\n function poll_last_entry(map) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n map%root => delete(map%root,ret)\n end\n\n function floor_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key > e%key-n%e%key) ret => n%e\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n\n function lower_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => floor_entry(map,new_entry(e%key-1,0))\n end\n\n function ceiling_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => map%root\n do while (associated(n))\n if (e%key < n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key < e%key-n%e%key) ret => n%e\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n\n function higher_entry(map,e) result(ret)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => ceiling_entry(map,new_entry(e%key+1,0))\n end\n\n subroutine get_keys(map,keys,num)\n type(t_tree_map), intent(inout) :: map\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n keys = 0\n num = 0\n call get_keys_list(map%root,keys,num)\n end\n\n subroutine put(map,key,val)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n integer, intent(in) :: val\n call put_entry(map,new_entry(key,val))\n end\n\n subroutine remove(map,key)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n call remove_entry(map,new_entry(key,0))\n end\n\n function get(map,key) result(val)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: val\n val = map%deflt\n tmp => get_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n val = tmp%val\n end\n\n logical function contain(map,key)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n contain = contain_entry(map,new_entry(key,0))\n end\n\n function get_first_key(map) result(key)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer :: tmp\n integer :: key\n key = map%deflt\n tmp => get_first_entry(map)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n\n function get_last_key(map) result(key)\n type(t_tree_map), intent(inout) :: map\n type(t_entry), pointer :: tmp\n integer :: key\n key = map%deflt\n tmp => get_last_entry(map)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n\n function floor_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => floor_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\n function lower_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => lower_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\n function ceiling_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => ceiling_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\n function higher_key(map,key) result(ret)\n type(t_tree_map), intent(inout) :: map\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = map%deflt\n tmp => higher_entry(map,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n\nend module mod_tree_map\nprogram ABC152E\n use mod_tree_map\n implicit none\n integer::N\n integer,allocatable,dimension(:)::A\n type(t_tree_map),allocatable,dimension(:)::AYK\n type(t_tree_map)::KYK\n integer::i,j,k,cnt,JOU\n integer(16)::PLUS,KAKE\n integer::ans=0,mo=10**9+7\n read*,N\n allocate(A(N),AYK(N))\n read*,A\n do i=1,N\n do j=2,int(sqrt(real(A(i))))\n if(A(i)/j/=0)cycle\n cnt=0\n do while(mod(A(i),j)==0)\n cnt=cnt+1\n A(i)=A(i)/j\n end do\n if(cnt/=0)then\n call put(AYK(i),j,cnt)\n if(get(KYK,j)=mo)KAKE=mod(KAKE,mo)\n end do\n PLUS=mod(PLUS*KAKE,mo)\n j=higher_key(KYK,j)\n end do\n ANS=mod(ANS+PLUS,mo)\n end do\n print\"(i0)\",ANS\ncontains\nend program ABC152E", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N positive integers A_1,...,A_N.\n\nConsider positive integers B_1, ..., B_N that satisfy the following condition.\n\nCondition: For any i, j such that 1 \\leq i < j \\leq N, A_i B_i = A_j B_j holds.\n\nFind the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.\n\nSince the answer can be enormous, print the sum modulo (10^9 +7).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A_i \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that satisfy the condition, modulo (10^9 +7).\n\nSample Input 1\n\n3\n2 3 4\n\nSample Output 1\n\n13\n\nLet B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.\n\nSample Input 2\n\n5\n12 12 12 12 12\n\nSample Output 2\n\n5\n\nWe can let all B_i be 1.\n\nSample Input 3\n\n3\n1000000 999999 999998\n\nSample Output 3\n\n996989508\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n2 3 4\n"}, "reference_outputs": ["13\n"], "source_document_id": "p02793", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N positive integers A_1,...,A_N.\n\nConsider positive integers B_1, ..., B_N that satisfy the following condition.\n\nCondition: For any i, j such that 1 \\leq i < j \\leq N, A_i B_i = A_j B_j holds.\n\nFind the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.\n\nSince the answer can be enormous, print the sum modulo (10^9 +7).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A_i \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nPrint the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that satisfy the condition, modulo (10^9 +7).\n\nSample Input 1\n\n3\n2 3 4\n\nSample Output 1\n\n13\n\nLet B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.\n\nSample Input 2\n\n5\n12 12 12 12 12\n\nSample Output 2\n\n5\n\nWe can let all B_i be 1.\n\nSample Input 3\n\n3\n1000000 999999 999998\n\nSample Output 3\n\n996989508\n\nPrint the sum modulo (10^9+7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 13168, "cpu_time_ms": 2158, "memory_kb": 897152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s217278084", "group_id": "codeNet:p02796", "input_text": "module merge_sort_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n interface merge_sort\n module procedure ms32, ms64!, msc\n end interface\n\n interface double_merge_sort\n module procedure msd3232, msd6464!, msdc32, msdc64, msd32c, msd64c\n end interface\n private\n public merge_sort, double_merge_sort\ncontains\n recursive subroutine ms32(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap32(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms32(ar, fst, mdl)\n call ms32(ar, mdl+1, lst)\n call merge32(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge32(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap32(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n\n recursive subroutine ms64(ar, fst, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap64(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms64(ar, fst, mdl)\n call ms64(ar, mdl+1, lst)\n call merge64(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge64(ar, fst, mdl, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst, mdl, lst\n integer(int64),allocatable:: tmp(:)\n integer(int64):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap64(x,y)\n integer(int64),intent(inout):: x,y\n integer(int64):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n recursive subroutine msd3232(ar1, ar2, fst, lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap32(ar1(fst), ar1(lst))\n call swap32(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd3232(ar1,ar2,fst,mdl)\n call msd3232(ar1,ar2,mdl+1,lst)\n call merged3232(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged3232(ar1,ar2,fst,mdl,lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,mdl,lst\n integer(int32),allocatable:: t1(:),t2(:)\n integer(int32):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n\n recursive subroutine msd6464(ar1, ar2, fst, lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap64(ar1(fst), ar1(lst))\n call swap64(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd6464(ar1,ar2,fst,mdl)\n call msd6464(ar1,ar2,mdl+1,lst)\n call merged6464(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged6464(ar1,ar2,fst,mdl,lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,mdl,lst\n integer(int64),allocatable:: t1(:),t2(:)\n integer(int64):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n ! recursive subroutine msc(ar, fst, lst)\n ! character(*),intent(inout):: ar(:)\n ! integer(int32),intent(in):: fst,lst\n ! integer(int32):: mdl\n\n ! if (lst-fst < 2) then\n ! if (ar(fst) > ar(lst)) call swapc(ar(fst),ar(lst))\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n ! call msc(ar, fst, mdl)\n ! call msc(ar, mdl+1, lst)\n ! call mergec(ar, fst, mdl, lst)\n ! end subroutine\n\n ! subroutine mergec(ar, fst, mdl, lst)\n ! character(*),intent(inout):: ar(:)\n ! integer(int32),intent(in):: fst, mdl, lst\n ! character(:),allocatable:: tmp(:)\n ! integer(int32):: li, ri, ti\n\n ! allocate(character(len(ar(fst))):: tmp(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1 \n ! ti=1\n\n ! do while (li <= mdl .and. ri <= lst)\n ! if (ar(li) <= ar(ri)) then\n ! tmp(ti) = ar(li)\n ! li=li+1\n ! else\n ! tmp(ti) = ar(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! tmp(ti:) = ar(li:mdl)\n ! else\n ! tmp(ti:) = ar(ri:lst)\n ! end if\n\n ! ar(fst:lst) = tmp(:)\n ! deallocate(tmp)\n ! end subroutine\n\n ! subroutine swapc(x,y)\n ! character(*),intent(inout):: x,y\n ! character(:),allocatable:: tmp\n ! tmp = x\n ! x = y\n ! y = tmp\n ! end subroutine\n\n\n ! recursive subroutine msdc32(ar1, ar2, fst, lst)\n ! integer(int32),intent(inout):: ar1(:)\n ! character(*), intent(inout):: ar2(:)\n ! integer(int32),intent(in):: fst,lst\n ! integer(int32):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swap32(ar1(fst), ar1(lst))\n ! call swapc(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msdc32(ar1,ar2,fst,mdl)\n ! call msdc32(ar1,ar2,mdl+1,lst)\n ! call mergedc32(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine mergedc32(ar1,ar2,fst,mdl,lst)\n ! integer(int32),intent(inout):: ar1(:)\n ! character(*),intent(inout):: ar2(:)\n ! integer(int32),intent(in):: fst,mdl,lst\n ! integer(int32),allocatable:: t1(:)\n ! character(:),allocatable:: t2(:)\n ! integer(int32):: li,ri,ti\n\n ! allocate(t1(lst-fst+1))\n ! allocate(character(len(ar2(fst))):: t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n \n ! recursive subroutine msdc64(ar1, ar2, fst, lst)\n ! integer(int64),intent(inout):: ar1(:)\n ! character(*), intent(inout):: ar2(:)\n ! integer(int64),intent(in):: fst,lst\n ! integer(int64):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swap64(ar1(fst), ar1(lst))\n ! call swapc(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msdc64(ar1,ar2,fst,mdl)\n ! call msdc64(ar1,ar2,mdl+1,lst)\n ! call mergedc64(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine mergedc64(ar1,ar2,fst,mdl,lst)\n ! integer(int64),intent(inout):: ar1(:)\n ! character(*),intent(inout):: ar2(:)\n ! integer(int64),intent(in):: fst,mdl,lst\n ! integer(int64),allocatable:: t1(:)\n ! character(:),allocatable:: t2(:)\n ! integer(int64):: li,ri,ti\n\n ! allocate(t1(lst-fst+1))\n ! allocate(character(len(ar2)):: t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n\n ! recursive subroutine msd32c(ar1, ar2, fst, lst)\n ! integer(int32),intent(inout):: ar2(:)\n ! character(*), intent(inout):: ar1(:)\n ! integer(int32),intent(in):: fst,lst\n ! integer(int32):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swapc(ar1(fst), ar1(lst))\n ! call swap32(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msd32c(ar1,ar2,fst,mdl)\n ! call msd32c(ar1,ar2,mdl+1,lst)\n ! call merged32c(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine merged32c(ar1,ar2,fst,mdl,lst)\n ! integer(int32),intent(inout):: ar2(:)\n ! character(*),intent(inout):: ar1(:)\n ! integer(int32),intent(in):: fst,mdl,lst\n ! integer(int32),allocatable:: t2(:)\n ! character(:),allocatable:: t1(:)\n ! integer(int32):: li,ri,ti\n\n ! allocate(character(len(ar1(fst))):: t1(lst-fst+1))\n ! allocate(t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n ! recursive subroutine msd64c(ar1, ar2, fst, lst)\n ! integer(int64),intent(inout):: ar2(:)\n ! character(*), intent(inout):: ar1(:)\n ! integer(int64),intent(in):: fst,lst\n ! integer(int64):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swapc(ar1(fst), ar1(lst))\n ! call swap64(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msd64c(ar1,ar2,fst,mdl)\n ! call msd64c(ar1,ar2,mdl+1,lst)\n ! call merged64c(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine merged64c(ar1,ar2,fst,mdl,lst)\n ! integer(int64),intent(inout):: ar2(:)\n ! character(*),intent(inout):: ar1(:)\n ! integer(int64),intent(in):: fst,mdl,lst\n ! integer(int64),allocatable:: t2(:)\n ! character(:),allocatable:: t1(:)\n ! integer(int64):: li,ri,ti\n\n ! allocate(character(len(ar1(fst))):: t1(lst-fst+1))\n ! allocate(t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n\n ! recursive subroutine msdcc(ar1, ar2, fst, lst)\n ! character(*), intent(inout):: ar1(:), ar2(:)\n ! integer(int64),intent(in):: fst,lst\n ! integer(int64):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swapc(ar1(fst), ar1(lst))\n ! call swapc(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msdcc(ar1,ar2,fst,mdl)\n ! call msdcc(ar1,ar2,mdl+1,lst)\n ! call mergecc(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine mergecc(ar1,ar2,fst,mdl,lst)\n ! character(*),intent(inout):: ar1(:),ar2(:)\n ! integer(int64),intent(in):: fst,mdl,lst\n ! character(:),allocatable:: t1(:),t2(:)\n ! integer(int64):: li,ri,ti\n\n ! allocate(character(len(ar1(fst))):: t1(lst-fst+1))\n ! allocate(character(len(ar2(fst))):: t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\nend module\n\nprogram keyence2020b\n use,intrinsic :: iso_fortran_env\n use merge_sort_mod\n implicit none\n integer(int32):: n,i\n integer(int32):: x,l,nl,ans\n integer(int32), allocatable:: fst(:),lst(:) \n\n read*, n\n allocate(fst(n),lst(n))\n\n do i=1,n\n read*, x,l\n fst(i)=x-l\n lst(i)=x+l\n end do\n call double_merge_sort(lst,fst,1,n)\n nl = -1000000009\n ans=0\n do i=1,n\n if (nl <= fst(i)) then\n ans=ans+1\n nl = lst(i)\n end if\n end do\n print'(i0)', ans\nend program keyence2020b", "language": "Fortran", "metadata": {"date": 1590992043, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02796.html", "problem_id": "p02796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02796/input.txt", "sample_output_relpath": "derived/input_output/data/p02796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02796/Fortran/s217278084.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s217278084", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module merge_sort_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n interface merge_sort\n module procedure ms32, ms64!, msc\n end interface\n\n interface double_merge_sort\n module procedure msd3232, msd6464!, msdc32, msdc64, msd32c, msd64c\n end interface\n private\n public merge_sort, double_merge_sort\ncontains\n recursive subroutine ms32(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap32(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms32(ar, fst, mdl)\n call ms32(ar, mdl+1, lst)\n call merge32(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge32(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap32(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n\n recursive subroutine ms64(ar, fst, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap64(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms64(ar, fst, mdl)\n call ms64(ar, mdl+1, lst)\n call merge64(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge64(ar, fst, mdl, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst, mdl, lst\n integer(int64),allocatable:: tmp(:)\n integer(int64):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap64(x,y)\n integer(int64),intent(inout):: x,y\n integer(int64):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n recursive subroutine msd3232(ar1, ar2, fst, lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap32(ar1(fst), ar1(lst))\n call swap32(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd3232(ar1,ar2,fst,mdl)\n call msd3232(ar1,ar2,mdl+1,lst)\n call merged3232(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged3232(ar1,ar2,fst,mdl,lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,mdl,lst\n integer(int32),allocatable:: t1(:),t2(:)\n integer(int32):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n\n recursive subroutine msd6464(ar1, ar2, fst, lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap64(ar1(fst), ar1(lst))\n call swap64(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd6464(ar1,ar2,fst,mdl)\n call msd6464(ar1,ar2,mdl+1,lst)\n call merged6464(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged6464(ar1,ar2,fst,mdl,lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,mdl,lst\n integer(int64),allocatable:: t1(:),t2(:)\n integer(int64):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n ! recursive subroutine msc(ar, fst, lst)\n ! character(*),intent(inout):: ar(:)\n ! integer(int32),intent(in):: fst,lst\n ! integer(int32):: mdl\n\n ! if (lst-fst < 2) then\n ! if (ar(fst) > ar(lst)) call swapc(ar(fst),ar(lst))\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n ! call msc(ar, fst, mdl)\n ! call msc(ar, mdl+1, lst)\n ! call mergec(ar, fst, mdl, lst)\n ! end subroutine\n\n ! subroutine mergec(ar, fst, mdl, lst)\n ! character(*),intent(inout):: ar(:)\n ! integer(int32),intent(in):: fst, mdl, lst\n ! character(:),allocatable:: tmp(:)\n ! integer(int32):: li, ri, ti\n\n ! allocate(character(len(ar(fst))):: tmp(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1 \n ! ti=1\n\n ! do while (li <= mdl .and. ri <= lst)\n ! if (ar(li) <= ar(ri)) then\n ! tmp(ti) = ar(li)\n ! li=li+1\n ! else\n ! tmp(ti) = ar(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! tmp(ti:) = ar(li:mdl)\n ! else\n ! tmp(ti:) = ar(ri:lst)\n ! end if\n\n ! ar(fst:lst) = tmp(:)\n ! deallocate(tmp)\n ! end subroutine\n\n ! subroutine swapc(x,y)\n ! character(*),intent(inout):: x,y\n ! character(:),allocatable:: tmp\n ! tmp = x\n ! x = y\n ! y = tmp\n ! end subroutine\n\n\n ! recursive subroutine msdc32(ar1, ar2, fst, lst)\n ! integer(int32),intent(inout):: ar1(:)\n ! character(*), intent(inout):: ar2(:)\n ! integer(int32),intent(in):: fst,lst\n ! integer(int32):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swap32(ar1(fst), ar1(lst))\n ! call swapc(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msdc32(ar1,ar2,fst,mdl)\n ! call msdc32(ar1,ar2,mdl+1,lst)\n ! call mergedc32(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine mergedc32(ar1,ar2,fst,mdl,lst)\n ! integer(int32),intent(inout):: ar1(:)\n ! character(*),intent(inout):: ar2(:)\n ! integer(int32),intent(in):: fst,mdl,lst\n ! integer(int32),allocatable:: t1(:)\n ! character(:),allocatable:: t2(:)\n ! integer(int32):: li,ri,ti\n\n ! allocate(t1(lst-fst+1))\n ! allocate(character(len(ar2(fst))):: t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n \n ! recursive subroutine msdc64(ar1, ar2, fst, lst)\n ! integer(int64),intent(inout):: ar1(:)\n ! character(*), intent(inout):: ar2(:)\n ! integer(int64),intent(in):: fst,lst\n ! integer(int64):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swap64(ar1(fst), ar1(lst))\n ! call swapc(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msdc64(ar1,ar2,fst,mdl)\n ! call msdc64(ar1,ar2,mdl+1,lst)\n ! call mergedc64(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine mergedc64(ar1,ar2,fst,mdl,lst)\n ! integer(int64),intent(inout):: ar1(:)\n ! character(*),intent(inout):: ar2(:)\n ! integer(int64),intent(in):: fst,mdl,lst\n ! integer(int64),allocatable:: t1(:)\n ! character(:),allocatable:: t2(:)\n ! integer(int64):: li,ri,ti\n\n ! allocate(t1(lst-fst+1))\n ! allocate(character(len(ar2)):: t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n\n ! recursive subroutine msd32c(ar1, ar2, fst, lst)\n ! integer(int32),intent(inout):: ar2(:)\n ! character(*), intent(inout):: ar1(:)\n ! integer(int32),intent(in):: fst,lst\n ! integer(int32):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swapc(ar1(fst), ar1(lst))\n ! call swap32(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msd32c(ar1,ar2,fst,mdl)\n ! call msd32c(ar1,ar2,mdl+1,lst)\n ! call merged32c(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine merged32c(ar1,ar2,fst,mdl,lst)\n ! integer(int32),intent(inout):: ar2(:)\n ! character(*),intent(inout):: ar1(:)\n ! integer(int32),intent(in):: fst,mdl,lst\n ! integer(int32),allocatable:: t2(:)\n ! character(:),allocatable:: t1(:)\n ! integer(int32):: li,ri,ti\n\n ! allocate(character(len(ar1(fst))):: t1(lst-fst+1))\n ! allocate(t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n ! recursive subroutine msd64c(ar1, ar2, fst, lst)\n ! integer(int64),intent(inout):: ar2(:)\n ! character(*), intent(inout):: ar1(:)\n ! integer(int64),intent(in):: fst,lst\n ! integer(int64):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swapc(ar1(fst), ar1(lst))\n ! call swap64(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msd64c(ar1,ar2,fst,mdl)\n ! call msd64c(ar1,ar2,mdl+1,lst)\n ! call merged64c(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine merged64c(ar1,ar2,fst,mdl,lst)\n ! integer(int64),intent(inout):: ar2(:)\n ! character(*),intent(inout):: ar1(:)\n ! integer(int64),intent(in):: fst,mdl,lst\n ! integer(int64),allocatable:: t2(:)\n ! character(:),allocatable:: t1(:)\n ! integer(int64):: li,ri,ti\n\n ! allocate(character(len(ar1(fst))):: t1(lst-fst+1))\n ! allocate(t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\n\n\n ! recursive subroutine msdcc(ar1, ar2, fst, lst)\n ! character(*), intent(inout):: ar1(:), ar2(:)\n ! integer(int64),intent(in):: fst,lst\n ! integer(int64):: mdl\n\n ! if (lst - fst < 2) then\n ! if (ar1(fst) > ar1(lst)) then\n ! call swapc(ar1(fst), ar1(lst))\n ! call swapc(ar2(fst), ar2(lst))\n ! end if\n ! return\n ! end if\n\n ! mdl = (fst+lst)/2\n\n ! call msdcc(ar1,ar2,fst,mdl)\n ! call msdcc(ar1,ar2,mdl+1,lst)\n ! call mergecc(ar1,ar2,fst,mdl,lst)\n ! end subroutine\n\n\n ! subroutine mergecc(ar1,ar2,fst,mdl,lst)\n ! character(*),intent(inout):: ar1(:),ar2(:)\n ! integer(int64),intent(in):: fst,mdl,lst\n ! character(:),allocatable:: t1(:),t2(:)\n ! integer(int64):: li,ri,ti\n\n ! allocate(character(len(ar1(fst))):: t1(lst-fst+1))\n ! allocate(character(len(ar2(fst))):: t2(lst-fst+1))\n\n ! li=fst\n ! ri=mdl+1\n ! ti=1\n\n ! do while(li <= mdl .and. ri <= lst)\n ! if (ar1(li) <= ar1(ri)) then\n ! t1(ti) = ar1(li) \n ! t2(ti) = ar2(li)\n ! li=li+1\n ! else\n ! t1(ti) = ar1(ri)\n ! t2(ti) = ar2(ri)\n ! ri=ri+1\n ! end if\n ! ti=ti+1\n ! end do\n\n ! if (li <= mdl) then\n ! t1(ti:) = ar1(li:mdl)\n ! t2(ti:) = ar2(li:mdl)\n ! else\n ! t1(ti:) = ar1(ri:lst)\n ! t2(ti:) = ar2(ri:lst)\n ! end if\n\n ! ar1(fst:lst) = t1(:)\n ! ar2(fst:lst) = t2(:)\n\n ! deallocate(t1,t2)\n ! end subroutine\nend module\n\nprogram keyence2020b\n use,intrinsic :: iso_fortran_env\n use merge_sort_mod\n implicit none\n integer(int32):: n,i\n integer(int32):: x,l,nl,ans\n integer(int32), allocatable:: fst(:),lst(:) \n\n read*, n\n allocate(fst(n),lst(n))\n\n do i=1,n\n read*, x,l\n fst(i)=x-l\n lst(i)=x+l\n end do\n call double_merge_sort(lst,fst,1,n)\n nl = -1000000009\n ans=0\n do i=1,n\n if (nl <= fst(i)) then\n ans=ans+1\n nl = lst(i)\n end if\n end do\n print'(i0)', ans\nend program keyence2020b", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "sample_input": "4\n2 4\n4 3\n9 3\n100 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02796", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 17098, "cpu_time_ms": 96, "memory_kb": 1908}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s076595363", "group_id": "codeNet:p02796", "input_text": "program key2020_B\n implicit none\n integer(16)::N\n integer(16),allocatable,dimension(:)::X,L\n integer(16)::ANS\n logical(16),allocatable,dimension(:)::IN\n integer(16)::R\n integer(16)::i\n\n read*,N\n allocate(X(N),L(N))\n do i=1,N\n read*,X(i),L(i)\n end do\n call heapsortPair(N,X,L)\n allocate(IN(N))\n IN=.True.\n ANS=N\n R=X(1)+L(1)\n do i=2,N\n if(X(i)-L(i) 1)then\n l=l-1\n t=array(L)\n t2=array2(L)\n else\n t=array(k)\n t2=array2(k)\n array(k)=array(1)\n array2(k)=array2(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n array2(1)=t2\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n array2(i)=array2(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n array2(i)=t2\n enddo\n return\nend subroutine HeapsortPair\n\n \nend program key2020_B", "language": "Fortran", "metadata": {"date": 1579378575, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02796.html", "problem_id": "p02796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02796/input.txt", "sample_output_relpath": "derived/input_output/data/p02796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02796/Fortran/s076595363.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076595363", "user_id": "u598073939"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program key2020_B\n implicit none\n integer(16)::N\n integer(16),allocatable,dimension(:)::X,L\n integer(16)::ANS\n logical(16),allocatable,dimension(:)::IN\n integer(16)::R\n integer(16)::i\n\n read*,N\n allocate(X(N),L(N))\n do i=1,N\n read*,X(i),L(i)\n end do\n call heapsortPair(N,X,L)\n allocate(IN(N))\n IN=.True.\n ANS=N\n R=X(1)+L(1)\n do i=2,N\n if(X(i)-L(i) 1)then\n l=l-1\n t=array(L)\n t2=array2(L)\n else\n t=array(k)\n t2=array2(k)\n array(k)=array(1)\n array2(k)=array2(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n array2(1)=t2\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n array2(i)=array2(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n array2(i)=t2\n enddo\n return\nend subroutine HeapsortPair\n\n \nend program key2020_B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "sample_input": "4\n2 4\n4 3\n9 3\n100 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02796", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn a factory, there are N robots placed on a number line.\nRobot i is placed at coordinate X_i and can extend its arms of length L_i in both directions, positive and negative.\n\nWe want to remove zero or more robots so that the movable ranges of arms of no two remaining robots intersect.\nHere, for each i (1 \\leq i \\leq N), the movable range of arms of Robot i is the part of the number line between the coordinates X_i - L_i and X_i + L_i, excluding the endpoints.\n\nFind the maximum number of robots that we can keep.\n\nConstraints\n\n1 \\leq N \\leq 100,000\n\n0 \\leq X_i \\leq 10^9 (1 \\leq i \\leq N)\n\n1 \\leq L_i \\leq 10^9 (1 \\leq i \\leq N)\n\nIf i \\neq j, X_i \\neq X_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 L_1\nX_2 L_2\n\\vdots\nX_N L_N\n\nOutput\n\nPrint the maximum number of robots that we can keep.\n\nSample Input 1\n\n4\n2 4\n4 3\n9 3\n100 5\n\nSample Output 1\n\n3\n\nBy removing Robot 2, we can keep the other three robots.\n\nSample Input 2\n\n2\n8 20\n1 10\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n10 1\n2 1\n4 1\n6 1\n8 1\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1590, "cpu_time_ms": 118, "memory_kb": 5248}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s164772878", "group_id": "codeNet:p02797", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,s\n integer(int32), allocatable:: ans(:)\n\n read*, n,k,s\n allocate(ans(n))\n ans(:) = 1000000000\n if (s == 1000000) ans(:) = 999999999\n ans(1:k) = s\n print*, ans(:)\nend program name", "language": "Fortran", "metadata": {"date": 1587136579, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02797.html", "problem_id": "p02797", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02797/input.txt", "sample_output_relpath": "derived/input_output/data/p02797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02797/Fortran/s164772878.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s164772878", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1 2 3 4\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,s\n integer(int32), allocatable:: ans(:)\n\n read*, n,k,s\n allocate(ans(n))\n ans(:) = 1000000000\n if (s == 1000000) ans(:) = 999999999\n ans(1:k) = s\n print*, ans(:)\nend program name", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "sample_input": "4 2 3\n"}, "reference_outputs": ["1 2 3 4\n"], "source_document_id": "p02797", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s229762614", "group_id": "codeNet:p02797", "input_text": "program key2020_C\n implicit none\n integer::N,K,S\n integer::i\n read*,N,K,S\n if(K/=0)then\n write(*,\"(i0)\",advance=\"no\")S\n else\n write(*,\"(i0)\",advance=\"no\")merge(S+1,S-1,S/=10**9)\n endif\n do i=2,K\n write(*,\"(A,i0)\",advance=\"no\")\" \",S\n end do\n do i=K+1,N\n if(K==0.and.i==N)exit\n write(*,\"(A,i0)\",advance=\"no\")\" \",merge(S+1,S-1,S/=10**9)\n end do\n write(*,*)\nend program key2020_C", "language": "Fortran", "metadata": {"date": 1579379590, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02797.html", "problem_id": "p02797", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02797/input.txt", "sample_output_relpath": "derived/input_output/data/p02797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02797/Fortran/s229762614.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s229762614", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1 2 3 4\n", "input_to_evaluate": "program key2020_C\n implicit none\n integer::N,K,S\n integer::i\n read*,N,K,S\n if(K/=0)then\n write(*,\"(i0)\",advance=\"no\")S\n else\n write(*,\"(i0)\",advance=\"no\")merge(S+1,S-1,S/=10**9)\n endif\n do i=2,K\n write(*,\"(A,i0)\",advance=\"no\")\" \",S\n end do\n do i=K+1,N\n if(K==0.and.i==N)exit\n write(*,\"(A,i0)\",advance=\"no\")\" \",merge(S+1,S-1,S/=10**9)\n end do\n write(*,*)\nend program key2020_C", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "sample_input": "4 2 3\n"}, "reference_outputs": ["1 2 3 4\n"], "source_document_id": "p02797", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 54, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s313248358", "group_id": "codeNet:p02801", "input_text": "program prob53\n implicit none\n character :: c\n write(*,'(a)') char(ichar(c) + 1)\n\n stop\ncontains\nend program prob53", "language": "Fortran", "metadata": {"date": 1592610267, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02801.html", "problem_id": "p02801", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02801/input.txt", "sample_output_relpath": "derived/input_output/data/p02801/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02801/Fortran/s313248358.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s313248358", "user_id": "u478462004"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "program prob53\n implicit none\n character :: c\n write(*,'(a)') char(ichar(c) + 1)\n\n stop\ncontains\nend program prob53", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "sample_input": "a\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02801", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a lowercase English letter C that is not z. Print the letter that follows C in alphabetical order.\n\nConstraints\n\nC is a lowercase English letter that is not z.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC\n\nOutput\n\nPrint the letter that follows C in alphabetical order.\n\nSample Input 1\n\na\n\nSample Output 1\n\nb\n\na is followed by b.\n\nSample Input 2\n\ny\n\nSample Output 2\n\nz\n\ny is followed by z.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 2788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s700814718", "group_id": "codeNet:p02802", "input_text": "program answer\n implicit none\n\n integer(8) :: N, M, i, ans\n integer(8), allocatable :: p(:), T(:), un(:)\n character(2), allocatable :: S(:)\n read(*,*) N, M\n allocate(p(M))\n allocate(S(M))\n allocate(T(N))\n allocate(un(N))\n do i = 1, M\n read(*,*) p(i), S(i)\n end do\n\n T=0\n un=0\n ans=0\n do i = 1, M\n if(T(p(i))==0) then\n if(S(i)=='AC') then\n ans=ans+1\n T(p(i))=1\n else\n un(p(i))=un(p(i))+1\n T(p(i))=0\n end if\n end if\n end do\n\n write(*,*) ans, sum(un)\n\n deallocate(p, T, un, S)\n \n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1596254264, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02802/input.txt", "sample_output_relpath": "derived/input_output/data/p02802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02802/Fortran/s700814718.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700814718", "user_id": "u873780029"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "program answer\n implicit none\n\n integer(8) :: N, M, i, ans\n integer(8), allocatable :: p(:), T(:), un(:)\n character(2), allocatable :: S(:)\n read(*,*) N, M\n allocate(p(M))\n allocate(S(M))\n allocate(T(N))\n allocate(un(N))\n do i = 1, M\n read(*,*) p(i), S(i)\n end do\n\n T=0\n un=0\n ans=0\n do i = 1, M\n if(T(p(i))==0) then\n if(S(i)=='AC') then\n ans=ans+1\n T(p(i))=1\n else\n un(p(i))=un(p(i))+1\n T(p(i))=0\n end if\n end if\n end do\n\n write(*,*) ans, sum(un)\n\n deallocate(p, T, un, S)\n \n stop\n end program answer", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "sample_input": "2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p02802", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 594, "cpu_time_ms": 54, "memory_kb": 5044}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s282709244", "group_id": "codeNet:p02802", "input_text": "program ccc\nimplicit none\n\ninteger :: n, m, p, i\ncharacter(2) :: s\ninteger,allocatable,dimension(:) :: q, r\n\nread*, n, m\nallocate(q(n),r(n))\nq = 0\nr = 0\n\ndo i = 1, m\nread*, p, s\n\tif (s=='AC') then\n \tif (q(p)==0) then\n q(p) = 1\n end if\n else\n \tif (q(p)==0) then\n\t r(p) = r(p) + 1\n end if\n end if\nend do\n\ndo i = 1, n\n\tif (q(i)==0) r(i)=0\nend do\n\nprint*, sum(q), sum(r)\n\nend program", "language": "Fortran", "metadata": {"date": 1578883146, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02802/input.txt", "sample_output_relpath": "derived/input_output/data/p02802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02802/Fortran/s282709244.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s282709244", "user_id": "u039189422"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "program ccc\nimplicit none\n\ninteger :: n, m, p, i\ncharacter(2) :: s\ninteger,allocatable,dimension(:) :: q, r\n\nread*, n, m\nallocate(q(n),r(n))\nq = 0\nr = 0\n\ndo i = 1, m\nread*, p, s\n\tif (s=='AC') then\n \tif (q(p)==0) then\n q(p) = 1\n end if\n else\n \tif (q(p)==0) then\n\t r(p) = r(p) + 1\n end if\n end if\nend do\n\ndo i = 1, n\n\tif (q(i)==0) r(i)=0\nend do\n\nprint*, sum(q), sum(r)\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "sample_input": "2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p02802", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 415, "cpu_time_ms": 52, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s230227069", "group_id": "codeNet:p02802", "input_text": " PROGRAM welcomeToAtcoder\n IMPLICIT NONE\n integer(16) :: n,m\n integer(16),allocatable :: p(:),w(:)\n character(2),allocatable :: s(:)\n integer(16) :: i\n logical,allocatable :: flag(:)\n integer(16) :: ac=0,wa=0\n \n \n read*,n,m\n allocate( p(m),s(m),flag(n),w(n) )\n do i = 1,m\n read*,p(i),s(i)\n end do\n \n \n flag(:) = .true.\n w(:) = 0\n do i = 1,m\n if( flag(p(i)) )then\n if( s(i)(1:2)=='AC' )then\n ac = ac + 1\n wa = wa + w(p(i))\n flag(p(i)) = .false.\n else\n w(p(i)) = w(p(i)) + 1\n end if\n end if\n end do\n \n print*,ac,wa\n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1578882708, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02802/input.txt", "sample_output_relpath": "derived/input_output/data/p02802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02802/Fortran/s230227069.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230227069", "user_id": "u171356453"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": " PROGRAM welcomeToAtcoder\n IMPLICIT NONE\n integer(16) :: n,m\n integer(16),allocatable :: p(:),w(:)\n character(2),allocatable :: s(:)\n integer(16) :: i\n logical,allocatable :: flag(:)\n integer(16) :: ac=0,wa=0\n \n \n read*,n,m\n allocate( p(m),s(m),flag(n),w(n) )\n do i = 1,m\n read*,p(i),s(i)\n end do\n \n \n flag(:) = .true.\n w(:) = 0\n do i = 1,m\n if( flag(p(i)) )then\n if( s(i)(1:2)=='AC' )then\n ac = ac + 1\n wa = wa + w(p(i))\n flag(p(i)) = .false.\n else\n w(p(i)) = w(p(i)) + 1\n end if\n end if\n end do\n \n print*,ac,wa\n \n \n END PROGRAM", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "sample_input": "2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p02802", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 746, "cpu_time_ms": 62, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s692409083", "group_id": "codeNet:p02803", "input_text": "module mod_queue\n implicit none\n type t_node\n private\n integer :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type\n type t_queue\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: enqueue => enqueue\n procedure :: dequeue => dequeue\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n end type\ncontains\n function new_node(item) result(node)\n integer, intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n subroutine enqueue(this,item)\n class(t_queue), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n function dequeue(this) result(item)\n class(t_queue), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n item = this%head%item\n node => this%head%next\n deallocate(this%head)\n this%head => node\n if (associated(node)) then\n node%prev => null()\n else\n this%tail => null()\n end if\n this%num = this%num-1\n end\n function peek(this) result(item)\n class(t_queue), intent(in) :: this\n integer :: item\n item = this%head%item\n end\n subroutine clear(this)\n class(t_queue), intent(inout) :: this\n type(t_node), pointer :: node, next\n if (.not.associated(this%head)) return\n node => this%head\n do while (associated(node%next))\n next => node%next\n deallocate(node)\n node => next\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n integer function size_of(this)\n class(t_queue), intent(in) :: this\n size_of = this%num\n end\nend module mod_queue\nprogram maze_master\n implicit none\n integer :: h, w, a(0:21,0:21) = -1, i, j, m = 0\n integer :: di(4) = (/-1,1,0,0/), dj(4) = (/0,0,-1,1/)\n logical :: b(20,20)\n real(8) :: t0, t1\n character(20) :: s\n call cpu_time(t0)\n read(*,*) h, w\n do i = 1, h\n read(*,*) s\n do j = 1, w\n if (s(j:j) == \".\") a(i,j) = 0\n end do\n end do\n do i = 1, h\n do j = 1, w\n if (a(i,j) /= -1) then\n b = .false.\n m = max(m,bfs(i,j))\n end if\n end do\n end do\n write(*,'(i0)') m\ncontains\n integer function bfs(i,j)\n use mod_queue\n integer, intent(in) :: i, j\n integer :: k, p, q, x, y, idx\n type(t_queue) :: queue\n a(i,j) = 0\n call queue%enqueue(i*(w+1)+j)\n do while (queue%size() > 0)\n call cpu_time(t1)\n if (t1-t0 > 1.95d0) then\n write(*,'(i0)') h+w-2\n stop\n end if\n idx = queue%dequeue()\n p = idx/(w+1)\n q = idx-p*(w+1)\n b(p,q) = .true.\n do k = 1, 4\n x = p+di(k)\n y = q+dj(k)\n if (a(x,y) /= -1 .and. ((.not. b(x,y)) .or. a(x,y) > a(p,q)+1)) then\n a(x,y) = a(p,q)+1\n call queue%enqueue(x*(w+1)+y)\n end if\n end do\n end do\n bfs = maxval(a(1:h,1:w))\n end\nend program maze_master", "language": "Fortran", "metadata": {"date": 1578883205, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02803.html", "problem_id": "p02803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02803/input.txt", "sample_output_relpath": "derived/input_output/data/p02803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02803/Fortran/s692409083.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s692409083", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module mod_queue\n implicit none\n type t_node\n private\n integer :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type\n type t_queue\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: enqueue => enqueue\n procedure :: dequeue => dequeue\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n end type\ncontains\n function new_node(item) result(node)\n integer, intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n subroutine enqueue(this,item)\n class(t_queue), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n function dequeue(this) result(item)\n class(t_queue), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n item = this%head%item\n node => this%head%next\n deallocate(this%head)\n this%head => node\n if (associated(node)) then\n node%prev => null()\n else\n this%tail => null()\n end if\n this%num = this%num-1\n end\n function peek(this) result(item)\n class(t_queue), intent(in) :: this\n integer :: item\n item = this%head%item\n end\n subroutine clear(this)\n class(t_queue), intent(inout) :: this\n type(t_node), pointer :: node, next\n if (.not.associated(this%head)) return\n node => this%head\n do while (associated(node%next))\n next => node%next\n deallocate(node)\n node => next\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n integer function size_of(this)\n class(t_queue), intent(in) :: this\n size_of = this%num\n end\nend module mod_queue\nprogram maze_master\n implicit none\n integer :: h, w, a(0:21,0:21) = -1, i, j, m = 0\n integer :: di(4) = (/-1,1,0,0/), dj(4) = (/0,0,-1,1/)\n logical :: b(20,20)\n real(8) :: t0, t1\n character(20) :: s\n call cpu_time(t0)\n read(*,*) h, w\n do i = 1, h\n read(*,*) s\n do j = 1, w\n if (s(j:j) == \".\") a(i,j) = 0\n end do\n end do\n do i = 1, h\n do j = 1, w\n if (a(i,j) /= -1) then\n b = .false.\n m = max(m,bfs(i,j))\n end if\n end do\n end do\n write(*,'(i0)') m\ncontains\n integer function bfs(i,j)\n use mod_queue\n integer, intent(in) :: i, j\n integer :: k, p, q, x, y, idx\n type(t_queue) :: queue\n a(i,j) = 0\n call queue%enqueue(i*(w+1)+j)\n do while (queue%size() > 0)\n call cpu_time(t1)\n if (t1-t0 > 1.95d0) then\n write(*,'(i0)') h+w-2\n stop\n end if\n idx = queue%dequeue()\n p = idx/(w+1)\n q = idx-p*(w+1)\n b(p,q) = .true.\n do k = 1, 4\n x = p+di(k)\n y = q+dj(k)\n if (a(x,y) /= -1 .and. ((.not. b(x,y)) .or. a(x,y) > a(p,q)+1)) then\n a(x,y) = a(p,q)+1\n call queue%enqueue(x*(w+1)+y)\n end if\n end do\n end do\n bfs = maxval(a(1:h,1:w))\n end\nend program maze_master", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "sample_input": "3 3\n...\n...\n...\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02803", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3235, "cpu_time_ms": 1956, "memory_kb": 109568}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s841302490", "group_id": "codeNet:p02805", "input_text": "program ABC151F\n implicit none\n integer::N\n integer,allocatable,dimension(:,:)::xy\n real(16)::ANS\n integer::i,j,k\n read*,N\n allocate(xy(N,2))\n do i=1,N\n read*,xy(i,1),xy(i,2)\n end do\n if(N==2)then\n print\"(f0.14)\",dist(1,2)/2.0\n stop\n endif\n ANS=0\n do i=1,N-2\n do j=i+1,N-1\n do k=j+1,N\n if(abs((XY(k,1)-XY(i,1))*(XY(j,2)-XY(i,2)))==abs((XY(k,2)-XY(i,2))*(XY(j,1)-XY(i,1))))then\n ANS=max(ANS,max(dist(i,j),dist(i,k),dist(j,k))/real(2.0,16))\n endif\n ANS=max(ANS,min(R(i,j,k)/real(2.0,16),max(dist(i,j),dist(i,k),dist(j,k))/real(2,16)))\n end do\n end do\n end do\n print\"(f0.20)\",ANS\ncontains\nfunction R(i,j,k)\n integer::i,j,k\n real(16) R\n R=dist(j,k)/sqrt(1-NAI(i,j,k)**2)\nend function\nfunction dist(i,j)\n integer::i,j\n real(16)::dist\n dist=sqrt(real((XY(i,1)-XY(j,1))**2+(XY(i,2)-XY(j,2))**2,16))\nend function\nfunction NAI(i,j,k)\n integer::i,j,k\n real(16)::NAI\n NAI=real((XY(j,1)-XY(i,1))*(XY(k,1)-XY(i,1))+(XY(j,2)-XY(i,2))*(XY(k,2)-XY(i,2)),kind=16)/dist(i,j)/dist(i,k)\nend function\nend program ABC151F\n", "language": "Fortran", "metadata": {"date": 1578890566, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02805.html", "problem_id": "p02805", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02805/input.txt", "sample_output_relpath": "derived/input_output/data/p02805/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02805/Fortran/s841302490.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s841302490", "user_id": "u598073939"}, "prompt_components": {"gold_output": "0.500000000000000000\n", "input_to_evaluate": "program ABC151F\n implicit none\n integer::N\n integer,allocatable,dimension(:,:)::xy\n real(16)::ANS\n integer::i,j,k\n read*,N\n allocate(xy(N,2))\n do i=1,N\n read*,xy(i,1),xy(i,2)\n end do\n if(N==2)then\n print\"(f0.14)\",dist(1,2)/2.0\n stop\n endif\n ANS=0\n do i=1,N-2\n do j=i+1,N-1\n do k=j+1,N\n if(abs((XY(k,1)-XY(i,1))*(XY(j,2)-XY(i,2)))==abs((XY(k,2)-XY(i,2))*(XY(j,1)-XY(i,1))))then\n ANS=max(ANS,max(dist(i,j),dist(i,k),dist(j,k))/real(2.0,16))\n endif\n ANS=max(ANS,min(R(i,j,k)/real(2.0,16),max(dist(i,j),dist(i,k),dist(j,k))/real(2,16)))\n end do\n end do\n end do\n print\"(f0.20)\",ANS\ncontains\nfunction R(i,j,k)\n integer::i,j,k\n real(16) R\n R=dist(j,k)/sqrt(1-NAI(i,j,k)**2)\nend function\nfunction dist(i,j)\n integer::i,j\n real(16)::dist\n dist=sqrt(real((XY(i,1)-XY(j,1))**2+(XY(i,2)-XY(j,2))**2,16))\nend function\nfunction NAI(i,j,k)\n integer::i,j,k\n real(16)::NAI\n NAI=real((XY(j,1)-XY(i,1))*(XY(k,1)-XY(i,1))+(XY(j,2)-XY(i,2))*(XY(k,2)-XY(i,2)),kind=16)/dist(i,j)/dist(i,k)\nend function\nend program ABC151F\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "sample_input": "2\n0 0\n1 0\n"}, "reference_outputs": ["0.500000000000000000\n"], "source_document_id": "p02805", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are N points (x_i, y_i) in a two-dimensional plane.\n\nFind the minimum radius of a circle such that all the points are inside or on it.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n0 \\leq x_i \\leq 1000\n\n0 \\leq y_i \\leq 1000\n\nThe given N points are all different.\n\nThe values in input are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum radius of a circle such that all the N points are inside or on it.\n\nYour output will be considered correct if the absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n2\n0 0\n1 0\n\nSample Output 1\n\n0.500000000000000000\n\nBoth points are contained in the circle centered at (0.5,0) with a radius of 0.5.\n\nSample Input 2\n\n3\n0 0\n0 1\n1 0\n\nSample Output 2\n\n0.707106781186497524\n\nSample Input 3\n\n10\n10 9\n5 9\n2 0\n0 0\n2 7\n3 3\n2 5\n10 0\n3 7\n1 9\n\nSample Output 3\n\n6.726812023536805158\n\nIf the absolute or relative error from our answer is at most 10^{-6}, the output will be considered correct.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1193, "cpu_time_ms": 40, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s789284209", "group_id": "codeNet:p02811", "input_text": "program yen\n\n implicit none\n integer::k,x\n\n read*,k,x\n\n if(500*k>=x) then \n print*,'Yes'\n else\n print*,'No'\n end if\n\nend program yen", "language": "Fortran", "metadata": {"date": 1588534817, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Fortran/s789284209.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s789284209", "user_id": "u882765852"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program yen\n\n implicit none\n integer::k,x\n\n read*,k,x\n\n if(500*k>=x) then \n print*,'Yes'\n else\n print*,'No'\n end if\n\nend program yen", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s423565242", "group_id": "codeNet:p02811", "input_text": " PROGRAM coins\n IMPLICIT NONE\n integer(16) :: k,x\n \n \n read*,k,x\n \n if( 500*k>=x )then\n print*,'Yes'\n else\n print*,'No'\n end if\n \n \n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1578794918, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Fortran/s423565242.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s423565242", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " PROGRAM coins\n IMPLICIT NONE\n integer(16) :: k,x\n \n \n read*,k,x\n \n if( 500*k>=x )then\n print*,'Yes'\n else\n print*,'No'\n end if\n \n \n \n \n \n END PROGRAM", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s499813280", "group_id": "codeNet:p02812", "input_text": "program main\n implicit none\n integer :: n, i, l, res\n character(50) :: s\n read (*, *) n\n read (*, *) s\n l = len(trim(s))\n res = 0\n do i = 1, l - 2\n if(s(i:i + 2) == \"ABC\") res = res + 1\n end do\n write (*, \"(i0)\") res\nend program main\n", "language": "Fortran", "metadata": {"date": 1582457874, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02812.html", "problem_id": "p02812", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02812/input.txt", "sample_output_relpath": "derived/input_output/data/p02812/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02812/Fortran/s499813280.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499813280", "user_id": "u388927326"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, l, res\n character(50) :: s\n read (*, *) n\n read (*, *) s\n l = len(trim(s))\n res = 0\n do i = 1, l - 2\n if(s(i:i + 2) == \"ABC\") res = res + 1\n end do\n write (*, \"(i0)\") res\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\n\nSample Output 3\n\n5", "sample_input": "10\nZABCDBABCQ\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02812", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s738074618", "group_id": "codeNet:p02813", "input_text": "program main\n\n implicit none\n\n integer :: a, N, i, j, k, pn, qn, tmp\n integer,allocatable :: P(:), Q(:)\n \n read(*,*) N\n allocate( P(N) )\n allocate( Q(N) )\n read(*,*) P\n read(*,*) Q\n \n pn = 0 \n qn = 0 \n\n do i = 1, N\n ! kaijou\n tmp = 1\n do j = 1, N - i\n tmp = tmp * j \n end do\n a = 0\n do k = 1, i \n if ( P(k) < P(i) ) a = a + 1\n end do\n pn = pn + ( P(i) - a - 1 ) * tmp\n end do\n pn = pn + 1 \n\n do i = 1, N \n ! kaijou\n tmp = 1\n do j = 1, N - i\n tmp = tmp * j \n end do\n a = 0\n do k = 1, i\n if ( Q(k) < Q(i) ) a = a + 1\n end do\n qn = qn + ( Q(i) - a - 1 ) * tmp\n end do\n qn = qn + 1\n\n tmp = pn - qn \n print*, abs( tmp ), pn, qn\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1578714952, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02813.html", "problem_id": "p02813", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02813/input.txt", "sample_output_relpath": "derived/input_output/data/p02813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02813/Fortran/s738074618.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s738074618", "user_id": "u675314298"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n\n implicit none\n\n integer :: a, N, i, j, k, pn, qn, tmp\n integer,allocatable :: P(:), Q(:)\n \n read(*,*) N\n allocate( P(N) )\n allocate( Q(N) )\n read(*,*) P\n read(*,*) Q\n \n pn = 0 \n qn = 0 \n\n do i = 1, N\n ! kaijou\n tmp = 1\n do j = 1, N - i\n tmp = tmp * j \n end do\n a = 0\n do k = 1, i \n if ( P(k) < P(i) ) a = a + 1\n end do\n pn = pn + ( P(i) - a - 1 ) * tmp\n end do\n pn = pn + 1 \n\n do i = 1, N \n ! kaijou\n tmp = 1\n do j = 1, N - i\n tmp = tmp * j \n end do\n a = 0\n do k = 1, i\n if ( Q(k) < Q(i) ) a = a + 1\n end do\n qn = qn + ( Q(i) - a - 1 ) * tmp\n end do\n qn = qn + 1\n\n tmp = pn - qn \n print*, abs( tmp ), pn, qn\n \nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "sample_input": "3\n1 3 2\n3 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02813", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 740, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s614400594", "group_id": "codeNet:p02814", "input_text": "program semi_common_multiple\n implicit none\n integer(8):: n, m, i\n integer(8), allocatable:: a(:)\n integer(8):: gcd, lcm\n\n read*, n, m\n allocate(a(n))\n read*, a(:)\n a(:) = a(:) / 2\n ! do while(mod(a(1), 2) == 0)\n ! do i=1, n\n ! if(mod(a(i),2) /= 0)then\n ! print*, 0\n ! stop\n ! endif\n ! a(i) = a(i) / 2\n ! end do\n ! m = m / 2\n ! end do\n\n lcm = 1\n\n do i=1,n\n gcd = calc_gcd(lcm,a(i))\n lcm = lcm/gcd*a(i)\n end do\n\n print*, (m/lcm+1)/2\n\ncontains\nrecursive function calc_gcd(a,b) result(ret)\ninteger(8):: a, b, r, ret\n if (mod(a,b) == 0)then\n ret = b\n return\n end if\n ret = calc_gcd(b,mod(a,b))\nend function\nend program", "language": "Fortran", "metadata": {"date": 1580458105, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02814.html", "problem_id": "p02814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02814/input.txt", "sample_output_relpath": "derived/input_output/data/p02814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02814/Fortran/s614400594.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s614400594", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program semi_common_multiple\n implicit none\n integer(8):: n, m, i\n integer(8), allocatable:: a(:)\n integer(8):: gcd, lcm\n\n read*, n, m\n allocate(a(n))\n read*, a(:)\n a(:) = a(:) / 2\n ! do while(mod(a(1), 2) == 0)\n ! do i=1, n\n ! if(mod(a(i),2) /= 0)then\n ! print*, 0\n ! stop\n ! endif\n ! a(i) = a(i) / 2\n ! end do\n ! m = m / 2\n ! end do\n\n lcm = 1\n\n do i=1,n\n gcd = calc_gcd(lcm,a(i))\n lcm = lcm/gcd*a(i)\n end do\n\n print*, (m/lcm+1)/2\n\ncontains\nrecursive function calc_gcd(a,b) result(ret)\ninteger(8):: a, b, r, ret\n if (mod(a,b) == 0)then\n ret = b\n return\n end if\n ret = calc_gcd(b,mod(a,b))\nend function\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are a sequence A= {a_1,a_2,......a_N} of N positive even numbers, and an integer M.\n\nLet a semi-common multiple of A be a positive integer X that satisfies the following condition for every k (1 \\leq k \\leq N):\n\nThere exists a non-negative integer p such that X= a_k \\times (p+0.5).\n\nFind the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\n2 \\leq a_i \\leq 10^9\n\na_i is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nSample Input 1\n\n2 50\n6 10\n\nSample Output 1\n\n2\n\n15 = 6 \\times 2.5\n\n15 = 10 \\times 1.5\n\n45 = 6 \\times 7.5\n\n45 = 10 \\times 4.5\n\nThus, 15 and 45 are semi-common multiples of A. There are no other semi-common multiples of A between 1 and 50, so the answer is 2.\n\nSample Input 2\n\n3 100\n14 22 40\n\nSample Output 2\n\n0\n\nThe answer can be 0.\n\nSample Input 3\n\n5 1000000000\n6 6 2 6 2\n\nSample Output 3\n\n166666667", "sample_input": "2 50\n6 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02814", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are a sequence A= {a_1,a_2,......a_N} of N positive even numbers, and an integer M.\n\nLet a semi-common multiple of A be a positive integer X that satisfies the following condition for every k (1 \\leq k \\leq N):\n\nThere exists a non-negative integer p such that X= a_k \\times (p+0.5).\n\nFind the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\n2 \\leq a_i \\leq 10^9\n\na_i is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nSample Input 1\n\n2 50\n6 10\n\nSample Output 1\n\n2\n\n15 = 6 \\times 2.5\n\n15 = 10 \\times 1.5\n\n45 = 6 \\times 7.5\n\n45 = 10 \\times 4.5\n\nThus, 15 and 45 are semi-common multiples of A. There are no other semi-common multiples of A between 1 and 50, so the answer is 2.\n\nSample Input 2\n\n3 100\n14 22 40\n\nSample Output 2\n\n0\n\nThe answer can be 0.\n\nSample Input 3\n\n5 1000000000\n6 6 2 6 2\n\nSample Output 3\n\n166666667", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 781, "cpu_time_ms": 55, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s049436320", "group_id": "codeNet:p02814", "input_text": "program semi_common_multiple\n implicit none\n integer :: n, i, c, c1 = 0\n integer(8) :: m, a(100000) = 0, l = 1, k\n read(*,*) n, m\n read(*,*) a(1:n)\n k = a(1)\n do while (mod(k,2) == 0)\n k = k/2\n c1 = c1+1\n end do\n k = a(1)/k/2\n do i = 1, n\n c = 0\n do while (mod(a(i),2) == 0)\n a(i) = a(i)/2\n c = c+1\n end do\n if (c /= c1) then\n write(*,'(i0)') 0\n stop\n end if\n l = lcm(l,a(i))\n if (l > m/k) then\n write(*,'(i0)') 0\n stop\n end if\n end do\n write(*,'(i0)') (m/(l*k)+1)/2\ncontains\n integer(8) function lcm(a,b)\n integer(8), intent(in) :: a, b\n lcm = a/gcd(a,b)*b\n end\n integer(8) function gcd(a,b)\n integer(8), intent(in) :: a, b\n integer(8) :: x, y\n x = max(a,b)\n y = min(a,b)\n do while (y > 0_8)\n gcd = y\n y = mod(x,y)\n x = gcd\n end do\n end\nend program semi_common_multiple", "language": "Fortran", "metadata": {"date": 1578710001, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02814.html", "problem_id": "p02814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02814/input.txt", "sample_output_relpath": "derived/input_output/data/p02814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02814/Fortran/s049436320.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s049436320", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program semi_common_multiple\n implicit none\n integer :: n, i, c, c1 = 0\n integer(8) :: m, a(100000) = 0, l = 1, k\n read(*,*) n, m\n read(*,*) a(1:n)\n k = a(1)\n do while (mod(k,2) == 0)\n k = k/2\n c1 = c1+1\n end do\n k = a(1)/k/2\n do i = 1, n\n c = 0\n do while (mod(a(i),2) == 0)\n a(i) = a(i)/2\n c = c+1\n end do\n if (c /= c1) then\n write(*,'(i0)') 0\n stop\n end if\n l = lcm(l,a(i))\n if (l > m/k) then\n write(*,'(i0)') 0\n stop\n end if\n end do\n write(*,'(i0)') (m/(l*k)+1)/2\ncontains\n integer(8) function lcm(a,b)\n integer(8), intent(in) :: a, b\n lcm = a/gcd(a,b)*b\n end\n integer(8) function gcd(a,b)\n integer(8), intent(in) :: a, b\n integer(8) :: x, y\n x = max(a,b)\n y = min(a,b)\n do while (y > 0_8)\n gcd = y\n y = mod(x,y)\n x = gcd\n end do\n end\nend program semi_common_multiple", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are a sequence A= {a_1,a_2,......a_N} of N positive even numbers, and an integer M.\n\nLet a semi-common multiple of A be a positive integer X that satisfies the following condition for every k (1 \\leq k \\leq N):\n\nThere exists a non-negative integer p such that X= a_k \\times (p+0.5).\n\nFind the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\n2 \\leq a_i \\leq 10^9\n\na_i is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nSample Input 1\n\n2 50\n6 10\n\nSample Output 1\n\n2\n\n15 = 6 \\times 2.5\n\n15 = 10 \\times 1.5\n\n45 = 6 \\times 7.5\n\n45 = 10 \\times 4.5\n\nThus, 15 and 45 are semi-common multiples of A. There are no other semi-common multiples of A between 1 and 50, so the answer is 2.\n\nSample Input 2\n\n3 100\n14 22 40\n\nSample Output 2\n\n0\n\nThe answer can be 0.\n\nSample Input 3\n\n5 1000000000\n6 6 2 6 2\n\nSample Output 3\n\n166666667", "sample_input": "2 50\n6 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02814", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are a sequence A= {a_1,a_2,......a_N} of N positive even numbers, and an integer M.\n\nLet a semi-common multiple of A be a positive integer X that satisfies the following condition for every k (1 \\leq k \\leq N):\n\nThere exists a non-negative integer p such that X= a_k \\times (p+0.5).\n\nFind the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\n2 \\leq a_i \\leq 10^9\n\na_i is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nSample Input 1\n\n2 50\n6 10\n\nSample Output 1\n\n2\n\n15 = 6 \\times 2.5\n\n15 = 10 \\times 1.5\n\n45 = 6 \\times 7.5\n\n45 = 10 \\times 4.5\n\nThus, 15 and 45 are semi-common multiples of A. There are no other semi-common multiples of A between 1 and 50, so the answer is 2.\n\nSample Input 2\n\n3 100\n14 22 40\n\nSample Output 2\n\n0\n\nThe answer can be 0.\n\nSample Input 3\n\n5 1000000000\n6 6 2 6 2\n\nSample Output 3\n\n166666667", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 132, "memory_kb": 2012}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s103402068", "group_id": "codeNet:p02814", "input_text": "program semi_common_multiple\n implicit none\n integer :: n, i\n integer(8) :: m, a(100000) = 0, l = 1\n read(*,*) n, m\n read(*,*) a(1:n)\n do i = 1, n\n a(i) = a(i)/2\n l = lcm(l,a(i))\n if (l > m .or. mod(l,2) == 0) then\n write(*,'(i0)') 0\n stop\n end if\n end do\n write(*,'(i0)') (m/l+1)/2\ncontains\n integer(8) function lcm(a,b)\n integer(8), intent(in) :: a, b\n lcm = a/gcd(a,b)*b\n end\n integer(8) function gcd(a,b)\n integer(8), intent(in) :: a, b\n integer(8) :: x, y\n x = max(a,b)\n y = min(a,b)\n do while (y > 0_8)\n gcd = y\n y = mod(x,y)\n x = gcd\n end do\n end\nend program semi_common_multiple", "language": "Fortran", "metadata": {"date": 1578709215, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02814.html", "problem_id": "p02814", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02814/input.txt", "sample_output_relpath": "derived/input_output/data/p02814/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02814/Fortran/s103402068.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s103402068", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program semi_common_multiple\n implicit none\n integer :: n, i\n integer(8) :: m, a(100000) = 0, l = 1\n read(*,*) n, m\n read(*,*) a(1:n)\n do i = 1, n\n a(i) = a(i)/2\n l = lcm(l,a(i))\n if (l > m .or. mod(l,2) == 0) then\n write(*,'(i0)') 0\n stop\n end if\n end do\n write(*,'(i0)') (m/l+1)/2\ncontains\n integer(8) function lcm(a,b)\n integer(8), intent(in) :: a, b\n lcm = a/gcd(a,b)*b\n end\n integer(8) function gcd(a,b)\n integer(8), intent(in) :: a, b\n integer(8) :: x, y\n x = max(a,b)\n y = min(a,b)\n do while (y > 0_8)\n gcd = y\n y = mod(x,y)\n x = gcd\n end do\n end\nend program semi_common_multiple", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are a sequence A= {a_1,a_2,......a_N} of N positive even numbers, and an integer M.\n\nLet a semi-common multiple of A be a positive integer X that satisfies the following condition for every k (1 \\leq k \\leq N):\n\nThere exists a non-negative integer p such that X= a_k \\times (p+0.5).\n\nFind the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\n2 \\leq a_i \\leq 10^9\n\na_i is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nSample Input 1\n\n2 50\n6 10\n\nSample Output 1\n\n2\n\n15 = 6 \\times 2.5\n\n15 = 10 \\times 1.5\n\n45 = 6 \\times 7.5\n\n45 = 10 \\times 4.5\n\nThus, 15 and 45 are semi-common multiples of A. There are no other semi-common multiples of A between 1 and 50, so the answer is 2.\n\nSample Input 2\n\n3 100\n14 22 40\n\nSample Output 2\n\n0\n\nThe answer can be 0.\n\nSample Input 3\n\n5 1000000000\n6 6 2 6 2\n\nSample Output 3\n\n166666667", "sample_input": "2 50\n6 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02814", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are a sequence A= {a_1,a_2,......a_N} of N positive even numbers, and an integer M.\n\nLet a semi-common multiple of A be a positive integer X that satisfies the following condition for every k (1 \\leq k \\leq N):\n\nThere exists a non-negative integer p such that X= a_k \\times (p+0.5).\n\nFind the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\n2 \\leq a_i \\leq 10^9\n\na_i is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of semi-common multiples of A among the integers between 1 and M (inclusive).\n\nSample Input 1\n\n2 50\n6 10\n\nSample Output 1\n\n2\n\n15 = 6 \\times 2.5\n\n15 = 10 \\times 1.5\n\n45 = 6 \\times 7.5\n\n45 = 10 \\times 4.5\n\nThus, 15 and 45 are semi-common multiples of A. There are no other semi-common multiples of A between 1 and 50, so the answer is 2.\n\nSample Input 2\n\n3 100\n14 22 40\n\nSample Output 2\n\n0\n\nThe answer can be 0.\n\nSample Input 3\n\n5 1000000000\n6 6 2 6 2\n\nSample Output 3\n\n166666667", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 35, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s314665381", "group_id": "codeNet:p02815", "input_text": "program change_a_little_bit\n implicit none\n integer(8),parameter:: md=1000000007_8\n integer(8):: n,i,ans=0\n integer(8),allocatable:: c(:)\n\n read*,n\n allocate(c(n))\n read*,c(:)\n call merge_sort(c,1_8,n)\n print*, c(:)\n \n do i=1, n\n ans = mod(ans + mod(c(i)*mod(pow_fast(2_8,n-1,md)+mod(pow_fast(2_8,n-2,md)*(n-i),md),md),md),md)\n end do\n\n print*, mod(ans*pow_fast(2_8,n,md),md)\ncontains\n\nrecursive subroutine merge_sort(ar,fst,lst)\n integer(8):: ar(:), fst, lst, mid, tmp\n\n if (lst-fst < 2) then\n if(ar(lst) < ar(fst)) then\n tmp = ar(lst)\n ar(lst) = ar(fst)\n ar(fst) = tmp\n end if\n return\n end if\n\n mid = (fst+lst)/2\n call merge_sort(ar,fst,mid)\n call merge_sort(ar,mid+1,lst)\n call merge(ar,fst,mid,lst)\nend subroutine\n\nsubroutine merge(ar,fst,mid,lst)\n integer(8):: ar(:), fst, mid, lst\n integer(8),pointer:: tmp(:)\n integer(8):: it,il,ir\n\n allocate(tmp(lst-fst+1))\n it = 1\n il = fst\n ir = mid+1\n do while(il<=mid .and. ir<=lst)\n if (ar(il) <= ar(ir)) then\n tmp(it) = ar(il)\n il=il+1 \n else\n tmp(it) = ar(ir)\n ir=ir+1\n end if\n it=it+1\n end do\n\n if (ir > lst) then\n tmp(it:) = ar(il:mid)\n else\n tmp(it:) = ar(ir:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\nend subroutine\n\nfunction pow_fast(x,pow,md) result(ret)\n integer(8),value:: x, pow\n integer(8)::md,ret\n\n ret=1_8\n if (x==1 .or. pow==0) return\n\n do while(pow > 0_8)\n if (mod(pow,2_8) == 1_8) then\n ret = mod(ret*x,md)\n end if\n x = mod(x*x,md)\n pow = pow/2_8\n end do\n\nend function\n\n\n\nend program change_a_little_bit", "language": "Fortran", "metadata": {"date": 1581450664, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02815.html", "problem_id": "p02815", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02815/input.txt", "sample_output_relpath": "derived/input_output/data/p02815/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02815/Fortran/s314665381.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s314665381", "user_id": "u234636620"}, "prompt_components": {"gold_output": "999999993\n", "input_to_evaluate": "program change_a_little_bit\n implicit none\n integer(8),parameter:: md=1000000007_8\n integer(8):: n,i,ans=0\n integer(8),allocatable:: c(:)\n\n read*,n\n allocate(c(n))\n read*,c(:)\n call merge_sort(c,1_8,n)\n print*, c(:)\n \n do i=1, n\n ans = mod(ans + mod(c(i)*mod(pow_fast(2_8,n-1,md)+mod(pow_fast(2_8,n-2,md)*(n-i),md),md),md),md)\n end do\n\n print*, mod(ans*pow_fast(2_8,n,md),md)\ncontains\n\nrecursive subroutine merge_sort(ar,fst,lst)\n integer(8):: ar(:), fst, lst, mid, tmp\n\n if (lst-fst < 2) then\n if(ar(lst) < ar(fst)) then\n tmp = ar(lst)\n ar(lst) = ar(fst)\n ar(fst) = tmp\n end if\n return\n end if\n\n mid = (fst+lst)/2\n call merge_sort(ar,fst,mid)\n call merge_sort(ar,mid+1,lst)\n call merge(ar,fst,mid,lst)\nend subroutine\n\nsubroutine merge(ar,fst,mid,lst)\n integer(8):: ar(:), fst, mid, lst\n integer(8),pointer:: tmp(:)\n integer(8):: it,il,ir\n\n allocate(tmp(lst-fst+1))\n it = 1\n il = fst\n ir = mid+1\n do while(il<=mid .and. ir<=lst)\n if (ar(il) <= ar(ir)) then\n tmp(it) = ar(il)\n il=il+1 \n else\n tmp(it) = ar(ir)\n ir=ir+1\n end if\n it=it+1\n end do\n\n if (ir > lst) then\n tmp(it:) = ar(il:mid)\n else\n tmp(it:) = ar(ir:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\nend subroutine\n\nfunction pow_fast(x,pow,md) result(ret)\n integer(8),value:: x, pow\n integer(8)::md,ret\n\n ret=1_8\n if (x==1 .or. pow==0) return\n\n do while(pow > 0_8)\n if (mod(pow,2_8) == 1_8) then\n ret = mod(ret*x,md)\n end if\n x = mod(x*x,md)\n pow = pow/2_8\n end do\n\nend function\n\n\n\nend program change_a_little_bit", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor two sequences S and T of length N consisting of 0 and 1, let us define f(S, T) as follows:\n\nConsider repeating the following operation on S so that S will be equal to T. f(S, T) is the minimum possible total cost of those operations.\n\nChange S_i (from 0 to 1 or vice versa). The cost of this operation is D \\times C_i, where D is the number of integers j such that S_j \\neq T_j (1 \\leq j \\leq N) just before this change.\n\nThere are 2^N \\times (2^N - 1) pairs (S, T) of different sequences of length N consisting of 0 and 1. Compute the sum of f(S, T) over all of those pairs, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the sum of f(S, T), modulo (10^9+7).\n\nSample Input 1\n\n1\n1000000000\n\nSample Output 1\n\n999999993\n\nThere are two pairs (S, T) of different sequences of length 2 consisting of 0 and 1, as follows:\n\nS = (0), T = (1): by changing S_1 to 1, we can have S = T at the cost of 1000000000, so f(S, T) = 1000000000.\n\nS = (1), T = (0): by changing S_1 to 0, we can have S = T at the cost of 1000000000, so f(S, T) = 1000000000.\n\nThe sum of these is 2000000000, and we should print it modulo (10^9+7), that is, 999999993.\n\nSample Input 2\n\n2\n5 8\n\nSample Output 2\n\n124\n\nThere are 12 pairs (S, T) of different sequences of length 3 consisting of 0 and 1, which include:\n\nS = (0, 1), T = (1, 0)\n\nIn this case, if we first change S_1 to 1 then change S_2 to 0, the total cost is 5 \\times 2 + 8 = 18. We cannot have S = T at a smaller cost, so f(S, T) = 18.\n\nSample Input 3\n\n5\n52 67 72 25 79\n\nSample Output 3\n\n269312", "sample_input": "1\n1000000000\n"}, "reference_outputs": ["999999993\n"], "source_document_id": "p02815", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor two sequences S and T of length N consisting of 0 and 1, let us define f(S, T) as follows:\n\nConsider repeating the following operation on S so that S will be equal to T. f(S, T) is the minimum possible total cost of those operations.\n\nChange S_i (from 0 to 1 or vice versa). The cost of this operation is D \\times C_i, where D is the number of integers j such that S_j \\neq T_j (1 \\leq j \\leq N) just before this change.\n\nThere are 2^N \\times (2^N - 1) pairs (S, T) of different sequences of length N consisting of 0 and 1. Compute the sum of f(S, T) over all of those pairs, modulo (10^9+7).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq C_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 C_2 \\cdots C_N\n\nOutput\n\nPrint the sum of f(S, T), modulo (10^9+7).\n\nSample Input 1\n\n1\n1000000000\n\nSample Output 1\n\n999999993\n\nThere are two pairs (S, T) of different sequences of length 2 consisting of 0 and 1, as follows:\n\nS = (0), T = (1): by changing S_1 to 1, we can have S = T at the cost of 1000000000, so f(S, T) = 1000000000.\n\nS = (1), T = (0): by changing S_1 to 0, we can have S = T at the cost of 1000000000, so f(S, T) = 1000000000.\n\nThe sum of these is 2000000000, and we should print it modulo (10^9+7), that is, 999999993.\n\nSample Input 2\n\n2\n5 8\n\nSample Output 2\n\n124\n\nThere are 12 pairs (S, T) of different sequences of length 3 consisting of 0 and 1, which include:\n\nS = (0, 1), T = (1, 0)\n\nIn this case, if we first change S_1 to 1 then change S_2 to 0, the total cost is 5 \\times 2 + 8 = 18. We cannot have S = T at a smaller cost, so f(S, T) = 18.\n\nSample Input 3\n\n5\n52 67 72 25 79\n\nSample Output 3\n\n269312", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1790, "cpu_time_ms": 181, "memory_kb": 7176}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s838769126", "group_id": "codeNet:p02817", "input_text": "program example\n\timplicit none\n\n\tcharacter(100) S,T\n \n read(*,*) S,T\n \n write(*,*) trim(adjustl(trim(adjustl(T))//trim(adjustl(S))))\n\nend program example", "language": "Fortran", "metadata": {"date": 1583791221, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02817/input.txt", "sample_output_relpath": "derived/input_output/data/p02817/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02817/Fortran/s838769126.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s838769126", "user_id": "u374107737"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tcharacter(100) S,T\n \n read(*,*) S,T\n \n write(*,*) trim(adjustl(trim(adjustl(T))//trim(adjustl(S))))\n\nend program example", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "sample_input": "oder atc\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p02817", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s720695334", "group_id": "codeNet:p02817", "input_text": "program aaa\nimplicit none\n\ncharacter(200) :: s, t, ts\n\nread*, s, t\n\nts = trim(t)//trim(s)\n\nprint*, trim(ts)\n\nend program", "language": "Fortran", "metadata": {"date": 1578608525, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02817/input.txt", "sample_output_relpath": "derived/input_output/data/p02817/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02817/Fortran/s720695334.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s720695334", "user_id": "u039189422"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program aaa\nimplicit none\n\ncharacter(200) :: s, t, ts\n\nread*, s, t\n\nts = trim(t)//trim(s)\n\nprint*, trim(ts)\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "sample_input": "oder atc\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p02817", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s100066551", "group_id": "codeNet:p02818", "input_text": "! 2019.12.29\n!\n program answer\n implicit none\n integer(8) :: A,B,K\n!\n read(*,*) A,B,K\n if(A < K) then\n B = B+A-K\n A = 0\n if(B < 0) then\n B = 0\n end if\n else\n A = A-K\n end if\n write(*,*) A,B\n end program answer", "language": "Fortran", "metadata": {"date": 1577669597, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/Fortran/s100066551.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s100066551", "user_id": "u954587078"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "! 2019.12.29\n!\n program answer\n implicit none\n integer(8) :: A,B,K\n!\n read(*,*) A,B,K\n if(A < K) then\n B = B+A-K\n A = 0\n if(B < 0) then\n B = 0\n end if\n else\n A = A-K\n end if\n write(*,*) A,B\n end program answer", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 298, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s854105095", "group_id": "codeNet:p02818", "input_text": "! 2019.12.29\n!\n program answer\n implicit none\n integer(8) :: A,B,K\n!\n read(*,*) A,B,K\n if(A < K) then\n B = B+A-K\n A = 0\n else\n A = A-K\n end if\n write(*,*) A,B\n end program answer", "language": "Fortran", "metadata": {"date": 1577668223, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/Fortran/s854105095.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s854105095", "user_id": "u954587078"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "! 2019.12.29\n!\n program answer\n implicit none\n integer(8) :: A,B,K\n!\n read(*,*) A,B,K\n if(A < K) then\n B = B+A-K\n A = 0\n else\n A = A-K\n end if\n write(*,*) A,B\n end program answer", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s397764430", "group_id": "codeNet:p02819", "input_text": "PROGRAM main\n\timplicit none\n\tinteger :: x,xmax, xx\n\tread *, x\n xmax = 100000000\n do xx = x, xmax\n if (isPrimeNum(xx))then\n \tprint \"(i0)\", xx\n exit\n endif\n enddo\ncontains\n\n\tlogical pure function isPrimeNum(n)\n \tinteger, intent (in) :: n\n integer :: i, iend\n \n iend = sqrt(dble(n))+1\n if(iend == n) iend = iend-1\n \tisPrimeNum = .false.\n do i = 2 , iend\n \tif (mod(n,i)==0) return\n enddo\n \n\t isPrimeNum = .true.\n end function isPrimeNum\n\nEND PROGRAM main", "language": "Fortran", "metadata": {"date": 1591108614, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02819.html", "problem_id": "p02819", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02819/input.txt", "sample_output_relpath": "derived/input_output/data/p02819/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02819/Fortran/s397764430.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397764430", "user_id": "u310855433"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "PROGRAM main\n\timplicit none\n\tinteger :: x,xmax, xx\n\tread *, x\n xmax = 100000000\n do xx = x, xmax\n if (isPrimeNum(xx))then\n \tprint \"(i0)\", xx\n exit\n endif\n enddo\ncontains\n\n\tlogical pure function isPrimeNum(n)\n \tinteger, intent (in) :: n\n integer :: i, iend\n \n iend = sqrt(dble(n))+1\n if(iend == n) iend = iend-1\n \tisPrimeNum = .false.\n do i = 2 , iend\n \tif (mod(n,i)==0) return\n enddo\n \n\t isPrimeNum = .true.\n end function isPrimeNum\n\nEND PROGRAM main", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 550, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s328205260", "group_id": "codeNet:p02819", "input_text": "program ABC149C\n implicit none\n integer(8)::X,i,j,div_max,flg\n read(5,*)X\n\n if(X==2)then\n print'(i0)',2\n else\n do i=X,100003\n div_max=int(sqrt(real(i)))+1\n flg=0\n do j=2,div_max\n if(mod(i,j)==0)then\n flg=1\n exit\n end if\n end do\n\n if(flg==0)then\n print'(i0)',i\n exit\n end if\n end do\n end if\n\nend program ABC149C", "language": "Fortran", "metadata": {"date": 1578993002, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02819.html", "problem_id": "p02819", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02819/input.txt", "sample_output_relpath": "derived/input_output/data/p02819/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02819/Fortran/s328205260.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s328205260", "user_id": "u414699019"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "program ABC149C\n implicit none\n integer(8)::X,i,j,div_max,flg\n read(5,*)X\n\n if(X==2)then\n print'(i0)',2\n else\n do i=X,100003\n div_max=int(sqrt(real(i)))+1\n flg=0\n do j=2,div_max\n if(mod(i,j)==0)then\n flg=1\n exit\n end if\n end do\n\n if(flg==0)then\n print'(i0)',i\n exit\n end if\n end do\n end if\n\nend program ABC149C", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 513, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s079347161", "group_id": "codeNet:p02820", "input_text": "program prediction_and_restriction\n implicit none\n integer :: n, k, r, s, p, i, x = 0\n character(100000) :: t\n read(*,*) n, k\n read(*,*) r, s, p\n read(*,*) t\n do i = k+1, n\n if (t(i:i) == t(i-k:i-k)) then\n t(i:i) = 'x'\n end if\n end do\n do i = 1, n\n select case (t(i:i))\n case ('r')\n x = x+p\n case ('s')\n x = x+r\n case ('p')\n x = x+s\n end select\n end do\n write(*,'(i0)') x\nend program prediction_and_restriction", "language": "Fortran", "metadata": {"date": 1590642106, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02820.html", "problem_id": "p02820", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02820/input.txt", "sample_output_relpath": "derived/input_output/data/p02820/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02820/Fortran/s079347161.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s079347161", "user_id": "u506403362"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "program prediction_and_restriction\n implicit none\n integer :: n, k, r, s, p, i, x = 0\n character(100000) :: t\n read(*,*) n, k\n read(*,*) r, s, p\n read(*,*) t\n do i = k+1, n\n if (t(i:i) == t(i-k:i-k)) then\n t(i:i) = 'x'\n end if\n end do\n do i = 1, n\n select case (t(i:i))\n case ('r')\n x = x+p\n case ('s')\n x = x+r\n case ('p')\n x = x+s\n end select\n end do\n write(*,'(i0)') x\nend program prediction_and_restriction", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "sample_input": "5 2\n8 7 6\nrsrpr\n"}, "reference_outputs": ["27\n"], "source_document_id": "p02820", "source_text": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 462, "cpu_time_ms": 7, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s415952712", "group_id": "codeNet:p02820", "input_text": "program main\n implicit none\n integer(8) :: n, k, i, r, s, p, res\n character(100000) :: t, used\n character(1) :: using\n read (*, *) n, k\n read (*, *) r, s, p\n read (*, *) t\n res = 0\n do i = 1, n\n if (i <= k) then\n using = t(i:i)\n else\n if (t(i:i) == used(i - k:i - k)) then\n using = \"*\"\n else\n using = t(i:i)\n end if\n end if\n if (using == \"r\") then\n res = res + p\n else if (using == \"p\") then\n res = res + s\n else if (using == \"s\") then\n res = res + r\n end if\n used(i:i) = using\n end do\n write (*, \"(i0)\") res\nend program main\n", "language": "Fortran", "metadata": {"date": 1585103290, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02820.html", "problem_id": "p02820", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02820/input.txt", "sample_output_relpath": "derived/input_output/data/p02820/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02820/Fortran/s415952712.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s415952712", "user_id": "u388927326"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: n, k, i, r, s, p, res\n character(100000) :: t, used\n character(1) :: using\n read (*, *) n, k\n read (*, *) r, s, p\n read (*, *) t\n res = 0\n do i = 1, n\n if (i <= k) then\n using = t(i:i)\n else\n if (t(i:i) == used(i - k:i - k)) then\n using = \"*\"\n else\n using = t(i:i)\n end if\n end if\n if (using == \"r\") then\n res = res + p\n else if (using == \"p\") then\n res = res + s\n else if (using == \"s\") then\n res = res + r\n end if\n used(i:i) = using\n end do\n write (*, \"(i0)\") res\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "sample_input": "5 2\n8 7 6\nrsrpr\n"}, "reference_outputs": ["27\n"], "source_document_id": "p02820", "source_text": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 610, "cpu_time_ms": 3, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s766406995", "group_id": "codeNet:p02821", "input_text": "module mod_ntt\n implicit none\n integer, parameter :: intkind = 16\n integer(intkind), parameter :: modu = 1224736769_intkind, root = 3_intkind\ncontains\n function convolve(a, na, b, nb) result(res)\n integer, intent(in) :: na, nb\n integer(intkind), intent(in) :: a(0:na), b(0:nb)\n integer(intkind), allocatable :: fa(:), fb(:), f(:)\n integer(intkind) :: res(0:na + nb)\n integer :: p\n p = find_pow2(na + nb + 1)\n allocate(fa(0:p - 1), fb(0:p - 1), f(0:p - 1))\n call init(a, na, fa, p)\n call ntt(fa, p)\n call init(b, nb, fb, p)\n call ntt(fb, p)\n f = mod(fa * fb, modu)\n call ntt(f, p, .true.)\n res = f(0:na + nb)\n end\n integer function find_pow2(n) result(res)\n integer, intent(in) :: n\n res = n - 1\n res = or(res, rshift(res, 1))\n res = or(res, rshift(res, 2))\n res = or(res, rshift(res, 4))\n res = or(res, rshift(res, 8))\n res = or(res, rshift(res, 16))\n res = res + 1\n end\n subroutine init(a, n, f, p)\n integer, intent(in) :: n, p\n integer(intkind), intent(in) :: a(0:n)\n integer(intkind), intent(out) :: f(0:p - 1)\n f(0:n) = a(0:n)\n f(n + 1:p - 1) = 0\n end\n subroutine ntt(f, p, invert)\n integer, intent(in) :: p\n integer(intkind), intent(inout) :: f(0:p - 1)\n logical, optional, intent(in) :: invert\n integer(intkind) :: w, z, pz, x, y\n integer :: i, j, r, m\n logical :: inverse\n inverse = merge(invert, .false., present(invert))\n w = pow(root, (modu - 1) / p)\n if (inverse) w = inv(w)\n r = 0\n do i = 1, p - 2\n j = p / 2\n do\n r = xor(r, j)\n if (j <= r) exit\n j = j / 2\n end do\n if (i < r) call swap(f(i), f(r))\n end do\n m = 1\n do while (m < p)\n pz = 1\n z = pow(w, int(p / (2 * m), intkind))\n do i = 0, m - 1\n do j = i, p - 1, 2 * m\n x = f(j)\n y = mod(f(j + m) * pz, modu)\n f(j) = mod(x + y, modu)\n f(j + m) = modulo(x - y, modu)\n end do\n pz = mod(pz * z, modu)\n end do\n m = m * 2\n end do\n if (inverse) f = mod(f * inv(int(p, intkind)), modu)\n end\n integer(intkind) function pow(a, b) result(res)\n integer(intkind), intent(in) :: a, b\n integer(intkind) :: r, p\n res = 1\n r = b\n p = a\n do while (r > 0)\n if (btest(r, 0)) res = mod(res * p, modu)\n p = mod(p * p, modu)\n r = rshift(r, 1)\n end do\n end\n integer(intkind) function inv(a) result(res)\n integer(intkind), intent(in) :: a\n res = pow(a, modu - 2)\n end\n subroutine swap(a, b)\n integer(intkind), intent(inout) :: a, b\n a = xor(a, b)\n b = xor(a, b)\n a = xor(a, b)\n end\nend module mod_ntt\nprogram handshake\n use mod_ntt\n implicit none\n integer :: n, i, maxa\n integer, dimension(100000) :: a\n integer(8) :: m, cnt = 0, x = 0\n integer(intkind), dimension(0:100000) :: p = 0, q = 0\n integer(intkind), dimension(0:200000) :: c = 0\n read(*,*) n, m\n read(*,*) a(1:n)\n maxa = maxval(a(1:n))\n do i = 1, n\n p(a(i)) = p(a(i)) + 1\n end do\n q = p\n c(0:2 * maxa) = convolve(p(0:maxa), maxa, q(0:maxa), maxa)\n do i = 2 * maxa, 0, -1\n if (c(i) + cnt >= m) then\n x = x + (m - cnt) * i\n exit\n else\n x = x + c(i) * i\n cnt = cnt + c(i)\n end if\n end do\n write(*,'(i0)') x\nend program handshake", "language": "Fortran", "metadata": {"date": 1594356607, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02821.html", "problem_id": "p02821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02821/input.txt", "sample_output_relpath": "derived/input_output/data/p02821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02821/Fortran/s766406995.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s766406995", "user_id": "u506403362"}, "prompt_components": {"gold_output": "202\n", "input_to_evaluate": "module mod_ntt\n implicit none\n integer, parameter :: intkind = 16\n integer(intkind), parameter :: modu = 1224736769_intkind, root = 3_intkind\ncontains\n function convolve(a, na, b, nb) result(res)\n integer, intent(in) :: na, nb\n integer(intkind), intent(in) :: a(0:na), b(0:nb)\n integer(intkind), allocatable :: fa(:), fb(:), f(:)\n integer(intkind) :: res(0:na + nb)\n integer :: p\n p = find_pow2(na + nb + 1)\n allocate(fa(0:p - 1), fb(0:p - 1), f(0:p - 1))\n call init(a, na, fa, p)\n call ntt(fa, p)\n call init(b, nb, fb, p)\n call ntt(fb, p)\n f = mod(fa * fb, modu)\n call ntt(f, p, .true.)\n res = f(0:na + nb)\n end\n integer function find_pow2(n) result(res)\n integer, intent(in) :: n\n res = n - 1\n res = or(res, rshift(res, 1))\n res = or(res, rshift(res, 2))\n res = or(res, rshift(res, 4))\n res = or(res, rshift(res, 8))\n res = or(res, rshift(res, 16))\n res = res + 1\n end\n subroutine init(a, n, f, p)\n integer, intent(in) :: n, p\n integer(intkind), intent(in) :: a(0:n)\n integer(intkind), intent(out) :: f(0:p - 1)\n f(0:n) = a(0:n)\n f(n + 1:p - 1) = 0\n end\n subroutine ntt(f, p, invert)\n integer, intent(in) :: p\n integer(intkind), intent(inout) :: f(0:p - 1)\n logical, optional, intent(in) :: invert\n integer(intkind) :: w, z, pz, x, y\n integer :: i, j, r, m\n logical :: inverse\n inverse = merge(invert, .false., present(invert))\n w = pow(root, (modu - 1) / p)\n if (inverse) w = inv(w)\n r = 0\n do i = 1, p - 2\n j = p / 2\n do\n r = xor(r, j)\n if (j <= r) exit\n j = j / 2\n end do\n if (i < r) call swap(f(i), f(r))\n end do\n m = 1\n do while (m < p)\n pz = 1\n z = pow(w, int(p / (2 * m), intkind))\n do i = 0, m - 1\n do j = i, p - 1, 2 * m\n x = f(j)\n y = mod(f(j + m) * pz, modu)\n f(j) = mod(x + y, modu)\n f(j + m) = modulo(x - y, modu)\n end do\n pz = mod(pz * z, modu)\n end do\n m = m * 2\n end do\n if (inverse) f = mod(f * inv(int(p, intkind)), modu)\n end\n integer(intkind) function pow(a, b) result(res)\n integer(intkind), intent(in) :: a, b\n integer(intkind) :: r, p\n res = 1\n r = b\n p = a\n do while (r > 0)\n if (btest(r, 0)) res = mod(res * p, modu)\n p = mod(p * p, modu)\n r = rshift(r, 1)\n end do\n end\n integer(intkind) function inv(a) result(res)\n integer(intkind), intent(in) :: a\n res = pow(a, modu - 2)\n end\n subroutine swap(a, b)\n integer(intkind), intent(inout) :: a, b\n a = xor(a, b)\n b = xor(a, b)\n a = xor(a, b)\n end\nend module mod_ntt\nprogram handshake\n use mod_ntt\n implicit none\n integer :: n, i, maxa\n integer, dimension(100000) :: a\n integer(8) :: m, cnt = 0, x = 0\n integer(intkind), dimension(0:100000) :: p = 0, q = 0\n integer(intkind), dimension(0:200000) :: c = 0\n read(*,*) n, m\n read(*,*) a(1:n)\n maxa = maxval(a(1:n))\n do i = 1, n\n p(a(i)) = p(a(i)) + 1\n end do\n q = p\n c(0:2 * maxa) = convolve(p(0:maxa), maxa, q(0:maxa), maxa)\n do i = 2 * maxa, 0, -1\n if (c(i) + cnt >= m) then\n x = x + (m - cnt) * i\n exit\n else\n x = x + c(i) * i\n cnt = cnt + c(i)\n end if\n end do\n write(*,'(i0)') x\nend program handshake", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "sample_input": "5 3\n10 14 19 34 33\n"}, "reference_outputs": ["202\n"], "source_document_id": "p02821", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3296, "cpu_time_ms": 357, "memory_kb": 21988}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s479936430", "group_id": "codeNet:p02821", "input_text": "program ABC149E\n implicit none\n integer(16)::N,M\n integer(16),allocatable,dimension(:)::A,R\n integer(16)::ans,OK,NG,MD\n integer(16)::i,j\n read*,N,M\n allocate(A(N))\n read*,A\n call heapsort(N,A)\n allocate(R(200000+1))\n R=0\n do i=1,N\n R(A(i))=R(A(i))+1\n end do\n do i=2*10**5,1,-1\n R(i)=R(i)+R(i+1)\n end do\n \n OK=0;NG=A(N)*2+1\n MD=(OK+NG)/2\n do while(NG-OK>1)\n if(CNT(MD)>=M)then\n OK=MD\n else\n NG=MD\n endif\n MD=(OK+NG)/2\n end do\n\n ans=0\n do i=N,1,-1\n do j=N,1,-1\n if(A(i)+A(j)>=MD)then\n ans=ans+A(i)+A(j)\n else\n exit\n endif\n end do\n end do\n print\"(i0)\",ans-MD*(cnt(MD)-M)\ncontains\ninteger(16) function cnt(MID)\n integer(16),intent(in)::MID\n integer(16)::ii\n cnt=0\n do ii=1,N\n if(MID>A(ii))then\n cnt=cnt+R(MID-A(ii))\n else\n cnt=cnt+N\n endif\n end do\nend function\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n integer(16)::i,k,j,l\n integer(16):: t\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend program ABC149E", "language": "Fortran", "metadata": {"date": 1577683444, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02821.html", "problem_id": "p02821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02821/input.txt", "sample_output_relpath": "derived/input_output/data/p02821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02821/Fortran/s479936430.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s479936430", "user_id": "u598073939"}, "prompt_components": {"gold_output": "202\n", "input_to_evaluate": "program ABC149E\n implicit none\n integer(16)::N,M\n integer(16),allocatable,dimension(:)::A,R\n integer(16)::ans,OK,NG,MD\n integer(16)::i,j\n read*,N,M\n allocate(A(N))\n read*,A\n call heapsort(N,A)\n allocate(R(200000+1))\n R=0\n do i=1,N\n R(A(i))=R(A(i))+1\n end do\n do i=2*10**5,1,-1\n R(i)=R(i)+R(i+1)\n end do\n \n OK=0;NG=A(N)*2+1\n MD=(OK+NG)/2\n do while(NG-OK>1)\n if(CNT(MD)>=M)then\n OK=MD\n else\n NG=MD\n endif\n MD=(OK+NG)/2\n end do\n\n ans=0\n do i=N,1,-1\n do j=N,1,-1\n if(A(i)+A(j)>=MD)then\n ans=ans+A(i)+A(j)\n else\n exit\n endif\n end do\n end do\n print\"(i0)\",ans-MD*(cnt(MD)-M)\ncontains\ninteger(16) function cnt(MID)\n integer(16),intent(in)::MID\n integer(16)::ii\n cnt=0\n do ii=1,N\n if(MID>A(ii))then\n cnt=cnt+R(MID-A(ii))\n else\n cnt=cnt+N\n endif\n end do\nend function\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n integer(16)::i,k,j,l\n integer(16):: t\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend program ABC149E", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "sample_input": "5 3\n10 14 19 34 33\n"}, "reference_outputs": ["202\n"], "source_document_id": "p02821", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1825, "cpu_time_ms": 2104, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s789523957", "group_id": "codeNet:p02821", "input_text": " module m_sort\n !reference\n !https://qiita.com/cure_honey/items/29944920e8aff5651e41\n implicit none\n contains \n recursive function iqsort(ix) result(ires)\n integer(16), allocatable :: ires(:)\n integer(16), intent(in) :: ix(:)\n integer(16) :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort \n end module m_sort\n \n PROGRAM handshake\n USE m_sort\n IMPLICIT NONE\n integer(16) :: n,m\n integer(16),allocatable :: a(:),sumPow(:)\n integer(16) :: i\n \n read*,n,m\n allocate( a(n),sumPow(n*n) )\n read*,a(:)\n \n do i = 1,n\n sumPow((i-1)*n+1:i*n) = a(i) + a(1:n)\n end do\n sumPow = iqsort( sumPow )\n \n print*,sum(sumPow(n*n-m+1:n*n))\n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1577672109, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02821.html", "problem_id": "p02821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02821/input.txt", "sample_output_relpath": "derived/input_output/data/p02821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02821/Fortran/s789523957.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s789523957", "user_id": "u171356453"}, "prompt_components": {"gold_output": "202\n", "input_to_evaluate": " module m_sort\n !reference\n !https://qiita.com/cure_honey/items/29944920e8aff5651e41\n implicit none\n contains \n recursive function iqsort(ix) result(ires)\n integer(16), allocatable :: ires(:)\n integer(16), intent(in) :: ix(:)\n integer(16) :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort \n end module m_sort\n \n PROGRAM handshake\n USE m_sort\n IMPLICIT NONE\n integer(16) :: n,m\n integer(16),allocatable :: a(:),sumPow(:)\n integer(16) :: i\n \n read*,n,m\n allocate( a(n),sumPow(n*n) )\n read*,a(:)\n \n do i = 1,n\n sumPow((i-1)*n+1:i*n) = a(i) + a(1:n)\n end do\n sumPow = iqsort( sumPow )\n \n print*,sum(sumPow(n*n-m+1:n*n))\n \n END PROGRAM", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "sample_input": "5 3\n10 14 19 34 33\n"}, "reference_outputs": ["202\n"], "source_document_id": "p02821", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 966, "cpu_time_ms": 1554, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s515364157", "group_id": "codeNet:p02823", "input_text": "program prob3\n implicit none\n integer(8) :: n, a, b, ans\n read(*,*) n,a,b\n if(mod(a+b, 2) == 0) then\n ans = (b-a) / 2\n else\n ans = min(2*n - (a+b) + 1, a+b-1)\n ans = ans / 2\n end if\n write(*,*) ans\n stop\ncontains\nend program prob3", "language": "Fortran", "metadata": {"date": 1598663583, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02823.html", "problem_id": "p02823", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02823/input.txt", "sample_output_relpath": "derived/input_output/data/p02823/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02823/Fortran/s515364157.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s515364157", "user_id": "u478462004"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program prob3\n implicit none\n integer(8) :: n, a, b, ans\n read(*,*) n,a,b\n if(mod(a+b, 2) == 0) then\n ans = (b-a) / 2\n else\n ans = min(2*n - (a+b) + 1, a+b-1)\n ans = ans / 2\n end if\n write(*,*) ans\n stop\ncontains\nend program prob3", "problem_context": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "sample_input": "5 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02823", "source_text": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 275, "cpu_time_ms": 7, "memory_kb": 2832}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s306539186", "group_id": "codeNet:p02823", "input_text": " PROGRAM tableTennisTraining\n IMPLICIT NONE\n integer(16) :: n,a,b\n integer(16) :: sub,ans\n \n read*,n,a,b\n \n !base\n sub = abs( a-b )\n ans = sub/2 + (sub - (sub/2)*2)\n \n !ex\n if( a-1<=ans .and. b-1<=ans )then\n ans = max(a-1,b-1)\n end if\n \n if( n-a<=ans .and. n-b<=ans )then\n ans = max(n-a,n-b)\n end if\n \n \n \n print*,ans\n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1577590113, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02823.html", "problem_id": "p02823", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02823/input.txt", "sample_output_relpath": "derived/input_output/data/p02823/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02823/Fortran/s306539186.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s306539186", "user_id": "u171356453"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": " PROGRAM tableTennisTraining\n IMPLICIT NONE\n integer(16) :: n,a,b\n integer(16) :: sub,ans\n \n read*,n,a,b\n \n !base\n sub = abs( a-b )\n ans = sub/2 + (sub - (sub/2)*2)\n \n !ex\n if( a-1<=ans .and. b-1<=ans )then\n ans = max(a-1,b-1)\n end if\n \n if( n-a<=ans .and. n-b<=ans )then\n ans = max(n-a,n-b)\n end if\n \n \n \n print*,ans\n \n \n END PROGRAM", "problem_context": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "sample_input": "5 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02823", "source_text": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 468, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s997249369", "group_id": "codeNet:p02829", "input_text": "program prob22\n implicit none\n integer :: a,b\n\n read(*,*) a,b\n\n write(*,*) 6-a-b\n\n stop\ncontains\nend program prob22", "language": "Fortran", "metadata": {"date": 1592629302, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02829.html", "problem_id": "p02829", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02829/input.txt", "sample_output_relpath": "derived/input_output/data/p02829/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02829/Fortran/s997249369.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s997249369", "user_id": "u478462004"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program prob22\n implicit none\n integer :: a,b\n\n read(*,*) a,b\n\n write(*,*) 6-a-b\n\n stop\ncontains\nend program prob22", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "sample_input": "3\n1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02829", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2832}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s614861572", "group_id": "codeNet:p02830", "input_text": "program main\n integer :: n, i\n character(100) :: s, t\n read(*,*) n\n read(*,*) s(1:n), t(1:n)\n\n do i = 1, n\n write(*,'(a,a)', advance='no') s(i:i), t(i:i)\n end do\n write(*,*)\n\n\nend program main", "language": "Fortran", "metadata": {"date": 1584471100, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02830/input.txt", "sample_output_relpath": "derived/input_output/data/p02830/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02830/Fortran/s614861572.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s614861572", "user_id": "u940479594"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "program main\n integer :: n, i\n character(100) :: s, t\n read(*,*) n\n read(*,*) s(1:n), t(1:n)\n\n do i = 1, n\n write(*,'(a,a)', advance='no') s(i:i), t(i:i)\n end do\n write(*,*)\n\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "sample_input": "2\nip cc\n"}, "reference_outputs": ["icpc\n"], "source_document_id": "p02830", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s933107301", "group_id": "codeNet:p02830", "input_text": "program bbb\n\nimplicit none\ninteger :: n, i, j\ncharacter(200) :: s, t, st\n\nread*, n\nread*, s, t\ndo i = 1, 200\nst(i:i) = ' '\nend do\ns = trim(s)\nt = trim(t)\n\nj = 0\ndo i = 1, n\nj = j + 1\nst(j:j) = s(i:i)\nj = j + 1\nst(j:j) = t(i:i)\nend do\n\nwrite(*,*) trim(st)\n\nend program", "language": "Fortran", "metadata": {"date": 1577236609, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02830/input.txt", "sample_output_relpath": "derived/input_output/data/p02830/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02830/Fortran/s933107301.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933107301", "user_id": "u039189422"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "program bbb\n\nimplicit none\ninteger :: n, i, j\ncharacter(200) :: s, t, st\n\nread*, n\nread*, s, t\ndo i = 1, 200\nst(i:i) = ' '\nend do\ns = trim(s)\nt = trim(t)\n\nj = 0\ndo i = 1, n\nj = j + 1\nst(j:j) = s(i:i)\nj = j + 1\nst(j:j) = t(i:i)\nend do\n\nwrite(*,*) trim(st)\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "sample_input": "2\nip cc\n"}, "reference_outputs": ["icpc\n"], "source_document_id": "p02830", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 267, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s276315748", "group_id": "codeNet:p02831", "input_text": "program main\n\n implicit none\n\n integer(8) :: i, j , ii, jj\n integer(8) :: ij, k, tmp, jjtmp\n\n read(*,*) i, j\n\n if( i > j ) then\n ii = i\n jj = j\n else\n ii = j\n jj = i\n end if\n\n do\n tmp = mod(ii,jj)\n if( tmp == 0 ) then\n jjtmp = jj\n exit\n end if\n jj = tmp\n ii = jj\n end do\n\n print*, int( i*j/jjtmp )\n\nend program main", "language": "Fortran", "metadata": {"date": 1577070984, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02831.html", "problem_id": "p02831", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02831/input.txt", "sample_output_relpath": "derived/input_output/data/p02831/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02831/Fortran/s276315748.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s276315748", "user_id": "u675314298"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program main\n\n implicit none\n\n integer(8) :: i, j , ii, jj\n integer(8) :: ij, k, tmp, jjtmp\n\n read(*,*) i, j\n\n if( i > j ) then\n ii = i\n jj = j\n else\n ii = j\n jj = i\n end if\n\n do\n tmp = mod(ii,jj)\n if( tmp == 0 ) then\n jjtmp = jj\n exit\n end if\n jj = tmp\n ii = jj\n end do\n\n print*, int( i*j/jjtmp )\n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "sample_input": "2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02831", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 362, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s095037896", "group_id": "codeNet:p02832", "input_text": "program brick_break\n implicit none\n integer :: n, a(200000) = 0, i, k = 0\n read(*,*) n\n read(*,*) a(1:n)\n do i = 1, n\n if (a(i) == k+1) then\n k = k+1\n end if\n end do\n if (k == 0) k = n+1\n write(*,'(i0)') n-k\nend program brick_break", "language": "Fortran", "metadata": {"date": 1577067043, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02832/input.txt", "sample_output_relpath": "derived/input_output/data/p02832/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02832/Fortran/s095037896.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s095037896", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program brick_break\n implicit none\n integer :: n, a(200000) = 0, i, k = 0\n read(*,*) n\n read(*,*) a(1:n)\n do i = 1, n\n if (a(i) == k+1) then\n k = k+1\n end if\n end do\n if (k == 0) k = n+1\n write(*,'(i0)') n-k\nend program brick_break", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N bricks arranged in a row from left to right.\n\nThe i-th brick from the left (1 \\leq i \\leq N) has an integer a_i written on it.\n\nAmong them, you can break at most N-1 bricks of your choice.\n\nLet us say there are K bricks remaining. Snuke will be satisfied if, for each integer i (1 \\leq i \\leq K), the i-th of those brick from the left has the integer i written on it.\n\nFind the minimum number of bricks you need to break to satisfy Snuke's desire. If his desire is unsatisfiable, print -1 instead.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200000\n\n1 \\leq a_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of bricks that need to be broken to satisfy Snuke's desire, or print -1 if his desire is unsatisfiable.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n1\n\nIf we break the leftmost brick, the remaining bricks have integers 1 and 2 written on them from left to right, in which case Snuke will be satisfied.\n\nSample Input 2\n\n3\n2 2 2\n\nSample Output 2\n\n-1\n\nIn this case, there is no way to break some of the bricks to satisfy Snuke's desire.\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n7\n\nSample Input 4\n\n1\n1\n\nSample Output 4\n\n0\n\nThere may be no need to break the bricks at all.", "sample_input": "3\n2 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02832", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N bricks arranged in a row from left to right.\n\nThe i-th brick from the left (1 \\leq i \\leq N) has an integer a_i written on it.\n\nAmong them, you can break at most N-1 bricks of your choice.\n\nLet us say there are K bricks remaining. Snuke will be satisfied if, for each integer i (1 \\leq i \\leq K), the i-th of those brick from the left has the integer i written on it.\n\nFind the minimum number of bricks you need to break to satisfy Snuke's desire. If his desire is unsatisfiable, print -1 instead.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200000\n\n1 \\leq a_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of bricks that need to be broken to satisfy Snuke's desire, or print -1 if his desire is unsatisfiable.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n1\n\nIf we break the leftmost brick, the remaining bricks have integers 1 and 2 written on them from left to right, in which case Snuke will be satisfied.\n\nSample Input 2\n\n3\n2 2 2\n\nSample Output 2\n\n-1\n\nIn this case, there is no way to break some of the bricks to satisfy Snuke's desire.\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n7\n\nSample Input 4\n\n1\n1\n\nSample Output 4\n\n0\n\nThere may be no need to break the bricks at all.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 52, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s101046510", "group_id": "codeNet:p02833", "input_text": "program double_fractorial\n implicit none\n integer(8):: n, md, ans, i,div\n read*, n\n\n if (mod(n,2) /= 0) then\n print*, 0\n stop\n end if\n\n div = 10\n ans = 0\n do while(div <= n)\n ans = ans + n/div\n div = div*5\n end do\n print*, ans\nend program double_fractorial", "language": "Fortran", "metadata": {"date": 1580791194, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02833.html", "problem_id": "p02833", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02833/input.txt", "sample_output_relpath": "derived/input_output/data/p02833/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02833/Fortran/s101046510.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s101046510", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program double_fractorial\n implicit none\n integer(8):: n, md, ans, i,div\n read*, n\n\n if (mod(n,2) /= 0) then\n print*, 0\n stop\n end if\n\n div = 10\n ans = 0\n do while(div <= n)\n ans = ans + n/div\n div = div*5\n end do\n print*, ans\nend program double_fractorial", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "sample_input": "12\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02833", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s588150430", "group_id": "codeNet:p02835", "input_text": "program ABC147A\n\tinteger(8)::A,B,C\n\tread(5,*)A,B,C\n\tif(A+B+C>=22)then\n\t\tprint'(A)',\"bust\"\n\telse\n\t\tprint'(A)',\"win\"\n\tend if\nend program ABC147A\n", "language": "Fortran", "metadata": {"date": 1575857012, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/Fortran/s588150430.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s588150430", "user_id": "u414699019"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "program ABC147A\n\tinteger(8)::A,B,C\n\tread(5,*)A,B,C\n\tif(A+B+C>=22)then\n\t\tprint'(A)',\"bust\"\n\telse\n\t\tprint'(A)',\"win\"\n\tend if\nend program ABC147A\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s775418058", "group_id": "codeNet:p02836", "input_text": "program palindrome_philia\n implicit none\n character(100):: s\n integer(4):: i, ans, s_len\n\n read*, s\n ans = 0\n s_len = len_trim(s)\n \n do i = 1, s_len/2\n if (s(i:i) /= s(s_len-i+1:s_len-i+1)) ans = ans+1\n end do\n\n print*, ans\nend program palindrome_philia", "language": "Fortran", "metadata": {"date": 1580880968, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02836.html", "problem_id": "p02836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02836/input.txt", "sample_output_relpath": "derived/input_output/data/p02836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02836/Fortran/s775418058.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s775418058", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program palindrome_philia\n implicit none\n character(100):: s\n integer(4):: i, ans, s_len\n\n read*, s\n ans = 0\n s_len = len_trim(s)\n \n do i = 1, s_len/2\n if (s(i:i) /= s(s_len-i+1:s_len-i+1)) ans = ans+1\n end do\n\n print*, ans\nend program palindrome_philia", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.\n\nGiven is a string S. Find the minimum number of hugs needed to make S palindromic.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of hugs needed to make S palindromic.\n\nSample Input 1\n\nredcoder\n\nSample Output 1\n\n1\n\nFor example, we can change the fourth character to o and get a palindrome redooder.\n\nSample Input 2\n\nvvvvvv\n\nSample Output 2\n\n0\n\nWe might need no hugs at all.\n\nSample Input 3\n\nabcdabc\n\nSample Output 3\n\n2", "sample_input": "redcoder\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02836", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.\n\nGiven is a string S. Find the minimum number of hugs needed to make S palindromic.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of hugs needed to make S palindromic.\n\nSample Input 1\n\nredcoder\n\nSample Output 1\n\n1\n\nFor example, we can change the fourth character to o and get a palindrome redooder.\n\nSample Input 2\n\nvvvvvv\n\nSample Output 2\n\n0\n\nWe might need no hugs at all.\n\nSample Input 3\n\nabcdabc\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s808427525", "group_id": "codeNet:p02837", "input_text": "program HonestOrUnkind2\n implicit none\n integer xy(15,15),a(15)\n integer n,ans,i,j,x,y,bit\n logical ok\n read(*,*) n\n xy(:,:)=-1\n do i=1,n\n read(*,*) a(i)\n do j=1,a(i)\n read(*,*) x,y\n xy(i,x)=y\n end do\n end do\n do bit=1,ishft(1,n)-1\n ok=.true.\n iloop:do i=1,n\n if(iand(bit,ishft(1,i-1))==0) cycle\n do j=1,a(i)\n if((xy(i,j)/=-1).and.(iand(bit,ishft(i,j-1))/=xy(i,j))) then\n ok=.false.\n exit iloop\n end if\n end do\n end do iloop\n if(ok) then\n ans=max(ans,popcnt(bit))\n end if\n end do\n print*,ans\nend program HonestOrUnkind2\n", "language": "Fortran", "metadata": {"date": 1576093307, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02837.html", "problem_id": "p02837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02837/input.txt", "sample_output_relpath": "derived/input_output/data/p02837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02837/Fortran/s808427525.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s808427525", "user_id": "u432137002"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program HonestOrUnkind2\n implicit none\n integer xy(15,15),a(15)\n integer n,ans,i,j,x,y,bit\n logical ok\n read(*,*) n\n xy(:,:)=-1\n do i=1,n\n read(*,*) a(i)\n do j=1,a(i)\n read(*,*) x,y\n xy(i,x)=y\n end do\n end do\n do bit=1,ishft(1,n)-1\n ok=.true.\n iloop:do i=1,n\n if(iand(bit,ishft(1,i-1))==0) cycle\n do j=1,a(i)\n if((xy(i,j)/=-1).and.(iand(bit,ishft(i,j-1))/=xy(i,j))) then\n ok=.false.\n exit iloop\n end if\n end do\n end do iloop\n if(ok) then\n ans=max(ans,popcnt(bit))\n end if\n end do\n print*,ans\nend program HonestOrUnkind2\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "sample_input": "3\n1\n2 1\n1\n1 1\n1\n2 0\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02837", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 651, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s195430866", "group_id": "codeNet:p02838", "input_text": "program xor_sum4\n implicit none\n integer(8),parameter:: md = 1000000007\n integer(4):: i,j,k\n integer(4):: n\n integer(8),allocatable::a(:), total_bits(:)\n integer(8):: ans=0\n \n read*, n\n allocate(a(n))\n allocate(total_bits(0:100), source=0_8)\n read*,a(:)\n\n do i=1,n\n do j=0,100\n if (btest(a(i),j)) total_bits(j) = total_bits(j) + 1\n end do\n end do\n \n do i=0,100\n ans = mod(ans + mod(mod(lshift(total_bits(i)*(n-total_bits(i)),i),md),md),md)\n end do\n\n print*, ans\n\nend program xor_sum4", "language": "Fortran", "metadata": {"date": 1580973736, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/Fortran/s195430866.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195430866", "user_id": "u234636620"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program xor_sum4\n implicit none\n integer(8),parameter:: md = 1000000007\n integer(4):: i,j,k\n integer(4):: n\n integer(8),allocatable::a(:), total_bits(:)\n integer(8):: ans=0\n \n read*, n\n allocate(a(n))\n allocate(total_bits(0:100), source=0_8)\n read*,a(:)\n\n do i=1,n\n do j=0,100\n if (btest(a(i),j)) total_bits(j) = total_bits(j) + 1\n end do\n end do\n \n do i=0,100\n ans = mod(ans + mod(mod(lshift(total_bits(i)*(n-total_bits(i)),i),md),md),md)\n end do\n\n print*, ans\n\nend program xor_sum4", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 566, "cpu_time_ms": 257, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s961291809", "group_id": "codeNet:p02839", "input_text": "module mod_bitset\n implicit none\n integer, private, parameter :: address_bits_per_word = 6\n integer, private, parameter :: bits_per_word = lshift(1, address_bits_per_word)\n integer, private, parameter :: bit_index_mask = bits_per_word - 1\n integer(8), private, parameter :: word_mask = -1\n type t_bitset\n integer(8), private, allocatable :: words(:) ! 0-indexed, [start, end)\n integer, private :: words_in_use = 0\n contains\n procedure, private :: flip0\n procedure, private :: flip1\n generic :: flip => flip0, flip1\n procedure, private :: set0\n procedure, private :: set1\n procedure, private :: setval0\n procedure, private :: setval1\n generic :: set => set0, set1, setval0, setval1\n procedure, private :: clear0\n procedure, private :: clear1\n procedure, private :: clear2\n generic :: clear => clear0, clear1, clear2\n procedure, private :: get0\n procedure, private :: get1\n generic :: get => get0, get1\n procedure :: next_set_bit => next_set_bit\n procedure :: next_clear_bit => next_clear_bit\n procedure :: previous_set_bit => previous_set_bit\n procedure :: previous_clear_bit => previous_clear_bit\n procedure :: length => length\n procedure :: is_empty => is_empty\n procedure :: is_not_empty => is_not_empty\n procedure :: intersects => intersects\n procedure :: cardinality => cardinality\n procedure :: and => and0\n procedure :: or => or0\n procedure :: xor => xor0\n procedure :: and_not => and_not0\n procedure :: size => size0\n end type\n interface bitset\n module procedure :: newb0, newb3\n end interface bitset\n interface slshift\n module procedure :: slshift0, slshift1\n end interface slshift\n interface urshift\n module procedure :: urshift0, urshift1\n end interface urshift\ncontains\n integer function slshift0(i, n) result(res)\n integer, intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 31)\n res = lshift(i, m)\n end\n integer(8) function slshift1(i, n) result(res)\n integer(8), intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 63)\n res = lshift(i, m)\n end\n integer function urshift0(i, n) result(res)\n integer, intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 31)\n if (m == 0) then\n res = i\n else\n res = rshift(ibclr(rshift(i, 1), 31), m - 1)\n end if\n end\n integer(8) function urshift1(i, n) result(res)\n integer(8), intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 63)\n if (m == 0) then\n res = i\n else\n res = rshift(ibclr(rshift(i, 1), 63), m - 1)\n end if\n end\n integer function number_of_leading_zeros(i) result(res)\n integer(8), intent(in) :: i\n integer :: x\n if (i == 0) then\n res = 64\n return\n end if\n res = 1\n x = int(urshift(i, 32))\n if (x == 0) then\n res = res + 32\n x = int(i)\n end if\n if (urshift(x, 16) == 0) then\n res = res + 16\n x = lshift(x, 16)\n end if\n if (urshift(x, 24) == 0) then\n res = res + 8\n x = lshift(x, 8)\n end if\n if (urshift(x, 28) == 0) then\n res = res + 4\n x = lshift(x, 4)\n end if\n if (urshift(x, 30) == 0) then\n res = res + 2\n x = lshift(x, 2)\n end if\n res = res - urshift(x, 31)\n end\n integer function number_of_trailing_zeros(i) result(res)\n integer(8), intent(in) :: i\n integer :: x, y\n if (i == 0) then\n res = 64\n return\n end if\n res = 63\n y = int(i)\n if (y /= 0) then\n res = res - 32\n x = y\n else\n x = int(urshift(i, 32))\n end if\n y = lshift(x, 16)\n if (y /= 0) then\n res = res - 16\n x = y\n end if\n if (y /= 0) then\n res = res - 8\n x = y\n end if\n if (y /= 0) then\n res = res - 4\n x = y\n end if\n if (y /= 0) then\n res = res - 2\n x = y\n end if\n res = res - urshift(lshift(x, 1), 31)\n end\n integer function words_index(bit_index) result(res)\n integer, intent(in) :: bit_index\n res = rshift(bit_index, address_bits_per_word)\n end\n subroutine assert(flag, message)\n logical, intent(in) :: flag\n character(*), intent(in), optional :: message\n if (flag) return\n write(*,*) \"*** Error occurred ***\"\n if (present(message)) write(*,'(a)') message\n stop\n end\n subroutine check_invariants(this)\n type(t_bitset), intent(in) :: this\n integer :: u, n\n u = this%words_in_use\n n = size(this%words)\n if (u /= 0) call assert(this%words(u - 1) /= 0, \"At check_invariants() (1)\")\n call assert(u >= 0 .and. u <= n, \"At check_invariants() (2)\")\n if (u /= n) call assert(this%words(u) == 0, \"At check_invariants() (3)\")\n end\n subroutine recalculate_words_in_use(this)\n type(t_bitset), intent(inout) :: this\n integer :: i\n do i = this%words_in_use - 1, 0, -1\n if (this%words(i) /= 0) then\n this%words_in_use = i + 1\n return\n end if\n end do\n this%words_in_use = 0\n end\n subroutine init_words(this, nbits)\n type(t_bitset), intent(inout) :: this\n integer, intent(in) :: nbits\n if (allocated(this%words)) deallocate(this%words)\n allocate(this%words(0:words_index(nbits - 1)))\n this%words = 0\n end\n type(t_bitset) function newb0() result(res)\n call init_words(res, bits_per_word)\n end\n type(t_bitset) function newb1(nbits) result(res)\n integer, intent(in) :: nbits\n call assert(nbits >= 0, \"nbits < 0 at newb1()\")\n call init_words(res, nbits)\n end\n type(t_bitset) function newb2(words) result(res)\n integer(8), intent(in) :: words(:)\n allocate(res%words(0:size(words) - 1))\n res%words = words\n res%words_in_use = size(words)\n call check_invariants(res)\n end\n type(t_bitset) function newb3(longs) result(res)\n integer(8), intent(in) :: longs(:)\n integer :: i\n do i = size(longs), 1, -1\n if (longs(i) /= 0) then\n res = newb2(longs(1:i))\n return\n end if\n end do\n res = newb0()\n end\n subroutine ensure_capacity(this, words_required)\n type(t_bitset), intent(inout) :: this\n integer, intent(in) :: words_required\n integer :: request\n integer(8), allocatable :: copy(:)\n if (size(this%words) >= words_required) return\n request = max(2 * size(this%words), words_required)\n allocate(copy(size(this%words)))\n copy = this%words\n deallocate(this%words)\n allocate(this%words(0:request - 1))\n this%words = 0\n this%words(0:size(copy) - 1) = copy\n end\n subroutine expand_to(this, word_index)\n type(t_bitset), intent(inout) :: this\n integer, intent(in) :: word_index\n integer :: words_required\n words_required = word_index + 1\n if (this%words_in_use < words_required) then\n call ensure_capacity(this, words_required)\n this%words_in_use = words_required\n end if\n end\n subroutine check_range(from_index, to_index)\n integer, intent(in) :: from_index, to_index\n call assert(0 <= from_index .and. from_index <= to_index, \"At check_range()\")\n end\n subroutine flip0(this, bit_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at flip0()\")\n word_index = words_index(bit_index)\n call expand_to(this, word_index)\n this%words(word_index) = xor(this%words(word_index), slshift(1_8, bit_index))\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine flip1(this, from_index, to_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index\n integer :: start_word_index, end_word_index, idx\n integer(8) :: first_word_mask, last_word_mask\n call check_range(from_index, to_index)\n if (from_index == to_index) return\n start_word_index = words_index(from_index)\n end_word_index = words_index(to_index - 1)\n call expand_to(this, end_word_index)\n first_word_mask = slshift(word_mask, from_index)\n last_word_mask = urshift(word_mask, -to_index)\n if (start_word_index == end_word_index) then\n idx = start_word_index\n this%words(idx) = xor(this%words(idx), and(first_word_mask, last_word_mask))\n else\n idx = start_word_index\n this%words(idx) = xor(this%words(idx), first_word_mask)\n do idx = start_word_index + 1, end_word_index - 1\n this%words(idx) = xor(this%words(idx), word_mask)\n end do\n idx = end_word_index\n this%words(idx) = xor(this%words(idx), last_word_mask)\n end if\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine set0(this, bit_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at set0()\")\n word_index = words_index(bit_index)\n call expand_to(this, word_index)\n this%words(word_index) = or(this%words(word_index), slshift(1_8, bit_index))\n call check_invariants(this)\n end\n subroutine clear0(this, bit_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at clear0()\")\n word_index = words_index(bit_index)\n if (word_index >= this%words_in_use) return\n this%words(word_index) = and(this%words(word_index), not(slshift(1_8, bit_index)))\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine setval0(this, bit_index, val)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n logical, intent(in) :: val\n if (val) then\n call set0(this, bit_index)\n else\n call clear0(this, bit_index)\n end if\n end\n subroutine set1(this, from_index, to_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index\n integer :: start_word_index, end_word_index, idx\n integer(8) :: first_word_mask, last_word_mask\n call check_range(from_index, to_index)\n if (from_index == to_index) return\n start_word_index = words_index(from_index)\n end_word_index = words_index(to_index - 1)\n call expand_to(this, end_word_index)\n first_word_mask = slshift(word_mask, from_index)\n last_word_mask = urshift(word_mask, -to_index)\n if (start_word_index == end_word_index) then\n idx = start_word_index\n this%words(idx) = or(this%words(idx), and(first_word_mask, last_word_mask))\n else\n idx = start_word_index\n this%words(idx) = or(this%words(idx), first_word_mask)\n do idx = start_word_index + 1, end_word_index - 1\n this%words(idx) = word_mask\n end do\n idx = end_word_index\n this%words(idx) = or(this%words(idx), last_word_mask)\n end if\n call check_invariants(this)\n end\n subroutine clear1(this, from_index, to_index_)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index_\n integer :: to_index\n integer :: start_word_index, end_word_index, idx\n integer(8) :: first_word_mask, last_word_mask\n to_index = to_index_\n call check_range(from_index, to_index)\n if (from_index == to_index) return\n start_word_index = words_index(from_index)\n if (start_word_index >= this%words_in_use) return\n end_word_index = words_index(to_index - 1)\n if (end_word_index >= this%words_in_use) then\n to_index = length(this)\n end_word_index = this%words_in_use - 1\n end if\n first_word_mask = slshift(word_mask, from_index)\n last_word_mask = urshift(word_mask, -to_index)\n if (start_word_index == end_word_index) then\n idx = start_word_index\n this%words(idx) = and(this%words(idx), not(and(first_word_mask, last_word_mask)))\n else\n idx = start_word_index\n this%words(idx) = and(this%words(idx), not(first_word_mask))\n do idx = start_word_index + 1, end_word_index - 1\n this%words(idx) = 0\n end do\n idx = end_word_index\n this%words(idx) = and(this%words(idx), not(last_word_mask))\n end if\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine setval1(this, from_index, to_index, val)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index\n logical, intent(in) :: val\n if (val) then\n call set1(this, from_index, to_index)\n else\n call clear1(this, from_index, to_index)\n end if\n end\n subroutine clear2(this)\n class(t_bitset), intent(out) :: this\n this%words(0:this%words_in_use - 1) = 0\n this%words_in_use = 0\n end\n logical function get0(this, bit_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at get0()\")\n call check_invariants(this)\n word_index = words_index(bit_index)\n if (word_index >= this%words_in_use) then\n res = .false.\n return\n end if\n res = and(this%words(word_index), slshift(1_8, bit_index)) /= 0\n end\n type(t_bitset) function get1(this, from_index, to_index_) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index, to_index_\n integer :: to_index, len\n integer :: target_words, source_index, idx\n logical :: word_aligned\n integer(8) :: last_word_mask\n to_index = to_index_\n call check_range(from_index, to_index)\n call check_invariants(this)\n len = length(this)\n if (len <= from_index .or. from_index == to_index) then\n res = newb0()\n return\n end if\n if (to_index > len) to_index = len\n res = newb1(to_index - from_index)\n target_words = words_index(to_index - from_index - 1) + 1\n source_index = words_index(from_index)\n word_aligned = and(from_index, bit_index_mask) == 0\n do idx = 0, target_words - 2\n if (word_aligned) then\n res%words(idx) = this%words(source_index)\n else\n res%words(idx) = or(urshift(this%words(source_index), from_index), slshift(this%words(source_index + 1), -from_index))\n end if\n source_index = source_index + 1\n end do\n last_word_mask = urshift(word_mask, -to_index)\n if (and(to_index - 1, bit_index_mask) < and(from_index, bit_index_mask)) then\n res%words(target_words - 1) = or(urshift(this%words(source_index), from_index), &\n slshift(and(this%words(source_index + 1), last_word_mask), -from_index))\n else\n res%words(target_words - 1) = urshift(and(this%words(source_index), last_word_mask), from_index)\n end if\n res%words_in_use = target_words\n call recalculate_words_in_use(res)\n call check_invariants(res)\n end\n integer function next_set_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n call assert(from_index >= 0, \"from_index < 0 at next_set_bit()\")\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = -1\n return\n end if\n word = and(this%words(u), slshift(word_mask, from_index))\n do\n if (word /= 0) then\n res = (u * bits_per_word) + number_of_trailing_zeros(word)\n return\n end if\n u = u + 1\n if (u == this%words_in_use) then\n res = -1\n return\n end if\n word = this%words(u)\n end do\n end\n integer function next_clear_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n call assert(from_index >= 0, \"from_index < 0 at next_clear_bit()\")\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = from_index\n return\n end if\n word = and(not(this%words(u)), slshift(word_mask, from_index))\n do\n if (word /= 0) then\n res = (u * bits_per_word) + number_of_trailing_zeros(word)\n return\n end if\n u = u + 1\n if (u == this%words_in_use) then\n res = this%words_in_use * bits_per_word\n return\n end if\n word = not(this%words(u))\n end do\n end\n integer function previous_set_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n if (from_index < 0) then\n call assert(from_index == -1, \"from_index < -1 at previous_set_bit()\")\n res = -1\n return\n end if\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = length(this) - 1\n return\n end if\n word = and(this%words(u), urshift(word_mask, -(from_index + 1)))\n do\n if (word /= 0) then\n res = (u + 1) * bits_per_word - 1 - number_of_leading_zeros(word)\n return\n end if\n if (u == 0) then\n res = -1\n return\n end if\n u = u - 1\n word = this%words(u)\n end do\n end\n integer function previous_clear_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n if (from_index < 0) then\n call assert(from_index == -1, \"from_index < -1 at previous_clear_bit()\")\n res = -1\n return\n end if\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = from_index\n return\n end if\n word = and(not(this%words(u)), urshift(word_mask, -(from_index + 1)))\n do\n if (word /= 0) then\n res = (u + 1) * bits_per_word - 1 - number_of_leading_zeros(word)\n return\n end if\n if (u == 0) then\n res = -1\n return\n end if\n u = u - 1\n word = not(this%words(u))\n end do\n end\n integer function length(this) result(res)\n class(t_bitset), intent(in) :: this\n integer :: u, n\n u = this%words_in_use\n if (u == 0) then\n res = 0\n else\n n = number_of_leading_zeros(this%words(u - 1))\n res = bits_per_word * (u - 1) + (bits_per_word - n)\n end if\n end\n logical function is_empty(this) result(res)\n class(t_bitset), intent(in) :: this\n res = this%words_in_use == 0\n end\n logical function is_not_empty(this) result(res)\n class(t_bitset), intent(in) :: this\n res = this%words_in_use > 0\n end\n logical function intersects(this, other) result(res)\n class(t_bitset), intent(in) :: this\n type(t_bitset), intent(in) :: other\n integer :: m, i\n m = min(this%words_in_use, other%words_in_use)\n do i = m, 0, -1\n if (and(this%words(i), other%words(i)) /= 0) then\n res = .true.\n end if\n end do\n res = .false.\n end\n integer function cardinality(this) result(res)\n class(t_bitset), intent(in) :: this\n res = sum(popcnt(this%words(0:this%words_in_use - 1)))\n end\n subroutine and0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: i\n do while (this%words_in_use > other%words_in_use)\n this%words_in_use = this%words_in_use - 1\n this%words(this%words_in_use) = 0\n end do\n do i = 0, this%words_in_use - 1\n this%words(i) = and(this%words(i), other%words(i))\n end do\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine or0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: u, i\n u = min(this%words_in_use, other%words_in_use)\n do i = 0, u - 1\n this%words(i) = or(this%words(i), other%words(i))\n end do\n if (u < other%words_in_use) then\n call ensure_capacity(this, other%words_in_use)\n this%words_in_use = other%words_in_use\n this%words(u:this%words_in_use - 1) = other%words(u:other%words_in_use - 1)\n end if\n call check_invariants(this)\n end\n subroutine xor0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: u, i\n u = min(this%words_in_use, other%words_in_use)\n do i = 0, u - 1\n this%words(i) = xor(this%words(i), other%words(i))\n end do\n if (u < other%words_in_use) then\n call ensure_capacity(this, other%words_in_use)\n this%words_in_use = other%words_in_use\n this%words(u:this%words_in_use - 1) = other%words(u:other%words_in_use - 1)\n end if\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine and_not0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: u, i\n u = min(this%words_in_use, other%words_in_use)\n do i = 0, u - 1\n this%words(i) = and(this%words(i), not(other%words(i)))\n end do\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n integer function size0(this) result(res)\n class(t_bitset), intent(in) :: this\n res = size(this%words) * bits_per_word\n end\nend module mod_bitset\nprogram balanced_path\n use mod_bitset\n implicit none\n integer :: h, w, a(80, 80) = 0, b(80) = 0, i, j, k\n type(t_bitset) :: dp(80, 80)\n read(*,*) h, w\n do i = 1, h\n read(*,*) a(i, 1:w)\n end do\n do i = 1, h\n read(*,*) b(1:w)\n a(i, 1:w) = abs(a(i, 1:w)-b(1:w))\n end do\n do i = 1, h\n do j = 1, w\n dp(i, j) = bitset()\n end do\n end do\n call dp(1, 1)%set(a(1, 1))\n do i = 1, h\n do j = 1, w\n if (i > 1) then\n do k = 0, 12800\n if (dp(i - 1, j)%get(k)) then\n call dp(i, j)%set(abs(k - a(i, j)))\n call dp(i, j)%set(k + a(i, j))\n end if\n end do\n end if\n if (j > 1) then\n do k = 0, 12800\n if (dp(i, j - 1)%get(k)) then\n call dp(i, j)%set(abs(k - a(i, j)))\n call dp(i, j)%set(k + a(i, j))\n end if\n end do\n end if\n end do\n end do\n do k = 0, 12800\n if (dp(h, w)%get(k)) then\n write(*,'(i0)') k\n stop\n end if\n end do\nend program balanced_path", "language": "Fortran", "metadata": {"date": 1592550471, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02839.html", "problem_id": "p02839", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02839/input.txt", "sample_output_relpath": "derived/input_output/data/p02839/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02839/Fortran/s961291809.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961291809", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "module mod_bitset\n implicit none\n integer, private, parameter :: address_bits_per_word = 6\n integer, private, parameter :: bits_per_word = lshift(1, address_bits_per_word)\n integer, private, parameter :: bit_index_mask = bits_per_word - 1\n integer(8), private, parameter :: word_mask = -1\n type t_bitset\n integer(8), private, allocatable :: words(:) ! 0-indexed, [start, end)\n integer, private :: words_in_use = 0\n contains\n procedure, private :: flip0\n procedure, private :: flip1\n generic :: flip => flip0, flip1\n procedure, private :: set0\n procedure, private :: set1\n procedure, private :: setval0\n procedure, private :: setval1\n generic :: set => set0, set1, setval0, setval1\n procedure, private :: clear0\n procedure, private :: clear1\n procedure, private :: clear2\n generic :: clear => clear0, clear1, clear2\n procedure, private :: get0\n procedure, private :: get1\n generic :: get => get0, get1\n procedure :: next_set_bit => next_set_bit\n procedure :: next_clear_bit => next_clear_bit\n procedure :: previous_set_bit => previous_set_bit\n procedure :: previous_clear_bit => previous_clear_bit\n procedure :: length => length\n procedure :: is_empty => is_empty\n procedure :: is_not_empty => is_not_empty\n procedure :: intersects => intersects\n procedure :: cardinality => cardinality\n procedure :: and => and0\n procedure :: or => or0\n procedure :: xor => xor0\n procedure :: and_not => and_not0\n procedure :: size => size0\n end type\n interface bitset\n module procedure :: newb0, newb3\n end interface bitset\n interface slshift\n module procedure :: slshift0, slshift1\n end interface slshift\n interface urshift\n module procedure :: urshift0, urshift1\n end interface urshift\ncontains\n integer function slshift0(i, n) result(res)\n integer, intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 31)\n res = lshift(i, m)\n end\n integer(8) function slshift1(i, n) result(res)\n integer(8), intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 63)\n res = lshift(i, m)\n end\n integer function urshift0(i, n) result(res)\n integer, intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 31)\n if (m == 0) then\n res = i\n else\n res = rshift(ibclr(rshift(i, 1), 31), m - 1)\n end if\n end\n integer(8) function urshift1(i, n) result(res)\n integer(8), intent(in) :: i\n integer, intent(in) :: n\n integer :: m\n m = and(n, 63)\n if (m == 0) then\n res = i\n else\n res = rshift(ibclr(rshift(i, 1), 63), m - 1)\n end if\n end\n integer function number_of_leading_zeros(i) result(res)\n integer(8), intent(in) :: i\n integer :: x\n if (i == 0) then\n res = 64\n return\n end if\n res = 1\n x = int(urshift(i, 32))\n if (x == 0) then\n res = res + 32\n x = int(i)\n end if\n if (urshift(x, 16) == 0) then\n res = res + 16\n x = lshift(x, 16)\n end if\n if (urshift(x, 24) == 0) then\n res = res + 8\n x = lshift(x, 8)\n end if\n if (urshift(x, 28) == 0) then\n res = res + 4\n x = lshift(x, 4)\n end if\n if (urshift(x, 30) == 0) then\n res = res + 2\n x = lshift(x, 2)\n end if\n res = res - urshift(x, 31)\n end\n integer function number_of_trailing_zeros(i) result(res)\n integer(8), intent(in) :: i\n integer :: x, y\n if (i == 0) then\n res = 64\n return\n end if\n res = 63\n y = int(i)\n if (y /= 0) then\n res = res - 32\n x = y\n else\n x = int(urshift(i, 32))\n end if\n y = lshift(x, 16)\n if (y /= 0) then\n res = res - 16\n x = y\n end if\n if (y /= 0) then\n res = res - 8\n x = y\n end if\n if (y /= 0) then\n res = res - 4\n x = y\n end if\n if (y /= 0) then\n res = res - 2\n x = y\n end if\n res = res - urshift(lshift(x, 1), 31)\n end\n integer function words_index(bit_index) result(res)\n integer, intent(in) :: bit_index\n res = rshift(bit_index, address_bits_per_word)\n end\n subroutine assert(flag, message)\n logical, intent(in) :: flag\n character(*), intent(in), optional :: message\n if (flag) return\n write(*,*) \"*** Error occurred ***\"\n if (present(message)) write(*,'(a)') message\n stop\n end\n subroutine check_invariants(this)\n type(t_bitset), intent(in) :: this\n integer :: u, n\n u = this%words_in_use\n n = size(this%words)\n if (u /= 0) call assert(this%words(u - 1) /= 0, \"At check_invariants() (1)\")\n call assert(u >= 0 .and. u <= n, \"At check_invariants() (2)\")\n if (u /= n) call assert(this%words(u) == 0, \"At check_invariants() (3)\")\n end\n subroutine recalculate_words_in_use(this)\n type(t_bitset), intent(inout) :: this\n integer :: i\n do i = this%words_in_use - 1, 0, -1\n if (this%words(i) /= 0) then\n this%words_in_use = i + 1\n return\n end if\n end do\n this%words_in_use = 0\n end\n subroutine init_words(this, nbits)\n type(t_bitset), intent(inout) :: this\n integer, intent(in) :: nbits\n if (allocated(this%words)) deallocate(this%words)\n allocate(this%words(0:words_index(nbits - 1)))\n this%words = 0\n end\n type(t_bitset) function newb0() result(res)\n call init_words(res, bits_per_word)\n end\n type(t_bitset) function newb1(nbits) result(res)\n integer, intent(in) :: nbits\n call assert(nbits >= 0, \"nbits < 0 at newb1()\")\n call init_words(res, nbits)\n end\n type(t_bitset) function newb2(words) result(res)\n integer(8), intent(in) :: words(:)\n allocate(res%words(0:size(words) - 1))\n res%words = words\n res%words_in_use = size(words)\n call check_invariants(res)\n end\n type(t_bitset) function newb3(longs) result(res)\n integer(8), intent(in) :: longs(:)\n integer :: i\n do i = size(longs), 1, -1\n if (longs(i) /= 0) then\n res = newb2(longs(1:i))\n return\n end if\n end do\n res = newb0()\n end\n subroutine ensure_capacity(this, words_required)\n type(t_bitset), intent(inout) :: this\n integer, intent(in) :: words_required\n integer :: request\n integer(8), allocatable :: copy(:)\n if (size(this%words) >= words_required) return\n request = max(2 * size(this%words), words_required)\n allocate(copy(size(this%words)))\n copy = this%words\n deallocate(this%words)\n allocate(this%words(0:request - 1))\n this%words = 0\n this%words(0:size(copy) - 1) = copy\n end\n subroutine expand_to(this, word_index)\n type(t_bitset), intent(inout) :: this\n integer, intent(in) :: word_index\n integer :: words_required\n words_required = word_index + 1\n if (this%words_in_use < words_required) then\n call ensure_capacity(this, words_required)\n this%words_in_use = words_required\n end if\n end\n subroutine check_range(from_index, to_index)\n integer, intent(in) :: from_index, to_index\n call assert(0 <= from_index .and. from_index <= to_index, \"At check_range()\")\n end\n subroutine flip0(this, bit_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at flip0()\")\n word_index = words_index(bit_index)\n call expand_to(this, word_index)\n this%words(word_index) = xor(this%words(word_index), slshift(1_8, bit_index))\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine flip1(this, from_index, to_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index\n integer :: start_word_index, end_word_index, idx\n integer(8) :: first_word_mask, last_word_mask\n call check_range(from_index, to_index)\n if (from_index == to_index) return\n start_word_index = words_index(from_index)\n end_word_index = words_index(to_index - 1)\n call expand_to(this, end_word_index)\n first_word_mask = slshift(word_mask, from_index)\n last_word_mask = urshift(word_mask, -to_index)\n if (start_word_index == end_word_index) then\n idx = start_word_index\n this%words(idx) = xor(this%words(idx), and(first_word_mask, last_word_mask))\n else\n idx = start_word_index\n this%words(idx) = xor(this%words(idx), first_word_mask)\n do idx = start_word_index + 1, end_word_index - 1\n this%words(idx) = xor(this%words(idx), word_mask)\n end do\n idx = end_word_index\n this%words(idx) = xor(this%words(idx), last_word_mask)\n end if\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine set0(this, bit_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at set0()\")\n word_index = words_index(bit_index)\n call expand_to(this, word_index)\n this%words(word_index) = or(this%words(word_index), slshift(1_8, bit_index))\n call check_invariants(this)\n end\n subroutine clear0(this, bit_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at clear0()\")\n word_index = words_index(bit_index)\n if (word_index >= this%words_in_use) return\n this%words(word_index) = and(this%words(word_index), not(slshift(1_8, bit_index)))\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine setval0(this, bit_index, val)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: bit_index\n logical, intent(in) :: val\n if (val) then\n call set0(this, bit_index)\n else\n call clear0(this, bit_index)\n end if\n end\n subroutine set1(this, from_index, to_index)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index\n integer :: start_word_index, end_word_index, idx\n integer(8) :: first_word_mask, last_word_mask\n call check_range(from_index, to_index)\n if (from_index == to_index) return\n start_word_index = words_index(from_index)\n end_word_index = words_index(to_index - 1)\n call expand_to(this, end_word_index)\n first_word_mask = slshift(word_mask, from_index)\n last_word_mask = urshift(word_mask, -to_index)\n if (start_word_index == end_word_index) then\n idx = start_word_index\n this%words(idx) = or(this%words(idx), and(first_word_mask, last_word_mask))\n else\n idx = start_word_index\n this%words(idx) = or(this%words(idx), first_word_mask)\n do idx = start_word_index + 1, end_word_index - 1\n this%words(idx) = word_mask\n end do\n idx = end_word_index\n this%words(idx) = or(this%words(idx), last_word_mask)\n end if\n call check_invariants(this)\n end\n subroutine clear1(this, from_index, to_index_)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index_\n integer :: to_index\n integer :: start_word_index, end_word_index, idx\n integer(8) :: first_word_mask, last_word_mask\n to_index = to_index_\n call check_range(from_index, to_index)\n if (from_index == to_index) return\n start_word_index = words_index(from_index)\n if (start_word_index >= this%words_in_use) return\n end_word_index = words_index(to_index - 1)\n if (end_word_index >= this%words_in_use) then\n to_index = length(this)\n end_word_index = this%words_in_use - 1\n end if\n first_word_mask = slshift(word_mask, from_index)\n last_word_mask = urshift(word_mask, -to_index)\n if (start_word_index == end_word_index) then\n idx = start_word_index\n this%words(idx) = and(this%words(idx), not(and(first_word_mask, last_word_mask)))\n else\n idx = start_word_index\n this%words(idx) = and(this%words(idx), not(first_word_mask))\n do idx = start_word_index + 1, end_word_index - 1\n this%words(idx) = 0\n end do\n idx = end_word_index\n this%words(idx) = and(this%words(idx), not(last_word_mask))\n end if\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine setval1(this, from_index, to_index, val)\n class(t_bitset), intent(inout) :: this\n integer, intent(in) :: from_index, to_index\n logical, intent(in) :: val\n if (val) then\n call set1(this, from_index, to_index)\n else\n call clear1(this, from_index, to_index)\n end if\n end\n subroutine clear2(this)\n class(t_bitset), intent(out) :: this\n this%words(0:this%words_in_use - 1) = 0\n this%words_in_use = 0\n end\n logical function get0(this, bit_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: bit_index\n integer :: word_index\n call assert(bit_index >= 0, \"bit_index < 0 at get0()\")\n call check_invariants(this)\n word_index = words_index(bit_index)\n if (word_index >= this%words_in_use) then\n res = .false.\n return\n end if\n res = and(this%words(word_index), slshift(1_8, bit_index)) /= 0\n end\n type(t_bitset) function get1(this, from_index, to_index_) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index, to_index_\n integer :: to_index, len\n integer :: target_words, source_index, idx\n logical :: word_aligned\n integer(8) :: last_word_mask\n to_index = to_index_\n call check_range(from_index, to_index)\n call check_invariants(this)\n len = length(this)\n if (len <= from_index .or. from_index == to_index) then\n res = newb0()\n return\n end if\n if (to_index > len) to_index = len\n res = newb1(to_index - from_index)\n target_words = words_index(to_index - from_index - 1) + 1\n source_index = words_index(from_index)\n word_aligned = and(from_index, bit_index_mask) == 0\n do idx = 0, target_words - 2\n if (word_aligned) then\n res%words(idx) = this%words(source_index)\n else\n res%words(idx) = or(urshift(this%words(source_index), from_index), slshift(this%words(source_index + 1), -from_index))\n end if\n source_index = source_index + 1\n end do\n last_word_mask = urshift(word_mask, -to_index)\n if (and(to_index - 1, bit_index_mask) < and(from_index, bit_index_mask)) then\n res%words(target_words - 1) = or(urshift(this%words(source_index), from_index), &\n slshift(and(this%words(source_index + 1), last_word_mask), -from_index))\n else\n res%words(target_words - 1) = urshift(and(this%words(source_index), last_word_mask), from_index)\n end if\n res%words_in_use = target_words\n call recalculate_words_in_use(res)\n call check_invariants(res)\n end\n integer function next_set_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n call assert(from_index >= 0, \"from_index < 0 at next_set_bit()\")\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = -1\n return\n end if\n word = and(this%words(u), slshift(word_mask, from_index))\n do\n if (word /= 0) then\n res = (u * bits_per_word) + number_of_trailing_zeros(word)\n return\n end if\n u = u + 1\n if (u == this%words_in_use) then\n res = -1\n return\n end if\n word = this%words(u)\n end do\n end\n integer function next_clear_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n call assert(from_index >= 0, \"from_index < 0 at next_clear_bit()\")\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = from_index\n return\n end if\n word = and(not(this%words(u)), slshift(word_mask, from_index))\n do\n if (word /= 0) then\n res = (u * bits_per_word) + number_of_trailing_zeros(word)\n return\n end if\n u = u + 1\n if (u == this%words_in_use) then\n res = this%words_in_use * bits_per_word\n return\n end if\n word = not(this%words(u))\n end do\n end\n integer function previous_set_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n if (from_index < 0) then\n call assert(from_index == -1, \"from_index < -1 at previous_set_bit()\")\n res = -1\n return\n end if\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = length(this) - 1\n return\n end if\n word = and(this%words(u), urshift(word_mask, -(from_index + 1)))\n do\n if (word /= 0) then\n res = (u + 1) * bits_per_word - 1 - number_of_leading_zeros(word)\n return\n end if\n if (u == 0) then\n res = -1\n return\n end if\n u = u - 1\n word = this%words(u)\n end do\n end\n integer function previous_clear_bit(this, from_index) result(res)\n class(t_bitset), intent(in) :: this\n integer, intent(in) :: from_index\n integer :: u\n integer(8) :: word\n if (from_index < 0) then\n call assert(from_index == -1, \"from_index < -1 at previous_clear_bit()\")\n res = -1\n return\n end if\n call check_invariants(this)\n u = words_index(from_index)\n if (u >= this%words_in_use) then\n res = from_index\n return\n end if\n word = and(not(this%words(u)), urshift(word_mask, -(from_index + 1)))\n do\n if (word /= 0) then\n res = (u + 1) * bits_per_word - 1 - number_of_leading_zeros(word)\n return\n end if\n if (u == 0) then\n res = -1\n return\n end if\n u = u - 1\n word = not(this%words(u))\n end do\n end\n integer function length(this) result(res)\n class(t_bitset), intent(in) :: this\n integer :: u, n\n u = this%words_in_use\n if (u == 0) then\n res = 0\n else\n n = number_of_leading_zeros(this%words(u - 1))\n res = bits_per_word * (u - 1) + (bits_per_word - n)\n end if\n end\n logical function is_empty(this) result(res)\n class(t_bitset), intent(in) :: this\n res = this%words_in_use == 0\n end\n logical function is_not_empty(this) result(res)\n class(t_bitset), intent(in) :: this\n res = this%words_in_use > 0\n end\n logical function intersects(this, other) result(res)\n class(t_bitset), intent(in) :: this\n type(t_bitset), intent(in) :: other\n integer :: m, i\n m = min(this%words_in_use, other%words_in_use)\n do i = m, 0, -1\n if (and(this%words(i), other%words(i)) /= 0) then\n res = .true.\n end if\n end do\n res = .false.\n end\n integer function cardinality(this) result(res)\n class(t_bitset), intent(in) :: this\n res = sum(popcnt(this%words(0:this%words_in_use - 1)))\n end\n subroutine and0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: i\n do while (this%words_in_use > other%words_in_use)\n this%words_in_use = this%words_in_use - 1\n this%words(this%words_in_use) = 0\n end do\n do i = 0, this%words_in_use - 1\n this%words(i) = and(this%words(i), other%words(i))\n end do\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine or0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: u, i\n u = min(this%words_in_use, other%words_in_use)\n do i = 0, u - 1\n this%words(i) = or(this%words(i), other%words(i))\n end do\n if (u < other%words_in_use) then\n call ensure_capacity(this, other%words_in_use)\n this%words_in_use = other%words_in_use\n this%words(u:this%words_in_use - 1) = other%words(u:other%words_in_use - 1)\n end if\n call check_invariants(this)\n end\n subroutine xor0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: u, i\n u = min(this%words_in_use, other%words_in_use)\n do i = 0, u - 1\n this%words(i) = xor(this%words(i), other%words(i))\n end do\n if (u < other%words_in_use) then\n call ensure_capacity(this, other%words_in_use)\n this%words_in_use = other%words_in_use\n this%words(u:this%words_in_use - 1) = other%words(u:other%words_in_use - 1)\n end if\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n subroutine and_not0(this, other)\n class(t_bitset), intent(inout) :: this\n type(t_bitset), intent(in) :: other\n integer :: u, i\n u = min(this%words_in_use, other%words_in_use)\n do i = 0, u - 1\n this%words(i) = and(this%words(i), not(other%words(i)))\n end do\n call recalculate_words_in_use(this)\n call check_invariants(this)\n end\n integer function size0(this) result(res)\n class(t_bitset), intent(in) :: this\n res = size(this%words) * bits_per_word\n end\nend module mod_bitset\nprogram balanced_path\n use mod_bitset\n implicit none\n integer :: h, w, a(80, 80) = 0, b(80) = 0, i, j, k\n type(t_bitset) :: dp(80, 80)\n read(*,*) h, w\n do i = 1, h\n read(*,*) a(i, 1:w)\n end do\n do i = 1, h\n read(*,*) b(1:w)\n a(i, 1:w) = abs(a(i, 1:w)-b(1:w))\n end do\n do i = 1, h\n do j = 1, w\n dp(i, j) = bitset()\n end do\n end do\n call dp(1, 1)%set(a(1, 1))\n do i = 1, h\n do j = 1, w\n if (i > 1) then\n do k = 0, 12800\n if (dp(i - 1, j)%get(k)) then\n call dp(i, j)%set(abs(k - a(i, j)))\n call dp(i, j)%set(k + a(i, j))\n end if\n end do\n end if\n if (j > 1) then\n do k = 0, 12800\n if (dp(i, j - 1)%get(k)) then\n call dp(i, j)%set(abs(k - a(i, j)))\n call dp(i, j)%set(k + a(i, j))\n end if\n end do\n end if\n end do\n end do\n do k = 0, 12800\n if (dp(h, w)%get(k)) then\n write(*,'(i0)') k\n stop\n end if\n end do\nend program balanced_path", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "sample_input": "2 2\n1 2\n3 4\n3 4\n2 1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02839", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 21897, "cpu_time_ms": 1547, "memory_kb": 10684}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s771593183", "group_id": "codeNet:p02841", "input_text": "program sample\n\tinteger ::a,b,c,d\n read(*,*) a,b\n read(*,*) c,d\n if (d==1) then\n \twrite(*,*) 1\n else\n \twrite(*,*) 0\n end if\n stop\nend program sample\n\n", "language": "Fortran", "metadata": {"date": 1592632101, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02841.html", "problem_id": "p02841", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02841/input.txt", "sample_output_relpath": "derived/input_output/data/p02841/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02841/Fortran/s771593183.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771593183", "user_id": "u323210830"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "program sample\n\tinteger ::a,b,c,d\n read(*,*) a,b\n read(*,*) c,d\n if (d==1) then\n \twrite(*,*) 1\n else\n \twrite(*,*) 0\n end if\n stop\nend program sample\n\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.\n\nIntegers M_1, D_1, M_2, and D_2 will be given as input.\n\nIt is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nDetermine whether the date 2019-M_1-D_1 is the last day of a month.\n\nConstraints\n\nBoth 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.\n\nThe date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM_1 D_1\nM_2 D_2\n\nOutput\n\nIf the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.\n\nSample Input 1\n\n11 16\n11 17\n\nSample Output 1\n\n0\n\nNovember 16 is not the last day of a month.\n\nSample Input 2\n\n11 30\n12 1\n\nSample Output 2\n\n1\n\nNovember 30 is the last day of November.", "sample_input": "11 16\n11 17\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02841", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.\n\nIntegers M_1, D_1, M_2, and D_2 will be given as input.\n\nIt is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nDetermine whether the date 2019-M_1-D_1 is the last day of a month.\n\nConstraints\n\nBoth 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.\n\nThe date 2019-M_2-D_2 follows 2019-M_1-D_1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM_1 D_1\nM_2 D_2\n\nOutput\n\nIf the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.\n\nSample Input 1\n\n11 16\n11 17\n\nSample Output 1\n\n0\n\nNovember 16 is not the last day of a month.\n\nSample Input 2\n\n11 30\n12 1\n\nSample Output 2\n\n1\n\nNovember 30 is the last day of November.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2852}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s871635601", "group_id": "codeNet:p02842", "input_text": "program sample\n implicit none\n real(8)::x,y,z\n integer(8) :: a,b,c,i,j,m,n,k,a1,b1,c1\n \n \n \n read(*,*) n\n\n if (mod(n*100,108)==0)then\n write(*,*) n*100/108\n else \n a=1+int(n/1.08)\n if (a<(n+1)/1.08)then\n write(*,*)a\n else\n write(*,*)':('\n end if\n end if\n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1592079548, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02842.html", "problem_id": "p02842", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02842/input.txt", "sample_output_relpath": "derived/input_output/data/p02842/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02842/Fortran/s871635601.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s871635601", "user_id": "u713568912"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "program sample\n implicit none\n real(8)::x,y,z\n integer(8) :: a,b,c,i,j,m,n,k,a1,b1,c1\n \n \n \n read(*,*) n\n\n if (mod(n*100,108)==0)then\n write(*,*) n*100/108\n else \n a=1+int(n/1.08)\n if (a<(n+1)/1.08)then\n write(*,*)a\n else\n write(*,*)':('\n end if\n end if\n stop\nend program sample\n \n\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "sample_input": "432\n"}, "reference_outputs": ["400\n"], "source_document_id": "p02842", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s548178181", "group_id": "codeNet:p02845", "input_text": "program colorful_hats_2\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer :: n, a(100000) = 0, i, c(3) = 0, j\n integer(8) :: ans = 1_8, m\n read(*,*) n\n read(*,*) a(1:n)\n do i = 1, n\n m = 0_8\n do j = 1, 3\n if (a(i) == c(j)) m = m+1_8\n end do\n ans = mod(ans*m,md)\n do j = 1, 3\n if (a(i) == c(j)) then\n c(j) = c(j)+1\n exit\n end if\n end do\n end do\n write(*,'(i0)') ans\nend program colorful_hats_2", "language": "Fortran", "metadata": {"date": 1575254230, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02845.html", "problem_id": "p02845", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02845/input.txt", "sample_output_relpath": "derived/input_output/data/p02845/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02845/Fortran/s548178181.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s548178181", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program colorful_hats_2\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer :: n, a(100000) = 0, i, c(3) = 0, j\n integer(8) :: ans = 1_8, m\n read(*,*) n\n read(*,*) a(1:n)\n do i = 1, n\n m = 0_8\n do j = 1, 3\n if (a(i) == c(j)) m = m+1_8\n end do\n ans = mod(ans*m,md)\n do j = 1, 3\n if (a(i) == c(j)) then\n c(j) = c(j)+1\n exit\n end if\n end do\n end do\n write(*,'(i0)') ans\nend program colorful_hats_2", "problem_context": "Score: 500 points\n\nProblem Statement\n\nN people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.\n\nThe person numbered i says:\n\n\"In front of me, exactly A_i people are wearing hats with the same color as mine.\"\n\nAssuming that all these statements are correct, find the number of possible combinations of colors of the N people's hats.\n\nSince the count can be enormous, compute it modulo 1000000007.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A_i \\leq N-1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint the number of possible combinations of colors of the N people's hats, modulo 1000000007.\n\nSample Input 1\n\n6\n0 1 2 3 4 5\n\nSample Output 1\n\n3\n\nWe have three possible combinations, as follows:\n\nRed, Red, Red, Red, Red, Red\n\nBlue, Blue, Blue, Blue, Blue, Blue\n\nGreen, Green, Green, Green, Green, Green\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n54\n0 0 1 0 1 2 1 2 3 2 3 3 4 4 5 4 6 5 7 8 5 6 6 7 7 8 8 9 9 10 10 11 9 12 10 13 14 11 11 12 12 13 13 14 14 15 15 15 16 16 16 17 17 17\n\nSample Output 3\n\n115295190", "sample_input": "6\n0 1 2 3 4 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02845", "source_text": "Score: 500 points\n\nProblem Statement\n\nN people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.\n\nThe person numbered i says:\n\n\"In front of me, exactly A_i people are wearing hats with the same color as mine.\"\n\nAssuming that all these statements are correct, find the number of possible combinations of colors of the N people's hats.\n\nSince the count can be enormous, compute it modulo 1000000007.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A_i \\leq N-1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint the number of possible combinations of colors of the N people's hats, modulo 1000000007.\n\nSample Input 1\n\n6\n0 1 2 3 4 5\n\nSample Output 1\n\n3\n\nWe have three possible combinations, as follows:\n\nRed, Red, Red, Red, Red, Red\n\nBlue, Blue, Blue, Blue, Blue, Blue\n\nGreen, Green, Green, Green, Green, Green\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n54\n0 0 1 0 1 2 1 2 3 2 3 3 4 4 5 4 6 5 7 8 5 6 6 7 7 8 8 9 9 10 10 11 9 12 10 13 14 11 11 12 12 13 13 14 14 15 15 15 16 16 16 17 17 17\n\nSample Output 3\n\n115295190", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s260695177", "group_id": "codeNet:p02846", "input_text": " PROGRAM run\n IMPLICIT NONE\n INTEGER(16) :: a1,a2,b1,b2,t1,t2\n INTEGER(16) :: iter,sub,len1,len2,s,l,pos1,pos2\n INTEGER(16) :: piyo,i,ans\n \n read*,t1,t2\n read*,a1,a2\n read*,b1,b2\n \n \n len1 = t1*a1 + t2*a2\n len2 = t1*b1 + t2*b2\n s = min( len1,len2 )\n l = max( len1,len2 )\n \n sub = l - s\n \n if( sub==0 )then\n print*,'infinity'\n stop\n end if\n iter = s / sub + 1\n \n pos1 = 0;pos2 = 0;ans = 0\n piyo = 3\n do i = 1,iter\n pos1 = pos1 + t1*a1\n pos2 = pos2 + t1*b1\n if( pos2 > pos1 )then\n if(piyo==1) ans = ans + 1\n piyo = 2\n else\n if(piyo==2) ans = ans + 1\n piyo = 1\n end if\n \n \n pos1 = pos1 + t2*a2\n pos2 = pos2 + t2*b2\n if( pos2 > pos1 )then\n if(piyo==1) ans = ans + 1\n piyo = 2\n else\n if(piyo==2) ans = ans + 1\n piyo = 1\n end if\n end do\n \n print*,ans\n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1575257014, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02846.html", "problem_id": "p02846", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02846/input.txt", "sample_output_relpath": "derived/input_output/data/p02846/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02846/Fortran/s260695177.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s260695177", "user_id": "u171356453"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": " PROGRAM run\n IMPLICIT NONE\n INTEGER(16) :: a1,a2,b1,b2,t1,t2\n INTEGER(16) :: iter,sub,len1,len2,s,l,pos1,pos2\n INTEGER(16) :: piyo,i,ans\n \n read*,t1,t2\n read*,a1,a2\n read*,b1,b2\n \n \n len1 = t1*a1 + t2*a2\n len2 = t1*b1 + t2*b2\n s = min( len1,len2 )\n l = max( len1,len2 )\n \n sub = l - s\n \n if( sub==0 )then\n print*,'infinity'\n stop\n end if\n iter = s / sub + 1\n \n pos1 = 0;pos2 = 0;ans = 0\n piyo = 3\n do i = 1,iter\n pos1 = pos1 + t1*a1\n pos2 = pos2 + t1*b1\n if( pos2 > pos1 )then\n if(piyo==1) ans = ans + 1\n piyo = 2\n else\n if(piyo==2) ans = ans + 1\n piyo = 1\n end if\n \n \n pos1 = pos1 + t2*a2\n pos2 = pos2 + t2*b2\n if( pos2 > pos1 )then\n if(piyo==1) ans = ans + 1\n piyo = 2\n else\n if(piyo==2) ans = ans + 1\n piyo = 1\n end if\n end do\n \n print*,ans\n \n \n \n END PROGRAM", "problem_context": "Score: 600 points\n\nProblem Statement\n\nTakahashi and Aoki are training for long-distance races in an infinitely long straight course running from west to east.\n\nThey start simultaneously at the same point and moves as follows towards the east:\n\nTakahashi runs A_1 meters per minute for the first T_1 minutes, then runs at A_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever.\n\nAoki runs B_1 meters per minute for the first T_1 minutes, then runs at B_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever.\n\nHow many times will Takahashi and Aoki meet each other, that is, come to the same point? We do not count the start of the run. If they meet infinitely many times, report that fact.\n\nConstraints\n\n1 \\leq T_i \\leq 100000\n\n1 \\leq A_i \\leq 10^{10}\n\n1 \\leq B_i \\leq 10^{10}\n\nA_1 \\neq B_1\n\nA_2 \\neq B_2\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT_1 T_2\nA_1 A_2\nB_1 B_2\n\nOutput\n\nPrint the number of times Takahashi and Aoki will meet each other.\n\nIf they meet infinitely many times, print infinity instead.\n\nSample Input 1\n\n1 2\n10 10\n12 4\n\nSample Output 1\n\n1\n\nThey will meet just once, \\frac{4}{3} minutes after they start, at \\frac{40}{3} meters from where they start.\n\nSample Input 2\n\n100 1\n101 101\n102 1\n\nSample Output 2\n\ninfinity\n\nThey will meet 101, 202, 303, 404, 505, 606, ... minutes after they start, that is, they will meet infinitely many times.\n\nSample Input 3\n\n12000 15700\n3390000000 3810000000\n5550000000 2130000000\n\nSample Output 3\n\n113\n\nThe values in input may not fit into a 32-bit integer type.", "sample_input": "1 2\n10 10\n12 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02846", "source_text": "Score: 600 points\n\nProblem Statement\n\nTakahashi and Aoki are training for long-distance races in an infinitely long straight course running from west to east.\n\nThey start simultaneously at the same point and moves as follows towards the east:\n\nTakahashi runs A_1 meters per minute for the first T_1 minutes, then runs at A_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever.\n\nAoki runs B_1 meters per minute for the first T_1 minutes, then runs at B_2 meters per minute for the subsequent T_2 minutes, and alternates between these two modes forever.\n\nHow many times will Takahashi and Aoki meet each other, that is, come to the same point? We do not count the start of the run. If they meet infinitely many times, report that fact.\n\nConstraints\n\n1 \\leq T_i \\leq 100000\n\n1 \\leq A_i \\leq 10^{10}\n\n1 \\leq B_i \\leq 10^{10}\n\nA_1 \\neq B_1\n\nA_2 \\neq B_2\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT_1 T_2\nA_1 A_2\nB_1 B_2\n\nOutput\n\nPrint the number of times Takahashi and Aoki will meet each other.\n\nIf they meet infinitely many times, print infinity instead.\n\nSample Input 1\n\n1 2\n10 10\n12 4\n\nSample Output 1\n\n1\n\nThey will meet just once, \\frac{4}{3} minutes after they start, at \\frac{40}{3} meters from where they start.\n\nSample Input 2\n\n100 1\n101 101\n102 1\n\nSample Output 2\n\ninfinity\n\nThey will meet 101, 202, 303, 404, 505, 606, ... minutes after they start, that is, they will meet infinitely many times.\n\nSample Input 3\n\n12000 15700\n3390000000 3810000000\n5550000000 2130000000\n\nSample Output 3\n\n113\n\nThe values in input may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1093, "cpu_time_ms": 2103, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s943454728", "group_id": "codeNet:p02847", "input_text": "program sample\n\timplicit none\n character(len=3) :: a\n \n read(*,*) a\n \n if (a=='SUN') then\n \twrite(*,*) 7\n else if (a=='MON') then \n write(*,*) 6\n else if (a=='TUE') then \n write(*,*) 5 \n else if (a=='WED') then \n write(*,*) 4 \n else if (a=='THU') then \n write(*,*) 3\n else if (a=='FRI') then \n write(*,*) 2\n else\n \twrite(*,*) 1\n end if \n stop\nend program sample\n\n\n\n", "language": "Fortran", "metadata": {"date": 1592633903, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02847.html", "problem_id": "p02847", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02847/input.txt", "sample_output_relpath": "derived/input_output/data/p02847/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02847/Fortran/s943454728.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943454728", "user_id": "u323210830"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program sample\n\timplicit none\n character(len=3) :: a\n \n read(*,*) a\n \n if (a=='SUN') then\n \twrite(*,*) 7\n else if (a=='MON') then \n write(*,*) 6\n else if (a=='TUE') then \n write(*,*) 5 \n else if (a=='WED') then \n write(*,*) 4 \n else if (a=='THU') then \n write(*,*) 3\n else if (a=='FRI') then \n write(*,*) 2\n else\n \twrite(*,*) 1\n end if \n stop\nend program sample\n\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "sample_input": "SAT\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02847", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is a string S representing the day of the week today.\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT, for Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday, respectively.\n\nAfter how many days is the next Sunday (tomorrow or later)?\n\nConstraints\n\nS is SUN, MON, TUE, WED, THU, FRI, or SAT.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of days before the next Sunday.\n\nSample Input 1\n\nSAT\n\nSample Output 1\n\n1\n\nIt is Saturday today, and tomorrow will be Sunday.\n\nSample Input 2\n\nSUN\n\nSample Output 2\n\n7\n\nIt is Sunday today, and seven days later, it will be Sunday again.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2852}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s341695441", "group_id": "codeNet:p02848", "input_text": "program b\n implicit none\n integer :: N, l, i\n character(10000) :: S\n\n read(*, *) N\n read(*, *) S\n\n l = len_trim(S)\n\n do i = 1, l\n S(i:i) = achar(mod(ichar(S(i:i)) - 65 + N, 26) + 65)\n end do\n \n write(*, '(a)') trim(S)\n\nend program b", "language": "Fortran", "metadata": {"date": 1577329048, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02848.html", "problem_id": "p02848", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02848/input.txt", "sample_output_relpath": "derived/input_output/data/p02848/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02848/Fortran/s341695441.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s341695441", "user_id": "u161693347"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "program b\n implicit none\n integer :: N, l, i\n character(10000) :: S\n\n read(*, *) N\n read(*, *) S\n\n l = len_trim(S)\n\n do i = 1, l\n S(i:i) = achar(mod(ichar(S(i:i)) - 65 + N, 26) + 65)\n end do\n \n write(*, '(a)') trim(S)\n\nend program b", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "sample_input": "2\nABCXYZ\n"}, "reference_outputs": ["CDEZAB\n"], "source_document_id": "p02848", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 269, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s679917339", "group_id": "codeNet:p02848", "input_text": "program main\n integer::n,i,j,k,ans,le\n !integer,allocatable::\n character(10000)::s\nread(*,*)n\n\nread(*,*)s\nle=len(s)\n!write(*,*) le\ndo i=1,n\n do j=1,le\n select case(s(j:j))\n case('A')\n s(j:j)='B'\n case('B')\n s(j:j)='C'\n case('C')\n s(j:j)='D'\n case('D')\n s(j:j)='E'\n case('E')\n s(j:j)='F'\n case('F')\n s(j:j)='G'\n case('G')\n s(j:j)='H'\n case('H')\n s(j:j)='I'\n case('I')\n s(j:j)='J'\n case('J')\n s(j:j)='K'\n case('K')\n s(j:j)='L'\n case('L')\n s(j:j)='M'\n case('M')\n s(j:j)='N'\n case('N')\n s(j:j)='O'\n case('O')\n s(j:j)='P'\n case('P')\n s(j:j)='Q'\n case('Q')\n s(j:j)='R'\n case('R')\n s(j:j)='S'\n case('S')\n s(j:j)='T'\n case('T')\n s(j:j)='U'\n case('U')\n s(j:j)='V'\n case('V')\n s(j:j)='W'\n case('W')\n s(j:j)='X'\n case('X')\n s(j:j)='Y'\n case('Y')\n s(j:j)='Z'\n case('Z')\n s(j:j)='A'\n end select\n end do\nend do\ns=trim(s(1:le))\nwrite(*,'(a)') s\nstop\nend program\n", "language": "Fortran", "metadata": {"date": 1574648477, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02848.html", "problem_id": "p02848", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02848/input.txt", "sample_output_relpath": "derived/input_output/data/p02848/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02848/Fortran/s679917339.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s679917339", "user_id": "u911684370"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "program main\n integer::n,i,j,k,ans,le\n !integer,allocatable::\n character(10000)::s\nread(*,*)n\n\nread(*,*)s\nle=len(s)\n!write(*,*) le\ndo i=1,n\n do j=1,le\n select case(s(j:j))\n case('A')\n s(j:j)='B'\n case('B')\n s(j:j)='C'\n case('C')\n s(j:j)='D'\n case('D')\n s(j:j)='E'\n case('E')\n s(j:j)='F'\n case('F')\n s(j:j)='G'\n case('G')\n s(j:j)='H'\n case('H')\n s(j:j)='I'\n case('I')\n s(j:j)='J'\n case('J')\n s(j:j)='K'\n case('K')\n s(j:j)='L'\n case('L')\n s(j:j)='M'\n case('M')\n s(j:j)='N'\n case('N')\n s(j:j)='O'\n case('O')\n s(j:j)='P'\n case('P')\n s(j:j)='Q'\n case('Q')\n s(j:j)='R'\n case('R')\n s(j:j)='S'\n case('S')\n s(j:j)='T'\n case('T')\n s(j:j)='U'\n case('U')\n s(j:j)='V'\n case('V')\n s(j:j)='W'\n case('W')\n s(j:j)='X'\n case('X')\n s(j:j)='Y'\n case('Y')\n s(j:j)='Z'\n case('Z')\n s(j:j)='A'\n end select\n end do\nend do\ns=trim(s(1:le))\nwrite(*,'(a)') s\nstop\nend program\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "sample_input": "2\nABCXYZ\n"}, "reference_outputs": ["CDEZAB\n"], "source_document_id": "p02848", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S consisting of uppercase English letters. Additionally, an integer N will be given.\n\nShift each character of S by N in alphabetical order (see below), and print the resulting string.\n\nWe assume that A follows Z. For example, shifting A by 2 results in C (A \\to B \\to C), and shifting Y by 3 results in B (Y \\to Z \\to A \\to B).\n\nConstraints\n\n0 \\leq N \\leq 26\n\n1 \\leq |S| \\leq 10^4\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the string resulting from shifting each character of S by N in alphabetical order.\n\nSample Input 1\n\n2\nABCXYZ\n\nSample Output 1\n\nCDEZAB\n\nNote that A follows Z.\n\nSample Input 2\n\n0\nABCXYZ\n\nSample Output 2\n\nABCXYZ\n\nSample Input 3\n\n13\nABCDEFGHIJKLMNOPQRSTUVWXYZ\n\nSample Output 3\n\nNOPQRSTUVWXYZABCDEFGHIJKLM", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1066, "cpu_time_ms": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s439284886", "group_id": "codeNet:p02851", "input_text": "program atcoder\n\timplicit none\n\tinteger :: i,n,ans=0,k,j\n\tinteger,allocatable,dimension(:) :: a\n\tread*,n,k\n\tallocate(a(n))\n\tread(*,*)(a(i),i=1,n)\n\tdo i = 1,n\n\t\tdo j=0,n-i\n\t\t\tif( mod(sum(a(i:i+j)),k) == j+1 )then\n\t\t\t\tans = ans+1\n\t\t\tendif\n\t\tend do\n\tend do\n\twrite(*,*)ans\n\tstop \nend program atcoder\n", "language": "Fortran", "metadata": {"date": 1577163765, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02851.html", "problem_id": "p02851", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02851/input.txt", "sample_output_relpath": "derived/input_output/data/p02851/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02851/Fortran/s439284886.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s439284886", "user_id": "u780122303"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program atcoder\n\timplicit none\n\tinteger :: i,n,ans=0,k,j\n\tinteger,allocatable,dimension(:) :: a\n\tread*,n,k\n\tallocate(a(n))\n\tread(*,*)(a(i),i=1,n)\n\tdo i = 1,n\n\t\tdo j=0,n-i\n\t\t\tif( mod(sum(a(i:i+j)),k) == j+1 )then\n\t\t\t\tans = ans+1\n\t\t\tendif\n\t\tend do\n\tend do\n\twrite(*,*)ans\n\tstop \nend program atcoder\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N, and a positive integer K.\n\nFind the number of non-empty contiguous subsequences in A such that the remainder when dividing the sum of its elements by K is equal to the number of its elements. We consider two subsequences different if they are taken from different positions, even if they are equal sequences.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the number of subsequences that satisfy the condition.\n\nSample Input 1\n\n5 4\n1 4 2 3 5\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: (1), (4,2), (1,4,2), and (5).\n\nSample Input 2\n\n8 4\n4 2 4 2 4 2 4 2\n\nSample Output 2\n\n7\n\n(4,2) is counted four times, and (2,4) is counted three times.\n\nSample Input 3\n\n10 7\n14 15 92 65 35 89 79 32 38 46\n\nSample Output 3\n\n8", "sample_input": "5 4\n1 4 2 3 5\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02851", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N, and a positive integer K.\n\nFind the number of non-empty contiguous subsequences in A such that the remainder when dividing the sum of its elements by K is equal to the number of its elements. We consider two subsequences different if they are taken from different positions, even if they are equal sequences.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the number of subsequences that satisfy the condition.\n\nSample Input 1\n\n5 4\n1 4 2 3 5\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: (1), (4,2), (1,4,2), and (5).\n\nSample Input 2\n\n8 4\n4 2 4 2 4 2 4 2\n\nSample Output 2\n\n7\n\n(4,2) is counted four times, and (2,4) is counted three times.\n\nSample Input 3\n\n10 7\n14 15 92 65 35 89 79 32 38 46\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 296, "cpu_time_ms": 2103, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s909934230", "group_id": "codeNet:p02852", "input_text": "module mod_segment_tree\n implicit none\n type t_segment_tree\n private\n integer :: deflt = 1000000000\n integer :: n, p\n integer, pointer :: arr(:) => null()\n contains\n procedure :: init => init_segtree\n procedure :: release => release_segtree\n procedure :: update => update\n procedure :: query => query\n procedure :: default => set_default\n procedure :: change => change_default\n end type\n interface segment_tree\n module procedure :: newst\n end interface segment_tree\ncontains\n integer function op(x,y)\n integer, intent(in) :: x, y\n op = min(x,y)\n end\n function newst(n) result(ret)\n integer, intent(in) :: n\n type(t_segment_tree) :: ret\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n ret%n = n\n ret%p = p\n allocate(ret%arr(2*p-1))\n ret%arr = ret%deflt\n end\n subroutine init_segtree(this,n)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n this%n = n\n this%p = p\n allocate(this%arr(2*p-1))\n this%arr = this%deflt\n end\n subroutine release_segtree(this)\n class(t_segment_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine set_default(this,i)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer :: x\n x = i+this%p-1\n this%arr(x) = this%deflt\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n subroutine change_default(this,deflt)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine update(this,i,v)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i+this%p-1\n this%arr(x) = v\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n integer function query(this,a,b)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: a, b\n integer :: l, r\n query = this%deflt\n l = a+this%p-1\n r = b+this%p-1\n do while (l <= r)\n if (mod(l,2) == 1) then\n query = op(query,this%arr(l))\n l = l+1\n end if\n if (mod(r,2) == 0) then\n query = op(query,this%arr(r))\n r = r-1\n end if\n l = l/2\n r = r/2\n end do\n end\nend module mod_segment_tree\nprogram Sugoroku\n use mod_segment_tree\n implicit none\n integer :: n, m, i, x, y, a(0:100001) = 0\n character(100001) :: s\n type(t_segment_tree) :: st\n read(*,*) n, m\n if (n <= m) then\n write(*,'(i0)') n\n stop\n end if\n read(*,*) s\n st = segment_tree(n+1)\n call st%update(1,0)\n do i = 2, n+1\n if (s(i:i) == \"1\") cycle\n x = st%query(max(1,i-m),i-1)\n if (x > n) then\n write(*,'(i0)') -1\n stop\n end if\n call st%update(i,x+1)\n end do\n y = st%query(n+1,n+1)\n a(y) = n+1\n do i = n+1, 1, -1\n if (s(i:i) == \"1\") cycle\n x = st%query(i,i)\n if (x == y) cycle\n if (i < a(x+1)-m) cycle\n a(x) = i\n end do\n write(*,'(i0)',advance='no') a(1)-a(0)\n do i = 1, y-1\n write(*,'(x,i0)',advance='no') a(i+1)-a(i)\n end do\n write(*,*)\nend program Sugoroku", "language": "Fortran", "metadata": {"date": 1575090438, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02852.html", "problem_id": "p02852", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02852/input.txt", "sample_output_relpath": "derived/input_output/data/p02852/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02852/Fortran/s909934230.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s909934230", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1 3 2 3\n", "input_to_evaluate": "module mod_segment_tree\n implicit none\n type t_segment_tree\n private\n integer :: deflt = 1000000000\n integer :: n, p\n integer, pointer :: arr(:) => null()\n contains\n procedure :: init => init_segtree\n procedure :: release => release_segtree\n procedure :: update => update\n procedure :: query => query\n procedure :: default => set_default\n procedure :: change => change_default\n end type\n interface segment_tree\n module procedure :: newst\n end interface segment_tree\ncontains\n integer function op(x,y)\n integer, intent(in) :: x, y\n op = min(x,y)\n end\n function newst(n) result(ret)\n integer, intent(in) :: n\n type(t_segment_tree) :: ret\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n ret%n = n\n ret%p = p\n allocate(ret%arr(2*p-1))\n ret%arr = ret%deflt\n end\n subroutine init_segtree(this,n)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n this%n = n\n this%p = p\n allocate(this%arr(2*p-1))\n this%arr = this%deflt\n end\n subroutine release_segtree(this)\n class(t_segment_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine set_default(this,i)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer :: x\n x = i+this%p-1\n this%arr(x) = this%deflt\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n subroutine change_default(this,deflt)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine update(this,i,v)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i+this%p-1\n this%arr(x) = v\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n integer function query(this,a,b)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: a, b\n integer :: l, r\n query = this%deflt\n l = a+this%p-1\n r = b+this%p-1\n do while (l <= r)\n if (mod(l,2) == 1) then\n query = op(query,this%arr(l))\n l = l+1\n end if\n if (mod(r,2) == 0) then\n query = op(query,this%arr(r))\n r = r-1\n end if\n l = l/2\n r = r/2\n end do\n end\nend module mod_segment_tree\nprogram Sugoroku\n use mod_segment_tree\n implicit none\n integer :: n, m, i, x, y, a(0:100001) = 0\n character(100001) :: s\n type(t_segment_tree) :: st\n read(*,*) n, m\n if (n <= m) then\n write(*,'(i0)') n\n stop\n end if\n read(*,*) s\n st = segment_tree(n+1)\n call st%update(1,0)\n do i = 2, n+1\n if (s(i:i) == \"1\") cycle\n x = st%query(max(1,i-m),i-1)\n if (x > n) then\n write(*,'(i0)') -1\n stop\n end if\n call st%update(i,x+1)\n end do\n y = st%query(n+1,n+1)\n a(y) = n+1\n do i = n+1, 1, -1\n if (s(i:i) == \"1\") cycle\n x = st%query(i,i)\n if (x == y) cycle\n if (i < a(x+1)-m) cycle\n a(x) = i\n end do\n write(*,'(i0)',advance='no') a(1)-a(0)\n do i = 1, y-1\n write(*,'(x,i0)',advance='no') a(i+1)-a(i)\n end do\n write(*,*)\nend program Sugoroku", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi is playing a board game called Sugoroku.\n\nOn the board, there are N + 1 squares numbered 0 to N. Takahashi starts at Square 0, and he has to stop exactly at Square N to win the game.\n\nThe game uses a roulette with the M numbers from 1 to M. In each turn, Takahashi spins the roulette. If the number x comes up when he is at Square s, he moves to Square s+x. If this makes him go beyond Square N, he loses the game.\n\nAdditionally, some of the squares are Game Over Squares. He also loses the game if he stops at one of those squares. You are given a string S of length N + 1, representing which squares are Game Over Squares. For each i (0 \\leq i \\leq N), Square i is a Game Over Square if S[i] = 1 and not if S[i] = 0.\n\nFind the sequence of numbers coming up in the roulette in which Takahashi can win the game in the fewest number of turns possible. If there are multiple such sequences, find the lexicographically smallest such sequence. If Takahashi cannot win the game, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n|S| = N + 1\n\nS consists of 0 and 1.\n\nS[0] = 0\n\nS[N] = 0\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\n\nOutput\n\nIf Takahashi can win the game, print the lexicographically smallest sequence among the shortest sequences of numbers coming up in the roulette in which Takahashi can win the game, with spaces in between.\n\nIf Takahashi cannot win the game, print -1.\n\nSample Input 1\n\n9 3\n0001000100\n\nSample Output 1\n\n1 3 2 3\n\nIf the numbers 1, 3, 2, 3 come up in this order, Takahashi can reach Square 9 via Square 1, 4, and 6. He cannot reach Square 9 in three or fewer turns, and this is the lexicographically smallest sequence in which he reaches Square 9 in four turns.\n\nSample Input 2\n\n5 4\n011110\n\nSample Output 2\n\n-1\n\nTakahashi cannot reach Square 5.\n\nSample Input 3\n\n6 6\n0101010\n\nSample Output 3\n\n6", "sample_input": "9 3\n0001000100\n"}, "reference_outputs": ["1 3 2 3\n"], "source_document_id": "p02852", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi is playing a board game called Sugoroku.\n\nOn the board, there are N + 1 squares numbered 0 to N. Takahashi starts at Square 0, and he has to stop exactly at Square N to win the game.\n\nThe game uses a roulette with the M numbers from 1 to M. In each turn, Takahashi spins the roulette. If the number x comes up when he is at Square s, he moves to Square s+x. If this makes him go beyond Square N, he loses the game.\n\nAdditionally, some of the squares are Game Over Squares. He also loses the game if he stops at one of those squares. You are given a string S of length N + 1, representing which squares are Game Over Squares. For each i (0 \\leq i \\leq N), Square i is a Game Over Square if S[i] = 1 and not if S[i] = 0.\n\nFind the sequence of numbers coming up in the roulette in which Takahashi can win the game in the fewest number of turns possible. If there are multiple such sequences, find the lexicographically smallest such sequence. If Takahashi cannot win the game, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n|S| = N + 1\n\nS consists of 0 and 1.\n\nS[0] = 0\n\nS[N] = 0\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\n\nOutput\n\nIf Takahashi can win the game, print the lexicographically smallest sequence among the shortest sequences of numbers coming up in the roulette in which Takahashi can win the game, with spaces in between.\n\nIf Takahashi cannot win the game, print -1.\n\nSample Input 1\n\n9 3\n0001000100\n\nSample Output 1\n\n1 3 2 3\n\nIf the numbers 1, 3, 2, 3 come up in this order, Takahashi can reach Square 9 via Square 1, 4, and 6. He cannot reach Square 9 in three or fewer turns, and this is the lexicographically smallest sequence in which he reaches Square 9 in four turns.\n\nSample Input 2\n\n5 4\n011110\n\nSample Output 2\n\n-1\n\nTakahashi cannot reach Square 5.\n\nSample Input 3\n\n6 6\n0101010\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3283, "cpu_time_ms": 41, "memory_kb": 2212}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s539628607", "group_id": "codeNet:p02852", "input_text": "module mod_segment_tree\n implicit none\n type t_segment_tree\n private\n integer :: deflt = 1000000000\n integer :: n, p\n integer, pointer :: arr(:) => null()\n contains\n procedure :: init => init_segtree\n procedure :: release => release_segtree\n procedure :: update => update\n procedure :: query => query\n procedure :: default => set_default\n procedure :: change => change_default\n end type\n interface segment_tree\n module procedure :: newst\n end interface segment_tree\ncontains\n integer function op(x,y)\n integer, intent(in) :: x, y\n op = min(x,y)\n end\n function newst(n) result(ret)\n integer, intent(in) :: n\n type(t_segment_tree) :: ret\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n ret%n = n\n ret%p = p\n allocate(ret%arr(2*p-1))\n ret%arr = ret%deflt\n end\n subroutine init_segtree(this,n)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n this%n = n\n this%p = p\n allocate(this%arr(2*p-1))\n this%arr = this%deflt\n end\n subroutine release_segtree(this)\n class(t_segment_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine set_default(this,i)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer :: x\n x = i+this%p-1\n this%arr(x) = this%deflt\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n subroutine change_default(this,deflt)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine update(this,i,v)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i+this%p-1\n this%arr(x) = v\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n integer function query(this,a,b)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: a, b\n integer :: l, r\n query = this%deflt\n l = a+this%p-1\n r = b+this%p-1\n do while (l <= r)\n if (mod(l,2) == 1) then\n query = op(query,this%arr(l))\n l = l+1\n end if\n if (mod(r,2) == 0) then\n query = op(query,this%arr(r))\n r = r-1\n end if\n l = l/2\n r = r/2\n end do\n end\nend module mod_segment_tree\nprogram Sugoroku\n use mod_segment_tree\n implicit none\n integer :: n, m, i, x, y, a(0:100001) = 0\n character(100001) :: s\n type(t_segment_tree) :: st\n read(*,*) n, m\n if (n <= m) then\n write(*,'(i0)') n\n stop\n end if\n read(*,*) s\n st = segment_tree(n+1)\n call st%update(1,0)\n do i = 2, n+1\n if (s(i:i) == \"1\") cycle\n x = st%query(max(1,i-m),i-1)\n if (x > n) then\n write(*,'(i0)') -1\n stop\n end if\n call st%update(i,x+1)\n end do\n y = st%query(n+1,n+1)\n a(y) = n+1\n do i = n+1, 1, -1\n if (s(i:i) == \"1\") cycle\n x = st%query(i,i)\n if (x == y) cycle\n a(x) = max(i,a(x+1)-m)\n end do\n write(*,'(i0)',advance='no') a(1)-a(0)\n do i = 1, y-1\n write(*,'(x,i0)',advance='no') a(i+1)-a(i)\n end do\n write(*,*)\nend program Sugoroku", "language": "Fortran", "metadata": {"date": 1575057017, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02852.html", "problem_id": "p02852", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02852/input.txt", "sample_output_relpath": "derived/input_output/data/p02852/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02852/Fortran/s539628607.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s539628607", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1 3 2 3\n", "input_to_evaluate": "module mod_segment_tree\n implicit none\n type t_segment_tree\n private\n integer :: deflt = 1000000000\n integer :: n, p\n integer, pointer :: arr(:) => null()\n contains\n procedure :: init => init_segtree\n procedure :: release => release_segtree\n procedure :: update => update\n procedure :: query => query\n procedure :: default => set_default\n procedure :: change => change_default\n end type\n interface segment_tree\n module procedure :: newst\n end interface segment_tree\ncontains\n integer function op(x,y)\n integer, intent(in) :: x, y\n op = min(x,y)\n end\n function newst(n) result(ret)\n integer, intent(in) :: n\n type(t_segment_tree) :: ret\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n ret%n = n\n ret%p = p\n allocate(ret%arr(2*p-1))\n ret%arr = ret%deflt\n end\n subroutine init_segtree(this,n)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n this%n = n\n this%p = p\n allocate(this%arr(2*p-1))\n this%arr = this%deflt\n end\n subroutine release_segtree(this)\n class(t_segment_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine set_default(this,i)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer :: x\n x = i+this%p-1\n this%arr(x) = this%deflt\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n subroutine change_default(this,deflt)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine update(this,i,v)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i+this%p-1\n this%arr(x) = v\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n integer function query(this,a,b)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: a, b\n integer :: l, r\n query = this%deflt\n l = a+this%p-1\n r = b+this%p-1\n do while (l <= r)\n if (mod(l,2) == 1) then\n query = op(query,this%arr(l))\n l = l+1\n end if\n if (mod(r,2) == 0) then\n query = op(query,this%arr(r))\n r = r-1\n end if\n l = l/2\n r = r/2\n end do\n end\nend module mod_segment_tree\nprogram Sugoroku\n use mod_segment_tree\n implicit none\n integer :: n, m, i, x, y, a(0:100001) = 0\n character(100001) :: s\n type(t_segment_tree) :: st\n read(*,*) n, m\n if (n <= m) then\n write(*,'(i0)') n\n stop\n end if\n read(*,*) s\n st = segment_tree(n+1)\n call st%update(1,0)\n do i = 2, n+1\n if (s(i:i) == \"1\") cycle\n x = st%query(max(1,i-m),i-1)\n if (x > n) then\n write(*,'(i0)') -1\n stop\n end if\n call st%update(i,x+1)\n end do\n y = st%query(n+1,n+1)\n a(y) = n+1\n do i = n+1, 1, -1\n if (s(i:i) == \"1\") cycle\n x = st%query(i,i)\n if (x == y) cycle\n a(x) = max(i,a(x+1)-m)\n end do\n write(*,'(i0)',advance='no') a(1)-a(0)\n do i = 1, y-1\n write(*,'(x,i0)',advance='no') a(i+1)-a(i)\n end do\n write(*,*)\nend program Sugoroku", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi is playing a board game called Sugoroku.\n\nOn the board, there are N + 1 squares numbered 0 to N. Takahashi starts at Square 0, and he has to stop exactly at Square N to win the game.\n\nThe game uses a roulette with the M numbers from 1 to M. In each turn, Takahashi spins the roulette. If the number x comes up when he is at Square s, he moves to Square s+x. If this makes him go beyond Square N, he loses the game.\n\nAdditionally, some of the squares are Game Over Squares. He also loses the game if he stops at one of those squares. You are given a string S of length N + 1, representing which squares are Game Over Squares. For each i (0 \\leq i \\leq N), Square i is a Game Over Square if S[i] = 1 and not if S[i] = 0.\n\nFind the sequence of numbers coming up in the roulette in which Takahashi can win the game in the fewest number of turns possible. If there are multiple such sequences, find the lexicographically smallest such sequence. If Takahashi cannot win the game, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n|S| = N + 1\n\nS consists of 0 and 1.\n\nS[0] = 0\n\nS[N] = 0\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\n\nOutput\n\nIf Takahashi can win the game, print the lexicographically smallest sequence among the shortest sequences of numbers coming up in the roulette in which Takahashi can win the game, with spaces in between.\n\nIf Takahashi cannot win the game, print -1.\n\nSample Input 1\n\n9 3\n0001000100\n\nSample Output 1\n\n1 3 2 3\n\nIf the numbers 1, 3, 2, 3 come up in this order, Takahashi can reach Square 9 via Square 1, 4, and 6. He cannot reach Square 9 in three or fewer turns, and this is the lexicographically smallest sequence in which he reaches Square 9 in four turns.\n\nSample Input 2\n\n5 4\n011110\n\nSample Output 2\n\n-1\n\nTakahashi cannot reach Square 5.\n\nSample Input 3\n\n6 6\n0101010\n\nSample Output 3\n\n6", "sample_input": "9 3\n0001000100\n"}, "reference_outputs": ["1 3 2 3\n"], "source_document_id": "p02852", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi is playing a board game called Sugoroku.\n\nOn the board, there are N + 1 squares numbered 0 to N. Takahashi starts at Square 0, and he has to stop exactly at Square N to win the game.\n\nThe game uses a roulette with the M numbers from 1 to M. In each turn, Takahashi spins the roulette. If the number x comes up when he is at Square s, he moves to Square s+x. If this makes him go beyond Square N, he loses the game.\n\nAdditionally, some of the squares are Game Over Squares. He also loses the game if he stops at one of those squares. You are given a string S of length N + 1, representing which squares are Game Over Squares. For each i (0 \\leq i \\leq N), Square i is a Game Over Square if S[i] = 1 and not if S[i] = 0.\n\nFind the sequence of numbers coming up in the roulette in which Takahashi can win the game in the fewest number of turns possible. If there are multiple such sequences, find the lexicographically smallest such sequence. If Takahashi cannot win the game, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n|S| = N + 1\n\nS consists of 0 and 1.\n\nS[0] = 0\n\nS[N] = 0\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS\n\nOutput\n\nIf Takahashi can win the game, print the lexicographically smallest sequence among the shortest sequences of numbers coming up in the roulette in which Takahashi can win the game, with spaces in between.\n\nIf Takahashi cannot win the game, print -1.\n\nSample Input 1\n\n9 3\n0001000100\n\nSample Output 1\n\n1 3 2 3\n\nIf the numbers 1, 3, 2, 3 come up in this order, Takahashi can reach Square 9 via Square 1, 4, and 6. He cannot reach Square 9 in three or fewer turns, and this is the lexicographically smallest sequence in which he reaches Square 9 in four turns.\n\nSample Input 2\n\n5 4\n011110\n\nSample Output 2\n\n-1\n\nTakahashi cannot reach Square 5.\n\nSample Input 3\n\n6 6\n0101010\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3269, "cpu_time_ms": 41, "memory_kb": 2212}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s069850683", "group_id": "codeNet:p02853", "input_text": " program ans1\n implicit none\n integer :: X,Y\n integer :: XR,YR\n read(*,*) X,Y\n XR = 0\n YR = 0\n if(X == 1) XR = 300000\n if(X == 2) XR = 200000\n if(X == 3) XR = 100000\n if(Y == 1) YR = 300000\n if(Y == 2) YR = 200000\n if(Y == 3) YR = 100000\n if(X == 1 .and. Y == 1) XR = XR + 400000\n write(*,*) XR + YR\n end program ans1", "language": "Fortran", "metadata": {"date": 1574561223, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02853.html", "problem_id": "p02853", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02853/input.txt", "sample_output_relpath": "derived/input_output/data/p02853/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02853/Fortran/s069850683.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069850683", "user_id": "u954587078"}, "prompt_components": {"gold_output": "1000000\n", "input_to_evaluate": " program ans1\n implicit none\n integer :: X,Y\n integer :: XR,YR\n read(*,*) X,Y\n XR = 0\n YR = 0\n if(X == 1) XR = 300000\n if(X == 2) XR = 200000\n if(X == 3) XR = 100000\n if(Y == 1) YR = 300000\n if(Y == 2) YR = 200000\n if(Y == 3) YR = 100000\n if(X == 1 .and. Y == 1) XR = XR + 400000\n write(*,*) XR + YR\n end program ans1", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "sample_input": "1 1\n"}, "reference_outputs": ["1000000\n"], "source_document_id": "p02853", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s797072321", "group_id": "codeNet:p02854", "input_text": "program DDCC2020B\n implicit none\n integer(8)::N,i,diff\n integer(8)::sum_half=0\n integer(8),allocatable,dimension(:)::A\n\n read(5,*)N\n allocate(A(N))\n read(5,*)(A(i),i=1,N)\n\n diff=sum(A)\n\n do i=1,N\n if(abs(sum(A)-2*(sum_half+A(i)))0)then\n ans(i,j)=ans(i,j-1)\n endif\n endif\n end do\n do j=W,1,-1\n if(ans(i,j)==-1)then\n if(j==W)cycle\n if(ans(i,j+1)>0)then\n ans(i,j)=ans(i,j+1)\n endif\n endif\n end do\nend do\ndo i=1,H\n if(ans(i,1)<0)then\n if(i==1)cycle\n if(ans(i-1,1)>0)then\n ans(i,:)=ans(i-1,:)\n endif\n endif\nend do\ndo i=H,1,-1\n if(ans(i,1)<0)then\n if(i==H)cycle\n if(ans(i+1,1)>0)then\n ans(i,:)=ans(i+1,:)\n endif\n endif\nend do\ndo i=1,H\n write(*,\"(i0)\",advance=\"no\") ans(i,1)\n do j=2,W\n write(*,\"(A,i0)\",advance=\"no\")\" \",ans(i,j)\n end do\n write(*,*)\nend do\nend", "language": "Fortran", "metadata": {"date": 1574563221, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02855.html", "problem_id": "p02855", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02855/input.txt", "sample_output_relpath": "derived/input_output/data/p02855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02855/Fortran/s584266584.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584266584", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1 2 2\n1 3 4\n5 5 4\n", "input_to_evaluate": "program DISCO2020yC\ninteger::H,W,K\ninteger,allocatable::ans(:,:)\ncharacter(300)reader\ninteger ichigonumber\nread*,H,W,K\nallocate(ans(H,W))\nans=-1\nichigonumber=1\ndo i=1,H\n read*,reader\n do j=1,W\n if(reader(j:j)==\"#\")then\n ans(i,j)=ichigonumber\n ichigonumber=ichigonumber+1\n endif\n end do\nend do\ndo i=1,H\n do j=1,W\n if(ans(i,j)==-1)then\n if(j==1)cycle\n if(ans(i,j-1)>0)then\n ans(i,j)=ans(i,j-1)\n endif\n endif\n end do\n do j=W,1,-1\n if(ans(i,j)==-1)then\n if(j==W)cycle\n if(ans(i,j+1)>0)then\n ans(i,j)=ans(i,j+1)\n endif\n endif\n end do\nend do\ndo i=1,H\n if(ans(i,1)<0)then\n if(i==1)cycle\n if(ans(i-1,1)>0)then\n ans(i,:)=ans(i-1,:)\n endif\n endif\nend do\ndo i=H,1,-1\n if(ans(i,1)<0)then\n if(i==H)cycle\n if(ans(i+1,1)>0)then\n ans(i,:)=ans(i+1,:)\n endif\n endif\nend do\ndo i=1,H\n write(*,\"(i0)\",advance=\"no\") ans(i,1)\n do j=2,W\n write(*,\"(A,i0)\",advance=\"no\")\" \",ans(i,j)\n end do\n write(*,*)\nend do\nend", "problem_context": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "sample_input": "3 3 5\n#.#\n.#.\n#.#\n"}, "reference_outputs": ["1 2 2\n1 3 4\n5 5 4\n"], "source_document_id": "p02855", "source_text": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1163, "cpu_time_ms": 42, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s071873671", "group_id": "codeNet:p02856", "input_text": "program DISCO2020yD\ninteger::M\ninteger(16)::d,c\ninteger(16)::bonus\ninteger(16)::ans\nread*,M\nans=0\nbonus=0\ndo i=1,M\n read*,d,c\n bonus=bonus+d*c\n ans=ans+c\nend do\nprint\"(i0)\",ans+(bonus-1_16)/9_16 -1_16\nend\n", "language": "Fortran", "metadata": {"date": 1574565756, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02856.html", "problem_id": "p02856", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02856/input.txt", "sample_output_relpath": "derived/input_output/data/p02856/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02856/Fortran/s071873671.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s071873671", "user_id": "u598073939"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program DISCO2020yD\ninteger::M\ninteger(16)::d,c\ninteger(16)::bonus\ninteger(16)::ans\nread*,M\nans=0\nbonus=0\ndo i=1,M\n read*,d,c\n bonus=bonus+d*c\n ans=ans+c\nend do\nprint\"(i0)\",ans+(bonus-1_16)/9_16 -1_16\nend\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nN programmers are going to participate in the preliminary stage of DDCC 20XX. Due to the size of the venue, however, at most 9 contestants can participate in the finals.\n\nThe preliminary stage consists of several rounds, which will take place as follows:\n\nAll the N contestants will participate in the first round.\n\nWhen X contestants participate in some round, the number of contestants advancing to the next round will be decided as follows:\n\nThe organizer will choose two consecutive digits in the decimal notation of X, and replace them with the sum of these digits. The number resulted will be the number of contestants advancing to the next round.\n\nFor example, when X = 2378, the number of contestants advancing to the next round will be 578 (if 2 and 3 are chosen), 2108 (if 3 and 7 are chosen), or 2315 (if 7 and 8 are chosen).\n\nWhen X = 100, the number of contestants advancing to the next round will be 10, no matter which two digits are chosen.\n\nThe preliminary stage ends when 9 or fewer contestants remain.\n\nRingo, the chief organizer, wants to hold as many rounds as possible.\nFind the maximum possible number of rounds in the preliminary stage.\n\nSince the number of contestants, N, can be enormous, it is given to you as two integer sequences d_1, \\ldots, d_M and c_1, \\ldots, c_M, which means the following: the decimal notation of N consists of c_1 + c_2 + \\ldots + c_M digits, whose first c_1 digits are all d_1, the following c_2 digits are all d_2, \\ldots, and the last c_M digits are all d_M.\n\nConstraints\n\n1 \\leq M \\leq 200000\n\n0 \\leq d_i \\leq 9\n\nd_1 \\neq 0\n\nd_i \\neq d_{i+1}\n\nc_i \\geq 1\n\n2 \\leq c_1 + \\ldots + c_M \\leq 10^{15}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\nd_1 c_1\nd_2 c_2\n:\nd_M c_M\n\nOutput\n\nPrint the maximum possible number of rounds in the preliminary stage.\n\nSample Input 1\n\n2\n2 2\n9 1\n\nSample Output 1\n\n3\n\nIn this case, N = 229 contestants will participate in the first round. One possible progression of the preliminary stage is as follows:\n\n229 contestants participate in Round 1, 49 contestants participate in Round 2, 13 contestants participate in Round 3, and 4 contestants advance to the finals.\n\nHere, three rounds take place in the preliminary stage, which is the maximum possible number.\n\nSample Input 2\n\n3\n1 1\n0 8\n7 1\n\nSample Output 2\n\n9\n\nIn this case, 1000000007 will participate in the first round.", "sample_input": "2\n2 2\n9 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02856", "source_text": "Score: 500 points\n\nProblem Statement\n\nN programmers are going to participate in the preliminary stage of DDCC 20XX. Due to the size of the venue, however, at most 9 contestants can participate in the finals.\n\nThe preliminary stage consists of several rounds, which will take place as follows:\n\nAll the N contestants will participate in the first round.\n\nWhen X contestants participate in some round, the number of contestants advancing to the next round will be decided as follows:\n\nThe organizer will choose two consecutive digits in the decimal notation of X, and replace them with the sum of these digits. The number resulted will be the number of contestants advancing to the next round.\n\nFor example, when X = 2378, the number of contestants advancing to the next round will be 578 (if 2 and 3 are chosen), 2108 (if 3 and 7 are chosen), or 2315 (if 7 and 8 are chosen).\n\nWhen X = 100, the number of contestants advancing to the next round will be 10, no matter which two digits are chosen.\n\nThe preliminary stage ends when 9 or fewer contestants remain.\n\nRingo, the chief organizer, wants to hold as many rounds as possible.\nFind the maximum possible number of rounds in the preliminary stage.\n\nSince the number of contestants, N, can be enormous, it is given to you as two integer sequences d_1, \\ldots, d_M and c_1, \\ldots, c_M, which means the following: the decimal notation of N consists of c_1 + c_2 + \\ldots + c_M digits, whose first c_1 digits are all d_1, the following c_2 digits are all d_2, \\ldots, and the last c_M digits are all d_M.\n\nConstraints\n\n1 \\leq M \\leq 200000\n\n0 \\leq d_i \\leq 9\n\nd_1 \\neq 0\n\nd_i \\neq d_{i+1}\n\nc_i \\geq 1\n\n2 \\leq c_1 + \\ldots + c_M \\leq 10^{15}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\nd_1 c_1\nd_2 c_2\n:\nd_M c_M\n\nOutput\n\nPrint the maximum possible number of rounds in the preliminary stage.\n\nSample Input 1\n\n2\n2 2\n9 1\n\nSample Output 1\n\n3\n\nIn this case, N = 229 contestants will participate in the first round. One possible progression of the preliminary stage is as follows:\n\n229 contestants participate in Round 1, 49 contestants participate in Round 2, 13 contestants participate in Round 3, and 4 contestants advance to the finals.\n\nHere, three rounds take place in the preliminary stage, which is the maximum possible number.\n\nSample Input 2\n\n3\n1 1\n0 8\n7 1\n\nSample Output 2\n\n9\n\nIn this case, 1000000007 will participate in the first round.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 155, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s553898889", "group_id": "codeNet:p02858", "input_text": "integer(16)::mo = 10**9 + 7\ninteger(16) h, w, t\ninteger(16) gh,gw,ans\nread*,h,w,t\ngh = gcd(h, t)\ngw = gcd(w, t)\nh =h/ gh\nw =w/ gw\nans = mod((power(2_16, h) + power(2_16, w) - 1 + mo),mo)\nans = mod((ans + power(2_16,gcd(h, w)) - 2 + mo),mo) \nprint\"(i0)\",power(ans, gh * gw)\ncontains\ninteger(16) recursive function power(x,y)result(res)\n integer(16) x,y\n res=1\n if (y==0)then\n return\n endif\n res=mod(power(x,y-1)*x,mo)\nend function\ninteger(16) recursive function gcd(a, b)result(res)\n integer(16), intent(in)::a, b\n res=merge(b, gcd(b, mod(a, b)),mod(a, b)==0)\nend function\nend ", "language": "Fortran", "metadata": {"date": 1574670766, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02858.html", "problem_id": "p02858", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02858/input.txt", "sample_output_relpath": "derived/input_output/data/p02858/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02858/Fortran/s553898889.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s553898889", "user_id": "u598073939"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "integer(16)::mo = 10**9 + 7\ninteger(16) h, w, t\ninteger(16) gh,gw,ans\nread*,h,w,t\ngh = gcd(h, t)\ngw = gcd(w, t)\nh =h/ gh\nw =w/ gw\nans = mod((power(2_16, h) + power(2_16, w) - 1 + mo),mo)\nans = mod((ans + power(2_16,gcd(h, w)) - 2 + mo),mo) \nprint\"(i0)\",power(ans, gh * gw)\ncontains\ninteger(16) recursive function power(x,y)result(res)\n integer(16) x,y\n res=1\n if (y==0)then\n return\n endif\n res=mod(power(x,y-1)*x,mo)\nend function\ninteger(16) recursive function gcd(a, b)result(res)\n integer(16), intent(in)::a, b\n res=merge(b, gcd(b, mod(a, b)),mod(a, b)==0)\nend function\nend ", "problem_context": "Score: 900 points\n\nProblem Statement\n\nIn 2937, DISCO creates a new universe called DISCOSMOS to celebrate its 1000-th anniversary.\n\nDISCOSMOS can be described as an H \\times W grid. Let (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W) denote the square at the i-th row from the top and the j-th column from the left.\n\nAt time 0, one robot will be placed onto each square. Each robot is one of the following three types:\n\nType-H: Does not move at all.\n\nType-R: If a robot of this type is in (i, j) at time t, it will be in (i, j+1) at time t+1. If it is in (i, W) at time t, however, it will be instead in (i, 1) at time t+1. (The robots do not collide with each other.)\n\nType-D: If a robot of this type is in (i, j) at time t, it will be in (i+1, j) at time t+1. If it is in (H, j) at time t, however, it will be instead in (1, j) at time t+1.\n\nThere are 3^{H \\times W} possible ways to place these robots. In how many of them will every square be occupied by one robot at times 0, T, 2T, 3T, 4T, and all subsequent multiples of T?\n\nSince the count can be enormous, compute it modulo (10^9 + 7).\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nH, W, T are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W T\n\nOutput\n\nPrint the number of ways to place the robots that satisfy the condition, modulo (10^9 + 7).\n\nSample Input 1\n\n2 2 1\n\nSample Output 1\n\n9\n\nShown below are some of the ways to place the robots that satisfy the condition, where ., >, and v stand for Type-H, Type-R, and Type-D, respectively:\n\n>> .. vv\n.. .. vv\n\nSample Input 2\n\n869 120 1001\n\nSample Output 2\n\n672919729", "sample_input": "2 2 1\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02858", "source_text": "Score: 900 points\n\nProblem Statement\n\nIn 2937, DISCO creates a new universe called DISCOSMOS to celebrate its 1000-th anniversary.\n\nDISCOSMOS can be described as an H \\times W grid. Let (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W) denote the square at the i-th row from the top and the j-th column from the left.\n\nAt time 0, one robot will be placed onto each square. Each robot is one of the following three types:\n\nType-H: Does not move at all.\n\nType-R: If a robot of this type is in (i, j) at time t, it will be in (i, j+1) at time t+1. If it is in (i, W) at time t, however, it will be instead in (i, 1) at time t+1. (The robots do not collide with each other.)\n\nType-D: If a robot of this type is in (i, j) at time t, it will be in (i+1, j) at time t+1. If it is in (H, j) at time t, however, it will be instead in (1, j) at time t+1.\n\nThere are 3^{H \\times W} possible ways to place these robots. In how many of them will every square be occupied by one robot at times 0, T, 2T, 3T, 4T, and all subsequent multiples of T?\n\nSince the count can be enormous, compute it modulo (10^9 + 7).\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq T \\leq 10^9\n\nH, W, T are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W T\n\nOutput\n\nPrint the number of ways to place the robots that satisfy the condition, modulo (10^9 + 7).\n\nSample Input 1\n\n2 2 1\n\nSample Output 1\n\n9\n\nShown below are some of the ways to place the robots that satisfy the condition, where ., >, and v stand for Type-H, Type-R, and Type-D, respectively:\n\n>> .. vv\n.. .. vv\n\nSample Input 2\n\n869 120 1001\n\nSample Output 2\n\n672919729", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 600, "cpu_time_ms": 230, "memory_kb": 262400}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s685173643", "group_id": "codeNet:p02859", "input_text": "program main\n integer r\n read(*,*) r\n write(*,*) r*r\nend program main", "language": "Fortran", "metadata": {"date": 1573957199, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02859.html", "problem_id": "p02859", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02859/input.txt", "sample_output_relpath": "derived/input_output/data/p02859/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02859/Fortran/s685173643.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s685173643", "user_id": "u671401989"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n integer r\n read(*,*) r\n write(*,*) r*r\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "sample_input": "2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02859", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s605179425", "group_id": "codeNet:p02859", "input_text": " PROGRAM circle\n IMPLICIT NONE\n INTEGER(8) :: r\n INTEGER(8) :: ans\n \n read*,r\n \n ans = r*r\n \n \n print*,ans\n \n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1573956086, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02859.html", "problem_id": "p02859", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02859/input.txt", "sample_output_relpath": "derived/input_output/data/p02859/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02859/Fortran/s605179425.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605179425", "user_id": "u171356453"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": " PROGRAM circle\n IMPLICIT NONE\n INTEGER(8) :: r\n INTEGER(8) :: ans\n \n read*,r\n \n ans = r*r\n \n \n print*,ans\n \n \n \n \n END PROGRAM", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "sample_input": "2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02859", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer r.\n\nHow many times is the area of a circle of radius r larger than the area of a circle of radius 1?\n\nIt can be proved that the answer is always an integer under the constraints given.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint the area of a circle of radius r, divided by the area of a circle of radius 1, as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n4\n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle of radius 1.\n\nNote that output must be an integer - for example, 4.0 will not be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s311846101", "group_id": "codeNet:p02860", "input_text": "program ABC145_B\ninteger N\ncharacter(200)S\nlogical check\nread*,N\nread*,S\n\ncheck=.true.\nif(mod(N,2)==1)check=.false.\nif(S(1:N/2)/=S(N/2+1:N))check=.false.\n\nif(check)then\n print\"(A)\",\"Yes\"\nelse\n print\"(A)\",\"No\"\nendif\nend program", "language": "Fortran", "metadata": {"date": 1573956420, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/Fortran/s311846101.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s311846101", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC145_B\ninteger N\ncharacter(200)S\nlogical check\nread*,N\nread*,S\n\ncheck=.true.\nif(mod(N,2)==1)check=.false.\nif(S(1:N/2)/=S(N/2+1:N))check=.false.\n\nif(check)then\n print\"(A)\",\"Yes\"\nelse\n print\"(A)\",\"No\"\nendif\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS consists of lowercase English letters.\n\n|S| = N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS consists of lowercase English letters.\n\n|S| = N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 4, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s759449176", "group_id": "codeNet:p02861", "input_text": "program main\n\n implicit none\n integer :: i,j,n \n integer, allocatable :: x(:), y(:)\n real :: dis, tmp\n \n read(*,*) n \n allocate( x(n) )\n allocate( y(n) )\n\n do i = 1, n\n read(*,*) x(i), y(i) \n end do\n \n dis = 0e0\n do i = 1, n\n do j = i, n\n if ( j == i ) cycle\n tmp = (x(i) - x(j))**2e0 + (y(i) - y(j))**2e0\n dis = dis + sqrt( tmp ) \n end do\n end do\n do i = 1, n\n dis = dis / real( i )\n end do\n print*, dis\n\n deallocate( x )\n deallocate( y )\nend program main\n", "language": "Fortran", "metadata": {"date": 1574226620, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02861/input.txt", "sample_output_relpath": "derived/input_output/data/p02861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02861/Fortran/s759449176.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s759449176", "user_id": "u675314298"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "program main\n\n implicit none\n integer :: i,j,n \n integer, allocatable :: x(:), y(:)\n real :: dis, tmp\n \n read(*,*) n \n allocate( x(n) )\n allocate( y(n) )\n\n do i = 1, n\n read(*,*) x(i), y(i) \n end do\n \n dis = 0e0\n do i = 1, n\n do j = i, n\n if ( j == i ) cycle\n tmp = (x(i) - x(j))**2e0 + (y(i) - y(j))**2e0\n dis = dis + sqrt( tmp ) \n end do\n end do\n do i = 1, n\n dis = dis / real( i )\n end do\n print*, dis\n\n deallocate( x )\n deallocate( y )\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "sample_input": "3\n0 0\n1 0\n0 1\n"}, "reference_outputs": ["2.2761423749\n"], "source_document_id": "p02861", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 503, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s466059799", "group_id": "codeNet:p02861", "input_text": "program ABC145_B\ntype xy\n real(16)::x,y\nend type\ninteger N\ntype(xy),allocatable::town(:)\nreal(16) average\nread*,N\nallocate(town(N))\ndo i=1,N\n read*,town(i)%x,town(i)%y\nend do\naverage=0\ndo i=1,N-1\n do j=i+1,N\n average=average+dist(town(i),town(j))\n end do\nend do\naverage=average/real(N*(N-1)/2)\nprint\"(f0.14)\",average*(N-1)\ncontains\npure real(16) function dist(a,b)\n type(xy),intent(in)::a,b\n dist=sqrt((a%x-b%x)**2+(a%y-b%y)**2)\nend function\nend program", "language": "Fortran", "metadata": {"date": 1573957628, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02861/input.txt", "sample_output_relpath": "derived/input_output/data/p02861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02861/Fortran/s466059799.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466059799", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "program ABC145_B\ntype xy\n real(16)::x,y\nend type\ninteger N\ntype(xy),allocatable::town(:)\nreal(16) average\nread*,N\nallocate(town(N))\ndo i=1,N\n read*,town(i)%x,town(i)%y\nend do\naverage=0\ndo i=1,N-1\n do j=i+1,N\n average=average+dist(town(i),town(j))\n end do\nend do\naverage=average/real(N*(N-1)/2)\nprint\"(f0.14)\",average*(N-1)\ncontains\npure real(16) function dist(a,b)\n type(xy),intent(in)::a,b\n dist=sqrt((a%x-b%x)**2+(a%y-b%y)**2)\nend function\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "sample_input": "3\n0 0\n1 0\n0 1\n"}, "reference_outputs": ["2.2761423749\n"], "source_document_id": "p02861", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N towns in a coordinate plane. Town i is located at coordinates (x_i, y_i). The distance between Town i and Town j is \\sqrt{\\left(x_i-x_j\\right)^2+\\left(y_i-y_j\\right)^2}.\n\nThere are N! possible paths to visit all of these towns once. Let the length of a path be the distance covered when we start at the first town in the path, visit the second, third, \\dots, towns, and arrive at the last town (assume that we travel in a straight line from a town to another). Compute the average length of these N! paths.\n\nConstraints\n\n2 \\leq N \\leq 8\n\n-1000 \\leq x_i \\leq 1000\n\n-1000 \\leq y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) (if i \\neq j)\n\n(Added 21:12 JST) All values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the average length of the paths.\nYour output will be judges as correct when the absolute difference from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n3\n0 0\n1 0\n0 1\n\nSample Output 1\n\n2.2761423749\n\nThere are six paths to visit the towns: 1 → 2 → 3, 1 → 3 → 2, 2 → 1 → 3, 2 → 3 → 1, 3 → 1 → 2, and 3 → 2 → 1.\n\nThe length of the path 1 → 2 → 3 is \\sqrt{\\left(0-1\\right)^2+\\left(0-0\\right)^2} + \\sqrt{\\left(1-0\\right)^2+\\left(0-1\\right)^2} = 1+\\sqrt{2}.\n\nBy calculating the lengths of the other paths in this way, we see that the average length of all routes is:\n\n\\frac{\\left(1+\\sqrt{2}\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)+\\left(2\\right)+\\left(1+\\sqrt{2}\\right)}{6} = 2.276142...\n\nSample Input 2\n\n2\n-879 981\n-866 890\n\nSample Output 2\n\n91.9238815543\n\nThere are two paths to visit the towns: 1 → 2 and 2 → 1. These paths have the same length.\n\nSample Input 3\n\n8\n-406 10\n512 859\n494 362\n-955 -475\n128 553\n-986 -885\n763 77\n449 310\n\nSample Output 3\n\n7641.9817824387", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 476, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s706905272", "group_id": "codeNet:p02862", "input_text": "program main\n implicit none\n integer(8) :: x, y, z, m\n read (*, *) x, y\n if (mod(x + y, 3_8) /= 0) then\n write (*, \"(i0)\") 0\n return\n end if\n z = (x + y) / 3\n if (x < z .or. y < z) then\n write (*, \"(i0)\") 0\n return\n end if\n\n m = 1000000007\n write(*, \"(i0)\") combi(z, x - z, m)\n contains\n\n function combi(n, k, m)\n implicit none\n integer(8), intent(in) :: n, k, m\n integer(8) :: combi, numera, denomi\n numera = perm(n, k, m)\n denomi = mod(fact(k, m), m)\n combi = mod(numera * inv(denomi, m), m)\n end function combi\n\n function perm(n, k, m)\n integer(8), intent(in) :: n, k, m\n integer(8) :: i, perm\n perm = 1\n do i = n, n - k + 1, -1\n perm = mod(perm * i, m)\n end do\n end function perm\n\n function fact(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: i, fact\n fact = 1\n do i = 1, n\n fact = mod(fact * i, m)\n end do\n end function fact\n\n function inv(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: inv\n inv = pow(n, m - 2, m)\n end function inv\n\n recursive function pow(n, p, m) result(res)\n implicit none\n integer(8), intent(in) :: n, p, m\n integer(8) :: res\n if (p == 0) then\n res = 1\n else if (mod(p, 2_8) == 0) then\n res = mod(pow(n, p / 2, m) ** 2, m)\n else\n res = mod(pow(n, p - 1, m) * n, m)\n end if\n end function pow\nend program main\n", "language": "Fortran", "metadata": {"date": 1585448646, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02862.html", "problem_id": "p02862", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02862/input.txt", "sample_output_relpath": "derived/input_output/data/p02862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02862/Fortran/s706905272.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706905272", "user_id": "u388927326"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: x, y, z, m\n read (*, *) x, y\n if (mod(x + y, 3_8) /= 0) then\n write (*, \"(i0)\") 0\n return\n end if\n z = (x + y) / 3\n if (x < z .or. y < z) then\n write (*, \"(i0)\") 0\n return\n end if\n\n m = 1000000007\n write(*, \"(i0)\") combi(z, x - z, m)\n contains\n\n function combi(n, k, m)\n implicit none\n integer(8), intent(in) :: n, k, m\n integer(8) :: combi, numera, denomi\n numera = perm(n, k, m)\n denomi = mod(fact(k, m), m)\n combi = mod(numera * inv(denomi, m), m)\n end function combi\n\n function perm(n, k, m)\n integer(8), intent(in) :: n, k, m\n integer(8) :: i, perm\n perm = 1\n do i = n, n - k + 1, -1\n perm = mod(perm * i, m)\n end do\n end function perm\n\n function fact(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: i, fact\n fact = 1\n do i = 1, n\n fact = mod(fact * i, m)\n end do\n end function fact\n\n function inv(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: inv\n inv = pow(n, m - 2, m)\n end function inv\n\n recursive function pow(n, p, m) result(res)\n implicit none\n integer(8), intent(in) :: n, p, m\n integer(8) :: res\n if (p == 0) then\n res = 1\n else if (mod(p, 2_8) == 0) then\n res = mod(pow(n, p / 2, m) ** 2, m)\n else\n res = mod(pow(n, p - 1, m) * n, m)\n end if\n end function pow\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "sample_input": "3 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02862", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1419, "cpu_time_ms": 7, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s999118044", "group_id": "codeNet:p02862", "input_text": "program kadai\n implicit none\ninteger(8) :: x,y,i\ninteger(8) :: newx,newy\ninteger(8),allocatable :: ue(:),shita1(:),shita2(:)\ninteger(8) :: ans\n\nread(*,*) x,y\n\nnewx=-x+2*y\nnewy=2*x-y\n\nif (mod(newx,3) /= 0 .or. mod(newy,3) /=0 .or. newx<0 .or. newy<0) then\n write(*,*) 0\n stop\nend if\nnewx=newx/3\nnewy=newy/3\n\nallocate(ue(newx+newy))\nallocate(shita1(10**9+7))\nallocate(shita2(newy+newy))\n\nue(1)=1\nshita1(1)=1\nshita2(1)=1\n\ndo i=2,newx+newy\n ue(i)=mod(ue(i-1)*i,10**9+7)\n shita1(i)=10**9+7-mod(shita1(mod(10**9+7,i)) * ((10**9+7)/i) , 10**9+7)\n shita2(i)=mod(shita2(i-1)*shita1(i),10**9+7)\nend do\n\n!do i=1,10**9+5\n! ans=mod(ans*shita1*shita2,10**9+7)\n!end do\n\nans=mod(ue(newx+newy)*mod(shita2(newx)*shita2(newy),10**9+7),10**9+7)\nwrite(*,*) ans\n\nstop\ncontains\nend program kadai\n", "language": "Fortran", "metadata": {"date": 1573960427, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02862.html", "problem_id": "p02862", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02862/input.txt", "sample_output_relpath": "derived/input_output/data/p02862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02862/Fortran/s999118044.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s999118044", "user_id": "u286754585"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program kadai\n implicit none\ninteger(8) :: x,y,i\ninteger(8) :: newx,newy\ninteger(8),allocatable :: ue(:),shita1(:),shita2(:)\ninteger(8) :: ans\n\nread(*,*) x,y\n\nnewx=-x+2*y\nnewy=2*x-y\n\nif (mod(newx,3) /= 0 .or. mod(newy,3) /=0 .or. newx<0 .or. newy<0) then\n write(*,*) 0\n stop\nend if\nnewx=newx/3\nnewy=newy/3\n\nallocate(ue(newx+newy))\nallocate(shita1(10**9+7))\nallocate(shita2(newy+newy))\n\nue(1)=1\nshita1(1)=1\nshita2(1)=1\n\ndo i=2,newx+newy\n ue(i)=mod(ue(i-1)*i,10**9+7)\n shita1(i)=10**9+7-mod(shita1(mod(10**9+7,i)) * ((10**9+7)/i) , 10**9+7)\n shita2(i)=mod(shita2(i-1)*shita1(i),10**9+7)\nend do\n\n!do i=1,10**9+5\n! ans=mod(ans*shita1*shita2,10**9+7)\n!end do\n\nans=mod(ue(newx+newy)*mod(shita2(newx)*shita2(newy),10**9+7),10**9+7)\nwrite(*,*) ans\n\nstop\ncontains\nend program kadai\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "sample_input": "3 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02862", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a knight - the chess piece - at the origin (0, 0) of a two-dimensional grid.\n\nWhen the knight is at the square (i, j), it can be moved to either (i+1,j+2) or (i+2, j+1).\n\nIn how many ways can the knight reach the square (X, Y)?\n\nFind the number of ways modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq X \\leq 10^6\n\n1 \\leq Y \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the number of ways for the knight to reach (X, Y) from (0, 0), modulo 10^9 + 7.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n2\n\nThere are two ways: (0,0) \\to (1,2) \\to (3,3) and (0,0) \\to (2,1) \\to (3,3).\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n0\n\nThe knight cannot reach (2,2).\n\nSample Input 3\n\n999999 999999\n\nSample Output 3\n\n151840682\n\nPrint the number of ways modulo 10^9 + 7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 802, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s309272324", "group_id": "codeNet:p02863", "input_text": "program abc145e\ntype data\n integer::A,B\nend type\ninteger N,T\ntype(data),allocatable::menu(:)\ninteger,allocatable::DP1(:,:),DP2(:,:)\ninteger ans\nread*,N,T\nallocate(DP1(0:N+1,0:T),DP2(0:N+1,0:T))\nallocate(menu(N))\ndo i=1,N\n read*,menu(i)%A,menu(i)%B\nend do\n\nDP1=0;DP2=0\ndo i = 1,N\n\tdo j = 0,T\n \tif (j >= menu(i)%A)then\n \tdp1(i+1,j) = max(dp1(i,J-menu(i)%A) +menu(i)%B, dp1(i,j))\n else\n dp1(i+1,j) = dp1(i,j)\n endif\n end do\nend do\ndo i = N,1,-1\n\tdo j = 0,T\n \tif (j >= menu(i)%A)then\n \tdp2(i-1,j) = max(dp2(i,J-menu(i)%A) +menu(i)%B, dp2(i,j))\n else\n dp2(i-1,j) = dp2(i,j)\n endif\n end do\nend do\nans=0\ndo j=1,N\n do i=0,T-1\n ans=max(ans,DP1(j,i)+DP2(j,T-1-i)+menu(j)%B)\n end do\nend do\nprint\"(i0)\",ans\nend program", "language": "Fortran", "metadata": {"date": 1573964736, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02863.html", "problem_id": "p02863", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02863/input.txt", "sample_output_relpath": "derived/input_output/data/p02863/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02863/Fortran/s309272324.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s309272324", "user_id": "u598073939"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "program abc145e\ntype data\n integer::A,B\nend type\ninteger N,T\ntype(data),allocatable::menu(:)\ninteger,allocatable::DP1(:,:),DP2(:,:)\ninteger ans\nread*,N,T\nallocate(DP1(0:N+1,0:T),DP2(0:N+1,0:T))\nallocate(menu(N))\ndo i=1,N\n read*,menu(i)%A,menu(i)%B\nend do\n\nDP1=0;DP2=0\ndo i = 1,N\n\tdo j = 0,T\n \tif (j >= menu(i)%A)then\n \tdp1(i+1,j) = max(dp1(i,J-menu(i)%A) +menu(i)%B, dp1(i,j))\n else\n dp1(i+1,j) = dp1(i,j)\n endif\n end do\nend do\ndo i = N,1,-1\n\tdo j = 0,T\n \tif (j >= menu(i)%A)then\n \tdp2(i-1,j) = max(dp2(i,J-menu(i)%A) +menu(i)%B, dp2(i,j))\n else\n dp2(i-1,j) = dp2(i,j)\n endif\n end do\nend do\nans=0\ndo j=1,N\n do i=0,T-1\n ans=max(ans,DP1(j,i)+DP2(j,T-1-i)+menu(j)%B)\n end do\nend do\nprint\"(i0)\",ans\nend program", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi is at an all-you-can-eat restaurant.\n\nThe restaurant offers N kinds of dishes. It takes A_i minutes to eat the i-th dish, whose deliciousness is B_i.\n\nThe restaurant has the following rules:\n\nYou can only order one dish at a time. The dish ordered will be immediately served and ready to eat.\n\nYou cannot order the same kind of dish more than once.\n\nUntil you finish eating the dish already served, you cannot order a new dish.\n\nAfter T-0.5 minutes from the first order, you can no longer place a new order, but you can continue eating the dish already served.\n\nLet Takahashi's happiness be the sum of the deliciousness of the dishes he eats in this restaurant.\n\nWhat is the maximum possible happiness achieved by making optimal choices?\n\nConstraints\n\n2 \\leq N \\leq 3000\n\n1 \\leq T \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\n1 \\leq B_i \\leq 3000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the maximum possible happiness Takahashi can achieve.\n\nSample Input 1\n\n2 60\n10 10\n100 100\n\nSample Output 1\n\n110\n\nBy ordering the first and second dishes in this order, Takahashi's happiness will be 110.\n\nNote that, if we manage to order a dish in time, we can spend any amount of time to eat it.\n\nSample Input 2\n\n3 60\n10 10\n10 20\n10 30\n\nSample Output 2\n\n60\n\nTakahashi can eat all the dishes within 60 minutes.\n\nSample Input 3\n\n3 60\n30 10\n30 20\n30 30\n\nSample Output 3\n\n50\n\nBy ordering the second and third dishes in this order, Takahashi's happiness will be 50.\n\nWe cannot order three dishes, in whatever order we place them.\n\nSample Input 4\n\n10 100\n15 23\n20 18\n13 17\n24 12\n18 29\n19 27\n23 21\n18 20\n27 15\n22 25\n\nSample Output 4\n\n145", "sample_input": "2 60\n10 10\n100 100\n"}, "reference_outputs": ["110\n"], "source_document_id": "p02863", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi is at an all-you-can-eat restaurant.\n\nThe restaurant offers N kinds of dishes. It takes A_i minutes to eat the i-th dish, whose deliciousness is B_i.\n\nThe restaurant has the following rules:\n\nYou can only order one dish at a time. The dish ordered will be immediately served and ready to eat.\n\nYou cannot order the same kind of dish more than once.\n\nUntil you finish eating the dish already served, you cannot order a new dish.\n\nAfter T-0.5 minutes from the first order, you can no longer place a new order, but you can continue eating the dish already served.\n\nLet Takahashi's happiness be the sum of the deliciousness of the dishes he eats in this restaurant.\n\nWhat is the maximum possible happiness achieved by making optimal choices?\n\nConstraints\n\n2 \\leq N \\leq 3000\n\n1 \\leq T \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\n1 \\leq B_i \\leq 3000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the maximum possible happiness Takahashi can achieve.\n\nSample Input 1\n\n2 60\n10 10\n100 100\n\nSample Output 1\n\n110\n\nBy ordering the first and second dishes in this order, Takahashi's happiness will be 110.\n\nNote that, if we manage to order a dish in time, we can spend any amount of time to eat it.\n\nSample Input 2\n\n3 60\n10 10\n10 20\n10 30\n\nSample Output 2\n\n60\n\nTakahashi can eat all the dishes within 60 minutes.\n\nSample Input 3\n\n3 60\n30 10\n30 20\n30 30\n\nSample Output 3\n\n50\n\nBy ordering the second and third dishes in this order, Takahashi's happiness will be 50.\n\nWe cannot order three dishes, in whatever order we place them.\n\nSample Input 4\n\n10 100\n15 23\n20 18\n13 17\n24 12\n18 29\n19 27\n23 21\n18 20\n27 15\n22 25\n\nSample Output 4\n\n145", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 260, "memory_kb": 70656}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s353034899", "group_id": "codeNet:p02864", "input_text": "program laminate\n implicit none\n integer(8), parameter :: inf = 10000000000000000_8\n integer :: n, k, i, j, l\n integer(8) :: h(0:300) = 0_8, dp(0:300,0:300) = inf\n read(*,*) n, k\n read(*,*) h(1:n)\n dp(:,0) = 0_8\n do i = 1, n\n do j = 1, min(i,n-k)\n do l = 0, i-1\n dp(i,j) = min(dp(i,j),dp(l,j-1)+max(0_8,h(i)-h(l)))\n end do\n end do\n end do\n write(*,'(i0)') minval(dp(1:n,n-k))\nend program laminate", "language": "Fortran", "metadata": {"date": 1574364915, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02864.html", "problem_id": "p02864", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02864/input.txt", "sample_output_relpath": "derived/input_output/data/p02864/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02864/Fortran/s353034899.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s353034899", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program laminate\n implicit none\n integer(8), parameter :: inf = 10000000000000000_8\n integer :: n, k, i, j, l\n integer(8) :: h(0:300) = 0_8, dp(0:300,0:300) = inf\n read(*,*) n, k\n read(*,*) h(1:n)\n dp(:,0) = 0_8\n do i = 1, n\n do j = 1, min(i,n-k)\n do l = 0, i-1\n dp(i,j) = min(dp(i,j),dp(l,j-1)+max(0_8,h(i)-h(l)))\n end do\n end do\n end do\n write(*,'(i0)') minval(dp(1:n,n-k))\nend program laminate", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe will create an artwork by painting black some squares in a white square grid with 10^9 rows and N columns.\n\nThe current plan is as follows: for the i-th column from the left, we will paint the H_i bottommost squares and will not paint the other squares in that column.\n\nBefore starting to work, you can choose at most K columns (possibly zero) and change the values of H_i for these columns to any integers of your choice between 0 and 10^9 (inclusive).\n\nDifferent values can be chosen for different columns.\n\nThen, you will create the modified artwork by repeating the following operation:\n\nChoose one or more consecutive squares in one row and paint them black. (Squares already painted black can be painted again, but squares not to be painted according to the modified plan should not be painted.)\n\nFind the minimum number of times you need to perform this operation.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n0 \\leq K \\leq N\n\n0 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 1\n2 3 4 1\n\nSample Output 1\n\n3\n\nFor example, by changing the value of H_3 to 2, you can create the modified artwork by the following three operations:\n\nPaint black the 1-st through 4-th squares from the left in the 1-st row from the bottom.\n\nPaint black the 1-st through 3-rd squares from the left in the 2-nd row from the bottom.\n\nPaint black the 2-nd square from the left in the 3-rd row from the bottom.\n\nSample Input 2\n\n6 2\n8 6 9 1 2 1\n\nSample Output 2\n\n7\n\nSample Input 3\n\n10 0\n1 1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000\n\nSample Output 3\n\n4999999996", "sample_input": "4 1\n2 3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02864", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe will create an artwork by painting black some squares in a white square grid with 10^9 rows and N columns.\n\nThe current plan is as follows: for the i-th column from the left, we will paint the H_i bottommost squares and will not paint the other squares in that column.\n\nBefore starting to work, you can choose at most K columns (possibly zero) and change the values of H_i for these columns to any integers of your choice between 0 and 10^9 (inclusive).\n\nDifferent values can be chosen for different columns.\n\nThen, you will create the modified artwork by repeating the following operation:\n\nChoose one or more consecutive squares in one row and paint them black. (Squares already painted black can be painted again, but squares not to be painted according to the modified plan should not be painted.)\n\nFind the minimum number of times you need to perform this operation.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n0 \\leq K \\leq N\n\n0 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 1\n2 3 4 1\n\nSample Output 1\n\n3\n\nFor example, by changing the value of H_3 to 2, you can create the modified artwork by the following three operations:\n\nPaint black the 1-st through 4-th squares from the left in the 1-st row from the bottom.\n\nPaint black the 1-st through 3-rd squares from the left in the 2-nd row from the bottom.\n\nPaint black the 2-nd square from the left in the 3-rd row from the bottom.\n\nSample Input 2\n\n6 2\n8 6 9 1 2 1\n\nSample Output 2\n\n7\n\nSample Input 3\n\n10 0\n1 1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000\n\nSample Output 3\n\n4999999996", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 429, "cpu_time_ms": 14, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s300113245", "group_id": "codeNet:p02869", "input_text": "program non_triangular_triplets\n implicit none\n integer(8) :: n, k, i, m\n read(*,*) n, k\n if (2_8*k-1_8 > n) then\n write(*,'(i0)') -1\n stop\n end if\n if (mod(n,2_8) == 1_8) then\n m = (n+1_8)/2_8\n do i = 0_8, m-2_8\n write(*,'(i0,x,i0,x,i0)') k+2_8*i, k+3_8*m-i-2_8, k+4_8*m+i-2_8\n write(*,'(i0,x,i0,x,i0)') k+2_8*i+1_8, k+4_8*m-i-3_8, k+5_8*m+i-3_8\n end do\n write(*,'(i0,x,i0,x,i0)') k+2_8*(m-1_8), k+2_8*m-1_8, k+6_8*m-4_8\n else\n m = n/2_8\n do i = 0_8, m-1_8\n write(*,'(i0,x,i0,x,i0)') k+2_8*i, k+3_8*m-i-1_8, k+4_8*m+i\n write(*,'(i0,x,i0,x,i0)') k+2_8*i+1_8, k+4_8*m-i-1_8, k+5_8*m+i\n end do\n end if\nend program non_triangular_triplets", "language": "Fortran", "metadata": {"date": 1573674857, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02869.html", "problem_id": "p02869", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02869/input.txt", "sample_output_relpath": "derived/input_output/data/p02869/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02869/Fortran/s300113245.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300113245", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1 2 3\n", "input_to_evaluate": "program non_triangular_triplets\n implicit none\n integer(8) :: n, k, i, m\n read(*,*) n, k\n if (2_8*k-1_8 > n) then\n write(*,'(i0)') -1\n stop\n end if\n if (mod(n,2_8) == 1_8) then\n m = (n+1_8)/2_8\n do i = 0_8, m-2_8\n write(*,'(i0,x,i0,x,i0)') k+2_8*i, k+3_8*m-i-2_8, k+4_8*m+i-2_8\n write(*,'(i0,x,i0,x,i0)') k+2_8*i+1_8, k+4_8*m-i-3_8, k+5_8*m+i-3_8\n end do\n write(*,'(i0,x,i0,x,i0)') k+2_8*(m-1_8), k+2_8*m-1_8, k+6_8*m-4_8\n else\n m = n/2_8\n do i = 0_8, m-1_8\n write(*,'(i0,x,i0,x,i0)') k+2_8*i, k+3_8*m-i-1_8, k+4_8*m+i\n write(*,'(i0,x,i0,x,i0)') k+2_8*i+1_8, k+4_8*m-i-1_8, k+5_8*m+i\n end do\n end if\nend program non_triangular_triplets", "problem_context": "Score : 700 points\n\nProblem Statement\n\nGiven are positive integers N and K.\n\nDetermine if the 3N integers K, K+1, ..., K+3N-1 can be partitioned into N triples (a_1,b_1,c_1), ..., (a_N,b_N,c_N) so that the condition below is satisfied. Any of the integers K, K+1, ..., K+3N-1 must appear in exactly one of those triples.\n\nFor every integer i from 1 to N, a_i + b_i \\leq c_i holds.\n\nIf the answer is yes, construct one such partition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf it is impossible to partition the integers satisfying the condition, print -1. If it is possible, print N triples in the following format:\n\na_1 b_1 c_1\n:\na_N b_N c_N\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1 2 3\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1", "sample_input": "1 1\n"}, "reference_outputs": ["1 2 3\n"], "source_document_id": "p02869", "source_text": "Score : 700 points\n\nProblem Statement\n\nGiven are positive integers N and K.\n\nDetermine if the 3N integers K, K+1, ..., K+3N-1 can be partitioned into N triples (a_1,b_1,c_1), ..., (a_N,b_N,c_N) so that the condition below is satisfied. Any of the integers K, K+1, ..., K+3N-1 must appear in exactly one of those triples.\n\nFor every integer i from 1 to N, a_i + b_i \\leq c_i holds.\n\nIf the answer is yes, construct one such partition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf it is impossible to partition the integers satisfying the condition, print -1. If it is possible, print N triples in the following format:\n\na_1 b_1 c_1\n:\na_N b_N c_N\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1 2 3\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 690, "cpu_time_ms": 92, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s293148122", "group_id": "codeNet:p02869", "input_text": "program non_triangular_triplets\n implicit none\n integer(8) :: n, k, i\n read(*,*) n, k\n if (2_8*k+2_8*n-1_8 <= k+2_8*n) then\n do i = 0_8, n-1_8\n write(*,'(i0,x,i0,x,i0)') k+i, k+2_8*n-1_8-i, k+2_8*n+i\n end do\n else\n write(*,'(i0)') -1\n end if\nend program non_triangular_triplets", "language": "Fortran", "metadata": {"date": 1573631407, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02869.html", "problem_id": "p02869", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02869/input.txt", "sample_output_relpath": "derived/input_output/data/p02869/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02869/Fortran/s293148122.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s293148122", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1 2 3\n", "input_to_evaluate": "program non_triangular_triplets\n implicit none\n integer(8) :: n, k, i\n read(*,*) n, k\n if (2_8*k+2_8*n-1_8 <= k+2_8*n) then\n do i = 0_8, n-1_8\n write(*,'(i0,x,i0,x,i0)') k+i, k+2_8*n-1_8-i, k+2_8*n+i\n end do\n else\n write(*,'(i0)') -1\n end if\nend program non_triangular_triplets", "problem_context": "Score : 700 points\n\nProblem Statement\n\nGiven are positive integers N and K.\n\nDetermine if the 3N integers K, K+1, ..., K+3N-1 can be partitioned into N triples (a_1,b_1,c_1), ..., (a_N,b_N,c_N) so that the condition below is satisfied. Any of the integers K, K+1, ..., K+3N-1 must appear in exactly one of those triples.\n\nFor every integer i from 1 to N, a_i + b_i \\leq c_i holds.\n\nIf the answer is yes, construct one such partition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf it is impossible to partition the integers satisfying the condition, print -1. If it is possible, print N triples in the following format:\n\na_1 b_1 c_1\n:\na_N b_N c_N\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1 2 3\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1", "sample_input": "1 1\n"}, "reference_outputs": ["1 2 3\n"], "source_document_id": "p02869", "source_text": "Score : 700 points\n\nProblem Statement\n\nGiven are positive integers N and K.\n\nDetermine if the 3N integers K, K+1, ..., K+3N-1 can be partitioned into N triples (a_1,b_1,c_1), ..., (a_N,b_N,c_N) so that the condition below is satisfied. Any of the integers K, K+1, ..., K+3N-1 must appear in exactly one of those triples.\n\nFor every integer i from 1 to N, a_i + b_i \\leq c_i holds.\n\nIf the answer is yes, construct one such partition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf it is impossible to partition the integers satisfying the condition, print -1. If it is possible, print N triples in the following format:\n\na_1 b_1 c_1\n:\na_N b_N c_N\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1 2 3\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s400123996", "group_id": "codeNet:p02873", "input_text": "program main\n implicit none\n character(5*10**5) :: s\n integer :: n, i, k, j, l, m, ans\n integer, allocatable :: a(:)\n\n read(*,*) s\n n = len_trim(s) + 1\n\n ans = 0\n do i = 1, n-1\n if(s(i:i) == '<') then\n k = i\n do j = 1, n-1\n if (s(j:j) == '>') then\n l = j\n exit\n end if\n end do\n\n do j = l, n-1\n if(s(j:j) == '<') then\n m = i\n exit\n end if\n end do\n\n if (l >= m) then\n ans = ans + l*(l+1)/2 + m*(m-1)/2\n else\n ans = ans + m*(m+1)/2 + l*(l-1)/2\n end if\n\n end if\nend do\n\nwrite(*,*) ans\n\nstop\nend program main\n\n\n\n \n", "language": "Fortran", "metadata": {"date": 1590806482, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02873.html", "problem_id": "p02873", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02873/input.txt", "sample_output_relpath": "derived/input_output/data/p02873/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02873/Fortran/s400123996.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s400123996", "user_id": "u979474608"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n character(5*10**5) :: s\n integer :: n, i, k, j, l, m, ans\n integer, allocatable :: a(:)\n\n read(*,*) s\n n = len_trim(s) + 1\n\n ans = 0\n do i = 1, n-1\n if(s(i:i) == '<') then\n k = i\n do j = 1, n-1\n if (s(j:j) == '>') then\n l = j\n exit\n end if\n end do\n\n do j = l, n-1\n if(s(j:j) == '<') then\n m = i\n exit\n end if\n end do\n\n if (l >= m) then\n ans = ans + l*(l+1)/2 + m*(m-1)/2\n else\n ans = ans + m*(m+1)/2 + l*(l-1)/2\n end if\n\n end if\nend do\n\nwrite(*,*) ans\n\nstop\nend program main\n\n\n\n \n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S of length N-1.\nEach character in S is < or >.\n\nA sequence of N non-negative integers, a_1,a_2,\\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \\leq i \\leq N-1):\n\nIf S_i= <: a_i: a_i>a_{i+1}\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^5\n\nS is a string of length N-1 consisting of < and >.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nSample Input 1\n\n<>>\n\nSample Output 1\n\n3\n\na=(0,2,1,0) is a good sequence whose sum is 3.\nThere is no good sequence whose sum is less than 3.\n\nSample Input 2\n\n<>>><<><<<<<>>><\n\nSample Output 2\n\n28", "sample_input": "<>>\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02873", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S of length N-1.\nEach character in S is < or >.\n\nA sequence of N non-negative integers, a_1,a_2,\\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \\leq i \\leq N-1):\n\nIf S_i= <: a_i: a_i>a_{i+1}\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^5\n\nS is a string of length N-1 consisting of < and >.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nSample Input 1\n\n<>>\n\nSample Output 1\n\n3\n\na=(0,2,1,0) is a good sequence whose sum is 3.\nThere is no good sequence whose sum is less than 3.\n\nSample Input 2\n\n<>>><<><<<<<>>><\n\nSample Output 2\n\n28", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1980}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s178942700", "group_id": "codeNet:p02880", "input_text": "program abc144b\n implicit none\n integer :: N, i\n\n read(*,*) N\n\n do i = 1, 9\n if (mod(N,i) == 0) then\n if (N/i <= 9) then\n write(*,*) \"Yes\"\n stop\n end if\n end if\n end do\n\n write(*,*) \"No\"\n\nend program abc144b\n", "language": "Fortran", "metadata": {"date": 1572454384, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02880.html", "problem_id": "p02880", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02880/input.txt", "sample_output_relpath": "derived/input_output/data/p02880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02880/Fortran/s178942700.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178942700", "user_id": "u210113718"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program abc144b\n implicit none\n integer :: N, i\n\n read(*,*) N\n\n do i = 1, 9\n if (mod(N,i) == 0) then\n if (N/i <= 9) then\n write(*,*) \"Yes\"\n stop\n end if\n end if\n end do\n\n write(*,*) \"No\"\n\nend program abc144b\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "sample_input": "10\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02880", "source_text": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 268, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s433529907", "group_id": "codeNet:p02880", "input_text": "program ABC144B\n implicit none\n integer::N,i\n integer::result=0\n\n read*,N\n\n do i=1,9\n if(mod(N,i)==0 .and. N/i<=9) then\n result=1\n endif\n end do\n\n if(result==0) then\n print'(A)',\"No\"\n else\n print'(A)',\"Yes\"\n end if\nend program ABC144B", "language": "Fortran", "metadata": {"date": 1572224784, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02880.html", "problem_id": "p02880", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02880/input.txt", "sample_output_relpath": "derived/input_output/data/p02880/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02880/Fortran/s433529907.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s433529907", "user_id": "u414699019"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC144B\n implicit none\n integer::N,i\n integer::result=0\n\n read*,N\n\n do i=1,9\n if(mod(N,i)==0 .and. N/i<=9) then\n result=1\n endif\n end do\n\n if(result==0) then\n print'(A)',\"No\"\n else\n print'(A)',\"Yes\"\n end if\nend program ABC144B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "sample_input": "10\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02880", "source_text": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 8, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s978123027", "group_id": "codeNet:p02881", "input_text": "program main\n implicit none\n \n integer(16) :: i,j,n,m,l,p=0,q=0\n \n read(*,*)n\n m = int(sqrt(real(n)))\n do i = 1, m\n l = n/i\n if (i*l == n) then\n p = i\n q = l\n end if\n end do\n write(*,'(i0)')p+q-2\nend program main", "language": "Fortran", "metadata": {"date": 1573155686, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02881/input.txt", "sample_output_relpath": "derived/input_output/data/p02881/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02881/Fortran/s978123027.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978123027", "user_id": "u287431190"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n \n integer(16) :: i,j,n,m,l,p=0,q=0\n \n read(*,*)n\n m = int(sqrt(real(n)))\n do i = 1, m\n l = n/i\n if (i*l == n) then\n p = i\n q = l\n end if\n end do\n write(*,'(i0)')p+q-2\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "sample_input": "10\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02881", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 240, "cpu_time_ms": 18, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s513253829", "group_id": "codeNet:p02882", "input_text": "program prob4\n implicit none\n integer::a,b,x\n real(8)::aa,bb,xx\n real(8),parameter::pi=3.141592653589793_8\n read(*,*) a,b,x\n aa = dble(a)\n bb = dble(b)\n xx = dble(x)\n if(2*x < a*a*b) then\n write(*,*) 90.0_8 - atan(2.0_8*xx / (aa*bb*bb))*180.0_8/pi\n else\n write(*,*) atan((2.0_8*bb - 2.0_8*xx/aa**2) / aa)*180.0_8/pi\n end if\n stop\nend program", "language": "Fortran", "metadata": {"date": 1594647160, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02882.html", "problem_id": "p02882", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02882/input.txt", "sample_output_relpath": "derived/input_output/data/p02882/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02882/Fortran/s513253829.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s513253829", "user_id": "u841856382"}, "prompt_components": {"gold_output": "45.0000000000\n", "input_to_evaluate": "program prob4\n implicit none\n integer::a,b,x\n real(8)::aa,bb,xx\n real(8),parameter::pi=3.141592653589793_8\n read(*,*) a,b,x\n aa = dble(a)\n bb = dble(b)\n xx = dble(x)\n if(2*x < a*a*b) then\n write(*,*) 90.0_8 - atan(2.0_8*xx / (aa*bb*bb))*180.0_8/pi\n else\n write(*,*) atan((2.0_8*bb - 2.0_8*xx/aa**2) / aa)*180.0_8/pi\n end if\n stop\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "sample_input": "2 2 4\n"}, "reference_outputs": ["45.0000000000\n"], "source_document_id": "p02882", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3160}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s173296660", "group_id": "codeNet:p02883", "input_text": "program problemE\n implicit none\n \n integer, parameter :: double = selected_real_kind ( 9 )\n integer, parameter :: i8 = selected_int_kind ( 18 )\n real ( kind = double ), parameter :: pi = 3.141592653589790_double\n\n integer, allocatable, dimension ( : ) :: mxl\n integer ( kind = i8 ) :: N, K, i, j, tmp, ans, min\n integer ( kind = i8 ), allocatable, dimension ( : ) :: A, F, AF, sA, sF \n\n read *, N, K\n\n allocate ( mxl ( 1:1 ) )\n allocate ( A ( 1:N ) )\n allocate ( F ( 1:N ) )\n allocate ( AF ( 1:N ) )\n allocate ( sA ( 1:N ) )\n allocate ( sF ( 1:N ) )\n \n read *, A ( 1:N )\n read *, F ( 1:N )\n\n call sort ( N, A, sA, F, sF )\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n \n do i = 1, K\n mxl ( 1:1 ) = maxloc ( AF ( 1:N ) )\n if ( AF ( mxl ( 1 ) ) == 0 ) then\n exit\n end if\n sA ( mxl ( 1 ) ) = sA ( mxl ( 1 ) ) - 1_i8\n AF ( mxl ( 1 ) ) = sA ( mxl ( 1 ) ) * sF ( mxl ( 1 ) ) \n end do\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n \n ans = maxval ( AF ( 1:N ) )\n print *, ans\n\n \ncontains\n \n subroutine sort ( n, lagsrc, lagrtn, smasrc, smartn )\n implicit none\n \n!!! parameter ==================================================\n \n integer, parameter :: i8 = selected_int_kind ( 18 )\n integer ( kind = i8 ) :: i, max, min, imax, imin\n integer ( kind = i8 ), intent ( in ) :: n\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( in ) :: lagsrc, smasrc\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( out ) :: lagrtn, smartn\n integer ( kind = i8 ), allocatable, dimension ( : ) :: lagtmp, smatmp\n\n \n!!! allocate ==================================================\n \n allocate ( lagrtn ( n ) )\n allocate ( lagtmp ( n ) )\n allocate ( smartn ( n ) )\n allocate ( smatmp ( n ) )\n \n max = maxval ( lagsrc ( 1:n ) )\n imax = maxval ( lagsrc ( 1:n ) )\n min = minval ( lagsrc ( 1:n ) )\n imin = minval ( lagsrc ( 1:n ) )\n\n\n!!! sort ==================================================\n \n max = maxval ( lagsrc ( 1:n ) )\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagtmp ( : ) ]\n \n min = minval ( smasrc ( 1:n ) )\n smatmp = pack ( smasrc, smasrc == min ) \n smartn = [ smatmp ( : ) ]\n \n do i = imin, imax\n max = max - 1\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagrtn, lagtmp ]\n \n min = min + 1\n smatmp = pack ( smasrc, smasrc == min )\n smartn = [ smartn, smatmp ]\n end do\n \n \n!!! ==================================================\n \n end subroutine sort\n \n\nend program problemE\n", "language": "Fortran", "metadata": {"date": 1572651432, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02883.html", "problem_id": "p02883", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02883/input.txt", "sample_output_relpath": "derived/input_output/data/p02883/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02883/Fortran/s173296660.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s173296660", "user_id": "u731648631"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program problemE\n implicit none\n \n integer, parameter :: double = selected_real_kind ( 9 )\n integer, parameter :: i8 = selected_int_kind ( 18 )\n real ( kind = double ), parameter :: pi = 3.141592653589790_double\n\n integer, allocatable, dimension ( : ) :: mxl\n integer ( kind = i8 ) :: N, K, i, j, tmp, ans, min\n integer ( kind = i8 ), allocatable, dimension ( : ) :: A, F, AF, sA, sF \n\n read *, N, K\n\n allocate ( mxl ( 1:1 ) )\n allocate ( A ( 1:N ) )\n allocate ( F ( 1:N ) )\n allocate ( AF ( 1:N ) )\n allocate ( sA ( 1:N ) )\n allocate ( sF ( 1:N ) )\n \n read *, A ( 1:N )\n read *, F ( 1:N )\n\n call sort ( N, A, sA, F, sF )\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n \n do i = 1, K\n mxl ( 1:1 ) = maxloc ( AF ( 1:N ) )\n if ( AF ( mxl ( 1 ) ) == 0 ) then\n exit\n end if\n sA ( mxl ( 1 ) ) = sA ( mxl ( 1 ) ) - 1_i8\n AF ( mxl ( 1 ) ) = sA ( mxl ( 1 ) ) * sF ( mxl ( 1 ) ) \n end do\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n \n ans = maxval ( AF ( 1:N ) )\n print *, ans\n\n \ncontains\n \n subroutine sort ( n, lagsrc, lagrtn, smasrc, smartn )\n implicit none\n \n!!! parameter ==================================================\n \n integer, parameter :: i8 = selected_int_kind ( 18 )\n integer ( kind = i8 ) :: i, max, min, imax, imin\n integer ( kind = i8 ), intent ( in ) :: n\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( in ) :: lagsrc, smasrc\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( out ) :: lagrtn, smartn\n integer ( kind = i8 ), allocatable, dimension ( : ) :: lagtmp, smatmp\n\n \n!!! allocate ==================================================\n \n allocate ( lagrtn ( n ) )\n allocate ( lagtmp ( n ) )\n allocate ( smartn ( n ) )\n allocate ( smatmp ( n ) )\n \n max = maxval ( lagsrc ( 1:n ) )\n imax = maxval ( lagsrc ( 1:n ) )\n min = minval ( lagsrc ( 1:n ) )\n imin = minval ( lagsrc ( 1:n ) )\n\n\n!!! sort ==================================================\n \n max = maxval ( lagsrc ( 1:n ) )\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagtmp ( : ) ]\n \n min = minval ( smasrc ( 1:n ) )\n smatmp = pack ( smasrc, smasrc == min ) \n smartn = [ smatmp ( : ) ]\n \n do i = imin, imax\n max = max - 1\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagrtn, lagtmp ]\n \n min = min + 1\n smatmp = pack ( smasrc, smasrc == min )\n smartn = [ smartn, smatmp ]\n end do\n \n \n!!! ==================================================\n \n end subroutine sort\n \n\nend program problemE\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "sample_input": "3 5\n4 2 1\n2 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02883", "source_text": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2696, "cpu_time_ms": 2104, "memory_kb": 11896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s148677657", "group_id": "codeNet:p02883", "input_text": "program problemE\n implicit none\n \n integer, parameter :: double = selected_real_kind ( 9 )\n integer, parameter :: i8 = selected_int_kind ( 18 )\n real ( kind = double ), parameter :: pi = 3.141592653589790_double\n\n integer ( kind = i8 ) :: N, K, i, j, tmp, ans, min\n integer ( kind = i8 ), allocatable, dimension ( : ) :: A, F, AF, sA, sF \n\n read *, N, K\n\n allocate ( A ( 1:N ) )\n allocate ( F ( 1:N ) )\n allocate ( AF ( 1:N ) )\n allocate ( sA ( 1:N ) )\n allocate ( sF ( 1:N ) )\n \n read *, A ( 1:N )\n read *, F ( 1:N )\n\n call sort ( N, A, sA, F, sF )\n\n do i = 1, K\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n if ( sum ( AF ( 1:N ) ) == 0 ) then\n exit\n end if\n sA ( maxloc ( AF ( 1:N ) ) ) = sA ( maxloc ( AF ( 1:N ) ) ) - 1\n end do\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n \n ans = maxval ( AF ( 1:N ) )\n print *, ans\n\n \ncontains\n \n subroutine sort ( n, lagsrc, lagrtn, smasrc, smartn )\n implicit none\n \n!!! parameter ==================================================\n \n integer, parameter :: i8 = selected_int_kind ( 18 )\n integer ( kind = i8 ), intent ( in ) :: n\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( in ) :: lagsrc, smasrc\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( out ) :: lagrtn, smartn\n integer ( kind = i8 ), allocatable, dimension ( : ) :: lagtmp, smatmp\n integer ( kind = i8 ) :: i, max, min, imax, imin\n \n!!! allocate ==================================================\n \n allocate ( lagrtn ( n ) )\n allocate ( lagtmp ( n ) )\n allocate ( smartn ( n ) )\n allocate ( smatmp ( n ) )\n \n max = maxval ( lagsrc ( 1:n ) )\n imax = maxval ( lagsrc ( 1:n ) )\n min = minval ( lagsrc ( 1:n ) )\n imin = minval ( lagsrc ( 1:n ) )\n\n\n!!! sort ==================================================\n \n max = maxval ( lagsrc ( 1:n ) )\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagtmp ( : ) ]\n \n min = minval ( smasrc ( 1:n ) )\n smatmp = pack ( smasrc, smasrc == min ) \n smartn = [ smatmp ( : ) ]\n \n do i = imin, imax\n max = max - 1\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagrtn, lagtmp ]\n \n min = min + 1\n smatmp = pack ( smasrc, smasrc == min )\n smartn = [ smartn, smatmp ]\n end do\n \n \n!!! ==================================================\n \n end subroutine sort\n \n\nend program problemE\n", "language": "Fortran", "metadata": {"date": 1572640981, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02883.html", "problem_id": "p02883", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02883/input.txt", "sample_output_relpath": "derived/input_output/data/p02883/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02883/Fortran/s148677657.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s148677657", "user_id": "u731648631"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program problemE\n implicit none\n \n integer, parameter :: double = selected_real_kind ( 9 )\n integer, parameter :: i8 = selected_int_kind ( 18 )\n real ( kind = double ), parameter :: pi = 3.141592653589790_double\n\n integer ( kind = i8 ) :: N, K, i, j, tmp, ans, min\n integer ( kind = i8 ), allocatable, dimension ( : ) :: A, F, AF, sA, sF \n\n read *, N, K\n\n allocate ( A ( 1:N ) )\n allocate ( F ( 1:N ) )\n allocate ( AF ( 1:N ) )\n allocate ( sA ( 1:N ) )\n allocate ( sF ( 1:N ) )\n \n read *, A ( 1:N )\n read *, F ( 1:N )\n\n call sort ( N, A, sA, F, sF )\n\n do i = 1, K\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n if ( sum ( AF ( 1:N ) ) == 0 ) then\n exit\n end if\n sA ( maxloc ( AF ( 1:N ) ) ) = sA ( maxloc ( AF ( 1:N ) ) ) - 1\n end do\n AF ( 1:N ) = sA ( 1:N ) * sF ( 1:N )\n \n ans = maxval ( AF ( 1:N ) )\n print *, ans\n\n \ncontains\n \n subroutine sort ( n, lagsrc, lagrtn, smasrc, smartn )\n implicit none\n \n!!! parameter ==================================================\n \n integer, parameter :: i8 = selected_int_kind ( 18 )\n integer ( kind = i8 ), intent ( in ) :: n\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( in ) :: lagsrc, smasrc\n integer ( kind = i8 ), allocatable, dimension ( : ), intent ( out ) :: lagrtn, smartn\n integer ( kind = i8 ), allocatable, dimension ( : ) :: lagtmp, smatmp\n integer ( kind = i8 ) :: i, max, min, imax, imin\n \n!!! allocate ==================================================\n \n allocate ( lagrtn ( n ) )\n allocate ( lagtmp ( n ) )\n allocate ( smartn ( n ) )\n allocate ( smatmp ( n ) )\n \n max = maxval ( lagsrc ( 1:n ) )\n imax = maxval ( lagsrc ( 1:n ) )\n min = minval ( lagsrc ( 1:n ) )\n imin = minval ( lagsrc ( 1:n ) )\n\n\n!!! sort ==================================================\n \n max = maxval ( lagsrc ( 1:n ) )\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagtmp ( : ) ]\n \n min = minval ( smasrc ( 1:n ) )\n smatmp = pack ( smasrc, smasrc == min ) \n smartn = [ smatmp ( : ) ]\n \n do i = imin, imax\n max = max - 1\n lagtmp = pack ( lagsrc, lagsrc == max )\n lagrtn = [ lagrtn, lagtmp ]\n \n min = min + 1\n smatmp = pack ( smasrc, smasrc == min )\n smartn = [ smartn, smatmp ]\n end do\n \n \n!!! ==================================================\n \n end subroutine sort\n \n\nend program problemE\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "sample_input": "3 5\n4 2 1\n2 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02883", "source_text": "Score: 500 points\n\nProblem Statement\n\nTakahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.\n\nIn the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:\n\nA team should assign one member to each food, and should not assign the same member to multiple foods.\n\nIt will take x \\times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.\n\nThe score of a team is the longest time it takes for an individual member to finish the food.\n\nBefore the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.\n\nWhat is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^{18}\n\n1 \\leq A_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\n1 \\leq F_i \\leq 10^6\\ (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\nF_1 F_2 ... F_N\n\nOutput\n\nPrint the minimum possible score of the team.\n\nSample Input 1\n\n3 5\n4 2 1\n2 3 1\n\nSample Output 1\n\n2\n\nThey can achieve the score of 2, as follows:\n\nMember 1 does 4 sets of training and eats Food 2 in (4-4) \\times 3 = 0 seconds.\n\nMember 2 does 1 set of training and eats Food 3 in (2-1) \\times 1 = 1 second.\n\nMember 3 does 0 sets of training and eats Food 1 in (1-0) \\times 2 = 2 seconds.\n\nThey cannot achieve a score of less than 2, so the answer is 2.\n\nSample Input 2\n\n3 8\n4 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nThey can choose not to do exactly K sets of training.\n\nSample Input 3\n\n11 14\n3 1 4 1 5 9 2 6 5 3 5\n8 9 7 9 3 2 3 8 4 6 2\n\nSample Output 3\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2518, "cpu_time_ms": 2104, "memory_kb": 13692}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s513044668", "group_id": "codeNet:p02886", "input_text": "program bbb\nimplicit none\n\ninteger :: n, i, j, res\ninteger,allocatable,dimension(:) :: d\n\nread*, n\nallocate(d(n))\nread*, d\n\nres=0\n\ndo i=1,n\n do j=i+1,n\n res=res+d(i)*d(j)\n end do\nend do\n\nwrite(*,'(i0)') res\n\nend program", "language": "Fortran", "metadata": {"date": 1571533625, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02886.html", "problem_id": "p02886", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02886/input.txt", "sample_output_relpath": "derived/input_output/data/p02886/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02886/Fortran/s513044668.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s513044668", "user_id": "u039189422"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "program bbb\nimplicit none\n\ninteger :: n, i, j, res\ninteger,allocatable,dimension(:) :: d\n\nread*, n\nallocate(d(n))\nread*, d\n\nres=0\n\ndo i=1,n\n do j=i+1,n\n res=res+d(i)*d(j)\n end do\nend do\n\nwrite(*,'(i0)') res\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s767167747", "group_id": "codeNet:p02886", "input_text": "program TAKOYAKI_FESTIVAL_2019\n implicit none\n integer :: n, d(50) = 0\n read(*,*) n\n read(*,*) d(1:n)\n write(*,'(i0)') (sum(d)**2-sum(d**2))/2\nend program TAKOYAKI_FESTIVAL_2019", "language": "Fortran", "metadata": {"date": 1571533409, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02886.html", "problem_id": "p02886", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02886/input.txt", "sample_output_relpath": "derived/input_output/data/p02886/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02886/Fortran/s767167747.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s767167747", "user_id": "u506403362"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "program TAKOYAKI_FESTIVAL_2019\n implicit none\n integer :: n, d(50) = 0\n read(*,*) n\n read(*,*) d(1:n)\n write(*,'(i0)') (sum(d)**2-sum(d**2))/2\nend program TAKOYAKI_FESTIVAL_2019", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s230994342", "group_id": "codeNet:p02887", "input_text": "program ccc\nimplicit none\n\ninteger :: n, i, res\ncharacter(100000) :: s\ncharacter(1) :: che\n\nread*, n\nread*, s\n\nche=s(1:1)\nres=1\n\ndo i=2, n\n\tif(s(i:i)/=che) then\n\t\tres=res+1\n\tend if\n\tche=s(i:i)\nend do\n\nwrite(*,'(i0)') res\n\nend program", "language": "Fortran", "metadata": {"date": 1571533924, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02887.html", "problem_id": "p02887", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02887/input.txt", "sample_output_relpath": "derived/input_output/data/p02887/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02887/Fortran/s230994342.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230994342", "user_id": "u039189422"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program ccc\nimplicit none\n\ninteger :: n, i, res\ncharacter(100000) :: s\ncharacter(1) :: che\n\nread*, n\nread*, s\n\nche=s(1:1)\nres=1\n\ndo i=2, n\n\tif(s(i:i)/=che) then\n\t\tres=res+1\n\tend if\n\tche=s(i:i)\nend do\n\nwrite(*,'(i0)') res\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 7, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s665788219", "group_id": "codeNet:p02894", "input_text": "program incenters\n implicit none\n real(8), parameter :: pi = 3.14159265358979d0\n integer :: n, l, t, i, j, k\n real(8) :: v(3000,2) = 0.d0, c(2) = 0.d0, s(0:3000,2) = 0.d0\n real(8) :: di, dj, dk\n character(48) :: sx, sy\n read(*,*) n, l\n do i = 1, n\n read(*,*) t\n v(i,1) = cos(2.d0*pi*real(t,8)/real(l,8))\n v(i,2) = sin(2.d0*pi*real(t,8)/real(l,8))\n s(i,:) = s(i-1,:)+v(i,:)\n end do\n do i = 1, n-2\n do j = i+1, n-1\n do k = j+1, n\n di = d(v(j,:),v(k,:))\n dj = d(v(k,:),v(i,:))\n dk = d(v(i,:),v(j,:))\n c = c+(di*v(i,:)+dj*v(j,:)+dk*v(k,:))/(di+dj+dk)\n end do\n end do\n end do\n c = 6.d0*c/(real(n,8)*real(n-1,8)*real(n-2,8))\n write(sx,'(f32.16)') c(1)\n write(sy,'(f32.16)') c(2)\n write(*,'(a,x,a)') trim(adjustl(sx)), trim(adjustl(sy))\ncontains\n real(8) function d(v1,v2)\n real(8), intent(in) :: v1(2), v2(2)\n d = sqrt(dot_product(v1-v2,v1-v2))\n end\nend program incenters", "language": "Fortran", "metadata": {"date": 1570332096, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02894.html", "problem_id": "p02894", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02894/input.txt", "sample_output_relpath": "derived/input_output/data/p02894/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02894/Fortran/s665788219.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s665788219", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0.414213562373095 -0.000000000000000\n", "input_to_evaluate": "program incenters\n implicit none\n real(8), parameter :: pi = 3.14159265358979d0\n integer :: n, l, t, i, j, k\n real(8) :: v(3000,2) = 0.d0, c(2) = 0.d0, s(0:3000,2) = 0.d0\n real(8) :: di, dj, dk\n character(48) :: sx, sy\n read(*,*) n, l\n do i = 1, n\n read(*,*) t\n v(i,1) = cos(2.d0*pi*real(t,8)/real(l,8))\n v(i,2) = sin(2.d0*pi*real(t,8)/real(l,8))\n s(i,:) = s(i-1,:)+v(i,:)\n end do\n do i = 1, n-2\n do j = i+1, n-1\n do k = j+1, n\n di = d(v(j,:),v(k,:))\n dj = d(v(k,:),v(i,:))\n dk = d(v(i,:),v(j,:))\n c = c+(di*v(i,:)+dj*v(j,:)+dk*v(k,:))/(di+dj+dk)\n end do\n end do\n end do\n c = 6.d0*c/(real(n,8)*real(n-1,8)*real(n-2,8))\n write(sx,'(f32.16)') c(1)\n write(sy,'(f32.16)') c(2)\n write(*,'(a,x,a)') trim(adjustl(sx)), trim(adjustl(sy))\ncontains\n real(8) function d(v1,v2)\n real(8), intent(in) :: v1(2), v2(2)\n d = sqrt(dot_product(v1-v2,v1-v2))\n end\nend program incenters", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nGiven are N points on the circumference of a circle centered at (0,0) in an xy-plane.\nThe coordinates of the i-th point are (\\cos(\\frac{2\\pi T_i}{L}),\\sin(\\frac{2\\pi T_i}{L})).\n\nThree distinct points will be chosen uniformly at random from these N points.\nFind the expected x- and y-coordinates of the center of the circle inscribed in the triangle formed by the chosen points.\n\nConstraints\n\n3 \\leq N \\leq 3000\n\nN \\leq L \\leq 10^9\n\n0 \\leq T_i \\leq L-1\n\nT_i=k) co=co+1\nend do\n\nwrite(*,'(i0)') co\n\nend program", "language": "Fortran", "metadata": {"date": 1569951713, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02898.html", "problem_id": "p02898", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02898/input.txt", "sample_output_relpath": "derived/input_output/data/p02898/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02898/Fortran/s248239099.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248239099", "user_id": "u039189422"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program bbb\n\nimplicit none\ninteger :: n, k, i, co\ninteger, allocatable, dimension(:) :: h\n\nread*, n, k\nallocate(h(n))\nread*, h\n\nco = 0\n\ndo i=1,n\nif (h(i)>=k) co=co+1\nend do\n\nwrite(*,'(i0)') co\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 205, "cpu_time_ms": 21, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s502531050", "group_id": "codeNet:p02898", "input_text": "program roller_coaster\n implicit none\n integer :: n, k, h(100000) = 0, i\n read(*,*) n, k\n read(*,*) h(1:n)\n write(*,'(i0)') sum([(1,i=1,n)],mask=h(1:n)>=k)\nend program roller_coaster", "language": "Fortran", "metadata": {"date": 1569719058, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02898.html", "problem_id": "p02898", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02898/input.txt", "sample_output_relpath": "derived/input_output/data/p02898/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02898/Fortran/s502531050.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s502531050", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program roller_coaster\n implicit none\n integer :: n, k, h(100000) = 0, i\n read(*,*) n, k\n read(*,*) h(1:n)\n write(*,'(i0)') sum([(1,i=1,n)],mask=h(1:n)>=k)\nend program roller_coaster", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 21, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s591919023", "group_id": "codeNet:p02899", "input_text": "program go_to_school\n implicit none\n integer n, i\n integer a(100000), b(100000)\n read *, n\n read *, a(1:n)\n do i = 1, n\n b(a(i)) = i\n end do\n write(*,*) b(1:n)\nend program", "language": "Fortran", "metadata": {"date": 1599250387, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02899.html", "problem_id": "p02899", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02899/input.txt", "sample_output_relpath": "derived/input_output/data/p02899/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02899/Fortran/s591919023.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s591919023", "user_id": "u622206408"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "program go_to_school\n implicit none\n integer n, i\n integer a(100000), b(100000)\n read *, n\n read *, a(1:n)\n do i = 1, n\n b(a(i)) = i\n end do\n write(*,*) b(1:n)\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "sample_input": "3\n2 3 1\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02899", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 46, "memory_kb": 4276}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s457730472", "group_id": "codeNet:p02899", "input_text": "program main\n implicit none\n \n integer :: n, a(100000), i, b(100000), j\n \n read(*,*)n\n read(*,*)(a(i),i = 1, n)\n \n do i = 1, n\n do j = 1, n\n if (a(j) < i) then\n cycle\n end if \n if (a(j) == i) then\n b(i) = j\n exit\n end if\n end do\n end do\n write(*,*)(b(i),i = 1, n)\nend program main", "language": "Fortran", "metadata": {"date": 1570317239, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02899.html", "problem_id": "p02899", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02899/input.txt", "sample_output_relpath": "derived/input_output/data/p02899/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02899/Fortran/s457730472.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s457730472", "user_id": "u287431190"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: n, a(100000), i, b(100000), j\n \n read(*,*)n\n read(*,*)(a(i),i = 1, n)\n \n do i = 1, n\n do j = 1, n\n if (a(j) < i) then\n cycle\n end if \n if (a(j) == i) then\n b(i) = j\n exit\n end if\n end do\n end do\n write(*,*)(b(i),i = 1, n)\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "sample_input": "3\n2 3 1\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02899", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 338, "cpu_time_ms": 2103, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s914022845", "group_id": "codeNet:p02899", "input_text": " PROGRAM goToSchool\n IMPLICIT NONE\n INTEGER :: N\n INTEGER,ALLOCATABLE :: A(:),ans(:)\n \n INTEGER :: i, buffer\n LOGICAL :: flag\n \n \n READ*,N\n ALLOCATE( A(N),ans(N) )\n READ*,A(:)\n \n \n ans = (/ (i, i = 1,N) /)\n \n \n outer:DO while( .true. )\n flag = .true.\n DO i = 1,N-1\n IF( A(i)>A(i+1) )THEN\n buffer = A(i+1)\n A(i+1) = A(i)\n A(i) = buffer\n \n buffer = ans(i+1)\n ans(i+1) = ans(i)\n ans(i) = buffer\n \n flag = .false.\n END IF\n END DO\n IF(flag) EXIT outer\n END DO outer\n \n \n \n print*,ans(:)\n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1569721127, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02899.html", "problem_id": "p02899", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02899/input.txt", "sample_output_relpath": "derived/input_output/data/p02899/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02899/Fortran/s914022845.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s914022845", "user_id": "u171356453"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": " PROGRAM goToSchool\n IMPLICIT NONE\n INTEGER :: N\n INTEGER,ALLOCATABLE :: A(:),ans(:)\n \n INTEGER :: i, buffer\n LOGICAL :: flag\n \n \n READ*,N\n ALLOCATE( A(N),ans(N) )\n READ*,A(:)\n \n \n ans = (/ (i, i = 1,N) /)\n \n \n outer:DO while( .true. )\n flag = .true.\n DO i = 1,N-1\n IF( A(i)>A(i+1) )THEN\n buffer = A(i+1)\n A(i+1) = A(i)\n A(i) = buffer\n \n buffer = ans(i+1)\n ans(i+1) = ans(i)\n ans(i) = buffer\n \n flag = .false.\n END IF\n END DO\n IF(flag) EXIT outer\n END DO outer\n \n \n \n print*,ans(:)\n \n \n END PROGRAM", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "sample_input": "3\n2 3 1\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02899", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 777, "cpu_time_ms": 2103, "memory_kb": 1920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s797912036", "group_id": "codeNet:p02900", "input_text": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n,ans\n integer(8)::a,b,c,d\n integer(8),allocatable::y(:)\n \n read(*,*) a,b\n c=min(a,b)\n d=max(a,b)\n a=c\n b=d\n \n do i=1,1000\n c=mod(b,a)\n b=a\n a=c\n if(a==0)then\n exit\n end if\n end do\n a=b\n if(a==1)then\n write(*,*)1\n stop\n end if\n \n c=0\n ans=1\n d=int(sqrt(real(b)))\n do i=2,d+1\n c=0\n do j=1,100\n if(mod(a,i)==0)then\n a=a/i\n if(c==0)then\n c=1\n ans=ans+1\n end if\n else\n exit\n end if\n end do\n if(a==1)then\n exit\n end if\n end do\n write(*,*)ans\n\n\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1597956504, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s797912036.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s797912036", "user_id": "u713568912"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n,ans\n integer(8)::a,b,c,d\n integer(8),allocatable::y(:)\n \n read(*,*) a,b\n c=min(a,b)\n d=max(a,b)\n a=c\n b=d\n \n do i=1,1000\n c=mod(b,a)\n b=a\n a=c\n if(a==0)then\n exit\n end if\n end do\n a=b\n if(a==1)then\n write(*,*)1\n stop\n end if\n \n c=0\n ans=1\n d=int(sqrt(real(b)))\n do i=2,d+1\n c=0\n do j=1,100\n if(mod(a,i)==0)then\n a=a/i\n if(c==0)then\n c=1\n ans=ans+1\n end if\n else\n exit\n end if\n end do\n if(a==1)then\n exit\n end if\n end do\n write(*,*)ans\n\n\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 856, "cpu_time_ms": 20, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s774533681", "group_id": "codeNet:p02900", "input_text": "program main\n integer::p,ans\n integer(8):: a,b,i, sosu\n read*, a,b\n sosu = 0\n i = 1\n do while(real(i) <= min(sqrt(real(a)),sqrt(real(b))))\n i=i+1\n if (.not.((mod(a,i) == 0) .and. (mod(b,i) == 0))) cycle\n sosu=sosu+1\n\n do while((mod(a,i) == 0) .and. (mod(b,i) == 0))\n a = a/(i)\n b = b/(i)\n end do\n \n end do\n print*, sosu+1\n \n\n\nend program", "language": "Fortran", "metadata": {"date": 1569728554, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s774533681.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s774533681", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n integer::p,ans\n integer(8):: a,b,i, sosu\n read*, a,b\n sosu = 0\n i = 1\n do while(real(i) <= min(sqrt(real(a)),sqrt(real(b))))\n i=i+1\n if (.not.((mod(a,i) == 0) .and. (mod(b,i) == 0))) cycle\n sosu=sosu+1\n\n do while((mod(a,i) == 0) .and. (mod(b,i) == 0))\n a = a/(i)\n b = b/(i)\n end do\n \n end do\n print*, sosu+1\n \n\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 11, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s702777603", "group_id": "codeNet:p02900", "input_text": "program main\n integer::p,ans\n integer(8):: a,b,i, sosu\n read*, a,b\n sosu = 0\n i = 1\n do while(i <= min(a,b))\n i=i+1\n if (.not.((mod(a,i) == 0) .and. (mod(b,i) == 0))) cycle\n sosu=sosu+1\n\n do while((mod(a,i) == 0) .and. (mod(b,i) == 0))\n a = a/(i)\n b = b/(i)\n end do\n \n end do\n print*, sosu+1\n \n\n\nend program", "language": "Fortran", "metadata": {"date": 1569727702, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s702777603.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s702777603", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n integer::p,ans\n integer(8):: a,b,i, sosu\n read*, a,b\n sosu = 0\n i = 1\n do while(i <= min(a,b))\n i=i+1\n if (.not.((mod(a,i) == 0) .and. (mod(b,i) == 0))) cycle\n sosu=sosu+1\n\n do while((mod(a,i) == 0) .and. (mod(b,i) == 0))\n a = a/(i)\n b = b/(i)\n end do\n \n end do\n print*, sosu+1\n \n\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s775358422", "group_id": "codeNet:p02900", "input_text": "program main\n integer::p,ans\n integer(8):: a,b,i, sosu\n integer(8), pointer:: cd(:)\n read*, a,b\n allocate(cd(1))\n sosu = 0\n i = 1\n do while(i <= min(a,b))\n i=i+1\n if (.not.((mod(a,i) == 0) .and. (mod(b,i) == 0))) cycle\n sosu=sosu+1\n do while((mod(a,i*i) == 0) .and. (mod(b,i*i) == 0))\n a = a/(i*i)\n b = b/(i*i)\n end do\n do while((mod(a,i) == 0) .and. (mod(b,i) == 0))\n a = a/(i)\n b = b/(i)\n end do\n \n end do\n print*, sosu+1\n \n\n\nend program", "language": "Fortran", "metadata": {"date": 1569727544, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s775358422.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s775358422", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n integer::p,ans\n integer(8):: a,b,i, sosu\n integer(8), pointer:: cd(:)\n read*, a,b\n allocate(cd(1))\n sosu = 0\n i = 1\n do while(i <= min(a,b))\n i=i+1\n if (.not.((mod(a,i) == 0) .and. (mod(b,i) == 0))) cycle\n sosu=sosu+1\n do while((mod(a,i*i) == 0) .and. (mod(b,i*i) == 0))\n a = a/(i*i)\n b = b/(i*i)\n end do\n do while((mod(a,i) == 0) .and. (mod(b,i) == 0))\n a = a/(i)\n b = b/(i)\n end do\n \n end do\n print*, sosu+1\n \n\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 569, "cpu_time_ms": 2103, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s327295957", "group_id": "codeNet:p02900", "input_text": "program main\n implicit none\n integer(8) i,A,B,ans,d\n integer div(5699)\n read(*, *)A,B\n !read(*, *) (L(i), i = 1,N)\n div = (/2,&\n3,&\n5,&\n7,&\n11,&\n13,&\n17,&\n19,&\n23,&\n29,&\n31,&\n37,&\n41,&\n43,&\n47,&\n53,&\n59,&\n61,&\n67,&\n71,&\n73,&\n79,&\n83,&\n89,&\n97,&\n101,&\n103,&\n107,&\n109,&\n113,&\n127,&\n131,&\n137,&\n139,&\n149,&\n151,&\n157,&\n163,&\n167,&\n173,&\n179,&\n181,&\n191,&\n193,&\n197,&\n199,&\n211,&\n223,&\n227,&\n229,&\n233,&\n239,&\n241,&\n251,&\n257,&\n263,&\n269,&\n271,&\n277,&\n281,&\n283,&\n293,&\n307,&\n311,&\n313,&\n317,&\n331,&\n337,&\n347,&\n349,&\n353,&\n359,&\n367,&\n373,&\n379,&\n383,&\n389,&\n397,&\n401,&\n409,&\n419,&\n421,&\n431,&\n433,&\n439,&\n443,&\n449,&\n457,&\n461,&\n463,&\n467,&\n479,&\n487,&\n491,&\n499,&\n503,&\n509,&\n521,&\n523,&\n541,&\n547,&\n557,&\n563,&\n569,&\n571,&\n577,&\n587,&\n593,&\n599,&\n601,&\n607,&\n613,&\n617,&\n619,&\n631,&\n641,&\n643,&\n647,&\n653,&\n659,&\n661,&\n673,&\n677,&\n683,&\n691,&\n701,&\n709,&\n719,&\n727,&\n733,&\n739,&\n743,&\n751,&\n757,&\n761,&\n769,&\n773,&\n787,&\n797,&\n809,&\n811,&\n821,&\n823,&\n827,&\n829,&\n839,&\n853,&\n857,&\n859,&\n863,&\n877,&\n881,&\n883,&\n887,&\n907,&\n911,&\n919,&\n929,&\n937,&\n941,&\n947,&\n953,&\n967,&\n971,&\n977,&\n983,&\n991,&\n997,&\n1009,&\n1013,&\n1019,&\n1021,&\n1031,&\n1033,&\n1039,&\n1049,&\n1051,&\n1061,&\n1063,&\n1069,&\n1087,&\n1091,&\n1093,&\n1097,&\n1103,&\n1109,&\n1117,&\n1123,&\n1129,&\n1151,&\n1153,&\n1163,&\n1171,&\n1181,&\n1187,&\n1193,&\n1201,&\n1213,&\n1217,&\n1223,&\n1229,&\n1231,&\n1237,&\n1249,&\n1259,&\n1277,&\n1279,&\n1283,&\n1289,&\n1291,&\n1297,&\n1301,&\n1303,&\n1307,&\n1319,&\n1321,&\n1327,&\n1361,&\n1367,&\n1373,&\n1381,&\n1399,&\n1409,&\n1423,&\n1427,&\n1429,&\n1433,&\n1439,&\n1447,&\n1451,&\n1453,&\n1459,&\n1471,&\n1481,&\n1483,&\n1487,&\n1489,&\n1493,&\n1499,&\n1511,&\n1523,&\n1531,&\n1543,&\n1549,&\n1553,&\n1559,&\n1567,&\n1571,&\n1579,&\n1583,&\n1597,&\n1601,&\n1607,&\n1609,&\n1613,&\n1619,&\n1621,&\n1627,&\n1637,&\n1657,&\n1663,&\n1667,&\n1669,&\n1693,&\n1697,&\n1699,&\n1709,&\n1721,&\n1723,&\n1733,&\n1741,&\n1747,&\n1753,&\n1759,&\n1777,&\n1783,&\n1787,&\n1789,&\n1801,&\n1811,&\n1823,&\n1831,&\n1847,&\n1861,&\n1867,&\n1871,&\n1873,&\n1877,&\n1879,&\n1889,&\n1901,&\n1907,&\n1913,&\n1931,&\n1933,&\n1949,&\n1951,&\n1973,&\n1979,&\n1987,&\n1993,&\n1997,&\n1999,&\n2003,&\n2011,&\n2017,&\n2027,&\n2029,&\n2039,&\n2053,&\n2063,&\n2069,&\n2081,&\n2083,&\n2087,&\n2089,&\n2099,&\n2111,&\n2113,&\n2129,&\n2131,&\n2137,&\n2141,&\n2143,&\n2153,&\n2161,&\n2179,&\n2203,&\n2207,&\n2213,&\n2221,&\n2237,&\n2239,&\n2243,&\n2251,&\n2267,&\n2269,&\n2273,&\n2281,&\n2287,&\n2293,&\n2297,&\n2309,&\n2311,&\n2333,&\n2339,&\n2341,&\n2347,&\n2351,&\n2357,&\n2371,&\n2377,&\n2381,&\n2383,&\n2389,&\n2393,&\n2399,&\n2411,&\n2417,&\n2423,&\n2437,&\n2441,&\n2447,&\n2459,&\n2467,&\n2473,&\n2477,&\n2503,&\n2521,&\n2531,&\n2539,&\n2543,&\n2549,&\n2551,&\n2557,&\n2579,&\n2591,&\n2593,&\n2609,&\n2617,&\n2621,&\n2633,&\n2647,&\n2657,&\n2659,&\n2663,&\n2671,&\n2677,&\n2683,&\n2687,&\n2689,&\n2693,&\n2699,&\n2707,&\n2711,&\n2713,&\n2719,&\n2729,&\n2731,&\n2741,&\n2749,&\n2753,&\n2767,&\n2777,&\n2789,&\n2791,&\n2797,&\n2801,&\n2803,&\n2819,&\n2833,&\n2837,&\n2843,&\n2851,&\n2857,&\n2861,&\n2879,&\n2887,&\n2897,&\n2903,&\n2909,&\n2917,&\n2927,&\n2939,&\n2953,&\n2957,&\n2963,&\n2969,&\n2971,&\n2999,&\n3001,&\n3011,&\n3019,&\n3023,&\n3037,&\n3041,&\n3049,&\n3061,&\n3067,&\n3079,&\n3083,&\n3089,&\n3109,&\n3119,&\n3121,&\n3137,&\n3163,&\n3167,&\n3169,&\n3181,&\n3187,&\n3191,&\n3203,&\n3209,&\n3217,&\n3221,&\n3229,&\n3251,&\n3253,&\n3257,&\n3259,&\n3271,&\n3299,&\n3301,&\n3307,&\n3313,&\n3319,&\n3323,&\n3329,&\n3331,&\n3343,&\n3347,&\n3359,&\n3361,&\n3371,&\n3373,&\n3389,&\n3391,&\n3407,&\n3413,&\n3433,&\n3449,&\n3457,&\n3461,&\n3463,&\n3467,&\n3469,&\n3491,&\n3499,&\n3511,&\n3517,&\n3527,&\n3529,&\n3533,&\n3539,&\n3541,&\n3547,&\n3557,&\n3559,&\n3571,&\n3581,&\n3583,&\n3593,&\n3607,&\n3613,&\n3617,&\n3623,&\n3631,&\n3637,&\n3643,&\n3659,&\n3671,&\n3673,&\n3677,&\n3691,&\n3697,&\n3701,&\n3709,&\n3719,&\n3727,&\n3733,&\n3739,&\n3761,&\n3767,&\n3769,&\n3779,&\n3793,&\n3797,&\n3803,&\n3821,&\n3823,&\n3833,&\n3847,&\n3851,&\n3853,&\n3863,&\n3877,&\n3881,&\n3889,&\n3907,&\n3911,&\n3917,&\n3919,&\n3923,&\n3929,&\n3931,&\n3943,&\n3947,&\n3967,&\n3989,&\n4001,&\n4003,&\n4007,&\n4013,&\n4019,&\n4021,&\n4027,&\n4049,&\n4051,&\n4057,&\n4073,&\n4079,&\n4091,&\n4093,&\n4099,&\n4111,&\n4127,&\n4129,&\n4133,&\n4139,&\n4153,&\n4157,&\n4159,&\n4177,&\n4201,&\n4211,&\n4217,&\n4219,&\n4229,&\n4231,&\n4241,&\n4243,&\n4253,&\n4259,&\n4261,&\n4271,&\n4273,&\n4283,&\n4289,&\n4297,&\n4327,&\n4337,&\n4339,&\n4349,&\n4357,&\n4363,&\n4373,&\n4391,&\n4397,&\n4409,&\n4421,&\n4423,&\n4441,&\n4447,&\n4451,&\n4457,&\n4463,&\n4481,&\n4483,&\n4493,&\n4507,&\n4513,&\n4517,&\n4519,&\n4523,&\n4547,&\n4549,&\n4561,&\n4567,&\n4583,&\n4591,&\n4597,&\n4603,&\n4621,&\n4637,&\n4639,&\n4643,&\n4649,&\n4651,&\n4657,&\n4663,&\n4673,&\n4679,&\n4691,&\n4703,&\n4721,&\n4723,&\n4729,&\n4733,&\n4751,&\n4759,&\n4783,&\n4787,&\n4789,&\n4793,&\n4799,&\n4801,&\n4813,&\n4817,&\n4831,&\n4861,&\n4871,&\n4877,&\n4889,&\n4903,&\n4909,&\n4919,&\n4931,&\n4933,&\n4937,&\n4943,&\n4951,&\n4957,&\n4967,&\n4969,&\n4973,&\n4987,&\n4993,&\n4999,&\n5003,&\n5009,&\n5011,&\n5021,&\n5023,&\n5039,&\n5051,&\n5059,&\n5077,&\n5081,&\n5087,&\n5099,&\n5101,&\n5107,&\n5113,&\n5119,&\n5147,&\n5153,&\n5167,&\n5171,&\n5179,&\n5189,&\n5197,&\n5209,&\n5227,&\n5231,&\n5233,&\n5237,&\n5261,&\n5273,&\n5279,&\n5281,&\n5297,&\n5303,&\n5309,&\n5323,&\n5333,&\n5347,&\n5351,&\n5381,&\n5387,&\n5393,&\n5399,&\n5407,&\n5413,&\n5417,&\n5419,&\n5431,&\n5437,&\n5441,&\n5443,&\n5449,&\n5471,&\n5477,&\n5479,&\n5483,&\n5501,&\n5503,&\n5507,&\n5519,&\n5521,&\n5527,&\n5531,&\n5557,&\n5563,&\n5569,&\n5573,&\n5581,&\n5591,&\n5623,&\n5639,&\n5641,&\n5647,&\n5651,&\n5653,&\n5657,&\n5659,&\n5669,&\n5683,&\n5689,&\n5693,&\n5701,&\n5711,&\n5717,&\n5737,&\n5741,&\n5743,&\n5749,&\n5779,&\n5783,&\n5791,&\n5801,&\n5807,&\n5813,&\n5821,&\n5827,&\n5839,&\n5843,&\n5849,&\n5851,&\n5857,&\n5861,&\n5867,&\n5869,&\n5879,&\n5881,&\n5897,&\n5903,&\n5923,&\n5927,&\n5939,&\n5953,&\n5981,&\n5987,&\n6007,&\n6011,&\n6029,&\n6037,&\n6043,&\n6047,&\n6053,&\n6067,&\n6073,&\n6079,&\n6089,&\n6091,&\n6101,&\n6113,&\n6121,&\n6131,&\n6133,&\n6143,&\n6151,&\n6163,&\n6173,&\n6197,&\n6199,&\n6203,&\n6211,&\n6217,&\n6221,&\n6229,&\n6247,&\n6257,&\n6263,&\n6269,&\n6271,&\n6277,&\n6287,&\n6299,&\n6301,&\n6311,&\n6317,&\n6323,&\n6329,&\n6337,&\n6343,&\n6353,&\n6359,&\n6361,&\n6367,&\n6373,&\n6379,&\n6389,&\n6397,&\n6421,&\n6427,&\n6449,&\n6451,&\n6469,&\n6473,&\n6481,&\n6491,&\n6521,&\n6529,&\n6547,&\n6551,&\n6553,&\n6563,&\n6569,&\n6571,&\n6577,&\n6581,&\n6599,&\n6607,&\n6619,&\n6637,&\n6653,&\n6659,&\n6661,&\n6673,&\n6679,&\n6689,&\n6691,&\n6701,&\n6703,&\n6709,&\n6719,&\n6733,&\n6737,&\n6761,&\n6763,&\n6779,&\n6781,&\n6791,&\n6793,&\n6803,&\n6823,&\n6827,&\n6829,&\n6833,&\n6841,&\n6857,&\n6863,&\n6869,&\n6871,&\n6883,&\n6899,&\n6907,&\n6911,&\n6917,&\n6947,&\n6949,&\n6959,&\n6961,&\n6967,&\n6971,&\n6977,&\n6983,&\n6991,&\n6997,&\n7001,&\n7013,&\n7019,&\n7027,&\n7039,&\n7043,&\n7057,&\n7069,&\n7079,&\n7103,&\n7109,&\n7121,&\n7127,&\n7129,&\n7151,&\n7159,&\n7177,&\n7187,&\n7193,&\n7207,&\n7211,&\n7213,&\n7219,&\n7229,&\n7237,&\n7243,&\n7247,&\n7253,&\n7283,&\n7297,&\n7307,&\n7309,&\n7321,&\n7331,&\n7333,&\n7349,&\n7351,&\n7369,&\n7393,&\n7411,&\n7417,&\n7433,&\n7451,&\n7457,&\n7459,&\n7477,&\n7481,&\n7487,&\n7489,&\n7499,&\n7507,&\n7517,&\n7523,&\n7529,&\n7537,&\n7541,&\n7547,&\n7549,&\n7559,&\n7561,&\n7573,&\n7577,&\n7583,&\n7589,&\n7591,&\n7603,&\n7607,&\n7621,&\n7639,&\n7643,&\n7649,&\n7669,&\n7673,&\n7681,&\n7687,&\n7691,&\n7699,&\n7703,&\n7717,&\n7723,&\n7727,&\n7741,&\n7753,&\n7757,&\n7759,&\n7789,&\n7793,&\n7817,&\n7823,&\n7829,&\n7841,&\n7853,&\n7867,&\n7873,&\n7877,&\n7879,&\n7883,&\n7901,&\n7907,&\n7919,&\n7927,&\n7933,&\n7937,&\n7949,&\n7951,&\n7963,&\n7993,&\n8009,&\n8011,&\n8017,&\n8039,&\n8053,&\n8059,&\n8069,&\n8081,&\n8087,&\n8089,&\n8093,&\n8101,&\n8111,&\n8117,&\n8123,&\n8147,&\n8161,&\n8167,&\n8171,&\n8179,&\n8191,&\n8209,&\n8219,&\n8221,&\n8231,&\n8233,&\n8237,&\n8243,&\n8263,&\n8269,&\n8273,&\n8287,&\n8291,&\n8293,&\n8297,&\n8311,&\n8317,&\n8329,&\n8353,&\n8363,&\n8369,&\n8377,&\n8387,&\n8389,&\n8419,&\n8423,&\n8429,&\n8431,&\n8443,&\n8447,&\n8461,&\n8467,&\n8501,&\n8513,&\n8521,&\n8527,&\n8537,&\n8539,&\n8543,&\n8563,&\n8573,&\n8581,&\n8597,&\n8599,&\n8609,&\n8623,&\n8627,&\n8629,&\n8641,&\n8647,&\n8663,&\n8669,&\n8677,&\n8681,&\n8689,&\n8693,&\n8699,&\n8707,&\n8713,&\n8719,&\n8731,&\n8737,&\n8741,&\n8747,&\n8753,&\n8761,&\n8779,&\n8783,&\n8803,&\n8807,&\n8819,&\n8821,&\n8831,&\n8837,&\n8839,&\n8849,&\n8861,&\n8863,&\n8867,&\n8887,&\n8893,&\n8923,&\n8929,&\n8933,&\n8941,&\n8951,&\n8963,&\n8969,&\n8971,&\n8999,&\n9001,&\n9007,&\n9011,&\n9013,&\n9029,&\n9041,&\n9043,&\n9049,&\n9059,&\n9067,&\n9091,&\n9103,&\n9109,&\n9127,&\n9133,&\n9137,&\n9151,&\n9157,&\n9161,&\n9173,&\n9181,&\n9187,&\n9199,&\n9203,&\n9209,&\n9221,&\n9227,&\n9239,&\n9241,&\n9257,&\n9277,&\n9281,&\n9283,&\n9293,&\n9311,&\n9319,&\n9323,&\n9337,&\n9341,&\n9343,&\n9349,&\n9371,&\n9377,&\n9391,&\n9397,&\n9403,&\n9413,&\n9419,&\n9421,&\n9431,&\n9433,&\n9437,&\n9439,&\n9461,&\n9463,&\n9467,&\n9473,&\n9479,&\n9491,&\n9497,&\n9511,&\n9521,&\n9533,&\n9539,&\n9547,&\n9551,&\n9587,&\n9601,&\n9613,&\n9619,&\n9623,&\n9629,&\n9631,&\n9643,&\n9649,&\n9661,&\n9677,&\n9679,&\n9689,&\n9697,&\n9719,&\n9721,&\n9733,&\n9739,&\n9743,&\n9749,&\n9767,&\n9769,&\n9781,&\n9787,&\n9791,&\n9803,&\n9811,&\n9817,&\n9829,&\n9833,&\n9839,&\n9851,&\n9857,&\n9859,&\n9871,&\n9883,&\n9887,&\n9901,&\n9907,&\n9923,&\n9929,&\n9931,&\n9941,&\n9949,&\n9967,&\n9973,&\n10007,&\n10009,&\n10037,&\n10039,&\n10061,&\n10067,&\n10069,&\n10079,&\n10091,&\n10093,&\n10099,&\n10103,&\n10111,&\n10133,&\n10139,&\n10141,&\n10151,&\n10159,&\n10163,&\n10169,&\n10177,&\n10181,&\n10193,&\n10211,&\n10223,&\n10243,&\n10247,&\n10253,&\n10259,&\n10267,&\n10271,&\n10273,&\n10289,&\n10301,&\n10303,&\n10313,&\n10321,&\n10331,&\n10333,&\n10337,&\n10343,&\n10357,&\n10369,&\n10391,&\n10399,&\n10427,&\n10429,&\n10433,&\n10453,&\n10457,&\n10459,&\n10463,&\n10477,&\n10487,&\n10499,&\n10501,&\n10513,&\n10529,&\n10531,&\n10559,&\n10567,&\n10589,&\n10597,&\n10601,&\n10607,&\n10613,&\n10627,&\n10631,&\n10639,&\n10651,&\n10657,&\n10663,&\n10667,&\n10687,&\n10691,&\n10709,&\n10711,&\n10723,&\n10729,&\n10733,&\n10739,&\n10753,&\n10771,&\n10781,&\n10789,&\n10799,&\n10831,&\n10837,&\n10847,&\n10853,&\n10859,&\n10861,&\n10867,&\n10883,&\n10889,&\n10891,&\n10903,&\n10909,&\n10937,&\n10939,&\n10949,&\n10957,&\n10973,&\n10979,&\n10987,&\n10993,&\n11003,&\n11027,&\n11047,&\n11057,&\n11059,&\n11069,&\n11071,&\n11083,&\n11087,&\n11093,&\n11113,&\n11117,&\n11119,&\n11131,&\n11149,&\n11159,&\n11161,&\n11171,&\n11173,&\n11177,&\n11197,&\n11213,&\n11239,&\n11243,&\n11251,&\n11257,&\n11261,&\n11273,&\n11279,&\n11287,&\n11299,&\n11311,&\n11317,&\n11321,&\n11329,&\n11351,&\n11353,&\n11369,&\n11383,&\n11393,&\n11399,&\n11411,&\n11423,&\n11437,&\n11443,&\n11447,&\n11467,&\n11471,&\n11483,&\n11489,&\n11491,&\n11497,&\n11503,&\n11519,&\n11527,&\n11549,&\n11551,&\n11579,&\n11587,&\n11593,&\n11597,&\n11617,&\n11621,&\n11633,&\n11657,&\n11677,&\n11681,&\n11689,&\n11699,&\n11701,&\n11717,&\n11719,&\n11731,&\n11743,&\n11777,&\n11779,&\n11783,&\n11789,&\n11801,&\n11807,&\n11813,&\n11821,&\n11827,&\n11831,&\n11833,&\n11839,&\n11863,&\n11867,&\n11887,&\n11897,&\n11903,&\n11909,&\n11923,&\n11927,&\n11933,&\n11939,&\n11941,&\n11953,&\n11959,&\n11969,&\n11971,&\n11981,&\n11987,&\n12007,&\n12011,&\n12037,&\n12041,&\n12043,&\n12049,&\n12071,&\n12073,&\n12097,&\n12101,&\n12107,&\n12109,&\n12113,&\n12119,&\n12143,&\n12149,&\n12157,&\n12161,&\n12163,&\n12197,&\n12203,&\n12211,&\n12227,&\n12239,&\n12241,&\n12251,&\n12253,&\n12263,&\n12269,&\n12277,&\n12281,&\n12289,&\n12301,&\n12323,&\n12329,&\n12343,&\n12347,&\n12373,&\n12377,&\n12379,&\n12391,&\n12401,&\n12409,&\n12413,&\n12421,&\n12433,&\n12437,&\n12451,&\n12457,&\n12473,&\n12479,&\n12487,&\n12491,&\n12497,&\n12503,&\n12511,&\n12517,&\n12527,&\n12539,&\n12541,&\n12547,&\n12553,&\n12569,&\n12577,&\n12583,&\n12589,&\n12601,&\n12611,&\n12613,&\n12619,&\n12637,&\n12641,&\n12647,&\n12653,&\n12659,&\n12671,&\n12689,&\n12697,&\n12703,&\n12713,&\n12721,&\n12739,&\n12743,&\n12757,&\n12763,&\n12781,&\n12791,&\n12799,&\n12809,&\n12821,&\n12823,&\n12829,&\n12841,&\n12853,&\n12889,&\n12893,&\n12899,&\n12907,&\n12911,&\n12917,&\n12919,&\n12923,&\n12941,&\n12953,&\n12959,&\n12967,&\n12973,&\n12979,&\n12983,&\n13001,&\n13003,&\n13007,&\n13009,&\n13033,&\n13037,&\n13043,&\n13049,&\n13063,&\n13093,&\n13099,&\n13103,&\n13109,&\n13121,&\n13127,&\n13147,&\n13151,&\n13159,&\n13163,&\n13171,&\n13177,&\n13183,&\n13187,&\n13217,&\n13219,&\n13229,&\n13241,&\n13249,&\n13259,&\n13267,&\n13291,&\n13297,&\n13309,&\n13313,&\n13327,&\n13331,&\n13337,&\n13339,&\n13367,&\n13381,&\n13397,&\n13399,&\n13411,&\n13417,&\n13421,&\n13441,&\n13451,&\n13457,&\n13463,&\n13469,&\n13477,&\n13487,&\n13499,&\n13513,&\n13523,&\n13537,&\n13553,&\n13567,&\n13577,&\n13591,&\n13597,&\n13613,&\n13619,&\n13627,&\n13633,&\n13649,&\n13669,&\n13679,&\n13681,&\n13687,&\n13691,&\n13693,&\n13697,&\n13709,&\n13711,&\n13721,&\n13723,&\n13729,&\n13751,&\n13757,&\n13759,&\n13763,&\n13781,&\n13789,&\n13799,&\n13807,&\n13829,&\n13831,&\n13841,&\n13859,&\n13873,&\n13877,&\n13879,&\n13883,&\n13901,&\n13903,&\n13907,&\n13913,&\n13921,&\n13931,&\n13933,&\n13963,&\n13967,&\n13997,&\n13999,&\n14009,&\n14011,&\n14029,&\n14033,&\n14051,&\n14057,&\n14071,&\n14081,&\n14083,&\n14087,&\n14107,&\n14143,&\n14149,&\n14153,&\n14159,&\n14173,&\n14177,&\n14197,&\n14207,&\n14221,&\n14243,&\n14249,&\n14251,&\n14281,&\n14293,&\n14303,&\n14321,&\n14323,&\n14327,&\n14341,&\n14347,&\n14369,&\n14387,&\n14389,&\n14401,&\n14407,&\n14411,&\n14419,&\n14423,&\n14431,&\n14437,&\n14447,&\n14449,&\n14461,&\n14479,&\n14489,&\n14503,&\n14519,&\n14533,&\n14537,&\n14543,&\n14549,&\n14551,&\n14557,&\n14561,&\n14563,&\n14591,&\n14593,&\n14621,&\n14627,&\n14629,&\n14633,&\n14639,&\n14653,&\n14657,&\n14669,&\n14683,&\n14699,&\n14713,&\n14717,&\n14723,&\n14731,&\n14737,&\n14741,&\n14747,&\n14753,&\n14759,&\n14767,&\n14771,&\n14779,&\n14783,&\n14797,&\n14813,&\n14821,&\n14827,&\n14831,&\n14843,&\n14851,&\n14867,&\n14869,&\n14879,&\n14887,&\n14891,&\n14897,&\n14923,&\n14929,&\n14939,&\n14947,&\n14951,&\n14957,&\n14969,&\n14983,&\n15013,&\n15017,&\n15031,&\n15053,&\n15061,&\n15073,&\n15077,&\n15083,&\n15091,&\n15101,&\n15107,&\n15121,&\n15131,&\n15137,&\n15139,&\n15149,&\n15161,&\n15173,&\n15187,&\n15193,&\n15199,&\n15217,&\n15227,&\n15233,&\n15241,&\n15259,&\n15263,&\n15269,&\n15271,&\n15277,&\n15287,&\n15289,&\n15299,&\n15307,&\n15313,&\n15319,&\n15329,&\n15331,&\n15349,&\n15359,&\n15361,&\n15373,&\n15377,&\n15383,&\n15391,&\n15401,&\n15413,&\n15427,&\n15439,&\n15443,&\n15451,&\n15461,&\n15467,&\n15473,&\n15493,&\n15497,&\n15511,&\n15527,&\n15541,&\n15551,&\n15559,&\n15569,&\n15581,&\n15583,&\n15601,&\n15607,&\n15619,&\n15629,&\n15641,&\n15643,&\n15647,&\n15649,&\n15661,&\n15667,&\n15671,&\n15679,&\n15683,&\n15727,&\n15731,&\n15733,&\n15737,&\n15739,&\n15749,&\n15761,&\n15767,&\n15773,&\n15787,&\n15791,&\n15797,&\n15803,&\n15809,&\n15817,&\n15823,&\n15859,&\n15877,&\n15881,&\n15887,&\n15889,&\n15901,&\n15907,&\n15913,&\n15919,&\n15923,&\n15937,&\n15959,&\n15971,&\n15973,&\n15991,&\n16001,&\n16007,&\n16033,&\n16057,&\n16061,&\n16063,&\n16067,&\n16069,&\n16073,&\n16087,&\n16091,&\n16097,&\n16103,&\n16111,&\n16127,&\n16139,&\n16141,&\n16183,&\n16187,&\n16189,&\n16193,&\n16217,&\n16223,&\n16229,&\n16231,&\n16249,&\n16253,&\n16267,&\n16273,&\n16301,&\n16319,&\n16333,&\n16339,&\n16349,&\n16361,&\n16363,&\n16369,&\n16381,&\n16411,&\n16417,&\n16421,&\n16427,&\n16433,&\n16447,&\n16451,&\n16453,&\n16477,&\n16481,&\n16487,&\n16493,&\n16519,&\n16529,&\n16547,&\n16553,&\n16561,&\n16567,&\n16573,&\n16603,&\n16607,&\n16619,&\n16631,&\n16633,&\n16649,&\n16651,&\n16657,&\n16661,&\n16673,&\n16691,&\n16693,&\n16699,&\n16703,&\n16729,&\n16741,&\n16747,&\n16759,&\n16763,&\n16787,&\n16811,&\n16823,&\n16829,&\n16831,&\n16843,&\n16871,&\n16879,&\n16883,&\n16889,&\n16901,&\n16903,&\n16921,&\n16927,&\n16931,&\n16937,&\n16943,&\n16963,&\n16979,&\n16981,&\n16987,&\n16993,&\n17011,&\n17021,&\n17027,&\n17029,&\n17033,&\n17041,&\n17047,&\n17053,&\n17077,&\n17093,&\n17099,&\n17107,&\n17117,&\n17123,&\n17137,&\n17159,&\n17167,&\n17183,&\n17189,&\n17191,&\n17203,&\n17207,&\n17209,&\n17231,&\n17239,&\n17257,&\n17291,&\n17293,&\n17299,&\n17317,&\n17321,&\n17327,&\n17333,&\n17341,&\n17351,&\n17359,&\n17377,&\n17383,&\n17387,&\n17389,&\n17393,&\n17401,&\n17417,&\n17419,&\n17431,&\n17443,&\n17449,&\n17467,&\n17471,&\n17477,&\n17483,&\n17489,&\n17491,&\n17497,&\n17509,&\n17519,&\n17539,&\n17551,&\n17569,&\n17573,&\n17579,&\n17581,&\n17597,&\n17599,&\n17609,&\n17623,&\n17627,&\n17657,&\n17659,&\n17669,&\n17681,&\n17683,&\n17707,&\n17713,&\n17729,&\n17737,&\n17747,&\n17749,&\n17761,&\n17783,&\n17789,&\n17791,&\n17807,&\n17827,&\n17837,&\n17839,&\n17851,&\n17863,&\n17881,&\n17891,&\n17903,&\n17909,&\n17911,&\n17921,&\n17923,&\n17929,&\n17939,&\n17957,&\n17959,&\n17971,&\n17977,&\n17981,&\n17987,&\n17989,&\n18013,&\n18041,&\n18043,&\n18047,&\n18049,&\n18059,&\n18061,&\n18077,&\n18089,&\n18097,&\n18119,&\n18121,&\n18127,&\n18131,&\n18133,&\n18143,&\n18149,&\n18169,&\n18181,&\n18191,&\n18199,&\n18211,&\n18217,&\n18223,&\n18229,&\n18233,&\n18251,&\n18253,&\n18257,&\n18269,&\n18287,&\n18289,&\n18301,&\n18307,&\n18311,&\n18313,&\n18329,&\n18341,&\n18353,&\n18367,&\n18371,&\n18379,&\n18397,&\n18401,&\n18413,&\n18427,&\n18433,&\n18439,&\n18443,&\n18451,&\n18457,&\n18461,&\n18481,&\n18493,&\n18503,&\n18517,&\n18521,&\n18523,&\n18539,&\n18541,&\n18553,&\n18583,&\n18587,&\n18593,&\n18617,&\n18637,&\n18661,&\n18671,&\n18679,&\n18691,&\n18701,&\n18713,&\n18719,&\n18731,&\n18743,&\n18749,&\n18757,&\n18773,&\n18787,&\n18793,&\n18797,&\n18803,&\n18839,&\n18859,&\n18869,&\n18899,&\n18911,&\n18913,&\n18917,&\n18919,&\n18947,&\n18959,&\n18973,&\n18979,&\n19001,&\n19009,&\n19013,&\n19031,&\n19037,&\n19051,&\n19069,&\n19073,&\n19079,&\n19081,&\n19087,&\n19121,&\n19139,&\n19141,&\n19157,&\n19163,&\n19181,&\n19183,&\n19207,&\n19211,&\n19213,&\n19219,&\n19231,&\n19237,&\n19249,&\n19259,&\n19267,&\n19273,&\n19289,&\n19301,&\n19309,&\n19319,&\n19333,&\n19373,&\n19379,&\n19381,&\n19387,&\n19391,&\n19403,&\n19417,&\n19421,&\n19423,&\n19427,&\n19429,&\n19433,&\n19441,&\n19447,&\n19457,&\n19463,&\n19469,&\n19471,&\n19477,&\n19483,&\n19489,&\n19501,&\n19507,&\n19531,&\n19541,&\n19543,&\n19553,&\n19559,&\n19571,&\n19577,&\n19583,&\n19597,&\n19603,&\n19609,&\n19661,&\n19681,&\n19687,&\n19697,&\n19699,&\n19709,&\n19717,&\n19727,&\n19739,&\n19751,&\n19753,&\n19759,&\n19763,&\n19777,&\n19793,&\n19801,&\n19813,&\n19819,&\n19841,&\n19843,&\n19853,&\n19861,&\n19867,&\n19889,&\n19891,&\n19913,&\n19919,&\n19927,&\n19937,&\n19949,&\n19961,&\n19963,&\n19973,&\n19979,&\n19991,&\n19993,&\n19997,&\n20011,&\n20021,&\n20023,&\n20029,&\n20047,&\n20051,&\n20063,&\n20071,&\n20089,&\n20101,&\n20107,&\n20113,&\n20117,&\n20123,&\n20129,&\n20143,&\n20147,&\n20149,&\n20161,&\n20173,&\n20177,&\n20183,&\n20201,&\n20219,&\n20231,&\n20233,&\n20249,&\n20261,&\n20269,&\n20287,&\n20297,&\n20323,&\n20327,&\n20333,&\n20341,&\n20347,&\n20353,&\n20357,&\n20359,&\n20369,&\n20389,&\n20393,&\n20399,&\n20407,&\n20411,&\n20431,&\n20441,&\n20443,&\n20477,&\n20479,&\n20483,&\n20507,&\n20509,&\n20521,&\n20533,&\n20543,&\n20549,&\n20551,&\n20563,&\n20593,&\n20599,&\n20611,&\n20627,&\n20639,&\n20641,&\n20663,&\n20681,&\n20693,&\n20707,&\n20717,&\n20719,&\n20731,&\n20743,&\n20747,&\n20749,&\n20753,&\n20759,&\n20771,&\n20773,&\n20789,&\n20807,&\n20809,&\n20849,&\n20857,&\n20873,&\n20879,&\n20887,&\n20897,&\n20899,&\n20903,&\n20921,&\n20929,&\n20939,&\n20947,&\n20959,&\n20963,&\n20981,&\n20983,&\n21001,&\n21011,&\n21013,&\n21017,&\n21019,&\n21023,&\n21031,&\n21059,&\n21061,&\n21067,&\n21089,&\n21101,&\n21107,&\n21121,&\n21139,&\n21143,&\n21149,&\n21157,&\n21163,&\n21169,&\n21179,&\n21187,&\n21191,&\n21193,&\n21211,&\n21221,&\n21227,&\n21247,&\n21269,&\n21277,&\n21283,&\n21313,&\n21317,&\n21319,&\n21323,&\n21341,&\n21347,&\n21377,&\n21379,&\n21383,&\n21391,&\n21397,&\n21401,&\n21407,&\n21419,&\n21433,&\n21467,&\n21481,&\n21487,&\n21491,&\n21493,&\n21499,&\n21503,&\n21517,&\n21521,&\n21523,&\n21529,&\n21557,&\n21559,&\n21563,&\n21569,&\n21577,&\n21587,&\n21589,&\n21599,&\n21601,&\n21611,&\n21613,&\n21617,&\n21647,&\n21649,&\n21661,&\n21673,&\n21683,&\n21701,&\n21713,&\n21727,&\n21737,&\n21739,&\n21751,&\n21757,&\n21767,&\n21773,&\n21787,&\n21799,&\n21803,&\n21817,&\n21821,&\n21839,&\n21841,&\n21851,&\n21859,&\n21863,&\n21871,&\n21881,&\n21893,&\n21911,&\n21929,&\n21937,&\n21943,&\n21961,&\n21977,&\n21991,&\n21997,&\n22003,&\n22013,&\n22027,&\n22031,&\n22037,&\n22039,&\n22051,&\n22063,&\n22067,&\n22073,&\n22079,&\n22091,&\n22093,&\n22109,&\n22111,&\n22123,&\n22129,&\n22133,&\n22147,&\n22153,&\n22157,&\n22159,&\n22171,&\n22189,&\n22193,&\n22229,&\n22247,&\n22259,&\n22271,&\n22273,&\n22277,&\n22279,&\n22283,&\n22291,&\n22303,&\n22307,&\n22343,&\n22349,&\n22367,&\n22369,&\n22381,&\n22391,&\n22397,&\n22409,&\n22433,&\n22441,&\n22447,&\n22453,&\n22469,&\n22481,&\n22483,&\n22501,&\n22511,&\n22531,&\n22541,&\n22543,&\n22549,&\n22567,&\n22571,&\n22573,&\n22613,&\n22619,&\n22621,&\n22637,&\n22639,&\n22643,&\n22651,&\n22669,&\n22679,&\n22691,&\n22697,&\n22699,&\n22709,&\n22717,&\n22721,&\n22727,&\n22739,&\n22741,&\n22751,&\n22769,&\n22777,&\n22783,&\n22787,&\n22807,&\n22811,&\n22817,&\n22853,&\n22859,&\n22861,&\n22871,&\n22877,&\n22901,&\n22907,&\n22921,&\n22937,&\n22943,&\n22961,&\n22963,&\n22973,&\n22993,&\n23003,&\n23011,&\n23017,&\n23021,&\n23027,&\n23029,&\n23039,&\n23041,&\n23053,&\n23057,&\n23059,&\n23063,&\n23071,&\n23081,&\n23087,&\n23099,&\n23117,&\n23131,&\n23143,&\n23159,&\n23167,&\n23173,&\n23189,&\n23197,&\n23201,&\n23203,&\n23209,&\n23227,&\n23251,&\n23269,&\n23279,&\n23291,&\n23293,&\n23297,&\n23311,&\n23321,&\n23327,&\n23333,&\n23339,&\n23357,&\n23369,&\n23371,&\n23399,&\n23417,&\n23431,&\n23447,&\n23459,&\n23473,&\n23497,&\n23509,&\n23531,&\n23537,&\n23539,&\n23549,&\n23557,&\n23561,&\n23563,&\n23567,&\n23581,&\n23593,&\n23599,&\n23603,&\n23609,&\n23623,&\n23627,&\n23629,&\n23633,&\n23663,&\n23669,&\n23671,&\n23677,&\n23687,&\n23689,&\n23719,&\n23741,&\n23743,&\n23747,&\n23753,&\n23761,&\n23767,&\n23773,&\n23789,&\n23801,&\n23813,&\n23819,&\n23827,&\n23831,&\n23833,&\n23857,&\n23869,&\n23873,&\n23879,&\n23887,&\n23893,&\n23899,&\n23909,&\n23911,&\n23917,&\n23929,&\n23957,&\n23971,&\n23977,&\n23981,&\n23993,&\n24001,&\n24007,&\n24019,&\n24023,&\n24029,&\n24043,&\n24049,&\n24061,&\n24071,&\n24077,&\n24083,&\n24091,&\n24097,&\n24103,&\n24107,&\n24109,&\n24113,&\n24121,&\n24133,&\n24137,&\n24151,&\n24169,&\n24179,&\n24181,&\n24197,&\n24203,&\n24223,&\n24229,&\n24239,&\n24247,&\n24251,&\n24281,&\n24317,&\n24329,&\n24337,&\n24359,&\n24371,&\n24373,&\n24379,&\n24391,&\n24407,&\n24413,&\n24419,&\n24421,&\n24439,&\n24443,&\n24469,&\n24473,&\n24481,&\n24499,&\n24509,&\n24517,&\n24527,&\n24533,&\n24547,&\n24551,&\n24571,&\n24593,&\n24611,&\n24623,&\n24631,&\n24659,&\n24671,&\n24677,&\n24683,&\n24691,&\n24697,&\n24709,&\n24733,&\n24749,&\n24763,&\n24767,&\n24781,&\n24793,&\n24799,&\n24809,&\n24821,&\n24841,&\n24847,&\n24851,&\n24859,&\n24877,&\n24889,&\n24907,&\n24917,&\n24919,&\n24923,&\n24943,&\n24953,&\n24967,&\n24971,&\n24977,&\n24979,&\n24989,&\n25013,&\n25031,&\n25033,&\n25037,&\n25057,&\n25073,&\n25087,&\n25097,&\n25111,&\n25117,&\n25121,&\n25127,&\n25147,&\n25153,&\n25163,&\n25169,&\n25171,&\n25183,&\n25189,&\n25219,&\n25229,&\n25237,&\n25243,&\n25247,&\n25253,&\n25261,&\n25301,&\n25303,&\n25307,&\n25309,&\n25321,&\n25339,&\n25343,&\n25349,&\n25357,&\n25367,&\n25373,&\n25391,&\n25409,&\n25411,&\n25423,&\n25439,&\n25447,&\n25453,&\n25457,&\n25463,&\n25469,&\n25471,&\n25523,&\n25537,&\n25541,&\n25561,&\n25577,&\n25579,&\n25583,&\n25589,&\n25601,&\n25603,&\n25609,&\n25621,&\n25633,&\n25639,&\n25643,&\n25657,&\n25667,&\n25673,&\n25679,&\n25693,&\n25703,&\n25717,&\n25733,&\n25741,&\n25747,&\n25759,&\n25763,&\n25771,&\n25793,&\n25799,&\n25801,&\n25819,&\n25841,&\n25847,&\n25849,&\n25867,&\n25873,&\n25889,&\n25903,&\n25913,&\n25919,&\n25931,&\n25933,&\n25939,&\n25943,&\n25951,&\n25969,&\n25981,&\n25997,&\n25999,&\n26003,&\n26017,&\n26021,&\n26029,&\n26041,&\n26053,&\n26083,&\n26099,&\n26107,&\n26111,&\n26113,&\n26119,&\n26141,&\n26153,&\n26161,&\n26171,&\n26177,&\n26183,&\n26189,&\n26203,&\n26209,&\n26227,&\n26237,&\n26249,&\n26251,&\n26261,&\n26263,&\n26267,&\n26293,&\n26297,&\n26309,&\n26317,&\n26321,&\n26339,&\n26347,&\n26357,&\n26371,&\n26387,&\n26393,&\n26399,&\n26407,&\n26417,&\n26423,&\n26431,&\n26437,&\n26449,&\n26459,&\n26479,&\n26489,&\n26497,&\n26501,&\n26513,&\n26539,&\n26557,&\n26561,&\n26573,&\n26591,&\n26597,&\n26627,&\n26633,&\n26641,&\n26647,&\n26669,&\n26681,&\n26683,&\n26687,&\n26693,&\n26699,&\n26701,&\n26711,&\n26713,&\n26717,&\n26723,&\n26729,&\n26731,&\n26737,&\n26759,&\n26777,&\n26783,&\n26801,&\n26813,&\n26821,&\n26833,&\n26839,&\n26849,&\n26861,&\n26863,&\n26879,&\n26881,&\n26891,&\n26893,&\n26903,&\n26921,&\n26927,&\n26947,&\n26951,&\n26953,&\n26959,&\n26981,&\n26987,&\n26993,&\n27011,&\n27017,&\n27031,&\n27043,&\n27059,&\n27061,&\n27067,&\n27073,&\n27077,&\n27091,&\n27103,&\n27107,&\n27109,&\n27127,&\n27143,&\n27179,&\n27191,&\n27197,&\n27211,&\n27239,&\n27241,&\n27253,&\n27259,&\n27271,&\n27277,&\n27281,&\n27283,&\n27299,&\n27329,&\n27337,&\n27361,&\n27367,&\n27397,&\n27407,&\n27409,&\n27427,&\n27431,&\n27437,&\n27449,&\n27457,&\n27479,&\n27481,&\n27487,&\n27509,&\n27527,&\n27529,&\n27539,&\n27541,&\n27551,&\n27581,&\n27583,&\n27611,&\n27617,&\n27631,&\n27647,&\n27653,&\n27673,&\n27689,&\n27691,&\n27697,&\n27701,&\n27733,&\n27737,&\n27739,&\n27743,&\n27749,&\n27751,&\n27763,&\n27767,&\n27773,&\n27779,&\n27791,&\n27793,&\n27799,&\n27803,&\n27809,&\n27817,&\n27823,&\n27827,&\n27847,&\n27851,&\n27883,&\n27893,&\n27901,&\n27917,&\n27919,&\n27941,&\n27943,&\n27947,&\n27953,&\n27961,&\n27967,&\n27983,&\n27997,&\n28001,&\n28019,&\n28027,&\n28031,&\n28051,&\n28057,&\n28069,&\n28081,&\n28087,&\n28097,&\n28099,&\n28109,&\n28111,&\n28123,&\n28151,&\n28163,&\n28181,&\n28183,&\n28201,&\n28211,&\n28219,&\n28229,&\n28277,&\n28279,&\n28283,&\n28289,&\n28297,&\n28307,&\n28309,&\n28319,&\n28349,&\n28351,&\n28387,&\n28393,&\n28403,&\n28409,&\n28411,&\n28429,&\n28433,&\n28439,&\n28447,&\n28463,&\n28477,&\n28493,&\n28499,&\n28513,&\n28517,&\n28537,&\n28541,&\n28547,&\n28549,&\n28559,&\n28571,&\n28573,&\n28579,&\n28591,&\n28597,&\n28603,&\n28607,&\n28619,&\n28621,&\n28627,&\n28631,&\n28643,&\n28649,&\n28657,&\n28661,&\n28663,&\n28669,&\n28687,&\n28697,&\n28703,&\n28711,&\n28723,&\n28729,&\n28751,&\n28753,&\n28759,&\n28771,&\n28789,&\n28793,&\n28807,&\n28813,&\n28817,&\n28837,&\n28843,&\n28859,&\n28867,&\n28871,&\n28879,&\n28901,&\n28909,&\n28921,&\n28927,&\n28933,&\n28949,&\n28961,&\n28979,&\n29009,&\n29017,&\n29021,&\n29023,&\n29027,&\n29033,&\n29059,&\n29063,&\n29077,&\n29101,&\n29123,&\n29129,&\n29131,&\n29137,&\n29147,&\n29153,&\n29167,&\n29173,&\n29179,&\n29191,&\n29201,&\n29207,&\n29209,&\n29221,&\n29231,&\n29243,&\n29251,&\n29269,&\n29287,&\n29297,&\n29303,&\n29311,&\n29327,&\n29333,&\n29339,&\n29347,&\n29363,&\n29383,&\n29387,&\n29389,&\n29399,&\n29401,&\n29411,&\n29423,&\n29429,&\n29437,&\n29443,&\n29453,&\n29473,&\n29483,&\n29501,&\n29527,&\n29531,&\n29537,&\n29567,&\n29569,&\n29573,&\n29581,&\n29587,&\n29599,&\n29611,&\n29629,&\n29633,&\n29641,&\n29663,&\n29669,&\n29671,&\n29683,&\n29717,&\n29723,&\n29741,&\n29753,&\n29759,&\n29761,&\n29789,&\n29803,&\n29819,&\n29833,&\n29837,&\n29851,&\n29863,&\n29867,&\n29873,&\n29879,&\n29881,&\n29917,&\n29921,&\n29927,&\n29947,&\n29959,&\n29983,&\n29989,&\n30011,&\n30013,&\n30029,&\n30047,&\n30059,&\n30071,&\n30089,&\n30091,&\n30097,&\n30103,&\n30109,&\n30113,&\n30119,&\n30133,&\n30137,&\n30139,&\n30161,&\n30169,&\n30181,&\n30187,&\n30197,&\n30203,&\n30211,&\n30223,&\n30241,&\n30253,&\n30259,&\n30269,&\n30271,&\n30293,&\n30307,&\n30313,&\n30319,&\n30323,&\n30341,&\n30347,&\n30367,&\n30389,&\n30391,&\n30403,&\n30427,&\n30431,&\n30449,&\n30467,&\n30469,&\n30491,&\n30493,&\n30497,&\n30509,&\n30517,&\n30529,&\n30539,&\n30553,&\n30557,&\n30559,&\n30577,&\n30593,&\n30631,&\n30637,&\n30643,&\n30649,&\n30661,&\n30671,&\n30677,&\n30689,&\n30697,&\n30703,&\n30707,&\n30713,&\n30727,&\n30757,&\n30763,&\n30773,&\n30781,&\n30803,&\n30809,&\n30817,&\n30829,&\n30839,&\n30841,&\n30851,&\n30853,&\n30859,&\n30869,&\n30871,&\n30881,&\n30893,&\n30911,&\n30931,&\n30937,&\n30941,&\n30949,&\n30971,&\n30977,&\n30983,&\n31013,&\n31019,&\n31033,&\n31039,&\n31051,&\n31063,&\n31069,&\n31079,&\n31081,&\n31091,&\n31121,&\n31123,&\n31139,&\n31147,&\n31151,&\n31153,&\n31159,&\n31177,&\n31181,&\n31183,&\n31189,&\n31193,&\n31219,&\n31223,&\n31231,&\n31237,&\n31247,&\n31249,&\n31253,&\n31259,&\n31267,&\n31271,&\n31277,&\n31307,&\n31319,&\n31321,&\n31327,&\n31333,&\n31337,&\n31357,&\n31379,&\n31387,&\n31391,&\n31393,&\n31397,&\n31469,&\n31477,&\n31481,&\n31489,&\n31511,&\n31513,&\n31517,&\n31531,&\n31541,&\n31543,&\n31547,&\n31567,&\n31573,&\n31583,&\n31601,&\n31607,&\n31627,&\n31643,&\n31649,&\n31657,&\n31663,&\n31667,&\n31687,&\n31699,&\n31721,&\n31723,&\n31727,&\n31729,&\n31741,&\n31751,&\n31769,&\n31771,&\n31793,&\n31799,&\n31817,&\n31847,&\n31849,&\n31859,&\n31873,&\n31883,&\n31891,&\n31907,&\n31957,&\n31963,&\n31973,&\n31981,&\n31991,&\n32003,&\n32009,&\n32027,&\n32029,&\n32051,&\n32057,&\n32059,&\n32063,&\n32069,&\n32077,&\n32083,&\n32089,&\n32099,&\n32117,&\n32119,&\n32141,&\n32143,&\n32159,&\n32173,&\n32183,&\n32189,&\n32191,&\n32203,&\n32213,&\n32233,&\n32237,&\n32251,&\n32257,&\n32261,&\n32297,&\n32299,&\n32303,&\n32309,&\n32321,&\n32323,&\n32327,&\n32341,&\n32353,&\n32359,&\n32363,&\n32369,&\n32371,&\n32377,&\n32381,&\n32401,&\n32411,&\n32413,&\n32423,&\n32429,&\n32441,&\n32443,&\n32467,&\n32479,&\n32491,&\n32497,&\n32503,&\n32507,&\n32531,&\n32533,&\n32537,&\n32561,&\n32563,&\n32569,&\n32573,&\n32579,&\n32587,&\n32603,&\n32609,&\n32611,&\n32621,&\n32633,&\n32647,&\n32653,&\n32687,&\n32693,&\n32707,&\n32713,&\n32717,&\n32719,&\n32749,&\n32771,&\n32779,&\n32783,&\n32789,&\n32797,&\n32801,&\n32803,&\n32831,&\n32833,&\n32839,&\n32843,&\n32869,&\n32887,&\n32909,&\n32911,&\n32917,&\n32933,&\n32939,&\n32941,&\n32957,&\n32969,&\n32971,&\n32983,&\n32987,&\n32993,&\n32999,&\n33013,&\n33023,&\n33029,&\n33037,&\n33049,&\n33053,&\n33071,&\n33073,&\n33083,&\n33091,&\n33107,&\n33113,&\n33119,&\n33149,&\n33151,&\n33161,&\n33179,&\n33181,&\n33191,&\n33199,&\n33203,&\n33211,&\n33223,&\n33247,&\n33287,&\n33289,&\n33301,&\n33311,&\n33317,&\n33329,&\n33331,&\n33343,&\n33347,&\n33349,&\n33353,&\n33359,&\n33377,&\n33391,&\n33403,&\n33409,&\n33413,&\n33427,&\n33457,&\n33461,&\n33469,&\n33479,&\n33487,&\n33493,&\n33503,&\n33521,&\n33529,&\n33533,&\n33547,&\n33563,&\n33569,&\n33577,&\n33581,&\n33587,&\n33589,&\n33599,&\n33601,&\n33613,&\n33617,&\n33619,&\n33623,&\n33629,&\n33637,&\n33641,&\n33647,&\n33679,&\n33703,&\n33713,&\n33721,&\n33739,&\n33749,&\n33751,&\n33757,&\n33767,&\n33769,&\n33773,&\n33791,&\n33797,&\n33809,&\n33811,&\n33827,&\n33829,&\n33851,&\n33857,&\n33863,&\n33871,&\n33889,&\n33893,&\n33911,&\n33923,&\n33931,&\n33937,&\n33941,&\n33961,&\n33967,&\n33997,&\n34019,&\n34031,&\n34033,&\n34039,&\n34057,&\n34061,&\n34123,&\n34127,&\n34129,&\n34141,&\n34147,&\n34157,&\n34159,&\n34171,&\n34183,&\n34211,&\n34213,&\n34217,&\n34231,&\n34253,&\n34259,&\n34261,&\n34267,&\n34273,&\n34283,&\n34297,&\n34301,&\n34303,&\n34313,&\n34319,&\n34327,&\n34337,&\n34351,&\n34361,&\n34367,&\n34369,&\n34381,&\n34403,&\n34421,&\n34429,&\n34439,&\n34457,&\n34469,&\n34471,&\n34483,&\n34487,&\n34499,&\n34501,&\n34511,&\n34513,&\n34519,&\n34537,&\n34543,&\n34549,&\n34583,&\n34589,&\n34591,&\n34603,&\n34607,&\n34613,&\n34631,&\n34649,&\n34651,&\n34667,&\n34673,&\n34679,&\n34687,&\n34693,&\n34703,&\n34721,&\n34729,&\n34739,&\n34747,&\n34757,&\n34759,&\n34763,&\n34781,&\n34807,&\n34819,&\n34841,&\n34843,&\n34847,&\n34849,&\n34871,&\n34877,&\n34883,&\n34897,&\n34913,&\n34919,&\n34939,&\n34949,&\n34961,&\n34963,&\n34981,&\n35023,&\n35027,&\n35051,&\n35053,&\n35059,&\n35069,&\n35081,&\n35083,&\n35089,&\n35099,&\n35107,&\n35111,&\n35117,&\n35129,&\n35141,&\n35149,&\n35153,&\n35159,&\n35171,&\n35201,&\n35221,&\n35227,&\n35251,&\n35257,&\n35267,&\n35279,&\n35281,&\n35291,&\n35311,&\n35317,&\n35323,&\n35327,&\n35339,&\n35353,&\n35363,&\n35381,&\n35393,&\n35401,&\n35407,&\n35419,&\n35423,&\n35437,&\n35447,&\n35449,&\n35461,&\n35491,&\n35507,&\n35509,&\n35521,&\n35527,&\n35531,&\n35533,&\n35537,&\n35543,&\n35569,&\n35573,&\n35591,&\n35593,&\n35597,&\n35603,&\n35617,&\n35671,&\n35677,&\n35729,&\n35731,&\n35747,&\n35753,&\n35759,&\n35771,&\n35797,&\n35801,&\n35803,&\n35809,&\n35831,&\n35837,&\n35839,&\n35851,&\n35863,&\n35869,&\n35879,&\n35897,&\n35899,&\n35911,&\n35923,&\n35933,&\n35951,&\n35963,&\n35969,&\n35977,&\n35983,&\n35993,&\n35999,&\n36007,&\n36011,&\n36013,&\n36017,&\n36037,&\n36061,&\n36067,&\n36073,&\n36083,&\n36097,&\n36107,&\n36109,&\n36131,&\n36137,&\n36151,&\n36161,&\n36187,&\n36191,&\n36209,&\n36217,&\n36229,&\n36241,&\n36251,&\n36263,&\n36269,&\n36277,&\n36293,&\n36299,&\n36307,&\n36313,&\n36319,&\n36341,&\n36343,&\n36353,&\n36373,&\n36383,&\n36389,&\n36433,&\n36451,&\n36457,&\n36467,&\n36469,&\n36473,&\n36479,&\n36493,&\n36497,&\n36523,&\n36527,&\n36529,&\n36541,&\n36551,&\n36559,&\n36563,&\n36571,&\n36583,&\n36587,&\n36599,&\n36607,&\n36629,&\n36637,&\n36643,&\n36653,&\n36671,&\n36677,&\n36683,&\n36691,&\n36697,&\n36709,&\n36713,&\n36721,&\n36739,&\n36749,&\n36761,&\n36767,&\n36779,&\n36781,&\n36787,&\n36791,&\n36793,&\n36809,&\n36821,&\n36833,&\n36847,&\n36857,&\n36871,&\n36877,&\n36887,&\n36899,&\n36901,&\n36913,&\n36919,&\n36923,&\n36929,&\n36931,&\n36943,&\n36947,&\n36973,&\n36979,&\n36997,&\n37003,&\n37013,&\n37019,&\n37021,&\n37039,&\n37049,&\n37057,&\n37061,&\n37087,&\n37097,&\n37117,&\n37123,&\n37139,&\n37159,&\n37171,&\n37181,&\n37189,&\n37199,&\n37201,&\n37217,&\n37223,&\n37243,&\n37253,&\n37273,&\n37277,&\n37307,&\n37309,&\n37313,&\n37321,&\n37337,&\n37339,&\n37357,&\n37361,&\n37363,&\n37369,&\n37379,&\n37397,&\n37409,&\n37423,&\n37441,&\n37447,&\n37463,&\n37483,&\n37489,&\n37493,&\n37501,&\n37507,&\n37511,&\n37517,&\n37529,&\n37537,&\n37547,&\n37549,&\n37561,&\n37567,&\n37571,&\n37573,&\n37579,&\n37589,&\n37591,&\n37607,&\n37619,&\n37633,&\n37643,&\n37649,&\n37657,&\n37663,&\n37691,&\n37693,&\n37699,&\n37717,&\n37747,&\n37781,&\n37783,&\n37799,&\n37811,&\n37813,&\n37831,&\n37847,&\n37853,&\n37861,&\n37871,&\n37879,&\n37889,&\n37897,&\n37907,&\n37951,&\n37957,&\n37963,&\n37967,&\n37987,&\n37991,&\n37993,&\n37997,&\n38011,&\n38039,&\n38047,&\n38053,&\n38069,&\n38083,&\n38113,&\n38119,&\n38149,&\n38153,&\n38167,&\n38177,&\n38183,&\n38189,&\n38197,&\n38201,&\n38219,&\n38231,&\n38237,&\n38239,&\n38261,&\n38273,&\n38281,&\n38287,&\n38299,&\n38303,&\n38317,&\n38321,&\n38327,&\n38329,&\n38333,&\n38351,&\n38371,&\n38377,&\n38393,&\n38431,&\n38447,&\n38449,&\n38453,&\n38459,&\n38461,&\n38501,&\n38543,&\n38557,&\n38561,&\n38567,&\n38569,&\n38593,&\n38603,&\n38609,&\n38611,&\n38629,&\n38639,&\n38651,&\n38653,&\n38669,&\n38671,&\n38677,&\n38693,&\n38699,&\n38707,&\n38711,&\n38713,&\n38723,&\n38729,&\n38737,&\n38747,&\n38749,&\n38767,&\n38783,&\n38791,&\n38803,&\n38821,&\n38833,&\n38839,&\n38851,&\n38861,&\n38867,&\n38873,&\n38891,&\n38903,&\n38917,&\n38921,&\n38923,&\n38933,&\n38953,&\n38959,&\n38971,&\n38977,&\n38993,&\n39019,&\n39023,&\n39041,&\n39043,&\n39047,&\n39079,&\n39089,&\n39097,&\n39103,&\n39107,&\n39113,&\n39119,&\n39133,&\n39139,&\n39157,&\n39161,&\n39163,&\n39181,&\n39191,&\n39199,&\n39209,&\n39217,&\n39227,&\n39229,&\n39233,&\n39239,&\n39241,&\n39251,&\n39293,&\n39301,&\n39313,&\n39317,&\n39323,&\n39341,&\n39343,&\n39359,&\n39367,&\n39371,&\n39373,&\n39383,&\n39397,&\n39409,&\n39419,&\n39439,&\n39443,&\n39451,&\n39461,&\n39499,&\n39503,&\n39509,&\n39511,&\n39521,&\n39541,&\n39551,&\n39563,&\n39569,&\n39581,&\n39607,&\n39619,&\n39623,&\n39631,&\n39659,&\n39667,&\n39671,&\n39679,&\n39703,&\n39709,&\n39719,&\n39727,&\n39733,&\n39749,&\n39761,&\n39769,&\n39779,&\n39791,&\n39799,&\n39821,&\n39827,&\n39829,&\n39839,&\n39841,&\n39847,&\n39857,&\n39863,&\n39869,&\n39877,&\n39883,&\n39887,&\n39901,&\n39929,&\n39937,&\n39953,&\n39971,&\n39979,&\n39983,&\n39989,&\n40009,&\n40013,&\n40031,&\n40037,&\n40039,&\n40063,&\n40087,&\n40093,&\n40099,&\n40111,&\n40123,&\n40127,&\n40129,&\n40151,&\n40153,&\n40163,&\n40169,&\n40177,&\n40189,&\n40193,&\n40213,&\n40231,&\n40237,&\n40241,&\n40253,&\n40277,&\n40283,&\n40289,&\n40343,&\n40351,&\n40357,&\n40361,&\n40387,&\n40423,&\n40427,&\n40429,&\n40433,&\n40459,&\n40471,&\n40483,&\n40487,&\n40493,&\n40499,&\n40507,&\n40519,&\n40529,&\n40531,&\n40543,&\n40559,&\n40577,&\n40583,&\n40591,&\n40597,&\n40609,&\n40627,&\n40637,&\n40639,&\n40693,&\n40697,&\n40699,&\n40709,&\n40739,&\n40751,&\n40759,&\n40763,&\n40771,&\n40787,&\n40801,&\n40813,&\n40819,&\n40823,&\n40829,&\n40841,&\n40847,&\n40849,&\n40853,&\n40867,&\n40879,&\n40883,&\n40897,&\n40903,&\n40927,&\n40933,&\n40939,&\n40949,&\n40961,&\n40973,&\n40993,&\n41011,&\n41017,&\n41023,&\n41039,&\n41047,&\n41051,&\n41057,&\n41077,&\n41081,&\n41113,&\n41117,&\n41131,&\n41141,&\n41143,&\n41149,&\n41161,&\n41177,&\n41179,&\n41183,&\n41189,&\n41201,&\n41203,&\n41213,&\n41221,&\n41227,&\n41231,&\n41233,&\n41243,&\n41257,&\n41263,&\n41269,&\n41281,&\n41299,&\n41333,&\n41341,&\n41351,&\n41357,&\n41381,&\n41387,&\n41389,&\n41399,&\n41411,&\n41413,&\n41443,&\n41453,&\n41467,&\n41479,&\n41491,&\n41507,&\n41513,&\n41519,&\n41521,&\n41539,&\n41543,&\n41549,&\n41579,&\n41593,&\n41597,&\n41603,&\n41609,&\n41611,&\n41617,&\n41621,&\n41627,&\n41641,&\n41647,&\n41651,&\n41659,&\n41669,&\n41681,&\n41687,&\n41719,&\n41729,&\n41737,&\n41759,&\n41761,&\n41771,&\n41777,&\n41801,&\n41809,&\n41813,&\n41843,&\n41849,&\n41851,&\n41863,&\n41879,&\n41887,&\n41893,&\n41897,&\n41903,&\n41911,&\n41927,&\n41941,&\n41947,&\n41953,&\n41957,&\n41959,&\n41969,&\n41981,&\n41983,&\n41999,&\n42013,&\n42017,&\n42019,&\n42023,&\n42043,&\n42061,&\n42071,&\n42073,&\n42083,&\n42089,&\n42101,&\n42131,&\n42139,&\n42157,&\n42169,&\n42179,&\n42181,&\n42187,&\n42193,&\n42197,&\n42209,&\n42221,&\n42223,&\n42227,&\n42239,&\n42257,&\n42281,&\n42283,&\n42293,&\n42299,&\n42307,&\n42323,&\n42331,&\n42337,&\n42349,&\n42359,&\n42373,&\n42379,&\n42391,&\n42397,&\n42403,&\n42407,&\n42409,&\n42433,&\n42437,&\n42443,&\n42451,&\n42457,&\n42461,&\n42463,&\n42467,&\n42473,&\n42487,&\n42491,&\n42499,&\n42509,&\n42533,&\n42557,&\n42569,&\n42571,&\n42577,&\n42589,&\n42611,&\n42641,&\n42643,&\n42649,&\n42667,&\n42677,&\n42683,&\n42689,&\n42697,&\n42701,&\n42703,&\n42709,&\n42719,&\n42727,&\n42737,&\n42743,&\n42751,&\n42767,&\n42773,&\n42787,&\n42793,&\n42797,&\n42821,&\n42829,&\n42839,&\n42841,&\n42853,&\n42859,&\n42863,&\n42899,&\n42901,&\n42923,&\n42929,&\n42937,&\n42943,&\n42953,&\n42961,&\n42967,&\n42979,&\n42989,&\n43003,&\n43013,&\n43019,&\n43037,&\n43049,&\n43051,&\n43063,&\n43067,&\n43093,&\n43103,&\n43117,&\n43133,&\n43151,&\n43159,&\n43177,&\n43189,&\n43201,&\n43207,&\n43223,&\n43237,&\n43261,&\n43271,&\n43283,&\n43291,&\n43313,&\n43319,&\n43321,&\n43331,&\n43391,&\n43397,&\n43399,&\n43403,&\n43411,&\n43427,&\n43441,&\n43451,&\n43457,&\n43481,&\n43487,&\n43499,&\n43517,&\n43541,&\n43543,&\n43573,&\n43577,&\n43579,&\n43591,&\n43597,&\n43607,&\n43609,&\n43613,&\n43627,&\n43633,&\n43649,&\n43651,&\n43661,&\n43669,&\n43691,&\n43711,&\n43717,&\n43721,&\n43753,&\n43759,&\n43777,&\n43781,&\n43783,&\n43787,&\n43789,&\n43793,&\n43801,&\n43853,&\n43867,&\n43889,&\n43891,&\n43913,&\n43933,&\n43943,&\n43951,&\n43961,&\n43963,&\n43969,&\n43973,&\n43987,&\n43991,&\n43997,&\n44017,&\n44021,&\n44027,&\n44029,&\n44041,&\n44053,&\n44059,&\n44071,&\n44087,&\n44089,&\n44101,&\n44111,&\n44119,&\n44123,&\n44129,&\n44131,&\n44159,&\n44171,&\n44179,&\n44189,&\n44201,&\n44203,&\n44207,&\n44221,&\n44249,&\n44257,&\n44263,&\n44267,&\n44269,&\n44273,&\n44279,&\n44281,&\n44293,&\n44351,&\n44357,&\n44371,&\n44381,&\n44383,&\n44389,&\n44417,&\n44449,&\n44453,&\n44483,&\n44491,&\n44497,&\n44501,&\n44507,&\n44519,&\n44531,&\n44533,&\n44537,&\n44543,&\n44549,&\n44563,&\n44579,&\n44587,&\n44617,&\n44621,&\n44623,&\n44633,&\n44641,&\n44647,&\n44651,&\n44657,&\n44683,&\n44687,&\n44699,&\n44701,&\n44711,&\n44729,&\n44741,&\n44753,&\n44771,&\n44773,&\n44777,&\n44789,&\n44797,&\n44809,&\n44819,&\n44839,&\n44843,&\n44851,&\n44867,&\n44879,&\n44887,&\n44893,&\n44909,&\n44917,&\n44927,&\n44939,&\n44953,&\n44959,&\n44963,&\n44971,&\n44983,&\n44987,&\n45007,&\n45013,&\n45053,&\n45061,&\n45077,&\n45083,&\n45119,&\n45121,&\n45127,&\n45131,&\n45137,&\n45139,&\n45161,&\n45179,&\n45181,&\n45191,&\n45197,&\n45233,&\n45247,&\n45259,&\n45263,&\n45281,&\n45289,&\n45293,&\n45307,&\n45317,&\n45319,&\n45329,&\n45337,&\n45341,&\n45343,&\n45361,&\n45377,&\n45389,&\n45403,&\n45413,&\n45427,&\n45433,&\n45439,&\n45481,&\n45491,&\n45497,&\n45503,&\n45523,&\n45533,&\n45541,&\n45553,&\n45557,&\n45569,&\n45587,&\n45589,&\n45599,&\n45613,&\n45631,&\n45641,&\n45659,&\n45667,&\n45673,&\n45677,&\n45691,&\n45697,&\n45707,&\n45737,&\n45751,&\n45757,&\n45763,&\n45767,&\n45779,&\n45817,&\n45821,&\n45823,&\n45827,&\n45833,&\n45841,&\n45853,&\n45863,&\n45869,&\n45887,&\n45893,&\n45943,&\n45949,&\n45953,&\n45959,&\n45971,&\n45979,&\n45989,&\n46021,&\n46027,&\n46049,&\n46051,&\n46061,&\n46073,&\n46091,&\n46093,&\n46099,&\n46103,&\n46133,&\n46141,&\n46147,&\n46153,&\n46171,&\n46181,&\n46183,&\n46187,&\n46199,&\n46219,&\n46229,&\n46237,&\n46261,&\n46271,&\n46273,&\n46279,&\n46301,&\n46307,&\n46309,&\n46327,&\n46337,&\n46349,&\n46351,&\n46381,&\n46399,&\n46411,&\n46439,&\n46441,&\n46447,&\n46451,&\n46457,&\n46471,&\n46477,&\n46489,&\n46499,&\n46507,&\n46511,&\n46523,&\n46549,&\n46559,&\n46567,&\n46573,&\n46589,&\n46591,&\n46601,&\n46619,&\n46633,&\n46639,&\n46643,&\n46649,&\n46663,&\n46679,&\n46681,&\n46687,&\n46691,&\n46703,&\n46723,&\n46727,&\n46747,&\n46751,&\n46757,&\n46769,&\n46771,&\n46807,&\n46811,&\n46817,&\n46819,&\n46829,&\n46831,&\n46853,&\n46861,&\n46867,&\n46877,&\n46889,&\n46901,&\n46919,&\n46933,&\n46957,&\n46993,&\n46997,&\n47017,&\n47041,&\n47051,&\n47057,&\n47059,&\n47087,&\n47093,&\n47111,&\n47119,&\n47123,&\n47129,&\n47137,&\n47143,&\n47147,&\n47149,&\n47161,&\n47189,&\n47207,&\n47221,&\n47237,&\n47251,&\n47269,&\n47279,&\n47287,&\n47293,&\n47297,&\n47303,&\n47309,&\n47317,&\n47339,&\n47351,&\n47353,&\n47363,&\n47381,&\n47387,&\n47389,&\n47407,&\n47417,&\n47419,&\n47431,&\n47441,&\n47459,&\n47491,&\n47497,&\n47501,&\n47507,&\n47513,&\n47521,&\n47527,&\n47533,&\n47543,&\n47563,&\n47569,&\n47581,&\n47591,&\n47599,&\n47609,&\n47623,&\n47629,&\n47639,&\n47653,&\n47657,&\n47659,&\n47681,&\n47699,&\n47701,&\n47711,&\n47713,&\n47717,&\n47737,&\n47741,&\n47743,&\n47777,&\n47779,&\n47791,&\n47797,&\n47807,&\n47809,&\n47819,&\n47837,&\n47843,&\n47857,&\n47869,&\n47881,&\n47903,&\n47911,&\n47917,&\n47933,&\n47939,&\n47947,&\n47951,&\n47963,&\n47969,&\n47977,&\n47981,&\n48017,&\n48023,&\n48029,&\n48049,&\n48073,&\n48079,&\n48091,&\n48109,&\n48119,&\n48121,&\n48131,&\n48157,&\n48163,&\n48179,&\n48187,&\n48193,&\n48197,&\n48221,&\n48239,&\n48247,&\n48259,&\n48271,&\n48281,&\n48299,&\n48311,&\n48313,&\n48337,&\n48341,&\n48353,&\n48371,&\n48383,&\n48397,&\n48407,&\n48409,&\n48413,&\n48437,&\n48449,&\n48463,&\n48473,&\n48479,&\n48481,&\n48487,&\n48491,&\n48497,&\n48523,&\n48527,&\n48533,&\n48539,&\n48541,&\n48563,&\n48571,&\n48589,&\n48593,&\n48611,&\n48619,&\n48623,&\n48647,&\n48649,&\n48661,&\n48673,&\n48677,&\n48679,&\n48731,&\n48733,&\n48751,&\n48757,&\n48761,&\n48767,&\n48779,&\n48781,&\n48787,&\n48799,&\n48809,&\n48817,&\n48821,&\n48823,&\n48847,&\n48857,&\n48859,&\n48869,&\n48871,&\n48883,&\n48889,&\n48907,&\n48947,&\n48953,&\n48973,&\n48989,&\n48991,&\n49003,&\n49009,&\n49019,&\n49031,&\n49033,&\n49037,&\n49043,&\n49057,&\n49069,&\n49081,&\n49103,&\n49109,&\n49117,&\n49121,&\n49123,&\n49139,&\n49157,&\n49169,&\n49171,&\n49177,&\n49193,&\n49199,&\n49201,&\n49207,&\n49211,&\n49223,&\n49253,&\n49261,&\n49277,&\n49279,&\n49297,&\n49307,&\n49331,&\n49333,&\n49339,&\n49363,&\n49367,&\n49369,&\n49391,&\n49393,&\n49409,&\n49411,&\n49417,&\n49429,&\n49433,&\n49451,&\n49459,&\n49463,&\n49477,&\n49481,&\n49499,&\n49523,&\n49529,&\n49531,&\n49537,&\n49547,&\n49549,&\n49559,&\n49597,&\n49603,&\n49613,&\n49627,&\n49633,&\n49639,&\n49663,&\n49667,&\n49669,&\n49681,&\n49697,&\n49711,&\n49727,&\n49739,&\n49741,&\n49747,&\n49757,&\n49783,&\n49787,&\n49789,&\n49801,&\n49807,&\n49811,&\n49823,&\n49831,&\n49843,&\n49853,&\n49871,&\n49877,&\n49891,&\n49919,&\n49921,&\n49927,&\n49937,&\n49939,&\n49943,&\n49957,&\n49991,&\n49993,&\n49999,&\n50021,&\n50023,&\n50033,&\n50047,&\n50051,&\n50053,&\n50069,&\n50077,&\n50087,&\n50093,&\n50101,&\n50111,&\n50119,&\n50123,&\n50129,&\n50131,&\n50147,&\n50153,&\n50159,&\n50177,&\n50207,&\n50221,&\n50227,&\n50231,&\n50261,&\n50263,&\n50273,&\n50287,&\n50291,&\n50311,&\n50321,&\n50329,&\n50333,&\n50341,&\n50359,&\n50363,&\n50377,&\n50383,&\n50387,&\n50411,&\n50417,&\n50423,&\n50441,&\n50459,&\n50461,&\n50497,&\n50503,&\n50513,&\n50527,&\n50539,&\n50543,&\n50549,&\n50551,&\n50581,&\n50587,&\n50591,&\n50593,&\n50599,&\n50627,&\n50647,&\n50651,&\n50671,&\n50683,&\n50707,&\n50723,&\n50741,&\n50753,&\n50767,&\n50773,&\n50777,&\n50789,&\n50821,&\n50833,&\n50839,&\n50849,&\n50857,&\n50867,&\n50873,&\n50891,&\n50893,&\n50909,&\n50923,&\n50929,&\n50951,&\n50957,&\n50969,&\n50971,&\n50989,&\n50993,&\n51001,&\n51031,&\n51043,&\n51047,&\n51059,&\n51061,&\n51071,&\n51109,&\n51131,&\n51133,&\n51137,&\n51151,&\n51157,&\n51169,&\n51193,&\n51197,&\n51199,&\n51203,&\n51217,&\n51229,&\n51239,&\n51241,&\n51257,&\n51263,&\n51283,&\n51287,&\n51307,&\n51329,&\n51341,&\n51343,&\n51347,&\n51349,&\n51361,&\n51383,&\n51407,&\n51413,&\n51419,&\n51421,&\n51427,&\n51431,&\n51437,&\n51439,&\n51449,&\n51461,&\n51473,&\n51479,&\n51481,&\n51487,&\n51503,&\n51511,&\n51517,&\n51521,&\n51539,&\n51551,&\n51563,&\n51577,&\n51581,&\n51593,&\n51599,&\n51607,&\n51613,&\n51631,&\n51637,&\n51647,&\n51659,&\n51673,&\n51679,&\n51683,&\n51691,&\n51713,&\n51719,&\n51721,&\n51749,&\n51767,&\n51769,&\n51787,&\n51797,&\n51803,&\n51817,&\n51827,&\n51829,&\n51839,&\n51853,&\n51859,&\n51869,&\n51871,&\n51893,&\n51899,&\n51907,&\n51913,&\n51929,&\n51941,&\n51949,&\n51971,&\n51973,&\n51977,&\n51991,&\n52009,&\n52021,&\n52027,&\n52051,&\n52057,&\n52067,&\n52069,&\n52081,&\n52103,&\n52121,&\n52127,&\n52147,&\n52153,&\n52163,&\n52177,&\n52181,&\n52183,&\n52189,&\n52201,&\n52223,&\n52237,&\n52249,&\n52253,&\n52259,&\n52267,&\n52289,&\n52291,&\n52301,&\n52313,&\n52321,&\n52361,&\n52363,&\n52369,&\n52379,&\n52387,&\n52391,&\n52433,&\n52453,&\n52457,&\n52489,&\n52501,&\n52511,&\n52517,&\n52529,&\n52541,&\n52543,&\n52553,&\n52561,&\n52567,&\n52571,&\n52579,&\n52583,&\n52609,&\n52627,&\n52631,&\n52639,&\n52667,&\n52673,&\n52691,&\n52697,&\n52709,&\n52711,&\n52721,&\n52727,&\n52733,&\n52747,&\n52757,&\n52769,&\n52783,&\n52807,&\n52813,&\n52817,&\n52837,&\n52859,&\n52861,&\n52879,&\n52883,&\n52889,&\n52901,&\n52903,&\n52919,&\n52937,&\n52951,&\n52957,&\n52963,&\n52967,&\n52973,&\n52981,&\n52999,&\n53003,&\n53017,&\n53047,&\n53051,&\n53069,&\n53077,&\n53087,&\n53089,&\n53093,&\n53101,&\n53113,&\n53117,&\n53129,&\n53147,&\n53149,&\n53161,&\n53171,&\n53173,&\n53189,&\n53197,&\n53201,&\n53231,&\n53233,&\n53239,&\n53267,&\n53269,&\n53279,&\n53281,&\n53299,&\n53309,&\n53323,&\n53327,&\n53353,&\n53359,&\n53377,&\n53381,&\n53401,&\n53407,&\n53411,&\n53419,&\n53437,&\n53441,&\n53453,&\n53479,&\n53503,&\n53507,&\n53527,&\n53549,&\n53551,&\n53569,&\n53591,&\n53593,&\n53597,&\n53609,&\n53611,&\n53617,&\n53623,&\n53629,&\n53633,&\n53639,&\n53653,&\n53657,&\n53681,&\n53693,&\n53699,&\n53717,&\n53719,&\n53731,&\n53759,&\n53773,&\n53777,&\n53783,&\n53791,&\n53813,&\n53819,&\n53831,&\n53849,&\n53857,&\n53861,&\n53881,&\n53887,&\n53891,&\n53897,&\n53899,&\n53917,&\n53923,&\n53927,&\n53939,&\n53951,&\n53959,&\n53987,&\n53993,&\n54001,&\n54011,&\n54013,&\n54037,&\n54049,&\n54059,&\n54083,&\n54091,&\n54101,&\n54121,&\n54133,&\n54139,&\n54151,&\n54163,&\n54167,&\n54181,&\n54193,&\n54217,&\n54251,&\n54269,&\n54277,&\n54287,&\n54293,&\n54311,&\n54319,&\n54323,&\n54331,&\n54347,&\n54361,&\n54367,&\n54371,&\n54377,&\n54401,&\n54403,&\n54409,&\n54413,&\n54419,&\n54421,&\n54437,&\n54443,&\n54449,&\n54469,&\n54493,&\n54497,&\n54499,&\n54503,&\n54517,&\n54521,&\n54539,&\n54541,&\n54547,&\n54559,&\n54563,&\n54577,&\n54581,&\n54583,&\n54601,&\n54617,&\n54623,&\n54629,&\n54631,&\n54647,&\n54667,&\n54673,&\n54679,&\n54709,&\n54713,&\n54721,&\n54727,&\n54751,&\n54767,&\n54773,&\n54779,&\n54787,&\n54799,&\n54829,&\n54833,&\n54851,&\n54869,&\n54877,&\n54881,&\n54907,&\n54917,&\n54919,&\n54941,&\n54949,&\n54959,&\n54973,&\n54979,&\n54983,&\n55001,&\n55009,&\n55021,&\n55049,&\n55051,&\n55057,&\n55061,&\n55073,&\n55079,&\n55103,&\n55109,&\n55117,&\n55127,&\n55147,&\n55163,&\n55171,&\n55201,&\n55207,&\n55213,&\n55217,&\n55219,&\n55229,&\n55243,&\n55249,&\n55259,&\n55291,&\n55313,&\n55331,&\n55333,&\n55337,&\n55339,&\n55343,&\n55351,&\n55373,&\n55381,&\n55399,&\n55411,&\n55439,&\n55441,&\n55457,&\n55469,&\n55487,&\n55501,&\n55511,&\n55529,&\n55541,&\n55547,&\n55579,&\n55589,&\n55603,&\n55609,&\n55619,&\n55621,&\n55631,&\n55633,&\n55639,&\n55661,&\n55663,&\n55667,&\n55673,&\n55681,&\n55691,&\n55697,&\n55711,&\n55717,&\n55721,&\n55733,&\n55763,&\n55787,&\n55793,&\n55799,&\n55807,&\n55813,&\n55817,&\n55819,&\n55823,&\n55829,&\n55837,&\n55843,&\n55849,&\n55871,&\n55889,&\n55897,&\n55901,&\n55903,&\n55921,&\n55927,&\n55931,&\n55933,&\n55949,&\n55967,&\n55987,&\n55997,&\n56003,&\n56009,&\n56039,&\n56041,&\n56053,&\n56081,&\n56087,&\n56093,&\n56099,&\n56101,&\n56113,&\n56123,&\n56131,&\n56149,&\n56167,&\n56171&\n/)\n ans = 1\n d = div(i)\n do i = 1,500\n d = div(i)\n if (mod(A,d)==0 .and. mod(B,d)==0) then\n ans = ans + 1\n end if\n end do\n\n write(*, *) ans\nend program main\n", "language": "Fortran", "metadata": {"date": 1569724743, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s327295957.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s327295957", "user_id": "u050276949"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer(8) i,A,B,ans,d\n integer div(5699)\n read(*, *)A,B\n !read(*, *) (L(i), i = 1,N)\n div = (/2,&\n3,&\n5,&\n7,&\n11,&\n13,&\n17,&\n19,&\n23,&\n29,&\n31,&\n37,&\n41,&\n43,&\n47,&\n53,&\n59,&\n61,&\n67,&\n71,&\n73,&\n79,&\n83,&\n89,&\n97,&\n101,&\n103,&\n107,&\n109,&\n113,&\n127,&\n131,&\n137,&\n139,&\n149,&\n151,&\n157,&\n163,&\n167,&\n173,&\n179,&\n181,&\n191,&\n193,&\n197,&\n199,&\n211,&\n223,&\n227,&\n229,&\n233,&\n239,&\n241,&\n251,&\n257,&\n263,&\n269,&\n271,&\n277,&\n281,&\n283,&\n293,&\n307,&\n311,&\n313,&\n317,&\n331,&\n337,&\n347,&\n349,&\n353,&\n359,&\n367,&\n373,&\n379,&\n383,&\n389,&\n397,&\n401,&\n409,&\n419,&\n421,&\n431,&\n433,&\n439,&\n443,&\n449,&\n457,&\n461,&\n463,&\n467,&\n479,&\n487,&\n491,&\n499,&\n503,&\n509,&\n521,&\n523,&\n541,&\n547,&\n557,&\n563,&\n569,&\n571,&\n577,&\n587,&\n593,&\n599,&\n601,&\n607,&\n613,&\n617,&\n619,&\n631,&\n641,&\n643,&\n647,&\n653,&\n659,&\n661,&\n673,&\n677,&\n683,&\n691,&\n701,&\n709,&\n719,&\n727,&\n733,&\n739,&\n743,&\n751,&\n757,&\n761,&\n769,&\n773,&\n787,&\n797,&\n809,&\n811,&\n821,&\n823,&\n827,&\n829,&\n839,&\n853,&\n857,&\n859,&\n863,&\n877,&\n881,&\n883,&\n887,&\n907,&\n911,&\n919,&\n929,&\n937,&\n941,&\n947,&\n953,&\n967,&\n971,&\n977,&\n983,&\n991,&\n997,&\n1009,&\n1013,&\n1019,&\n1021,&\n1031,&\n1033,&\n1039,&\n1049,&\n1051,&\n1061,&\n1063,&\n1069,&\n1087,&\n1091,&\n1093,&\n1097,&\n1103,&\n1109,&\n1117,&\n1123,&\n1129,&\n1151,&\n1153,&\n1163,&\n1171,&\n1181,&\n1187,&\n1193,&\n1201,&\n1213,&\n1217,&\n1223,&\n1229,&\n1231,&\n1237,&\n1249,&\n1259,&\n1277,&\n1279,&\n1283,&\n1289,&\n1291,&\n1297,&\n1301,&\n1303,&\n1307,&\n1319,&\n1321,&\n1327,&\n1361,&\n1367,&\n1373,&\n1381,&\n1399,&\n1409,&\n1423,&\n1427,&\n1429,&\n1433,&\n1439,&\n1447,&\n1451,&\n1453,&\n1459,&\n1471,&\n1481,&\n1483,&\n1487,&\n1489,&\n1493,&\n1499,&\n1511,&\n1523,&\n1531,&\n1543,&\n1549,&\n1553,&\n1559,&\n1567,&\n1571,&\n1579,&\n1583,&\n1597,&\n1601,&\n1607,&\n1609,&\n1613,&\n1619,&\n1621,&\n1627,&\n1637,&\n1657,&\n1663,&\n1667,&\n1669,&\n1693,&\n1697,&\n1699,&\n1709,&\n1721,&\n1723,&\n1733,&\n1741,&\n1747,&\n1753,&\n1759,&\n1777,&\n1783,&\n1787,&\n1789,&\n1801,&\n1811,&\n1823,&\n1831,&\n1847,&\n1861,&\n1867,&\n1871,&\n1873,&\n1877,&\n1879,&\n1889,&\n1901,&\n1907,&\n1913,&\n1931,&\n1933,&\n1949,&\n1951,&\n1973,&\n1979,&\n1987,&\n1993,&\n1997,&\n1999,&\n2003,&\n2011,&\n2017,&\n2027,&\n2029,&\n2039,&\n2053,&\n2063,&\n2069,&\n2081,&\n2083,&\n2087,&\n2089,&\n2099,&\n2111,&\n2113,&\n2129,&\n2131,&\n2137,&\n2141,&\n2143,&\n2153,&\n2161,&\n2179,&\n2203,&\n2207,&\n2213,&\n2221,&\n2237,&\n2239,&\n2243,&\n2251,&\n2267,&\n2269,&\n2273,&\n2281,&\n2287,&\n2293,&\n2297,&\n2309,&\n2311,&\n2333,&\n2339,&\n2341,&\n2347,&\n2351,&\n2357,&\n2371,&\n2377,&\n2381,&\n2383,&\n2389,&\n2393,&\n2399,&\n2411,&\n2417,&\n2423,&\n2437,&\n2441,&\n2447,&\n2459,&\n2467,&\n2473,&\n2477,&\n2503,&\n2521,&\n2531,&\n2539,&\n2543,&\n2549,&\n2551,&\n2557,&\n2579,&\n2591,&\n2593,&\n2609,&\n2617,&\n2621,&\n2633,&\n2647,&\n2657,&\n2659,&\n2663,&\n2671,&\n2677,&\n2683,&\n2687,&\n2689,&\n2693,&\n2699,&\n2707,&\n2711,&\n2713,&\n2719,&\n2729,&\n2731,&\n2741,&\n2749,&\n2753,&\n2767,&\n2777,&\n2789,&\n2791,&\n2797,&\n2801,&\n2803,&\n2819,&\n2833,&\n2837,&\n2843,&\n2851,&\n2857,&\n2861,&\n2879,&\n2887,&\n2897,&\n2903,&\n2909,&\n2917,&\n2927,&\n2939,&\n2953,&\n2957,&\n2963,&\n2969,&\n2971,&\n2999,&\n3001,&\n3011,&\n3019,&\n3023,&\n3037,&\n3041,&\n3049,&\n3061,&\n3067,&\n3079,&\n3083,&\n3089,&\n3109,&\n3119,&\n3121,&\n3137,&\n3163,&\n3167,&\n3169,&\n3181,&\n3187,&\n3191,&\n3203,&\n3209,&\n3217,&\n3221,&\n3229,&\n3251,&\n3253,&\n3257,&\n3259,&\n3271,&\n3299,&\n3301,&\n3307,&\n3313,&\n3319,&\n3323,&\n3329,&\n3331,&\n3343,&\n3347,&\n3359,&\n3361,&\n3371,&\n3373,&\n3389,&\n3391,&\n3407,&\n3413,&\n3433,&\n3449,&\n3457,&\n3461,&\n3463,&\n3467,&\n3469,&\n3491,&\n3499,&\n3511,&\n3517,&\n3527,&\n3529,&\n3533,&\n3539,&\n3541,&\n3547,&\n3557,&\n3559,&\n3571,&\n3581,&\n3583,&\n3593,&\n3607,&\n3613,&\n3617,&\n3623,&\n3631,&\n3637,&\n3643,&\n3659,&\n3671,&\n3673,&\n3677,&\n3691,&\n3697,&\n3701,&\n3709,&\n3719,&\n3727,&\n3733,&\n3739,&\n3761,&\n3767,&\n3769,&\n3779,&\n3793,&\n3797,&\n3803,&\n3821,&\n3823,&\n3833,&\n3847,&\n3851,&\n3853,&\n3863,&\n3877,&\n3881,&\n3889,&\n3907,&\n3911,&\n3917,&\n3919,&\n3923,&\n3929,&\n3931,&\n3943,&\n3947,&\n3967,&\n3989,&\n4001,&\n4003,&\n4007,&\n4013,&\n4019,&\n4021,&\n4027,&\n4049,&\n4051,&\n4057,&\n4073,&\n4079,&\n4091,&\n4093,&\n4099,&\n4111,&\n4127,&\n4129,&\n4133,&\n4139,&\n4153,&\n4157,&\n4159,&\n4177,&\n4201,&\n4211,&\n4217,&\n4219,&\n4229,&\n4231,&\n4241,&\n4243,&\n4253,&\n4259,&\n4261,&\n4271,&\n4273,&\n4283,&\n4289,&\n4297,&\n4327,&\n4337,&\n4339,&\n4349,&\n4357,&\n4363,&\n4373,&\n4391,&\n4397,&\n4409,&\n4421,&\n4423,&\n4441,&\n4447,&\n4451,&\n4457,&\n4463,&\n4481,&\n4483,&\n4493,&\n4507,&\n4513,&\n4517,&\n4519,&\n4523,&\n4547,&\n4549,&\n4561,&\n4567,&\n4583,&\n4591,&\n4597,&\n4603,&\n4621,&\n4637,&\n4639,&\n4643,&\n4649,&\n4651,&\n4657,&\n4663,&\n4673,&\n4679,&\n4691,&\n4703,&\n4721,&\n4723,&\n4729,&\n4733,&\n4751,&\n4759,&\n4783,&\n4787,&\n4789,&\n4793,&\n4799,&\n4801,&\n4813,&\n4817,&\n4831,&\n4861,&\n4871,&\n4877,&\n4889,&\n4903,&\n4909,&\n4919,&\n4931,&\n4933,&\n4937,&\n4943,&\n4951,&\n4957,&\n4967,&\n4969,&\n4973,&\n4987,&\n4993,&\n4999,&\n5003,&\n5009,&\n5011,&\n5021,&\n5023,&\n5039,&\n5051,&\n5059,&\n5077,&\n5081,&\n5087,&\n5099,&\n5101,&\n5107,&\n5113,&\n5119,&\n5147,&\n5153,&\n5167,&\n5171,&\n5179,&\n5189,&\n5197,&\n5209,&\n5227,&\n5231,&\n5233,&\n5237,&\n5261,&\n5273,&\n5279,&\n5281,&\n5297,&\n5303,&\n5309,&\n5323,&\n5333,&\n5347,&\n5351,&\n5381,&\n5387,&\n5393,&\n5399,&\n5407,&\n5413,&\n5417,&\n5419,&\n5431,&\n5437,&\n5441,&\n5443,&\n5449,&\n5471,&\n5477,&\n5479,&\n5483,&\n5501,&\n5503,&\n5507,&\n5519,&\n5521,&\n5527,&\n5531,&\n5557,&\n5563,&\n5569,&\n5573,&\n5581,&\n5591,&\n5623,&\n5639,&\n5641,&\n5647,&\n5651,&\n5653,&\n5657,&\n5659,&\n5669,&\n5683,&\n5689,&\n5693,&\n5701,&\n5711,&\n5717,&\n5737,&\n5741,&\n5743,&\n5749,&\n5779,&\n5783,&\n5791,&\n5801,&\n5807,&\n5813,&\n5821,&\n5827,&\n5839,&\n5843,&\n5849,&\n5851,&\n5857,&\n5861,&\n5867,&\n5869,&\n5879,&\n5881,&\n5897,&\n5903,&\n5923,&\n5927,&\n5939,&\n5953,&\n5981,&\n5987,&\n6007,&\n6011,&\n6029,&\n6037,&\n6043,&\n6047,&\n6053,&\n6067,&\n6073,&\n6079,&\n6089,&\n6091,&\n6101,&\n6113,&\n6121,&\n6131,&\n6133,&\n6143,&\n6151,&\n6163,&\n6173,&\n6197,&\n6199,&\n6203,&\n6211,&\n6217,&\n6221,&\n6229,&\n6247,&\n6257,&\n6263,&\n6269,&\n6271,&\n6277,&\n6287,&\n6299,&\n6301,&\n6311,&\n6317,&\n6323,&\n6329,&\n6337,&\n6343,&\n6353,&\n6359,&\n6361,&\n6367,&\n6373,&\n6379,&\n6389,&\n6397,&\n6421,&\n6427,&\n6449,&\n6451,&\n6469,&\n6473,&\n6481,&\n6491,&\n6521,&\n6529,&\n6547,&\n6551,&\n6553,&\n6563,&\n6569,&\n6571,&\n6577,&\n6581,&\n6599,&\n6607,&\n6619,&\n6637,&\n6653,&\n6659,&\n6661,&\n6673,&\n6679,&\n6689,&\n6691,&\n6701,&\n6703,&\n6709,&\n6719,&\n6733,&\n6737,&\n6761,&\n6763,&\n6779,&\n6781,&\n6791,&\n6793,&\n6803,&\n6823,&\n6827,&\n6829,&\n6833,&\n6841,&\n6857,&\n6863,&\n6869,&\n6871,&\n6883,&\n6899,&\n6907,&\n6911,&\n6917,&\n6947,&\n6949,&\n6959,&\n6961,&\n6967,&\n6971,&\n6977,&\n6983,&\n6991,&\n6997,&\n7001,&\n7013,&\n7019,&\n7027,&\n7039,&\n7043,&\n7057,&\n7069,&\n7079,&\n7103,&\n7109,&\n7121,&\n7127,&\n7129,&\n7151,&\n7159,&\n7177,&\n7187,&\n7193,&\n7207,&\n7211,&\n7213,&\n7219,&\n7229,&\n7237,&\n7243,&\n7247,&\n7253,&\n7283,&\n7297,&\n7307,&\n7309,&\n7321,&\n7331,&\n7333,&\n7349,&\n7351,&\n7369,&\n7393,&\n7411,&\n7417,&\n7433,&\n7451,&\n7457,&\n7459,&\n7477,&\n7481,&\n7487,&\n7489,&\n7499,&\n7507,&\n7517,&\n7523,&\n7529,&\n7537,&\n7541,&\n7547,&\n7549,&\n7559,&\n7561,&\n7573,&\n7577,&\n7583,&\n7589,&\n7591,&\n7603,&\n7607,&\n7621,&\n7639,&\n7643,&\n7649,&\n7669,&\n7673,&\n7681,&\n7687,&\n7691,&\n7699,&\n7703,&\n7717,&\n7723,&\n7727,&\n7741,&\n7753,&\n7757,&\n7759,&\n7789,&\n7793,&\n7817,&\n7823,&\n7829,&\n7841,&\n7853,&\n7867,&\n7873,&\n7877,&\n7879,&\n7883,&\n7901,&\n7907,&\n7919,&\n7927,&\n7933,&\n7937,&\n7949,&\n7951,&\n7963,&\n7993,&\n8009,&\n8011,&\n8017,&\n8039,&\n8053,&\n8059,&\n8069,&\n8081,&\n8087,&\n8089,&\n8093,&\n8101,&\n8111,&\n8117,&\n8123,&\n8147,&\n8161,&\n8167,&\n8171,&\n8179,&\n8191,&\n8209,&\n8219,&\n8221,&\n8231,&\n8233,&\n8237,&\n8243,&\n8263,&\n8269,&\n8273,&\n8287,&\n8291,&\n8293,&\n8297,&\n8311,&\n8317,&\n8329,&\n8353,&\n8363,&\n8369,&\n8377,&\n8387,&\n8389,&\n8419,&\n8423,&\n8429,&\n8431,&\n8443,&\n8447,&\n8461,&\n8467,&\n8501,&\n8513,&\n8521,&\n8527,&\n8537,&\n8539,&\n8543,&\n8563,&\n8573,&\n8581,&\n8597,&\n8599,&\n8609,&\n8623,&\n8627,&\n8629,&\n8641,&\n8647,&\n8663,&\n8669,&\n8677,&\n8681,&\n8689,&\n8693,&\n8699,&\n8707,&\n8713,&\n8719,&\n8731,&\n8737,&\n8741,&\n8747,&\n8753,&\n8761,&\n8779,&\n8783,&\n8803,&\n8807,&\n8819,&\n8821,&\n8831,&\n8837,&\n8839,&\n8849,&\n8861,&\n8863,&\n8867,&\n8887,&\n8893,&\n8923,&\n8929,&\n8933,&\n8941,&\n8951,&\n8963,&\n8969,&\n8971,&\n8999,&\n9001,&\n9007,&\n9011,&\n9013,&\n9029,&\n9041,&\n9043,&\n9049,&\n9059,&\n9067,&\n9091,&\n9103,&\n9109,&\n9127,&\n9133,&\n9137,&\n9151,&\n9157,&\n9161,&\n9173,&\n9181,&\n9187,&\n9199,&\n9203,&\n9209,&\n9221,&\n9227,&\n9239,&\n9241,&\n9257,&\n9277,&\n9281,&\n9283,&\n9293,&\n9311,&\n9319,&\n9323,&\n9337,&\n9341,&\n9343,&\n9349,&\n9371,&\n9377,&\n9391,&\n9397,&\n9403,&\n9413,&\n9419,&\n9421,&\n9431,&\n9433,&\n9437,&\n9439,&\n9461,&\n9463,&\n9467,&\n9473,&\n9479,&\n9491,&\n9497,&\n9511,&\n9521,&\n9533,&\n9539,&\n9547,&\n9551,&\n9587,&\n9601,&\n9613,&\n9619,&\n9623,&\n9629,&\n9631,&\n9643,&\n9649,&\n9661,&\n9677,&\n9679,&\n9689,&\n9697,&\n9719,&\n9721,&\n9733,&\n9739,&\n9743,&\n9749,&\n9767,&\n9769,&\n9781,&\n9787,&\n9791,&\n9803,&\n9811,&\n9817,&\n9829,&\n9833,&\n9839,&\n9851,&\n9857,&\n9859,&\n9871,&\n9883,&\n9887,&\n9901,&\n9907,&\n9923,&\n9929,&\n9931,&\n9941,&\n9949,&\n9967,&\n9973,&\n10007,&\n10009,&\n10037,&\n10039,&\n10061,&\n10067,&\n10069,&\n10079,&\n10091,&\n10093,&\n10099,&\n10103,&\n10111,&\n10133,&\n10139,&\n10141,&\n10151,&\n10159,&\n10163,&\n10169,&\n10177,&\n10181,&\n10193,&\n10211,&\n10223,&\n10243,&\n10247,&\n10253,&\n10259,&\n10267,&\n10271,&\n10273,&\n10289,&\n10301,&\n10303,&\n10313,&\n10321,&\n10331,&\n10333,&\n10337,&\n10343,&\n10357,&\n10369,&\n10391,&\n10399,&\n10427,&\n10429,&\n10433,&\n10453,&\n10457,&\n10459,&\n10463,&\n10477,&\n10487,&\n10499,&\n10501,&\n10513,&\n10529,&\n10531,&\n10559,&\n10567,&\n10589,&\n10597,&\n10601,&\n10607,&\n10613,&\n10627,&\n10631,&\n10639,&\n10651,&\n10657,&\n10663,&\n10667,&\n10687,&\n10691,&\n10709,&\n10711,&\n10723,&\n10729,&\n10733,&\n10739,&\n10753,&\n10771,&\n10781,&\n10789,&\n10799,&\n10831,&\n10837,&\n10847,&\n10853,&\n10859,&\n10861,&\n10867,&\n10883,&\n10889,&\n10891,&\n10903,&\n10909,&\n10937,&\n10939,&\n10949,&\n10957,&\n10973,&\n10979,&\n10987,&\n10993,&\n11003,&\n11027,&\n11047,&\n11057,&\n11059,&\n11069,&\n11071,&\n11083,&\n11087,&\n11093,&\n11113,&\n11117,&\n11119,&\n11131,&\n11149,&\n11159,&\n11161,&\n11171,&\n11173,&\n11177,&\n11197,&\n11213,&\n11239,&\n11243,&\n11251,&\n11257,&\n11261,&\n11273,&\n11279,&\n11287,&\n11299,&\n11311,&\n11317,&\n11321,&\n11329,&\n11351,&\n11353,&\n11369,&\n11383,&\n11393,&\n11399,&\n11411,&\n11423,&\n11437,&\n11443,&\n11447,&\n11467,&\n11471,&\n11483,&\n11489,&\n11491,&\n11497,&\n11503,&\n11519,&\n11527,&\n11549,&\n11551,&\n11579,&\n11587,&\n11593,&\n11597,&\n11617,&\n11621,&\n11633,&\n11657,&\n11677,&\n11681,&\n11689,&\n11699,&\n11701,&\n11717,&\n11719,&\n11731,&\n11743,&\n11777,&\n11779,&\n11783,&\n11789,&\n11801,&\n11807,&\n11813,&\n11821,&\n11827,&\n11831,&\n11833,&\n11839,&\n11863,&\n11867,&\n11887,&\n11897,&\n11903,&\n11909,&\n11923,&\n11927,&\n11933,&\n11939,&\n11941,&\n11953,&\n11959,&\n11969,&\n11971,&\n11981,&\n11987,&\n12007,&\n12011,&\n12037,&\n12041,&\n12043,&\n12049,&\n12071,&\n12073,&\n12097,&\n12101,&\n12107,&\n12109,&\n12113,&\n12119,&\n12143,&\n12149,&\n12157,&\n12161,&\n12163,&\n12197,&\n12203,&\n12211,&\n12227,&\n12239,&\n12241,&\n12251,&\n12253,&\n12263,&\n12269,&\n12277,&\n12281,&\n12289,&\n12301,&\n12323,&\n12329,&\n12343,&\n12347,&\n12373,&\n12377,&\n12379,&\n12391,&\n12401,&\n12409,&\n12413,&\n12421,&\n12433,&\n12437,&\n12451,&\n12457,&\n12473,&\n12479,&\n12487,&\n12491,&\n12497,&\n12503,&\n12511,&\n12517,&\n12527,&\n12539,&\n12541,&\n12547,&\n12553,&\n12569,&\n12577,&\n12583,&\n12589,&\n12601,&\n12611,&\n12613,&\n12619,&\n12637,&\n12641,&\n12647,&\n12653,&\n12659,&\n12671,&\n12689,&\n12697,&\n12703,&\n12713,&\n12721,&\n12739,&\n12743,&\n12757,&\n12763,&\n12781,&\n12791,&\n12799,&\n12809,&\n12821,&\n12823,&\n12829,&\n12841,&\n12853,&\n12889,&\n12893,&\n12899,&\n12907,&\n12911,&\n12917,&\n12919,&\n12923,&\n12941,&\n12953,&\n12959,&\n12967,&\n12973,&\n12979,&\n12983,&\n13001,&\n13003,&\n13007,&\n13009,&\n13033,&\n13037,&\n13043,&\n13049,&\n13063,&\n13093,&\n13099,&\n13103,&\n13109,&\n13121,&\n13127,&\n13147,&\n13151,&\n13159,&\n13163,&\n13171,&\n13177,&\n13183,&\n13187,&\n13217,&\n13219,&\n13229,&\n13241,&\n13249,&\n13259,&\n13267,&\n13291,&\n13297,&\n13309,&\n13313,&\n13327,&\n13331,&\n13337,&\n13339,&\n13367,&\n13381,&\n13397,&\n13399,&\n13411,&\n13417,&\n13421,&\n13441,&\n13451,&\n13457,&\n13463,&\n13469,&\n13477,&\n13487,&\n13499,&\n13513,&\n13523,&\n13537,&\n13553,&\n13567,&\n13577,&\n13591,&\n13597,&\n13613,&\n13619,&\n13627,&\n13633,&\n13649,&\n13669,&\n13679,&\n13681,&\n13687,&\n13691,&\n13693,&\n13697,&\n13709,&\n13711,&\n13721,&\n13723,&\n13729,&\n13751,&\n13757,&\n13759,&\n13763,&\n13781,&\n13789,&\n13799,&\n13807,&\n13829,&\n13831,&\n13841,&\n13859,&\n13873,&\n13877,&\n13879,&\n13883,&\n13901,&\n13903,&\n13907,&\n13913,&\n13921,&\n13931,&\n13933,&\n13963,&\n13967,&\n13997,&\n13999,&\n14009,&\n14011,&\n14029,&\n14033,&\n14051,&\n14057,&\n14071,&\n14081,&\n14083,&\n14087,&\n14107,&\n14143,&\n14149,&\n14153,&\n14159,&\n14173,&\n14177,&\n14197,&\n14207,&\n14221,&\n14243,&\n14249,&\n14251,&\n14281,&\n14293,&\n14303,&\n14321,&\n14323,&\n14327,&\n14341,&\n14347,&\n14369,&\n14387,&\n14389,&\n14401,&\n14407,&\n14411,&\n14419,&\n14423,&\n14431,&\n14437,&\n14447,&\n14449,&\n14461,&\n14479,&\n14489,&\n14503,&\n14519,&\n14533,&\n14537,&\n14543,&\n14549,&\n14551,&\n14557,&\n14561,&\n14563,&\n14591,&\n14593,&\n14621,&\n14627,&\n14629,&\n14633,&\n14639,&\n14653,&\n14657,&\n14669,&\n14683,&\n14699,&\n14713,&\n14717,&\n14723,&\n14731,&\n14737,&\n14741,&\n14747,&\n14753,&\n14759,&\n14767,&\n14771,&\n14779,&\n14783,&\n14797,&\n14813,&\n14821,&\n14827,&\n14831,&\n14843,&\n14851,&\n14867,&\n14869,&\n14879,&\n14887,&\n14891,&\n14897,&\n14923,&\n14929,&\n14939,&\n14947,&\n14951,&\n14957,&\n14969,&\n14983,&\n15013,&\n15017,&\n15031,&\n15053,&\n15061,&\n15073,&\n15077,&\n15083,&\n15091,&\n15101,&\n15107,&\n15121,&\n15131,&\n15137,&\n15139,&\n15149,&\n15161,&\n15173,&\n15187,&\n15193,&\n15199,&\n15217,&\n15227,&\n15233,&\n15241,&\n15259,&\n15263,&\n15269,&\n15271,&\n15277,&\n15287,&\n15289,&\n15299,&\n15307,&\n15313,&\n15319,&\n15329,&\n15331,&\n15349,&\n15359,&\n15361,&\n15373,&\n15377,&\n15383,&\n15391,&\n15401,&\n15413,&\n15427,&\n15439,&\n15443,&\n15451,&\n15461,&\n15467,&\n15473,&\n15493,&\n15497,&\n15511,&\n15527,&\n15541,&\n15551,&\n15559,&\n15569,&\n15581,&\n15583,&\n15601,&\n15607,&\n15619,&\n15629,&\n15641,&\n15643,&\n15647,&\n15649,&\n15661,&\n15667,&\n15671,&\n15679,&\n15683,&\n15727,&\n15731,&\n15733,&\n15737,&\n15739,&\n15749,&\n15761,&\n15767,&\n15773,&\n15787,&\n15791,&\n15797,&\n15803,&\n15809,&\n15817,&\n15823,&\n15859,&\n15877,&\n15881,&\n15887,&\n15889,&\n15901,&\n15907,&\n15913,&\n15919,&\n15923,&\n15937,&\n15959,&\n15971,&\n15973,&\n15991,&\n16001,&\n16007,&\n16033,&\n16057,&\n16061,&\n16063,&\n16067,&\n16069,&\n16073,&\n16087,&\n16091,&\n16097,&\n16103,&\n16111,&\n16127,&\n16139,&\n16141,&\n16183,&\n16187,&\n16189,&\n16193,&\n16217,&\n16223,&\n16229,&\n16231,&\n16249,&\n16253,&\n16267,&\n16273,&\n16301,&\n16319,&\n16333,&\n16339,&\n16349,&\n16361,&\n16363,&\n16369,&\n16381,&\n16411,&\n16417,&\n16421,&\n16427,&\n16433,&\n16447,&\n16451,&\n16453,&\n16477,&\n16481,&\n16487,&\n16493,&\n16519,&\n16529,&\n16547,&\n16553,&\n16561,&\n16567,&\n16573,&\n16603,&\n16607,&\n16619,&\n16631,&\n16633,&\n16649,&\n16651,&\n16657,&\n16661,&\n16673,&\n16691,&\n16693,&\n16699,&\n16703,&\n16729,&\n16741,&\n16747,&\n16759,&\n16763,&\n16787,&\n16811,&\n16823,&\n16829,&\n16831,&\n16843,&\n16871,&\n16879,&\n16883,&\n16889,&\n16901,&\n16903,&\n16921,&\n16927,&\n16931,&\n16937,&\n16943,&\n16963,&\n16979,&\n16981,&\n16987,&\n16993,&\n17011,&\n17021,&\n17027,&\n17029,&\n17033,&\n17041,&\n17047,&\n17053,&\n17077,&\n17093,&\n17099,&\n17107,&\n17117,&\n17123,&\n17137,&\n17159,&\n17167,&\n17183,&\n17189,&\n17191,&\n17203,&\n17207,&\n17209,&\n17231,&\n17239,&\n17257,&\n17291,&\n17293,&\n17299,&\n17317,&\n17321,&\n17327,&\n17333,&\n17341,&\n17351,&\n17359,&\n17377,&\n17383,&\n17387,&\n17389,&\n17393,&\n17401,&\n17417,&\n17419,&\n17431,&\n17443,&\n17449,&\n17467,&\n17471,&\n17477,&\n17483,&\n17489,&\n17491,&\n17497,&\n17509,&\n17519,&\n17539,&\n17551,&\n17569,&\n17573,&\n17579,&\n17581,&\n17597,&\n17599,&\n17609,&\n17623,&\n17627,&\n17657,&\n17659,&\n17669,&\n17681,&\n17683,&\n17707,&\n17713,&\n17729,&\n17737,&\n17747,&\n17749,&\n17761,&\n17783,&\n17789,&\n17791,&\n17807,&\n17827,&\n17837,&\n17839,&\n17851,&\n17863,&\n17881,&\n17891,&\n17903,&\n17909,&\n17911,&\n17921,&\n17923,&\n17929,&\n17939,&\n17957,&\n17959,&\n17971,&\n17977,&\n17981,&\n17987,&\n17989,&\n18013,&\n18041,&\n18043,&\n18047,&\n18049,&\n18059,&\n18061,&\n18077,&\n18089,&\n18097,&\n18119,&\n18121,&\n18127,&\n18131,&\n18133,&\n18143,&\n18149,&\n18169,&\n18181,&\n18191,&\n18199,&\n18211,&\n18217,&\n18223,&\n18229,&\n18233,&\n18251,&\n18253,&\n18257,&\n18269,&\n18287,&\n18289,&\n18301,&\n18307,&\n18311,&\n18313,&\n18329,&\n18341,&\n18353,&\n18367,&\n18371,&\n18379,&\n18397,&\n18401,&\n18413,&\n18427,&\n18433,&\n18439,&\n18443,&\n18451,&\n18457,&\n18461,&\n18481,&\n18493,&\n18503,&\n18517,&\n18521,&\n18523,&\n18539,&\n18541,&\n18553,&\n18583,&\n18587,&\n18593,&\n18617,&\n18637,&\n18661,&\n18671,&\n18679,&\n18691,&\n18701,&\n18713,&\n18719,&\n18731,&\n18743,&\n18749,&\n18757,&\n18773,&\n18787,&\n18793,&\n18797,&\n18803,&\n18839,&\n18859,&\n18869,&\n18899,&\n18911,&\n18913,&\n18917,&\n18919,&\n18947,&\n18959,&\n18973,&\n18979,&\n19001,&\n19009,&\n19013,&\n19031,&\n19037,&\n19051,&\n19069,&\n19073,&\n19079,&\n19081,&\n19087,&\n19121,&\n19139,&\n19141,&\n19157,&\n19163,&\n19181,&\n19183,&\n19207,&\n19211,&\n19213,&\n19219,&\n19231,&\n19237,&\n19249,&\n19259,&\n19267,&\n19273,&\n19289,&\n19301,&\n19309,&\n19319,&\n19333,&\n19373,&\n19379,&\n19381,&\n19387,&\n19391,&\n19403,&\n19417,&\n19421,&\n19423,&\n19427,&\n19429,&\n19433,&\n19441,&\n19447,&\n19457,&\n19463,&\n19469,&\n19471,&\n19477,&\n19483,&\n19489,&\n19501,&\n19507,&\n19531,&\n19541,&\n19543,&\n19553,&\n19559,&\n19571,&\n19577,&\n19583,&\n19597,&\n19603,&\n19609,&\n19661,&\n19681,&\n19687,&\n19697,&\n19699,&\n19709,&\n19717,&\n19727,&\n19739,&\n19751,&\n19753,&\n19759,&\n19763,&\n19777,&\n19793,&\n19801,&\n19813,&\n19819,&\n19841,&\n19843,&\n19853,&\n19861,&\n19867,&\n19889,&\n19891,&\n19913,&\n19919,&\n19927,&\n19937,&\n19949,&\n19961,&\n19963,&\n19973,&\n19979,&\n19991,&\n19993,&\n19997,&\n20011,&\n20021,&\n20023,&\n20029,&\n20047,&\n20051,&\n20063,&\n20071,&\n20089,&\n20101,&\n20107,&\n20113,&\n20117,&\n20123,&\n20129,&\n20143,&\n20147,&\n20149,&\n20161,&\n20173,&\n20177,&\n20183,&\n20201,&\n20219,&\n20231,&\n20233,&\n20249,&\n20261,&\n20269,&\n20287,&\n20297,&\n20323,&\n20327,&\n20333,&\n20341,&\n20347,&\n20353,&\n20357,&\n20359,&\n20369,&\n20389,&\n20393,&\n20399,&\n20407,&\n20411,&\n20431,&\n20441,&\n20443,&\n20477,&\n20479,&\n20483,&\n20507,&\n20509,&\n20521,&\n20533,&\n20543,&\n20549,&\n20551,&\n20563,&\n20593,&\n20599,&\n20611,&\n20627,&\n20639,&\n20641,&\n20663,&\n20681,&\n20693,&\n20707,&\n20717,&\n20719,&\n20731,&\n20743,&\n20747,&\n20749,&\n20753,&\n20759,&\n20771,&\n20773,&\n20789,&\n20807,&\n20809,&\n20849,&\n20857,&\n20873,&\n20879,&\n20887,&\n20897,&\n20899,&\n20903,&\n20921,&\n20929,&\n20939,&\n20947,&\n20959,&\n20963,&\n20981,&\n20983,&\n21001,&\n21011,&\n21013,&\n21017,&\n21019,&\n21023,&\n21031,&\n21059,&\n21061,&\n21067,&\n21089,&\n21101,&\n21107,&\n21121,&\n21139,&\n21143,&\n21149,&\n21157,&\n21163,&\n21169,&\n21179,&\n21187,&\n21191,&\n21193,&\n21211,&\n21221,&\n21227,&\n21247,&\n21269,&\n21277,&\n21283,&\n21313,&\n21317,&\n21319,&\n21323,&\n21341,&\n21347,&\n21377,&\n21379,&\n21383,&\n21391,&\n21397,&\n21401,&\n21407,&\n21419,&\n21433,&\n21467,&\n21481,&\n21487,&\n21491,&\n21493,&\n21499,&\n21503,&\n21517,&\n21521,&\n21523,&\n21529,&\n21557,&\n21559,&\n21563,&\n21569,&\n21577,&\n21587,&\n21589,&\n21599,&\n21601,&\n21611,&\n21613,&\n21617,&\n21647,&\n21649,&\n21661,&\n21673,&\n21683,&\n21701,&\n21713,&\n21727,&\n21737,&\n21739,&\n21751,&\n21757,&\n21767,&\n21773,&\n21787,&\n21799,&\n21803,&\n21817,&\n21821,&\n21839,&\n21841,&\n21851,&\n21859,&\n21863,&\n21871,&\n21881,&\n21893,&\n21911,&\n21929,&\n21937,&\n21943,&\n21961,&\n21977,&\n21991,&\n21997,&\n22003,&\n22013,&\n22027,&\n22031,&\n22037,&\n22039,&\n22051,&\n22063,&\n22067,&\n22073,&\n22079,&\n22091,&\n22093,&\n22109,&\n22111,&\n22123,&\n22129,&\n22133,&\n22147,&\n22153,&\n22157,&\n22159,&\n22171,&\n22189,&\n22193,&\n22229,&\n22247,&\n22259,&\n22271,&\n22273,&\n22277,&\n22279,&\n22283,&\n22291,&\n22303,&\n22307,&\n22343,&\n22349,&\n22367,&\n22369,&\n22381,&\n22391,&\n22397,&\n22409,&\n22433,&\n22441,&\n22447,&\n22453,&\n22469,&\n22481,&\n22483,&\n22501,&\n22511,&\n22531,&\n22541,&\n22543,&\n22549,&\n22567,&\n22571,&\n22573,&\n22613,&\n22619,&\n22621,&\n22637,&\n22639,&\n22643,&\n22651,&\n22669,&\n22679,&\n22691,&\n22697,&\n22699,&\n22709,&\n22717,&\n22721,&\n22727,&\n22739,&\n22741,&\n22751,&\n22769,&\n22777,&\n22783,&\n22787,&\n22807,&\n22811,&\n22817,&\n22853,&\n22859,&\n22861,&\n22871,&\n22877,&\n22901,&\n22907,&\n22921,&\n22937,&\n22943,&\n22961,&\n22963,&\n22973,&\n22993,&\n23003,&\n23011,&\n23017,&\n23021,&\n23027,&\n23029,&\n23039,&\n23041,&\n23053,&\n23057,&\n23059,&\n23063,&\n23071,&\n23081,&\n23087,&\n23099,&\n23117,&\n23131,&\n23143,&\n23159,&\n23167,&\n23173,&\n23189,&\n23197,&\n23201,&\n23203,&\n23209,&\n23227,&\n23251,&\n23269,&\n23279,&\n23291,&\n23293,&\n23297,&\n23311,&\n23321,&\n23327,&\n23333,&\n23339,&\n23357,&\n23369,&\n23371,&\n23399,&\n23417,&\n23431,&\n23447,&\n23459,&\n23473,&\n23497,&\n23509,&\n23531,&\n23537,&\n23539,&\n23549,&\n23557,&\n23561,&\n23563,&\n23567,&\n23581,&\n23593,&\n23599,&\n23603,&\n23609,&\n23623,&\n23627,&\n23629,&\n23633,&\n23663,&\n23669,&\n23671,&\n23677,&\n23687,&\n23689,&\n23719,&\n23741,&\n23743,&\n23747,&\n23753,&\n23761,&\n23767,&\n23773,&\n23789,&\n23801,&\n23813,&\n23819,&\n23827,&\n23831,&\n23833,&\n23857,&\n23869,&\n23873,&\n23879,&\n23887,&\n23893,&\n23899,&\n23909,&\n23911,&\n23917,&\n23929,&\n23957,&\n23971,&\n23977,&\n23981,&\n23993,&\n24001,&\n24007,&\n24019,&\n24023,&\n24029,&\n24043,&\n24049,&\n24061,&\n24071,&\n24077,&\n24083,&\n24091,&\n24097,&\n24103,&\n24107,&\n24109,&\n24113,&\n24121,&\n24133,&\n24137,&\n24151,&\n24169,&\n24179,&\n24181,&\n24197,&\n24203,&\n24223,&\n24229,&\n24239,&\n24247,&\n24251,&\n24281,&\n24317,&\n24329,&\n24337,&\n24359,&\n24371,&\n24373,&\n24379,&\n24391,&\n24407,&\n24413,&\n24419,&\n24421,&\n24439,&\n24443,&\n24469,&\n24473,&\n24481,&\n24499,&\n24509,&\n24517,&\n24527,&\n24533,&\n24547,&\n24551,&\n24571,&\n24593,&\n24611,&\n24623,&\n24631,&\n24659,&\n24671,&\n24677,&\n24683,&\n24691,&\n24697,&\n24709,&\n24733,&\n24749,&\n24763,&\n24767,&\n24781,&\n24793,&\n24799,&\n24809,&\n24821,&\n24841,&\n24847,&\n24851,&\n24859,&\n24877,&\n24889,&\n24907,&\n24917,&\n24919,&\n24923,&\n24943,&\n24953,&\n24967,&\n24971,&\n24977,&\n24979,&\n24989,&\n25013,&\n25031,&\n25033,&\n25037,&\n25057,&\n25073,&\n25087,&\n25097,&\n25111,&\n25117,&\n25121,&\n25127,&\n25147,&\n25153,&\n25163,&\n25169,&\n25171,&\n25183,&\n25189,&\n25219,&\n25229,&\n25237,&\n25243,&\n25247,&\n25253,&\n25261,&\n25301,&\n25303,&\n25307,&\n25309,&\n25321,&\n25339,&\n25343,&\n25349,&\n25357,&\n25367,&\n25373,&\n25391,&\n25409,&\n25411,&\n25423,&\n25439,&\n25447,&\n25453,&\n25457,&\n25463,&\n25469,&\n25471,&\n25523,&\n25537,&\n25541,&\n25561,&\n25577,&\n25579,&\n25583,&\n25589,&\n25601,&\n25603,&\n25609,&\n25621,&\n25633,&\n25639,&\n25643,&\n25657,&\n25667,&\n25673,&\n25679,&\n25693,&\n25703,&\n25717,&\n25733,&\n25741,&\n25747,&\n25759,&\n25763,&\n25771,&\n25793,&\n25799,&\n25801,&\n25819,&\n25841,&\n25847,&\n25849,&\n25867,&\n25873,&\n25889,&\n25903,&\n25913,&\n25919,&\n25931,&\n25933,&\n25939,&\n25943,&\n25951,&\n25969,&\n25981,&\n25997,&\n25999,&\n26003,&\n26017,&\n26021,&\n26029,&\n26041,&\n26053,&\n26083,&\n26099,&\n26107,&\n26111,&\n26113,&\n26119,&\n26141,&\n26153,&\n26161,&\n26171,&\n26177,&\n26183,&\n26189,&\n26203,&\n26209,&\n26227,&\n26237,&\n26249,&\n26251,&\n26261,&\n26263,&\n26267,&\n26293,&\n26297,&\n26309,&\n26317,&\n26321,&\n26339,&\n26347,&\n26357,&\n26371,&\n26387,&\n26393,&\n26399,&\n26407,&\n26417,&\n26423,&\n26431,&\n26437,&\n26449,&\n26459,&\n26479,&\n26489,&\n26497,&\n26501,&\n26513,&\n26539,&\n26557,&\n26561,&\n26573,&\n26591,&\n26597,&\n26627,&\n26633,&\n26641,&\n26647,&\n26669,&\n26681,&\n26683,&\n26687,&\n26693,&\n26699,&\n26701,&\n26711,&\n26713,&\n26717,&\n26723,&\n26729,&\n26731,&\n26737,&\n26759,&\n26777,&\n26783,&\n26801,&\n26813,&\n26821,&\n26833,&\n26839,&\n26849,&\n26861,&\n26863,&\n26879,&\n26881,&\n26891,&\n26893,&\n26903,&\n26921,&\n26927,&\n26947,&\n26951,&\n26953,&\n26959,&\n26981,&\n26987,&\n26993,&\n27011,&\n27017,&\n27031,&\n27043,&\n27059,&\n27061,&\n27067,&\n27073,&\n27077,&\n27091,&\n27103,&\n27107,&\n27109,&\n27127,&\n27143,&\n27179,&\n27191,&\n27197,&\n27211,&\n27239,&\n27241,&\n27253,&\n27259,&\n27271,&\n27277,&\n27281,&\n27283,&\n27299,&\n27329,&\n27337,&\n27361,&\n27367,&\n27397,&\n27407,&\n27409,&\n27427,&\n27431,&\n27437,&\n27449,&\n27457,&\n27479,&\n27481,&\n27487,&\n27509,&\n27527,&\n27529,&\n27539,&\n27541,&\n27551,&\n27581,&\n27583,&\n27611,&\n27617,&\n27631,&\n27647,&\n27653,&\n27673,&\n27689,&\n27691,&\n27697,&\n27701,&\n27733,&\n27737,&\n27739,&\n27743,&\n27749,&\n27751,&\n27763,&\n27767,&\n27773,&\n27779,&\n27791,&\n27793,&\n27799,&\n27803,&\n27809,&\n27817,&\n27823,&\n27827,&\n27847,&\n27851,&\n27883,&\n27893,&\n27901,&\n27917,&\n27919,&\n27941,&\n27943,&\n27947,&\n27953,&\n27961,&\n27967,&\n27983,&\n27997,&\n28001,&\n28019,&\n28027,&\n28031,&\n28051,&\n28057,&\n28069,&\n28081,&\n28087,&\n28097,&\n28099,&\n28109,&\n28111,&\n28123,&\n28151,&\n28163,&\n28181,&\n28183,&\n28201,&\n28211,&\n28219,&\n28229,&\n28277,&\n28279,&\n28283,&\n28289,&\n28297,&\n28307,&\n28309,&\n28319,&\n28349,&\n28351,&\n28387,&\n28393,&\n28403,&\n28409,&\n28411,&\n28429,&\n28433,&\n28439,&\n28447,&\n28463,&\n28477,&\n28493,&\n28499,&\n28513,&\n28517,&\n28537,&\n28541,&\n28547,&\n28549,&\n28559,&\n28571,&\n28573,&\n28579,&\n28591,&\n28597,&\n28603,&\n28607,&\n28619,&\n28621,&\n28627,&\n28631,&\n28643,&\n28649,&\n28657,&\n28661,&\n28663,&\n28669,&\n28687,&\n28697,&\n28703,&\n28711,&\n28723,&\n28729,&\n28751,&\n28753,&\n28759,&\n28771,&\n28789,&\n28793,&\n28807,&\n28813,&\n28817,&\n28837,&\n28843,&\n28859,&\n28867,&\n28871,&\n28879,&\n28901,&\n28909,&\n28921,&\n28927,&\n28933,&\n28949,&\n28961,&\n28979,&\n29009,&\n29017,&\n29021,&\n29023,&\n29027,&\n29033,&\n29059,&\n29063,&\n29077,&\n29101,&\n29123,&\n29129,&\n29131,&\n29137,&\n29147,&\n29153,&\n29167,&\n29173,&\n29179,&\n29191,&\n29201,&\n29207,&\n29209,&\n29221,&\n29231,&\n29243,&\n29251,&\n29269,&\n29287,&\n29297,&\n29303,&\n29311,&\n29327,&\n29333,&\n29339,&\n29347,&\n29363,&\n29383,&\n29387,&\n29389,&\n29399,&\n29401,&\n29411,&\n29423,&\n29429,&\n29437,&\n29443,&\n29453,&\n29473,&\n29483,&\n29501,&\n29527,&\n29531,&\n29537,&\n29567,&\n29569,&\n29573,&\n29581,&\n29587,&\n29599,&\n29611,&\n29629,&\n29633,&\n29641,&\n29663,&\n29669,&\n29671,&\n29683,&\n29717,&\n29723,&\n29741,&\n29753,&\n29759,&\n29761,&\n29789,&\n29803,&\n29819,&\n29833,&\n29837,&\n29851,&\n29863,&\n29867,&\n29873,&\n29879,&\n29881,&\n29917,&\n29921,&\n29927,&\n29947,&\n29959,&\n29983,&\n29989,&\n30011,&\n30013,&\n30029,&\n30047,&\n30059,&\n30071,&\n30089,&\n30091,&\n30097,&\n30103,&\n30109,&\n30113,&\n30119,&\n30133,&\n30137,&\n30139,&\n30161,&\n30169,&\n30181,&\n30187,&\n30197,&\n30203,&\n30211,&\n30223,&\n30241,&\n30253,&\n30259,&\n30269,&\n30271,&\n30293,&\n30307,&\n30313,&\n30319,&\n30323,&\n30341,&\n30347,&\n30367,&\n30389,&\n30391,&\n30403,&\n30427,&\n30431,&\n30449,&\n30467,&\n30469,&\n30491,&\n30493,&\n30497,&\n30509,&\n30517,&\n30529,&\n30539,&\n30553,&\n30557,&\n30559,&\n30577,&\n30593,&\n30631,&\n30637,&\n30643,&\n30649,&\n30661,&\n30671,&\n30677,&\n30689,&\n30697,&\n30703,&\n30707,&\n30713,&\n30727,&\n30757,&\n30763,&\n30773,&\n30781,&\n30803,&\n30809,&\n30817,&\n30829,&\n30839,&\n30841,&\n30851,&\n30853,&\n30859,&\n30869,&\n30871,&\n30881,&\n30893,&\n30911,&\n30931,&\n30937,&\n30941,&\n30949,&\n30971,&\n30977,&\n30983,&\n31013,&\n31019,&\n31033,&\n31039,&\n31051,&\n31063,&\n31069,&\n31079,&\n31081,&\n31091,&\n31121,&\n31123,&\n31139,&\n31147,&\n31151,&\n31153,&\n31159,&\n31177,&\n31181,&\n31183,&\n31189,&\n31193,&\n31219,&\n31223,&\n31231,&\n31237,&\n31247,&\n31249,&\n31253,&\n31259,&\n31267,&\n31271,&\n31277,&\n31307,&\n31319,&\n31321,&\n31327,&\n31333,&\n31337,&\n31357,&\n31379,&\n31387,&\n31391,&\n31393,&\n31397,&\n31469,&\n31477,&\n31481,&\n31489,&\n31511,&\n31513,&\n31517,&\n31531,&\n31541,&\n31543,&\n31547,&\n31567,&\n31573,&\n31583,&\n31601,&\n31607,&\n31627,&\n31643,&\n31649,&\n31657,&\n31663,&\n31667,&\n31687,&\n31699,&\n31721,&\n31723,&\n31727,&\n31729,&\n31741,&\n31751,&\n31769,&\n31771,&\n31793,&\n31799,&\n31817,&\n31847,&\n31849,&\n31859,&\n31873,&\n31883,&\n31891,&\n31907,&\n31957,&\n31963,&\n31973,&\n31981,&\n31991,&\n32003,&\n32009,&\n32027,&\n32029,&\n32051,&\n32057,&\n32059,&\n32063,&\n32069,&\n32077,&\n32083,&\n32089,&\n32099,&\n32117,&\n32119,&\n32141,&\n32143,&\n32159,&\n32173,&\n32183,&\n32189,&\n32191,&\n32203,&\n32213,&\n32233,&\n32237,&\n32251,&\n32257,&\n32261,&\n32297,&\n32299,&\n32303,&\n32309,&\n32321,&\n32323,&\n32327,&\n32341,&\n32353,&\n32359,&\n32363,&\n32369,&\n32371,&\n32377,&\n32381,&\n32401,&\n32411,&\n32413,&\n32423,&\n32429,&\n32441,&\n32443,&\n32467,&\n32479,&\n32491,&\n32497,&\n32503,&\n32507,&\n32531,&\n32533,&\n32537,&\n32561,&\n32563,&\n32569,&\n32573,&\n32579,&\n32587,&\n32603,&\n32609,&\n32611,&\n32621,&\n32633,&\n32647,&\n32653,&\n32687,&\n32693,&\n32707,&\n32713,&\n32717,&\n32719,&\n32749,&\n32771,&\n32779,&\n32783,&\n32789,&\n32797,&\n32801,&\n32803,&\n32831,&\n32833,&\n32839,&\n32843,&\n32869,&\n32887,&\n32909,&\n32911,&\n32917,&\n32933,&\n32939,&\n32941,&\n32957,&\n32969,&\n32971,&\n32983,&\n32987,&\n32993,&\n32999,&\n33013,&\n33023,&\n33029,&\n33037,&\n33049,&\n33053,&\n33071,&\n33073,&\n33083,&\n33091,&\n33107,&\n33113,&\n33119,&\n33149,&\n33151,&\n33161,&\n33179,&\n33181,&\n33191,&\n33199,&\n33203,&\n33211,&\n33223,&\n33247,&\n33287,&\n33289,&\n33301,&\n33311,&\n33317,&\n33329,&\n33331,&\n33343,&\n33347,&\n33349,&\n33353,&\n33359,&\n33377,&\n33391,&\n33403,&\n33409,&\n33413,&\n33427,&\n33457,&\n33461,&\n33469,&\n33479,&\n33487,&\n33493,&\n33503,&\n33521,&\n33529,&\n33533,&\n33547,&\n33563,&\n33569,&\n33577,&\n33581,&\n33587,&\n33589,&\n33599,&\n33601,&\n33613,&\n33617,&\n33619,&\n33623,&\n33629,&\n33637,&\n33641,&\n33647,&\n33679,&\n33703,&\n33713,&\n33721,&\n33739,&\n33749,&\n33751,&\n33757,&\n33767,&\n33769,&\n33773,&\n33791,&\n33797,&\n33809,&\n33811,&\n33827,&\n33829,&\n33851,&\n33857,&\n33863,&\n33871,&\n33889,&\n33893,&\n33911,&\n33923,&\n33931,&\n33937,&\n33941,&\n33961,&\n33967,&\n33997,&\n34019,&\n34031,&\n34033,&\n34039,&\n34057,&\n34061,&\n34123,&\n34127,&\n34129,&\n34141,&\n34147,&\n34157,&\n34159,&\n34171,&\n34183,&\n34211,&\n34213,&\n34217,&\n34231,&\n34253,&\n34259,&\n34261,&\n34267,&\n34273,&\n34283,&\n34297,&\n34301,&\n34303,&\n34313,&\n34319,&\n34327,&\n34337,&\n34351,&\n34361,&\n34367,&\n34369,&\n34381,&\n34403,&\n34421,&\n34429,&\n34439,&\n34457,&\n34469,&\n34471,&\n34483,&\n34487,&\n34499,&\n34501,&\n34511,&\n34513,&\n34519,&\n34537,&\n34543,&\n34549,&\n34583,&\n34589,&\n34591,&\n34603,&\n34607,&\n34613,&\n34631,&\n34649,&\n34651,&\n34667,&\n34673,&\n34679,&\n34687,&\n34693,&\n34703,&\n34721,&\n34729,&\n34739,&\n34747,&\n34757,&\n34759,&\n34763,&\n34781,&\n34807,&\n34819,&\n34841,&\n34843,&\n34847,&\n34849,&\n34871,&\n34877,&\n34883,&\n34897,&\n34913,&\n34919,&\n34939,&\n34949,&\n34961,&\n34963,&\n34981,&\n35023,&\n35027,&\n35051,&\n35053,&\n35059,&\n35069,&\n35081,&\n35083,&\n35089,&\n35099,&\n35107,&\n35111,&\n35117,&\n35129,&\n35141,&\n35149,&\n35153,&\n35159,&\n35171,&\n35201,&\n35221,&\n35227,&\n35251,&\n35257,&\n35267,&\n35279,&\n35281,&\n35291,&\n35311,&\n35317,&\n35323,&\n35327,&\n35339,&\n35353,&\n35363,&\n35381,&\n35393,&\n35401,&\n35407,&\n35419,&\n35423,&\n35437,&\n35447,&\n35449,&\n35461,&\n35491,&\n35507,&\n35509,&\n35521,&\n35527,&\n35531,&\n35533,&\n35537,&\n35543,&\n35569,&\n35573,&\n35591,&\n35593,&\n35597,&\n35603,&\n35617,&\n35671,&\n35677,&\n35729,&\n35731,&\n35747,&\n35753,&\n35759,&\n35771,&\n35797,&\n35801,&\n35803,&\n35809,&\n35831,&\n35837,&\n35839,&\n35851,&\n35863,&\n35869,&\n35879,&\n35897,&\n35899,&\n35911,&\n35923,&\n35933,&\n35951,&\n35963,&\n35969,&\n35977,&\n35983,&\n35993,&\n35999,&\n36007,&\n36011,&\n36013,&\n36017,&\n36037,&\n36061,&\n36067,&\n36073,&\n36083,&\n36097,&\n36107,&\n36109,&\n36131,&\n36137,&\n36151,&\n36161,&\n36187,&\n36191,&\n36209,&\n36217,&\n36229,&\n36241,&\n36251,&\n36263,&\n36269,&\n36277,&\n36293,&\n36299,&\n36307,&\n36313,&\n36319,&\n36341,&\n36343,&\n36353,&\n36373,&\n36383,&\n36389,&\n36433,&\n36451,&\n36457,&\n36467,&\n36469,&\n36473,&\n36479,&\n36493,&\n36497,&\n36523,&\n36527,&\n36529,&\n36541,&\n36551,&\n36559,&\n36563,&\n36571,&\n36583,&\n36587,&\n36599,&\n36607,&\n36629,&\n36637,&\n36643,&\n36653,&\n36671,&\n36677,&\n36683,&\n36691,&\n36697,&\n36709,&\n36713,&\n36721,&\n36739,&\n36749,&\n36761,&\n36767,&\n36779,&\n36781,&\n36787,&\n36791,&\n36793,&\n36809,&\n36821,&\n36833,&\n36847,&\n36857,&\n36871,&\n36877,&\n36887,&\n36899,&\n36901,&\n36913,&\n36919,&\n36923,&\n36929,&\n36931,&\n36943,&\n36947,&\n36973,&\n36979,&\n36997,&\n37003,&\n37013,&\n37019,&\n37021,&\n37039,&\n37049,&\n37057,&\n37061,&\n37087,&\n37097,&\n37117,&\n37123,&\n37139,&\n37159,&\n37171,&\n37181,&\n37189,&\n37199,&\n37201,&\n37217,&\n37223,&\n37243,&\n37253,&\n37273,&\n37277,&\n37307,&\n37309,&\n37313,&\n37321,&\n37337,&\n37339,&\n37357,&\n37361,&\n37363,&\n37369,&\n37379,&\n37397,&\n37409,&\n37423,&\n37441,&\n37447,&\n37463,&\n37483,&\n37489,&\n37493,&\n37501,&\n37507,&\n37511,&\n37517,&\n37529,&\n37537,&\n37547,&\n37549,&\n37561,&\n37567,&\n37571,&\n37573,&\n37579,&\n37589,&\n37591,&\n37607,&\n37619,&\n37633,&\n37643,&\n37649,&\n37657,&\n37663,&\n37691,&\n37693,&\n37699,&\n37717,&\n37747,&\n37781,&\n37783,&\n37799,&\n37811,&\n37813,&\n37831,&\n37847,&\n37853,&\n37861,&\n37871,&\n37879,&\n37889,&\n37897,&\n37907,&\n37951,&\n37957,&\n37963,&\n37967,&\n37987,&\n37991,&\n37993,&\n37997,&\n38011,&\n38039,&\n38047,&\n38053,&\n38069,&\n38083,&\n38113,&\n38119,&\n38149,&\n38153,&\n38167,&\n38177,&\n38183,&\n38189,&\n38197,&\n38201,&\n38219,&\n38231,&\n38237,&\n38239,&\n38261,&\n38273,&\n38281,&\n38287,&\n38299,&\n38303,&\n38317,&\n38321,&\n38327,&\n38329,&\n38333,&\n38351,&\n38371,&\n38377,&\n38393,&\n38431,&\n38447,&\n38449,&\n38453,&\n38459,&\n38461,&\n38501,&\n38543,&\n38557,&\n38561,&\n38567,&\n38569,&\n38593,&\n38603,&\n38609,&\n38611,&\n38629,&\n38639,&\n38651,&\n38653,&\n38669,&\n38671,&\n38677,&\n38693,&\n38699,&\n38707,&\n38711,&\n38713,&\n38723,&\n38729,&\n38737,&\n38747,&\n38749,&\n38767,&\n38783,&\n38791,&\n38803,&\n38821,&\n38833,&\n38839,&\n38851,&\n38861,&\n38867,&\n38873,&\n38891,&\n38903,&\n38917,&\n38921,&\n38923,&\n38933,&\n38953,&\n38959,&\n38971,&\n38977,&\n38993,&\n39019,&\n39023,&\n39041,&\n39043,&\n39047,&\n39079,&\n39089,&\n39097,&\n39103,&\n39107,&\n39113,&\n39119,&\n39133,&\n39139,&\n39157,&\n39161,&\n39163,&\n39181,&\n39191,&\n39199,&\n39209,&\n39217,&\n39227,&\n39229,&\n39233,&\n39239,&\n39241,&\n39251,&\n39293,&\n39301,&\n39313,&\n39317,&\n39323,&\n39341,&\n39343,&\n39359,&\n39367,&\n39371,&\n39373,&\n39383,&\n39397,&\n39409,&\n39419,&\n39439,&\n39443,&\n39451,&\n39461,&\n39499,&\n39503,&\n39509,&\n39511,&\n39521,&\n39541,&\n39551,&\n39563,&\n39569,&\n39581,&\n39607,&\n39619,&\n39623,&\n39631,&\n39659,&\n39667,&\n39671,&\n39679,&\n39703,&\n39709,&\n39719,&\n39727,&\n39733,&\n39749,&\n39761,&\n39769,&\n39779,&\n39791,&\n39799,&\n39821,&\n39827,&\n39829,&\n39839,&\n39841,&\n39847,&\n39857,&\n39863,&\n39869,&\n39877,&\n39883,&\n39887,&\n39901,&\n39929,&\n39937,&\n39953,&\n39971,&\n39979,&\n39983,&\n39989,&\n40009,&\n40013,&\n40031,&\n40037,&\n40039,&\n40063,&\n40087,&\n40093,&\n40099,&\n40111,&\n40123,&\n40127,&\n40129,&\n40151,&\n40153,&\n40163,&\n40169,&\n40177,&\n40189,&\n40193,&\n40213,&\n40231,&\n40237,&\n40241,&\n40253,&\n40277,&\n40283,&\n40289,&\n40343,&\n40351,&\n40357,&\n40361,&\n40387,&\n40423,&\n40427,&\n40429,&\n40433,&\n40459,&\n40471,&\n40483,&\n40487,&\n40493,&\n40499,&\n40507,&\n40519,&\n40529,&\n40531,&\n40543,&\n40559,&\n40577,&\n40583,&\n40591,&\n40597,&\n40609,&\n40627,&\n40637,&\n40639,&\n40693,&\n40697,&\n40699,&\n40709,&\n40739,&\n40751,&\n40759,&\n40763,&\n40771,&\n40787,&\n40801,&\n40813,&\n40819,&\n40823,&\n40829,&\n40841,&\n40847,&\n40849,&\n40853,&\n40867,&\n40879,&\n40883,&\n40897,&\n40903,&\n40927,&\n40933,&\n40939,&\n40949,&\n40961,&\n40973,&\n40993,&\n41011,&\n41017,&\n41023,&\n41039,&\n41047,&\n41051,&\n41057,&\n41077,&\n41081,&\n41113,&\n41117,&\n41131,&\n41141,&\n41143,&\n41149,&\n41161,&\n41177,&\n41179,&\n41183,&\n41189,&\n41201,&\n41203,&\n41213,&\n41221,&\n41227,&\n41231,&\n41233,&\n41243,&\n41257,&\n41263,&\n41269,&\n41281,&\n41299,&\n41333,&\n41341,&\n41351,&\n41357,&\n41381,&\n41387,&\n41389,&\n41399,&\n41411,&\n41413,&\n41443,&\n41453,&\n41467,&\n41479,&\n41491,&\n41507,&\n41513,&\n41519,&\n41521,&\n41539,&\n41543,&\n41549,&\n41579,&\n41593,&\n41597,&\n41603,&\n41609,&\n41611,&\n41617,&\n41621,&\n41627,&\n41641,&\n41647,&\n41651,&\n41659,&\n41669,&\n41681,&\n41687,&\n41719,&\n41729,&\n41737,&\n41759,&\n41761,&\n41771,&\n41777,&\n41801,&\n41809,&\n41813,&\n41843,&\n41849,&\n41851,&\n41863,&\n41879,&\n41887,&\n41893,&\n41897,&\n41903,&\n41911,&\n41927,&\n41941,&\n41947,&\n41953,&\n41957,&\n41959,&\n41969,&\n41981,&\n41983,&\n41999,&\n42013,&\n42017,&\n42019,&\n42023,&\n42043,&\n42061,&\n42071,&\n42073,&\n42083,&\n42089,&\n42101,&\n42131,&\n42139,&\n42157,&\n42169,&\n42179,&\n42181,&\n42187,&\n42193,&\n42197,&\n42209,&\n42221,&\n42223,&\n42227,&\n42239,&\n42257,&\n42281,&\n42283,&\n42293,&\n42299,&\n42307,&\n42323,&\n42331,&\n42337,&\n42349,&\n42359,&\n42373,&\n42379,&\n42391,&\n42397,&\n42403,&\n42407,&\n42409,&\n42433,&\n42437,&\n42443,&\n42451,&\n42457,&\n42461,&\n42463,&\n42467,&\n42473,&\n42487,&\n42491,&\n42499,&\n42509,&\n42533,&\n42557,&\n42569,&\n42571,&\n42577,&\n42589,&\n42611,&\n42641,&\n42643,&\n42649,&\n42667,&\n42677,&\n42683,&\n42689,&\n42697,&\n42701,&\n42703,&\n42709,&\n42719,&\n42727,&\n42737,&\n42743,&\n42751,&\n42767,&\n42773,&\n42787,&\n42793,&\n42797,&\n42821,&\n42829,&\n42839,&\n42841,&\n42853,&\n42859,&\n42863,&\n42899,&\n42901,&\n42923,&\n42929,&\n42937,&\n42943,&\n42953,&\n42961,&\n42967,&\n42979,&\n42989,&\n43003,&\n43013,&\n43019,&\n43037,&\n43049,&\n43051,&\n43063,&\n43067,&\n43093,&\n43103,&\n43117,&\n43133,&\n43151,&\n43159,&\n43177,&\n43189,&\n43201,&\n43207,&\n43223,&\n43237,&\n43261,&\n43271,&\n43283,&\n43291,&\n43313,&\n43319,&\n43321,&\n43331,&\n43391,&\n43397,&\n43399,&\n43403,&\n43411,&\n43427,&\n43441,&\n43451,&\n43457,&\n43481,&\n43487,&\n43499,&\n43517,&\n43541,&\n43543,&\n43573,&\n43577,&\n43579,&\n43591,&\n43597,&\n43607,&\n43609,&\n43613,&\n43627,&\n43633,&\n43649,&\n43651,&\n43661,&\n43669,&\n43691,&\n43711,&\n43717,&\n43721,&\n43753,&\n43759,&\n43777,&\n43781,&\n43783,&\n43787,&\n43789,&\n43793,&\n43801,&\n43853,&\n43867,&\n43889,&\n43891,&\n43913,&\n43933,&\n43943,&\n43951,&\n43961,&\n43963,&\n43969,&\n43973,&\n43987,&\n43991,&\n43997,&\n44017,&\n44021,&\n44027,&\n44029,&\n44041,&\n44053,&\n44059,&\n44071,&\n44087,&\n44089,&\n44101,&\n44111,&\n44119,&\n44123,&\n44129,&\n44131,&\n44159,&\n44171,&\n44179,&\n44189,&\n44201,&\n44203,&\n44207,&\n44221,&\n44249,&\n44257,&\n44263,&\n44267,&\n44269,&\n44273,&\n44279,&\n44281,&\n44293,&\n44351,&\n44357,&\n44371,&\n44381,&\n44383,&\n44389,&\n44417,&\n44449,&\n44453,&\n44483,&\n44491,&\n44497,&\n44501,&\n44507,&\n44519,&\n44531,&\n44533,&\n44537,&\n44543,&\n44549,&\n44563,&\n44579,&\n44587,&\n44617,&\n44621,&\n44623,&\n44633,&\n44641,&\n44647,&\n44651,&\n44657,&\n44683,&\n44687,&\n44699,&\n44701,&\n44711,&\n44729,&\n44741,&\n44753,&\n44771,&\n44773,&\n44777,&\n44789,&\n44797,&\n44809,&\n44819,&\n44839,&\n44843,&\n44851,&\n44867,&\n44879,&\n44887,&\n44893,&\n44909,&\n44917,&\n44927,&\n44939,&\n44953,&\n44959,&\n44963,&\n44971,&\n44983,&\n44987,&\n45007,&\n45013,&\n45053,&\n45061,&\n45077,&\n45083,&\n45119,&\n45121,&\n45127,&\n45131,&\n45137,&\n45139,&\n45161,&\n45179,&\n45181,&\n45191,&\n45197,&\n45233,&\n45247,&\n45259,&\n45263,&\n45281,&\n45289,&\n45293,&\n45307,&\n45317,&\n45319,&\n45329,&\n45337,&\n45341,&\n45343,&\n45361,&\n45377,&\n45389,&\n45403,&\n45413,&\n45427,&\n45433,&\n45439,&\n45481,&\n45491,&\n45497,&\n45503,&\n45523,&\n45533,&\n45541,&\n45553,&\n45557,&\n45569,&\n45587,&\n45589,&\n45599,&\n45613,&\n45631,&\n45641,&\n45659,&\n45667,&\n45673,&\n45677,&\n45691,&\n45697,&\n45707,&\n45737,&\n45751,&\n45757,&\n45763,&\n45767,&\n45779,&\n45817,&\n45821,&\n45823,&\n45827,&\n45833,&\n45841,&\n45853,&\n45863,&\n45869,&\n45887,&\n45893,&\n45943,&\n45949,&\n45953,&\n45959,&\n45971,&\n45979,&\n45989,&\n46021,&\n46027,&\n46049,&\n46051,&\n46061,&\n46073,&\n46091,&\n46093,&\n46099,&\n46103,&\n46133,&\n46141,&\n46147,&\n46153,&\n46171,&\n46181,&\n46183,&\n46187,&\n46199,&\n46219,&\n46229,&\n46237,&\n46261,&\n46271,&\n46273,&\n46279,&\n46301,&\n46307,&\n46309,&\n46327,&\n46337,&\n46349,&\n46351,&\n46381,&\n46399,&\n46411,&\n46439,&\n46441,&\n46447,&\n46451,&\n46457,&\n46471,&\n46477,&\n46489,&\n46499,&\n46507,&\n46511,&\n46523,&\n46549,&\n46559,&\n46567,&\n46573,&\n46589,&\n46591,&\n46601,&\n46619,&\n46633,&\n46639,&\n46643,&\n46649,&\n46663,&\n46679,&\n46681,&\n46687,&\n46691,&\n46703,&\n46723,&\n46727,&\n46747,&\n46751,&\n46757,&\n46769,&\n46771,&\n46807,&\n46811,&\n46817,&\n46819,&\n46829,&\n46831,&\n46853,&\n46861,&\n46867,&\n46877,&\n46889,&\n46901,&\n46919,&\n46933,&\n46957,&\n46993,&\n46997,&\n47017,&\n47041,&\n47051,&\n47057,&\n47059,&\n47087,&\n47093,&\n47111,&\n47119,&\n47123,&\n47129,&\n47137,&\n47143,&\n47147,&\n47149,&\n47161,&\n47189,&\n47207,&\n47221,&\n47237,&\n47251,&\n47269,&\n47279,&\n47287,&\n47293,&\n47297,&\n47303,&\n47309,&\n47317,&\n47339,&\n47351,&\n47353,&\n47363,&\n47381,&\n47387,&\n47389,&\n47407,&\n47417,&\n47419,&\n47431,&\n47441,&\n47459,&\n47491,&\n47497,&\n47501,&\n47507,&\n47513,&\n47521,&\n47527,&\n47533,&\n47543,&\n47563,&\n47569,&\n47581,&\n47591,&\n47599,&\n47609,&\n47623,&\n47629,&\n47639,&\n47653,&\n47657,&\n47659,&\n47681,&\n47699,&\n47701,&\n47711,&\n47713,&\n47717,&\n47737,&\n47741,&\n47743,&\n47777,&\n47779,&\n47791,&\n47797,&\n47807,&\n47809,&\n47819,&\n47837,&\n47843,&\n47857,&\n47869,&\n47881,&\n47903,&\n47911,&\n47917,&\n47933,&\n47939,&\n47947,&\n47951,&\n47963,&\n47969,&\n47977,&\n47981,&\n48017,&\n48023,&\n48029,&\n48049,&\n48073,&\n48079,&\n48091,&\n48109,&\n48119,&\n48121,&\n48131,&\n48157,&\n48163,&\n48179,&\n48187,&\n48193,&\n48197,&\n48221,&\n48239,&\n48247,&\n48259,&\n48271,&\n48281,&\n48299,&\n48311,&\n48313,&\n48337,&\n48341,&\n48353,&\n48371,&\n48383,&\n48397,&\n48407,&\n48409,&\n48413,&\n48437,&\n48449,&\n48463,&\n48473,&\n48479,&\n48481,&\n48487,&\n48491,&\n48497,&\n48523,&\n48527,&\n48533,&\n48539,&\n48541,&\n48563,&\n48571,&\n48589,&\n48593,&\n48611,&\n48619,&\n48623,&\n48647,&\n48649,&\n48661,&\n48673,&\n48677,&\n48679,&\n48731,&\n48733,&\n48751,&\n48757,&\n48761,&\n48767,&\n48779,&\n48781,&\n48787,&\n48799,&\n48809,&\n48817,&\n48821,&\n48823,&\n48847,&\n48857,&\n48859,&\n48869,&\n48871,&\n48883,&\n48889,&\n48907,&\n48947,&\n48953,&\n48973,&\n48989,&\n48991,&\n49003,&\n49009,&\n49019,&\n49031,&\n49033,&\n49037,&\n49043,&\n49057,&\n49069,&\n49081,&\n49103,&\n49109,&\n49117,&\n49121,&\n49123,&\n49139,&\n49157,&\n49169,&\n49171,&\n49177,&\n49193,&\n49199,&\n49201,&\n49207,&\n49211,&\n49223,&\n49253,&\n49261,&\n49277,&\n49279,&\n49297,&\n49307,&\n49331,&\n49333,&\n49339,&\n49363,&\n49367,&\n49369,&\n49391,&\n49393,&\n49409,&\n49411,&\n49417,&\n49429,&\n49433,&\n49451,&\n49459,&\n49463,&\n49477,&\n49481,&\n49499,&\n49523,&\n49529,&\n49531,&\n49537,&\n49547,&\n49549,&\n49559,&\n49597,&\n49603,&\n49613,&\n49627,&\n49633,&\n49639,&\n49663,&\n49667,&\n49669,&\n49681,&\n49697,&\n49711,&\n49727,&\n49739,&\n49741,&\n49747,&\n49757,&\n49783,&\n49787,&\n49789,&\n49801,&\n49807,&\n49811,&\n49823,&\n49831,&\n49843,&\n49853,&\n49871,&\n49877,&\n49891,&\n49919,&\n49921,&\n49927,&\n49937,&\n49939,&\n49943,&\n49957,&\n49991,&\n49993,&\n49999,&\n50021,&\n50023,&\n50033,&\n50047,&\n50051,&\n50053,&\n50069,&\n50077,&\n50087,&\n50093,&\n50101,&\n50111,&\n50119,&\n50123,&\n50129,&\n50131,&\n50147,&\n50153,&\n50159,&\n50177,&\n50207,&\n50221,&\n50227,&\n50231,&\n50261,&\n50263,&\n50273,&\n50287,&\n50291,&\n50311,&\n50321,&\n50329,&\n50333,&\n50341,&\n50359,&\n50363,&\n50377,&\n50383,&\n50387,&\n50411,&\n50417,&\n50423,&\n50441,&\n50459,&\n50461,&\n50497,&\n50503,&\n50513,&\n50527,&\n50539,&\n50543,&\n50549,&\n50551,&\n50581,&\n50587,&\n50591,&\n50593,&\n50599,&\n50627,&\n50647,&\n50651,&\n50671,&\n50683,&\n50707,&\n50723,&\n50741,&\n50753,&\n50767,&\n50773,&\n50777,&\n50789,&\n50821,&\n50833,&\n50839,&\n50849,&\n50857,&\n50867,&\n50873,&\n50891,&\n50893,&\n50909,&\n50923,&\n50929,&\n50951,&\n50957,&\n50969,&\n50971,&\n50989,&\n50993,&\n51001,&\n51031,&\n51043,&\n51047,&\n51059,&\n51061,&\n51071,&\n51109,&\n51131,&\n51133,&\n51137,&\n51151,&\n51157,&\n51169,&\n51193,&\n51197,&\n51199,&\n51203,&\n51217,&\n51229,&\n51239,&\n51241,&\n51257,&\n51263,&\n51283,&\n51287,&\n51307,&\n51329,&\n51341,&\n51343,&\n51347,&\n51349,&\n51361,&\n51383,&\n51407,&\n51413,&\n51419,&\n51421,&\n51427,&\n51431,&\n51437,&\n51439,&\n51449,&\n51461,&\n51473,&\n51479,&\n51481,&\n51487,&\n51503,&\n51511,&\n51517,&\n51521,&\n51539,&\n51551,&\n51563,&\n51577,&\n51581,&\n51593,&\n51599,&\n51607,&\n51613,&\n51631,&\n51637,&\n51647,&\n51659,&\n51673,&\n51679,&\n51683,&\n51691,&\n51713,&\n51719,&\n51721,&\n51749,&\n51767,&\n51769,&\n51787,&\n51797,&\n51803,&\n51817,&\n51827,&\n51829,&\n51839,&\n51853,&\n51859,&\n51869,&\n51871,&\n51893,&\n51899,&\n51907,&\n51913,&\n51929,&\n51941,&\n51949,&\n51971,&\n51973,&\n51977,&\n51991,&\n52009,&\n52021,&\n52027,&\n52051,&\n52057,&\n52067,&\n52069,&\n52081,&\n52103,&\n52121,&\n52127,&\n52147,&\n52153,&\n52163,&\n52177,&\n52181,&\n52183,&\n52189,&\n52201,&\n52223,&\n52237,&\n52249,&\n52253,&\n52259,&\n52267,&\n52289,&\n52291,&\n52301,&\n52313,&\n52321,&\n52361,&\n52363,&\n52369,&\n52379,&\n52387,&\n52391,&\n52433,&\n52453,&\n52457,&\n52489,&\n52501,&\n52511,&\n52517,&\n52529,&\n52541,&\n52543,&\n52553,&\n52561,&\n52567,&\n52571,&\n52579,&\n52583,&\n52609,&\n52627,&\n52631,&\n52639,&\n52667,&\n52673,&\n52691,&\n52697,&\n52709,&\n52711,&\n52721,&\n52727,&\n52733,&\n52747,&\n52757,&\n52769,&\n52783,&\n52807,&\n52813,&\n52817,&\n52837,&\n52859,&\n52861,&\n52879,&\n52883,&\n52889,&\n52901,&\n52903,&\n52919,&\n52937,&\n52951,&\n52957,&\n52963,&\n52967,&\n52973,&\n52981,&\n52999,&\n53003,&\n53017,&\n53047,&\n53051,&\n53069,&\n53077,&\n53087,&\n53089,&\n53093,&\n53101,&\n53113,&\n53117,&\n53129,&\n53147,&\n53149,&\n53161,&\n53171,&\n53173,&\n53189,&\n53197,&\n53201,&\n53231,&\n53233,&\n53239,&\n53267,&\n53269,&\n53279,&\n53281,&\n53299,&\n53309,&\n53323,&\n53327,&\n53353,&\n53359,&\n53377,&\n53381,&\n53401,&\n53407,&\n53411,&\n53419,&\n53437,&\n53441,&\n53453,&\n53479,&\n53503,&\n53507,&\n53527,&\n53549,&\n53551,&\n53569,&\n53591,&\n53593,&\n53597,&\n53609,&\n53611,&\n53617,&\n53623,&\n53629,&\n53633,&\n53639,&\n53653,&\n53657,&\n53681,&\n53693,&\n53699,&\n53717,&\n53719,&\n53731,&\n53759,&\n53773,&\n53777,&\n53783,&\n53791,&\n53813,&\n53819,&\n53831,&\n53849,&\n53857,&\n53861,&\n53881,&\n53887,&\n53891,&\n53897,&\n53899,&\n53917,&\n53923,&\n53927,&\n53939,&\n53951,&\n53959,&\n53987,&\n53993,&\n54001,&\n54011,&\n54013,&\n54037,&\n54049,&\n54059,&\n54083,&\n54091,&\n54101,&\n54121,&\n54133,&\n54139,&\n54151,&\n54163,&\n54167,&\n54181,&\n54193,&\n54217,&\n54251,&\n54269,&\n54277,&\n54287,&\n54293,&\n54311,&\n54319,&\n54323,&\n54331,&\n54347,&\n54361,&\n54367,&\n54371,&\n54377,&\n54401,&\n54403,&\n54409,&\n54413,&\n54419,&\n54421,&\n54437,&\n54443,&\n54449,&\n54469,&\n54493,&\n54497,&\n54499,&\n54503,&\n54517,&\n54521,&\n54539,&\n54541,&\n54547,&\n54559,&\n54563,&\n54577,&\n54581,&\n54583,&\n54601,&\n54617,&\n54623,&\n54629,&\n54631,&\n54647,&\n54667,&\n54673,&\n54679,&\n54709,&\n54713,&\n54721,&\n54727,&\n54751,&\n54767,&\n54773,&\n54779,&\n54787,&\n54799,&\n54829,&\n54833,&\n54851,&\n54869,&\n54877,&\n54881,&\n54907,&\n54917,&\n54919,&\n54941,&\n54949,&\n54959,&\n54973,&\n54979,&\n54983,&\n55001,&\n55009,&\n55021,&\n55049,&\n55051,&\n55057,&\n55061,&\n55073,&\n55079,&\n55103,&\n55109,&\n55117,&\n55127,&\n55147,&\n55163,&\n55171,&\n55201,&\n55207,&\n55213,&\n55217,&\n55219,&\n55229,&\n55243,&\n55249,&\n55259,&\n55291,&\n55313,&\n55331,&\n55333,&\n55337,&\n55339,&\n55343,&\n55351,&\n55373,&\n55381,&\n55399,&\n55411,&\n55439,&\n55441,&\n55457,&\n55469,&\n55487,&\n55501,&\n55511,&\n55529,&\n55541,&\n55547,&\n55579,&\n55589,&\n55603,&\n55609,&\n55619,&\n55621,&\n55631,&\n55633,&\n55639,&\n55661,&\n55663,&\n55667,&\n55673,&\n55681,&\n55691,&\n55697,&\n55711,&\n55717,&\n55721,&\n55733,&\n55763,&\n55787,&\n55793,&\n55799,&\n55807,&\n55813,&\n55817,&\n55819,&\n55823,&\n55829,&\n55837,&\n55843,&\n55849,&\n55871,&\n55889,&\n55897,&\n55901,&\n55903,&\n55921,&\n55927,&\n55931,&\n55933,&\n55949,&\n55967,&\n55987,&\n55997,&\n56003,&\n56009,&\n56039,&\n56041,&\n56053,&\n56081,&\n56087,&\n56093,&\n56099,&\n56101,&\n56113,&\n56123,&\n56131,&\n56149,&\n56167,&\n56171&\n/)\n ans = 1\n d = div(i)\n do i = 1,500\n d = div(i)\n if (mod(A,d)==0 .and. mod(B,d)==0) then\n ans = ans + 1\n end if\n end do\n\n write(*, *) ans\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 44471, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s915288628", "group_id": "codeNet:p02900", "input_text": "module ABC142\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_D\n private :: gcd\n private :: info_num\n\n ! s for this \n type info_num\n logical, public :: is_cd\n logical, public :: is_prime\n end type\n\n ! contained s and s are below\n contains\n\n pure function gcd (a, b) result (val_gcd)\n\n ! arguments for this \n integer(INT64), intent(in) :: a, b\n\n ! variables for this \n integer(INT64) :: buf_a, buf_b, buf\n\n ! return value of this \n integer(INT64) :: val_gcd\n\n buf_a = a\n buf_b = b\n\n do while (buf_b .ne. 0_INT64)\n buf = mod(buf_a, buf_b)\n buf_a = buf_b\n buf_b = buf\n end do\n\n val_gcd = buf_a\n\n return\n\n end function gcd\n\n subroutine task_D (A, B)\n\n ! arguments for this \n integer(INT64), intent(in) :: A, B\n\n ! variables for this \n integer(INT64) :: gcd_AB\n\n ! arrays for this \n type(info_num), allocatable :: list_candidates(:)\n\n ! support variables for this \n integer(INT64) :: itr_n\n integer(INT64) :: itr\n integer(INT32) :: size_target\n\n ! STEP.01\n ! calculate the greatest common divisor of A & B\n gcd_AB = gcd(A, B)\n\n ! STEP.02\n ! judge the greatest common divisor of A & B\n if (gcd_AB .eq. 1_INT64) then\n print '(I0)', 1_INT64\n return\n end if\n\n ! STEP.03\n ! allocate the array to store the given data\n allocate( list_candidates(2:gcd_AB) )\n\n ! STEP.02\n ! count up the number of the common divisors which are also prime numbers\n do itr_n = 2_INT64, gcd_AB, 1_INT64\n list_candidates(itr_n)%is_cd = (mod(A, itr_n) .eq. 0_INT64) .and. (mod(B, itr_n) .eq. 0_INT64)\n end do\n\n ! STEP.03\n ! judge whether the number is a prime number\n if (gcd_AB .ge. 2_INT64) list_candidates(2_INT64)%is_prime = .true.\n\n do itr_n = 3_INT64, gcd_AB, 1_INT64\n\n itr = 2_INT64\n list_candidates(itr_n)%is_prime = .true.\n\n do while (itr .lt. itr_n)\n\n if ( list_candidates(itr)%is_prime ) then\n if ( mod(itr_n, itr) .eq. 0_INT64 ) then\n list_candidates(itr_n)%is_prime = .false.\n exit\n else\n end if\n end if\n\n itr = itr + 1_INT64\n\n end do\n \n end do\n\n ! STEP.04\n ! count up the number of the target common divisors\n size_target = 1_INT32\n\n do itr_n = 2_INT64, gcd_AB, 1_INT64\n if ( list_candidates(itr_n)%is_cd .and. list_candidates(itr_n)%is_prime ) size_target = size_target + 1_INT32\n end do\n\n ! STEP.05\n ! output the answer of this task\n print '(I0,*(1X,I0))', size_target\n\n ! STEP.06\n ! deallocate the array to store the given data\n deallocate( list_candidates )\n\n ! STEP.END\n return\n\n end subroutine task_D\n\nend module ABC142\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC142\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! variables for this \n integer(INT64) :: A, B\n\n ! STEP.01\n ! read out the given data\n read(unit=INPUT_UNIT, fmt=*) A, B\n\n ! STEP.02\n ! calculate & output the answer of this task\n call task_D (A, B)\n\nend program main", "language": "Fortran", "metadata": {"date": 1569724288, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s915288628.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s915288628", "user_id": "u484703930"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module ABC142\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_D\n private :: gcd\n private :: info_num\n\n ! s for this \n type info_num\n logical, public :: is_cd\n logical, public :: is_prime\n end type\n\n ! contained s and s are below\n contains\n\n pure function gcd (a, b) result (val_gcd)\n\n ! arguments for this \n integer(INT64), intent(in) :: a, b\n\n ! variables for this \n integer(INT64) :: buf_a, buf_b, buf\n\n ! return value of this \n integer(INT64) :: val_gcd\n\n buf_a = a\n buf_b = b\n\n do while (buf_b .ne. 0_INT64)\n buf = mod(buf_a, buf_b)\n buf_a = buf_b\n buf_b = buf\n end do\n\n val_gcd = buf_a\n\n return\n\n end function gcd\n\n subroutine task_D (A, B)\n\n ! arguments for this \n integer(INT64), intent(in) :: A, B\n\n ! variables for this \n integer(INT64) :: gcd_AB\n\n ! arrays for this \n type(info_num), allocatable :: list_candidates(:)\n\n ! support variables for this \n integer(INT64) :: itr_n\n integer(INT64) :: itr\n integer(INT32) :: size_target\n\n ! STEP.01\n ! calculate the greatest common divisor of A & B\n gcd_AB = gcd(A, B)\n\n ! STEP.02\n ! judge the greatest common divisor of A & B\n if (gcd_AB .eq. 1_INT64) then\n print '(I0)', 1_INT64\n return\n end if\n\n ! STEP.03\n ! allocate the array to store the given data\n allocate( list_candidates(2:gcd_AB) )\n\n ! STEP.02\n ! count up the number of the common divisors which are also prime numbers\n do itr_n = 2_INT64, gcd_AB, 1_INT64\n list_candidates(itr_n)%is_cd = (mod(A, itr_n) .eq. 0_INT64) .and. (mod(B, itr_n) .eq. 0_INT64)\n end do\n\n ! STEP.03\n ! judge whether the number is a prime number\n if (gcd_AB .ge. 2_INT64) list_candidates(2_INT64)%is_prime = .true.\n\n do itr_n = 3_INT64, gcd_AB, 1_INT64\n\n itr = 2_INT64\n list_candidates(itr_n)%is_prime = .true.\n\n do while (itr .lt. itr_n)\n\n if ( list_candidates(itr)%is_prime ) then\n if ( mod(itr_n, itr) .eq. 0_INT64 ) then\n list_candidates(itr_n)%is_prime = .false.\n exit\n else\n end if\n end if\n\n itr = itr + 1_INT64\n\n end do\n \n end do\n\n ! STEP.04\n ! count up the number of the target common divisors\n size_target = 1_INT32\n\n do itr_n = 2_INT64, gcd_AB, 1_INT64\n if ( list_candidates(itr_n)%is_cd .and. list_candidates(itr_n)%is_prime ) size_target = size_target + 1_INT32\n end do\n\n ! STEP.05\n ! output the answer of this task\n print '(I0,*(1X,I0))', size_target\n\n ! STEP.06\n ! deallocate the array to store the given data\n deallocate( list_candidates )\n\n ! STEP.END\n return\n\n end subroutine task_D\n\nend module ABC142\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC142\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! variables for this \n integer(INT64) :: A, B\n\n ! STEP.01\n ! read out the given data\n read(unit=INPUT_UNIT, fmt=*) A, B\n\n ! STEP.02\n ! calculate & output the answer of this task\n call task_D (A, B)\n\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3401, "cpu_time_ms": 2108, "memory_kb": 1356288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s414404540", "group_id": "codeNet:p02900", "input_text": "integer(16) A,B\ninteger(16) g,gf,i\ninteger(16) cnt\n\nread*,A,B\ng=gcd(A,B)\n\ngf=g\ncnt=1\ndo i=2,gf\n if(mod(g,i)==0)then\n do while(mod(g,i)==0)\n g=g/i\n end do\n cnt=cnt+1\n endif\nend do\nprint\"(i0)\",g\n\ncontains\npure function gcd(a,b)\ninteger(16),intent(in)::a,b\ninteger(16) gcd\ninteger(16) s,t\ns=a\ngcd=b\n\nt=mod(s,gcd)\ndo while(t/=0)\n s=gcd\n gcd=t\n t=mod(s,gcd)\nend do\nend function gcd\nend", "language": "Fortran", "metadata": {"date": 1569721165, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02900.html", "problem_id": "p02900", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02900/input.txt", "sample_output_relpath": "derived/input_output/data/p02900/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02900/Fortran/s414404540.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s414404540", "user_id": "u598073939"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "integer(16) A,B\ninteger(16) g,gf,i\ninteger(16) cnt\n\nread*,A,B\ng=gcd(A,B)\n\ngf=g\ncnt=1\ndo i=2,gf\n if(mod(g,i)==0)then\n do while(mod(g,i)==0)\n g=g/i\n end do\n cnt=cnt+1\n endif\nend do\nprint\"(i0)\",g\n\ncontains\npure function gcd(a,b)\ninteger(16),intent(in)::a,b\ninteger(16) gcd\ninteger(16) s,t\ns=a\ngcd=b\n\nt=mod(s,gcd)\ndo while(t/=0)\n s=gcd\n gcd=t\n t=mod(s,gcd)\nend do\nend function gcd\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s783646227", "group_id": "codeNet:p02903", "input_text": "! 2019.9.21 \n! A\n! Error --> 9999\n! Correct(H /= 1) --> 8888\n! Correct(H = 1) --> 7777\n! Correct(W = 1) --> 6666\n program answer\n implicit none\n integer :: H, W, A, B !input number\n double precision :: Hd, Wd, Ad, Bd\n integer(8) :: i,j\n integer :: mod_j\n integer,allocatable,dimension(:,:) :: ans\n intrinsic dble,mod\n! read input number\n read(*,*) H, W, A, B\n! H + A > W\n allocate(ans(H,W))\n!\n ans = 0\n!\n Hd=dble(H)\n Wd=dble(W)\n Ad=dble(A)\n Bd=dble(B)\n! B > H/2\n if( Bd .gt. Hd/2.0d0) goto 9999\n! H = 1\n if( H .eq. 1) goto 7777\n! A > W/2\n if( Ad .gt. Wd/2.0d0) goto 9999\n! W = 1\n if( W .eq. 1) goto 6666\n! B = 0(H /= 1 & W /= 1)\n if( B .eq. 0) then\n if( W .eq. A) then\n goto 8888\n else\n goto 9999\n end if\n! B /= 0(H /= 1 & W /= 1)\n else\n if( Hd*Ad/Bd .eq. Wd) then\n goto 8888\n else\n goto 9999\n end if\n end if\n! Output(6666)\n6666 do j=1,B\n ans(1,j) = 1\n end do\n do j=1,H\n write(*,'(I1)') ans(1,j)\n end do\n stop\n! Output(7777)\n7777 do i=1,A\n ans(1,i) = 1\n end do\n write(*,'(1000I1)') (ans(1,j),j=1,W)\n stop\n! Output(8888)\n8888 do i=1,H\n do j=A*i,A*(i+1)-1\n mod_j = mod(j,W)\n if( mod_j == 0) mod_j = W\n ans(i,mod_j) = 1\n end do\n end do\n do i=1,H\n write(*,'(1000I1)') (ans(i,j),j=1,W)\n end do\n stop\n! Error(9999)\n9999 write(*,*) 'No'\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1569121540, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02903.html", "problem_id": "p02903", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02903/input.txt", "sample_output_relpath": "derived/input_output/data/p02903/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02903/Fortran/s783646227.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s783646227", "user_id": "u954587078"}, "prompt_components": {"gold_output": "100\n010\n001\n", "input_to_evaluate": "! 2019.9.21 \n! A\n! Error --> 9999\n! Correct(H /= 1) --> 8888\n! Correct(H = 1) --> 7777\n! Correct(W = 1) --> 6666\n program answer\n implicit none\n integer :: H, W, A, B !input number\n double precision :: Hd, Wd, Ad, Bd\n integer(8) :: i,j\n integer :: mod_j\n integer,allocatable,dimension(:,:) :: ans\n intrinsic dble,mod\n! read input number\n read(*,*) H, W, A, B\n! H + A > W\n allocate(ans(H,W))\n!\n ans = 0\n!\n Hd=dble(H)\n Wd=dble(W)\n Ad=dble(A)\n Bd=dble(B)\n! B > H/2\n if( Bd .gt. Hd/2.0d0) goto 9999\n! H = 1\n if( H .eq. 1) goto 7777\n! A > W/2\n if( Ad .gt. Wd/2.0d0) goto 9999\n! W = 1\n if( W .eq. 1) goto 6666\n! B = 0(H /= 1 & W /= 1)\n if( B .eq. 0) then\n if( W .eq. A) then\n goto 8888\n else\n goto 9999\n end if\n! B /= 0(H /= 1 & W /= 1)\n else\n if( Hd*Ad/Bd .eq. Wd) then\n goto 8888\n else\n goto 9999\n end if\n end if\n! Output(6666)\n6666 do j=1,B\n ans(1,j) = 1\n end do\n do j=1,H\n write(*,'(I1)') ans(1,j)\n end do\n stop\n! Output(7777)\n7777 do i=1,A\n ans(1,i) = 1\n end do\n write(*,'(1000I1)') (ans(1,j),j=1,W)\n stop\n! Output(8888)\n8888 do i=1,H\n do j=A*i,A*(i+1)-1\n mod_j = mod(j,W)\n if( mod_j == 0) mod_j = W\n ans(i,mod_j) = 1\n end do\n end do\n do i=1,H\n write(*,'(1000I1)') (ans(i,j),j=1,W)\n end do\n stop\n! Error(9999)\n9999 write(*,*) 'No'\n stop\n end program answer", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a square grid with H rows and W columns.\nSnuke wants to write 0 or 1 in each of the squares.\nHere, all of the following conditions have to be satisfied:\n\nFor every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)\n\nFor every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.\n\nDetermine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\n0 \\leq A\n\n2 \\times A \\leq W\n\n0 \\leq B\n\n2 \\times B \\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nIf the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.\n\nIf the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:\n\ns_{11}s_{12}\\cdots s_{1W}\ns_{21}s_{22}\\cdots s_{2W}\n\\vdots\ns_{H1}s_{H2}\\cdots s_{HW}\n\nHere s_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.\n\nIf multiple solutions exist, printing any of them will be accepted.\n\nSample Input 1\n\n3 3 1 1\n\nSample Output 1\n\n100\n010\n001\n\nEvery row contains two 0s and one 1, so the first condition is satisfied.\nAlso, every column contains two 0s and one 1, so the second condition is satisfied.\n\nSample Input 2\n\n1 5 2 0\n\nSample Output 2\n\n01010", "sample_input": "3 3 1 1\n"}, "reference_outputs": ["100\n010\n001\n"], "source_document_id": "p02903", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a square grid with H rows and W columns.\nSnuke wants to write 0 or 1 in each of the squares.\nHere, all of the following conditions have to be satisfied:\n\nFor every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)\n\nFor every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.\n\nDetermine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\n0 \\leq A\n\n2 \\times A \\leq W\n\n0 \\leq B\n\n2 \\times B \\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nIf the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.\n\nIf the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:\n\ns_{11}s_{12}\\cdots s_{1W}\ns_{21}s_{22}\\cdots s_{2W}\n\\vdots\ns_{H1}s_{H2}\\cdots s_{HW}\n\nHere s_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.\n\nIf multiple solutions exist, printing any of them will be accepted.\n\nSample Input 1\n\n3 3 1 1\n\nSample Output 1\n\n100\n010\n001\n\nEvery row contains two 0s and one 1, so the first condition is satisfied.\nAlso, every column contains two 0s and one 1, so the second condition is satisfied.\n\nSample Input 2\n\n1 5 2 0\n\nSample Output 2\n\n01010", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1582, "cpu_time_ms": 103, "memory_kb": 4096}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s542381187", "group_id": "codeNet:p02903", "input_text": "! 2019.9.21 \n! A\n! Error --> 9999\n! Correct(H /= 1) --> 8888\n! Correct(H = 1) --> 7777\n! Correct(W = 1) --> 6666\n program answer\n implicit none\n integer :: H, W, A, B !input number\n double precision :: Hd, Wd, Ad, Bd\n integer :: i,j\n integer,allocatable,dimension(:,:) :: ans\n intrinsic dble\n! read input number\n read(*,*) H, W, A, B\n! H + A > W\n if( H+A .gt. W) then\n allocate(ans(H,H+A))\n else\n allocate(ans(H,W))\n end if\n!\n ans = 0\n!\n Hd=dble(H)\n Wd=dble(W)\n Ad=dble(A)\n Bd=dble(B)\n! B > H/2\n if( Bd .gt. Hd/2.0d0) goto 9999\n! H = 1\n if( H .eq. 1) goto 7777\n! A > W/2\n if( Ad .gt. Wd/2.0d0) goto 9999\n! W = 1\n if( W .eq. 1) goto 6666\n! B = 0(H /= 1 & W /= 1)\n if( B .eq. 0) then\n if( W .eq. A) then\n goto 8888\n else\n goto 9999\n end if\n! B /= 0(H /= 1 & W /= 1)\n else\n if( Hd*Ad/Bd .eq. Wd) then\n goto 8888\n else\n goto 9999\n end if\n end if\n! Output(6666)\n6666 do j=1,B\n ans(1,j) = 1\n end do\n do j=1,H\n write(*,'(I1)') ans(1,j)\n end do\n stop\n! Output(7777)\n7777 do i=1,A\n ans(1,i) = 1\n end do\n write(*,'(1000I1)') (ans(1,j),j=1,W)\n stop\n! Output(8888)\n8888 do i=1,H\n do j=i,i-1+A\n ans(i,j) = 1\n if(j .gt. W) then\n ans(i,j-W) = ans(i,j)\n end if\n end do\n end do\n do i=1,H\n write(*,'(1000I1)') (ans(i,j),j=1,W)\n end do\n stop\n! Error(9999)\n9999 write(*,*) 'No'\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1569118280, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02903.html", "problem_id": "p02903", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02903/input.txt", "sample_output_relpath": "derived/input_output/data/p02903/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02903/Fortran/s542381187.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s542381187", "user_id": "u954587078"}, "prompt_components": {"gold_output": "100\n010\n001\n", "input_to_evaluate": "! 2019.9.21 \n! A\n! Error --> 9999\n! Correct(H /= 1) --> 8888\n! Correct(H = 1) --> 7777\n! Correct(W = 1) --> 6666\n program answer\n implicit none\n integer :: H, W, A, B !input number\n double precision :: Hd, Wd, Ad, Bd\n integer :: i,j\n integer,allocatable,dimension(:,:) :: ans\n intrinsic dble\n! read input number\n read(*,*) H, W, A, B\n! H + A > W\n if( H+A .gt. W) then\n allocate(ans(H,H+A))\n else\n allocate(ans(H,W))\n end if\n!\n ans = 0\n!\n Hd=dble(H)\n Wd=dble(W)\n Ad=dble(A)\n Bd=dble(B)\n! B > H/2\n if( Bd .gt. Hd/2.0d0) goto 9999\n! H = 1\n if( H .eq. 1) goto 7777\n! A > W/2\n if( Ad .gt. Wd/2.0d0) goto 9999\n! W = 1\n if( W .eq. 1) goto 6666\n! B = 0(H /= 1 & W /= 1)\n if( B .eq. 0) then\n if( W .eq. A) then\n goto 8888\n else\n goto 9999\n end if\n! B /= 0(H /= 1 & W /= 1)\n else\n if( Hd*Ad/Bd .eq. Wd) then\n goto 8888\n else\n goto 9999\n end if\n end if\n! Output(6666)\n6666 do j=1,B\n ans(1,j) = 1\n end do\n do j=1,H\n write(*,'(I1)') ans(1,j)\n end do\n stop\n! Output(7777)\n7777 do i=1,A\n ans(1,i) = 1\n end do\n write(*,'(1000I1)') (ans(1,j),j=1,W)\n stop\n! Output(8888)\n8888 do i=1,H\n do j=i,i-1+A\n ans(i,j) = 1\n if(j .gt. W) then\n ans(i,j-W) = ans(i,j)\n end if\n end do\n end do\n do i=1,H\n write(*,'(1000I1)') (ans(i,j),j=1,W)\n end do\n stop\n! Error(9999)\n9999 write(*,*) 'No'\n stop\n end program answer", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a square grid with H rows and W columns.\nSnuke wants to write 0 or 1 in each of the squares.\nHere, all of the following conditions have to be satisfied:\n\nFor every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)\n\nFor every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.\n\nDetermine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\n0 \\leq A\n\n2 \\times A \\leq W\n\n0 \\leq B\n\n2 \\times B \\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nIf the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.\n\nIf the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:\n\ns_{11}s_{12}\\cdots s_{1W}\ns_{21}s_{22}\\cdots s_{2W}\n\\vdots\ns_{H1}s_{H2}\\cdots s_{HW}\n\nHere s_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.\n\nIf multiple solutions exist, printing any of them will be accepted.\n\nSample Input 1\n\n3 3 1 1\n\nSample Output 1\n\n100\n010\n001\n\nEvery row contains two 0s and one 1, so the first condition is satisfied.\nAlso, every column contains two 0s and one 1, so the second condition is satisfied.\n\nSample Input 2\n\n1 5 2 0\n\nSample Output 2\n\n01010", "sample_input": "3 3 1 1\n"}, "reference_outputs": ["100\n010\n001\n"], "source_document_id": "p02903", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a square grid with H rows and W columns.\nSnuke wants to write 0 or 1 in each of the squares.\nHere, all of the following conditions have to be satisfied:\n\nFor every row, the smaller of the following is A: the number of 0s contained in the row, and the number of 1s contained in the row. (If these two numbers are equal, “the smaller” should be read as “either”.)\n\nFor every column, the smaller of the following is B: the number of 0s contained in the column, and the number of 1s contained in the column.\n\nDetermine if these conditions can be satisfied by writing 0 or 1 in each of the squares. If the answer is yes, show one way to fill the squares so that the conditions are satisfied.\n\nConstraints\n\n1 \\leq H,W \\leq 1000\n\n0 \\leq A\n\n2 \\times A \\leq W\n\n0 \\leq B\n\n2 \\times B \\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W A B\n\nOutput\n\nIf the conditions cannot be satisfied by writing 0 or 1 in each of the squares, print -1.\n\nIf the conditions can be satisfied, print one way to fill the squares so that the conditions are satisfied, in the following format:\n\ns_{11}s_{12}\\cdots s_{1W}\ns_{21}s_{22}\\cdots s_{2W}\n\\vdots\ns_{H1}s_{H2}\\cdots s_{HW}\n\nHere s_{ij} is the digit written in the square at the i-th row from the top and the j-th column from the left in the grid.\n\nIf multiple solutions exist, printing any of them will be accepted.\n\nSample Input 1\n\n3 3 1 1\n\nSample Output 1\n\n100\n010\n001\n\nEvery row contains two 0s and one 1, so the first condition is satisfied.\nAlso, every column contains two 0s and one 1, so the second condition is satisfied.\n\nSample Input 2\n\n1 5 2 0\n\nSample Output 2\n\n01010", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1640, "cpu_time_ms": 4, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s927485006", "group_id": "codeNet:p02906", "input_text": "module UnionFind\n\nimplicit none\ninteger,allocatable,dimension(:)::par\ninteger::R\ncontains\n\nrecursive function root(x) result(res)\ninteger :: x,res\nif(par(x) /= x)par(x) = root(par(x))\nres = par(x)\nend function\n\nsubroutine unite(x,y)\ninteger :: x,y\nx = root(x)\ny = root(y)\nif(x /= y)then\n par(x) = y\n R=R-1\nendif\nend subroutine\n\nfunction same(x, y) result (res)\n integer :: x, y\n logical :: res\n res = (root(x) == root(y))\nend function\n\nend module UnionFind\nmodule mod_queue\n implicit none\n\n type t_node\n private\n integer :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n\n type t_queue\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: enqueue => enqueue\n procedure :: dequeue => dequeue\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n final :: finalize\n end type t_queue\n\ncontains\n\n subroutine finalize(this)\n type(t_queue), intent(inout) :: this\n\n call clear(this)\n end\n\n function new_node(item) result(node)\n integer, intent(in) :: item\n type(t_node), pointer :: node\n\n allocate(node)\n node%item = item\n end\n\n subroutine enqueue(this,item)\n class(t_queue), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n\n function dequeue(this) result(item)\n class(t_queue), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n\n item = this%head%item\n node => this%head%next\n deallocate(this%head)\n this%head => node\n if (associated(node)) then\n node%prev => null()\n else\n this%tail => null()\n end if\n this%num = this%num-1\n end\n\n function peek(this) result(item)\n class(t_queue), intent(in) :: this\n integer :: item\n\n item = this%head%item\n end\n\n subroutine clear(this)\n class(t_queue), intent(inout) :: this\n type(t_node), pointer :: node, next\n\n if (.not.associated(this%head)) return\n node => this%head\n do while (associated(node%next))\n next => node%next\n deallocate(node)\n node => next\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n\n integer function size_of(this)\n class(t_queue), intent(in) :: this\n\n size_of = this%num\n end\n\nend module mod_queue\nprogram D\n use UnionFind\n use mod_queue\n implicit none\n integer::N,M,Q\n integer::A,B,C\n type(t_queue)::U,V\n integer::i\n read*,N,M,Q\n\n allocate(par(0:N-1))\n do i=0,N-1\n par(i)=i\n end do\n R=N\n\n do i=1,Q\n read*,A,B,C\n select case(C)\n case(0)\n call unite(A,B)\n case(1)\n call enqueue(U,A)\n call enqueue(V,B)\n end select\n end do\n if(M==N-1)then\n print\"(A)\",trim(merge(\"Yes\",\"No \",size_of(U)==0))\n stop\n endif\n\n do while(size_of(U)/=0)\n if(same(dequeue(U),dequeue(V)))then\n print\"(A)\",\"No\"\n stop\n endif\n end do\n\n if(M<=N+R*(R-3)/2)then\n print\"(A)\",\"Yes\"\n else\n print\"(A)\",\"No\"\n endif\nend program D", "language": "Fortran", "metadata": {"date": 1593996871, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02906.html", "problem_id": "p02906", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02906/input.txt", "sample_output_relpath": "derived/input_output/data/p02906/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02906/Fortran/s927485006.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s927485006", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module UnionFind\n\nimplicit none\ninteger,allocatable,dimension(:)::par\ninteger::R\ncontains\n\nrecursive function root(x) result(res)\ninteger :: x,res\nif(par(x) /= x)par(x) = root(par(x))\nres = par(x)\nend function\n\nsubroutine unite(x,y)\ninteger :: x,y\nx = root(x)\ny = root(y)\nif(x /= y)then\n par(x) = y\n R=R-1\nendif\nend subroutine\n\nfunction same(x, y) result (res)\n integer :: x, y\n logical :: res\n res = (root(x) == root(y))\nend function\n\nend module UnionFind\nmodule mod_queue\n implicit none\n\n type t_node\n private\n integer :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n\n type t_queue\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: enqueue => enqueue\n procedure :: dequeue => dequeue\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n final :: finalize\n end type t_queue\n\ncontains\n\n subroutine finalize(this)\n type(t_queue), intent(inout) :: this\n\n call clear(this)\n end\n\n function new_node(item) result(node)\n integer, intent(in) :: item\n type(t_node), pointer :: node\n\n allocate(node)\n node%item = item\n end\n\n subroutine enqueue(this,item)\n class(t_queue), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n\n function dequeue(this) result(item)\n class(t_queue), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n\n item = this%head%item\n node => this%head%next\n deallocate(this%head)\n this%head => node\n if (associated(node)) then\n node%prev => null()\n else\n this%tail => null()\n end if\n this%num = this%num-1\n end\n\n function peek(this) result(item)\n class(t_queue), intent(in) :: this\n integer :: item\n\n item = this%head%item\n end\n\n subroutine clear(this)\n class(t_queue), intent(inout) :: this\n type(t_node), pointer :: node, next\n\n if (.not.associated(this%head)) return\n node => this%head\n do while (associated(node%next))\n next => node%next\n deallocate(node)\n node => next\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n\n integer function size_of(this)\n class(t_queue), intent(in) :: this\n\n size_of = this%num\n end\n\nend module mod_queue\nprogram D\n use UnionFind\n use mod_queue\n implicit none\n integer::N,M,Q\n integer::A,B,C\n type(t_queue)::U,V\n integer::i\n read*,N,M,Q\n\n allocate(par(0:N-1))\n do i=0,N-1\n par(i)=i\n end do\n R=N\n\n do i=1,Q\n read*,A,B,C\n select case(C)\n case(0)\n call unite(A,B)\n case(1)\n call enqueue(U,A)\n call enqueue(V,B)\n end select\n end do\n if(M==N-1)then\n print\"(A)\",trim(merge(\"Yes\",\"No \",size_of(U)==0))\n stop\n endif\n\n do while(size_of(U)/=0)\n if(same(dequeue(U),dequeue(V)))then\n print\"(A)\",\"No\"\n stop\n endif\n end do\n\n if(M<=N+R*(R-3)/2)then\n print\"(A)\",\"Yes\"\n else\n print\"(A)\",\"No\"\n endif\nend program D", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges.\nThis graph was connected and contained no parallel edges or self-loops.\n\nOne day, Snuke broke this graph.\nFortunately, he remembered Q clues about the graph.\nThe i-th clue (0 \\leq i \\leq Q-1) is represented as integers A_i,B_i,C_i and means the following:\n\nIf C_i=0: there was exactly one simple path (a path that never visits the same vertex twice) from Vertex A_i to B_i.\n\nIf C_i=1: there were two or more simple paths from Vertex A_i to B_i.\n\nSnuke is not sure if his memory is correct, and worried whether there is a graph that matches these Q clues.\nDetermine if there exists a graph that matches Snuke's memory.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq N \\times (N-1)/2\n\n1 \\leq Q \\leq 10^5\n\n0 \\leq A_i,B_i \\leq N-1\n\nA_i \\neq B_i\n\n0 \\leq C_i \\leq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\nA_0 B_0 C_0\nA_1 B_1 C_1\n\\vdots\nA_{Q-1} B_{Q-1} C_{Q-1}\n\nOutput\n\nIf there exists a graph that matches Snuke's memory, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 5 3\n0 1 0\n1 2 1\n2 3 0\n\nSample Output 1\n\nYes\n\nFor example, consider a graph with edges (0,1),(1,2),(1,4),(2,3),(2,4). This graph matches the clues.\n\nSample Input 2\n\n4 4 3\n0 1 0\n1 2 1\n2 3 0\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 9 9\n7 6 0\n4 5 1\n9 7 0\n2 9 0\n2 3 0\n4 1 0\n8 0 0\n9 1 0\n3 0 0\n\nSample Output 3\n\nNo", "sample_input": "5 5 3\n0 1 0\n1 2 1\n2 3 0\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02906", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges.\nThis graph was connected and contained no parallel edges or self-loops.\n\nOne day, Snuke broke this graph.\nFortunately, he remembered Q clues about the graph.\nThe i-th clue (0 \\leq i \\leq Q-1) is represented as integers A_i,B_i,C_i and means the following:\n\nIf C_i=0: there was exactly one simple path (a path that never visits the same vertex twice) from Vertex A_i to B_i.\n\nIf C_i=1: there were two or more simple paths from Vertex A_i to B_i.\n\nSnuke is not sure if his memory is correct, and worried whether there is a graph that matches these Q clues.\nDetermine if there exists a graph that matches Snuke's memory.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq N \\times (N-1)/2\n\n1 \\leq Q \\leq 10^5\n\n0 \\leq A_i,B_i \\leq N-1\n\nA_i \\neq B_i\n\n0 \\leq C_i \\leq 1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\nA_0 B_0 C_0\nA_1 B_1 C_1\n\\vdots\nA_{Q-1} B_{Q-1} C_{Q-1}\n\nOutput\n\nIf there exists a graph that matches Snuke's memory, print Yes; otherwise, print No.\n\nSample Input 1\n\n5 5 3\n0 1 0\n1 2 1\n2 3 0\n\nSample Output 1\n\nYes\n\nFor example, consider a graph with edges (0,1),(1,2),(1,4),(2,3),(2,4). This graph matches the clues.\n\nSample Input 2\n\n4 4 3\n0 1 0\n1 2 1\n2 3 0\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 9 9\n7 6 0\n4 5 1\n9 7 0\n2 9 0\n2 3 0\n4 1 0\n8 0 0\n9 1 0\n3 0 0\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3349, "cpu_time_ms": 82, "memory_kb": 9572}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s238782323", "group_id": "codeNet:p02909", "input_text": " program answer\n implicit none\n character(len=6) :: S\n read(*,*) S\n if( S == 'Sunny') write(*,'(A)') 'Cloudy'\n if( S == 'Cloudy') write(*,'(A)') 'Rainy'\n if( S == 'Rainy') write(*,'(A)') 'Sunny'\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1568595862, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02909.html", "problem_id": "p02909", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02909/input.txt", "sample_output_relpath": "derived/input_output/data/p02909/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02909/Fortran/s238782323.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s238782323", "user_id": "u954587078"}, "prompt_components": {"gold_output": "Cloudy\n", "input_to_evaluate": " program answer\n implicit none\n character(len=6) :: S\n read(*,*) S\n if( S == 'Sunny') write(*,'(A)') 'Cloudy'\n if( S == 'Cloudy') write(*,'(A)') 'Rainy'\n if( S == 'Rainy') write(*,'(A)') 'Sunny'\n stop\n end program answer", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "sample_input": "Sunny\n"}, "reference_outputs": ["Cloudy\n"], "source_document_id": "p02909", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s682133294", "group_id": "codeNet:p02910", "input_text": "program main\n implicit none\n integer:: l, i,j,k\n character(100):: s\n read*, s\n l = len_trim(s)\n\n do i = 1,l\n if ((mod(i,2) == 0).and. (s(i:i) == 'R'))then\n print*, 'No'\n stop\n else if((mod(i,2) == 1) .and. (s(i:i) == 'L'))then\n print*, 'No'\n stop\n end if\n enddo\n\n print*, 'Yes'\n\n \nend program", "language": "Fortran", "metadata": {"date": 1568596165, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02910.html", "problem_id": "p02910", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02910/input.txt", "sample_output_relpath": "derived/input_output/data/p02910/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02910/Fortran/s682133294.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s682133294", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n integer:: l, i,j,k\n character(100):: s\n read*, s\n l = len_trim(s)\n\n do i = 1,l\n if ((mod(i,2) == 0).and. (s(i:i) == 'R'))then\n print*, 'No'\n stop\n else if((mod(i,2) == 1) .and. (s(i:i) == 'L'))then\n print*, 'No'\n stop\n end if\n enddo\n\n print*, 'Yes'\n\n \nend program", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "sample_input": "RUDLUDR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02910", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s629465996", "group_id": "codeNet:p02911", "input_text": " program answer\n implicit none\n integer(8) :: N, K, Q\n integer(8),allocatable,dimension(:) :: A,num\n integer(8) :: i\n read(*,*) N,K,Q\n allocate(A(N),num(Q))\n num=0\n do i=1,N\n A(i) = 0\n end do\n do i=1,Q\n read(*,*) num(i)\n A(num(i)) = A(num(i)) + 1\n end do\n do i=1,N\n if( (Q-A(i)) < K) then\n write(*,'(A)') 'Yse'\n else\n write(*,'(A)') 'No'\n end if\n end do\n stop\n end program answer\n", "language": "Fortran", "metadata": {"date": 1568600131, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02911.html", "problem_id": "p02911", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02911/input.txt", "sample_output_relpath": "derived/input_output/data/p02911/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02911/Fortran/s629465996.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s629465996", "user_id": "u954587078"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": " program answer\n implicit none\n integer(8) :: N, K, Q\n integer(8),allocatable,dimension(:) :: A,num\n integer(8) :: i\n read(*,*) N,K,Q\n allocate(A(N),num(Q))\n num=0\n do i=1,N\n A(i) = 0\n end do\n do i=1,Q\n read(*,*) num(i)\n A(num(i)) = A(num(i)) + 1\n end do\n do i=1,N\n if( (Q-A(i)) < K) then\n write(*,'(A)') 'Yse'\n else\n write(*,'(A)') 'No'\n end if\n end do\n stop\n end program answer\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "sample_input": "6 3 4\n3\n1\n3\n2\n"}, "reference_outputs": ["No\nNo\nYes\nNo\nNo\nNo\n"], "source_document_id": "p02911", "source_text": "Score: 300 points\n\nProblem Statement\n\nTakahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.\n\nA game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.\n\nWhen a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.\n\nAt the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.\n\nIn the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.\nFor Kizahashi, write a program that determines whether each of the N players survived this game.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq A_i \\leq N\\ (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K Q\nA_1\nA_2\n.\n.\n.\nA_Q\n\nOutput\n\nPrint N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.\n\nSample Input 1\n\n6 3 4\n3\n1\n3\n2\n\nSample Output 1\n\nNo\nNo\nYes\nNo\nNo\nNo\n\nIn the beginning, the players' scores are (3, 3, 3, 3, 3, 3).\n\nPlayer 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).\n\nPlayer 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).\n\nPlayer 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).\n\nPlayer 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).\n\nPlayers 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.\n\nSample Input 2\n\n6 5 4\n3\n1\n3\n2\n\nSample Output 2\n\nYes\nYes\nYes\nYes\nYes\nYes\n\nSample Input 3\n\n10 13 15\n3\n1\n4\n1\n5\n9\n2\n6\n5\n3\n5\n8\n9\n7\n9\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 57, "memory_kb": 2176}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s378431787", "group_id": "codeNet:p02915", "input_text": "program sample\n\timplicit none\n integer ::a\n \n read(*,*) a\n write(*,*) a**3\n stop\nend program sample\n", "language": "Fortran", "metadata": {"date": 1592634645, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02915.html", "problem_id": "p02915", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02915/input.txt", "sample_output_relpath": "derived/input_output/data/p02915/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02915/Fortran/s378431787.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s378431787", "user_id": "u323210830"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program sample\n\timplicit none\n integer ::a\n \n read(*,*) a\n write(*,*) a**3\n stop\nend program sample\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 7, "memory_kb": 2796}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s646833068", "group_id": "codeNet:p02915", "input_text": "program main\ninteger::n,i,k=0\ninteger, allocatable::a(:),b(:),c(:)\nread*,n\nallocate(a(n),b(n),c(n-1))\nread*,a,b,c\ndo i=1,n\nk=k+b(a(i))\nif(a(i)==a(i-1)+1)then\nk=k+c(a(i-1))\nend if\nend do\nprint*,k\nend program main", "language": "Fortran", "metadata": {"date": 1568006622, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02915.html", "problem_id": "p02915", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02915/input.txt", "sample_output_relpath": "derived/input_output/data/p02915/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02915/Fortran/s646833068.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s646833068", "user_id": "u129978636"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program main\ninteger::n,i,k=0\ninteger, allocatable::a(:),b(:),c(:)\nread*,n\nallocate(a(n),b(n),c(n-1))\nread*,a,b,c\ndo i=1,n\nk=k+b(a(i))\nif(a(i)==a(i-1)+1)then\nk=k+c(a(i-1))\nend if\nend do\nprint*,k\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s347537522", "group_id": "codeNet:p02915", "input_text": "program main\n implicit none\n integer n\n read*, n\n\n print*, n*n*n\n\nend program", "language": "Fortran", "metadata": {"date": 1567904586, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02915.html", "problem_id": "p02915", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02915/input.txt", "sample_output_relpath": "derived/input_output/data/p02915/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02915/Fortran/s347537522.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s347537522", "user_id": "u234636620"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program main\n implicit none\n integer n\n read*, n\n\n print*, n*n*n\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s065846308", "group_id": "codeNet:p02916", "input_text": "program ya\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,ans=0\n integer(int32), allocatable:: a(:),b(:),c(:)\n\n read*, n\n allocate(a(n), b(n), c(n-1))\n read*, a(:)\n read*, b(:)\n read*, c(:)\n\n do i=1,n\n ans=ans+b(a(i))\n end do\n do i=1,n-1\n if (a(i)+1==a(i+1)) ans=ans+c(a(i))\n end do\n print'(i0)', ans\nend program ya", "language": "Fortran", "metadata": {"date": 1591664755, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02916.html", "problem_id": "p02916", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02916/input.txt", "sample_output_relpath": "derived/input_output/data/p02916/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02916/Fortran/s065846308.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065846308", "user_id": "u234636620"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program ya\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,ans=0\n integer(int32), allocatable:: a(:),b(:),c(:)\n\n read*, n\n allocate(a(n), b(n), c(n-1))\n read*, a(:)\n read*, b(:)\n read*, c(:)\n\n do i=1,n\n ans=ans+b(a(i))\n end do\n do i=1,n-1\n if (a(i)+1==a(i+1)) ans=ans+c(a(i))\n end do\n print'(i0)', ans\nend program ya", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "sample_input": "3\n3 1 2\n2 5 4\n3 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02916", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s283811158", "group_id": "codeNet:p02916", "input_text": "program test\nimplicit none\n integer,allocatable::a(:),b(:),c(:)\n integer :: N,i,ans\n read*,N\n allocate(a(N))\n allocate(b(N))\n allocate(c(N-1))\n read(*,*)(a(i),i=1,N)\n read(*,*)(b(i),i=1,N)\n read(*,*)(c(i),i=1,N-1)\n ans=0\n do i=1,N\n \tif(a(i+1)==a(i)+1)then\n \t\tans=ans+b(a(i))+c(a(i))\n else \n \tans=ans+b(a(i))\n end if\n \n end do\n print*,ans\nend program\n ", "language": "Fortran", "metadata": {"date": 1567905654, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02916.html", "problem_id": "p02916", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02916/input.txt", "sample_output_relpath": "derived/input_output/data/p02916/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02916/Fortran/s283811158.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s283811158", "user_id": "u723571904"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program test\nimplicit none\n integer,allocatable::a(:),b(:),c(:)\n integer :: N,i,ans\n read*,N\n allocate(a(N))\n allocate(b(N))\n allocate(c(N-1))\n read(*,*)(a(i),i=1,N)\n read(*,*)(b(i),i=1,N)\n read(*,*)(c(i),i=1,N-1)\n ans=0\n do i=1,N\n \tif(a(i+1)==a(i)+1)then\n \t\tans=ans+b(a(i))+c(a(i))\n else \n \tans=ans+b(a(i))\n end if\n \n end do\n print*,ans\nend program\n ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "sample_input": "3\n3 1 2\n2 5 4\n3 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02916", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 376, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s088657602", "group_id": "codeNet:p02916", "input_text": "module ABC140\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer(INT32) :: num_dishes\n integer(INT32) :: sum_satisfaction\n\n ! arrays for this \n integer(INT32), dimension(:), allocatable :: list_turn\n integer(INT32), dimension(:), allocatable :: list_satisfaction\n integer(INT32), dimension(:), allocatable :: list_satisfaction_additional\n\n ! support variables for this \n integer :: itr\n\n ! STEP.01\n ! read out the given data\n ! (the number of the dishes)\n read(unit=INPUT_UNIT, fmt=*) num_dishes\n\n ! STEP.02\n ! allocate the arrays to store the given data\n allocate( list_turn(1:num_dishes) )\n allocate( list_satisfaction(1:num_dishes) )\n allocate( list_satisfaction_additional(1:num_dishes - 1) )\n\n ! STEP.03\n ! read out the given data\n read(unit=INPUT_UNIT, fmt=*) list_turn(:)\n read(unit=INPUT_UNIT, fmt=*) list_satisfaction(:)\n read(unit=INPUT_UNIT, fmt=*) list_satisfaction_additional(:)\n\n ! STEP.04\n ! calculate the sum of the satisfaction\n sum_satisfaction = list_satisfaction( list_turn(1) )\n\n do itr = 2, num_dishes, 1\n\n sum_satisfaction = sum_satisfaction + list_satisfaction( list_turn(itr) )\n\n if ( list_turn(itr - 1) + 1_INT32 .eq. list_turn(itr) ) then\n sum_satisfaction = sum_satisfaction + list_satisfaction_additional( list_turn(itr - 1) )\n end if\n\n end do\n\n ! STEP.05\n ! output the answer of this task\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') sum_satisfaction\n\n ! STEP.06\n ! deallocate the arrays to store the given data\n deallocate( list_turn )\n deallocate( list_satisfaction )\n deallocate( list_satisfaction_additional )\n\n ! STEP.END\n return\n\n end subroutine task_B\n\nend module ABC140\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC140\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "language": "Fortran", "metadata": {"date": 1567905471, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02916.html", "problem_id": "p02916", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02916/input.txt", "sample_output_relpath": "derived/input_output/data/p02916/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02916/Fortran/s088657602.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s088657602", "user_id": "u484703930"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "module ABC140\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer(INT32) :: num_dishes\n integer(INT32) :: sum_satisfaction\n\n ! arrays for this \n integer(INT32), dimension(:), allocatable :: list_turn\n integer(INT32), dimension(:), allocatable :: list_satisfaction\n integer(INT32), dimension(:), allocatable :: list_satisfaction_additional\n\n ! support variables for this \n integer :: itr\n\n ! STEP.01\n ! read out the given data\n ! (the number of the dishes)\n read(unit=INPUT_UNIT, fmt=*) num_dishes\n\n ! STEP.02\n ! allocate the arrays to store the given data\n allocate( list_turn(1:num_dishes) )\n allocate( list_satisfaction(1:num_dishes) )\n allocate( list_satisfaction_additional(1:num_dishes - 1) )\n\n ! STEP.03\n ! read out the given data\n read(unit=INPUT_UNIT, fmt=*) list_turn(:)\n read(unit=INPUT_UNIT, fmt=*) list_satisfaction(:)\n read(unit=INPUT_UNIT, fmt=*) list_satisfaction_additional(:)\n\n ! STEP.04\n ! calculate the sum of the satisfaction\n sum_satisfaction = list_satisfaction( list_turn(1) )\n\n do itr = 2, num_dishes, 1\n\n sum_satisfaction = sum_satisfaction + list_satisfaction( list_turn(itr) )\n\n if ( list_turn(itr - 1) + 1_INT32 .eq. list_turn(itr) ) then\n sum_satisfaction = sum_satisfaction + list_satisfaction_additional( list_turn(itr - 1) )\n end if\n\n end do\n\n ! STEP.05\n ! output the answer of this task\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') sum_satisfaction\n\n ! STEP.06\n ! deallocate the arrays to store the given data\n deallocate( list_turn )\n deallocate( list_satisfaction )\n deallocate( list_satisfaction_additional )\n\n ! STEP.END\n return\n\n end subroutine task_B\n\nend module ABC140\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC140\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "sample_input": "3\n3 1 2\n2 5 4\n3 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02916", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2247, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s501659668", "group_id": "codeNet:p02917", "input_text": "program ccc\n\nimplicit none\n\ninteger :: n, i\ninteger,allocatable,dimension(:) :: a, b\n\nread(*,*) n\n\nallocate(a(n))\nallocate(b(n-1))\n\nread(*,*) b\n\na(1) = b(1)\na(n) = b(n-1)\n\ndo i = 2, n-1\na(i) = min(b(i-1),b(i))\nend do\n\nwrite(*,'(i0)') sum(a)\n\nend program", "language": "Fortran", "metadata": {"date": 1568635982, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Fortran/s501659668.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501659668", "user_id": "u039189422"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program ccc\n\nimplicit none\n\ninteger :: n, i\ninteger,allocatable,dimension(:) :: a, b\n\nread(*,*) n\n\nallocate(a(n))\nallocate(b(n-1))\n\nread(*,*) b\n\na(1) = b(1)\na(n) = b(n-1)\n\ndo i = 2, n-1\na(i) = min(b(i-1),b(i))\nend do\n\nwrite(*,'(i0)') sum(a)\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s389287057", "group_id": "codeNet:p02917", "input_text": "program maximal_value\n implicit none\n integer :: n, b(100) = 0, a(100) = 0, ans, i\n read(*,*) n\n read(*,*) b(1:n-1)\n a(1) = b(1)\n a(n) = b(n-1)\n do i = 2, n-1\n a(i) = min(b(i-1),b(i))\n end do\n write(*,'(i0)') sum(a(1:n))\nend program maximal_value", "language": "Fortran", "metadata": {"date": 1568088022, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02917.html", "problem_id": "p02917", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02917/input.txt", "sample_output_relpath": "derived/input_output/data/p02917/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02917/Fortran/s389287057.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s389287057", "user_id": "u506403362"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program maximal_value\n implicit none\n integer :: n, b(100) = 0, a(100) = 0, ans, i\n read(*,*) n\n read(*,*) b(1:n-1)\n a(1) = b(1)\n a(n) = b(n-1)\n do i = 2, n-1\n a(i) = min(b(i-1),b(i))\n end do\n write(*,'(i0)') sum(a(1:n))\nend program maximal_value", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 258, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s674370632", "group_id": "codeNet:p02918", "input_text": "program main\n implicit none\n integer:: n, k, i, j, l,r\n integer,allocatable:: cnum(:)\n character(10**5):: s\n integer:: hap\n hap = 0\n read*, n, k\n read*, s\n \n allocate(cnum(n+2))\n\n do i = 2, n+1\n if(s(i-1:i-1) == 'L')then\n cnum(i) = -1\n else\n cnum(i) = 1\n endif\n enddo\n cnum(1) = -1\n cnum(n+2) = 1\n ! print*, cnum\n do i = 2, n\n if (cnum(i) == cnum(i+1))then\n hap = hap + 1\n ! print*, i\n endif\n enddo\n\n\n cnum(n+1) = cnum(1)*(-1)\n l = 0\n r = 0\n do i=1,n+2\n if (cnum(i) == cnum(i+1))cycle\n if(cnum(i) == -1)then\n ! print*, 'l'\n l = l + 1\n endif\n\n if(cnum(i) == 1)then\n ! print*, 'r'\n r = r + 1\n endif\n enddo\n\n \n\n\n print*, hap, hap + min(k,min(l,r))*2\n \n\nend program", "language": "Fortran", "metadata": {"date": 1567911873, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02918.html", "problem_id": "p02918", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02918/input.txt", "sample_output_relpath": "derived/input_output/data/p02918/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02918/Fortran/s674370632.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s674370632", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer:: n, k, i, j, l,r\n integer,allocatable:: cnum(:)\n character(10**5):: s\n integer:: hap\n hap = 0\n read*, n, k\n read*, s\n \n allocate(cnum(n+2))\n\n do i = 2, n+1\n if(s(i-1:i-1) == 'L')then\n cnum(i) = -1\n else\n cnum(i) = 1\n endif\n enddo\n cnum(1) = -1\n cnum(n+2) = 1\n ! print*, cnum\n do i = 2, n\n if (cnum(i) == cnum(i+1))then\n hap = hap + 1\n ! print*, i\n endif\n enddo\n\n\n cnum(n+1) = cnum(1)*(-1)\n l = 0\n r = 0\n do i=1,n+2\n if (cnum(i) == cnum(i+1))cycle\n if(cnum(i) == -1)then\n ! print*, 'l'\n l = l + 1\n endif\n\n if(cnum(i) == 1)then\n ! print*, 'r'\n r = r + 1\n endif\n enddo\n\n \n\n\n print*, hap, hap + min(k,min(l,r))*2\n \n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "sample_input": "6 1\nLRLRRL\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02918", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing in a queue from west to east.\n\nGiven is a string S of length N representing the directions of the people.\nThe i-th person from the west is facing west if the i-th character of S is L, and east if that character of S is R.\n\nA person is happy if the person in front of him/her is facing the same direction.\nIf no person is standing in front of a person, however, he/she is not happy.\n\nYou can perform the following operation any number of times between 0 and K (inclusive):\n\nOperation: Choose integers l and r such that 1 \\leq l \\leq r \\leq N, and rotate by 180 degrees the part of the queue: the l-th, (l+1)-th, ..., r-th persons. That is, for each i = 0, 1, ..., r-l, the (l + i)-th person from the west will stand the (r - i)-th from the west after the operation, facing east if he/she is facing west now, and vice versa.\n\nWhat is the maximum possible number of happy people you can have?\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\n|S| = N\n\nEach character of S is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of happy people after at most K operations.\n\nSample Input 1\n\n6 1\nLRLRRL\n\nSample Output 1\n\n3\n\nIf we choose (l, r) = (2, 5), we have LLLRLL, where the 2-nd, 3-rd, and 6-th persons from the west are happy.\n\nSample Input 2\n\n13 3\nLRRLRLRRLRLLR\n\nSample Output 2\n\n9\n\nSample Input 3\n\n10 1\nLLLLLRRRRR\n\nSample Output 3\n\n9\n\nSample Input 4\n\n9 2\nRRRLRLRLL\n\nSample Output 4\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 894, "cpu_time_ms": 4, "memory_kb": 932}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s632295755", "group_id": "codeNet:p02921", "input_text": "program tenki\n implicit none\n integer :: i, cnt = 0\n character s(3), t(3)\n read *, s\n read *, t\n do i = 1, 3\n if(s(i) .eq. t(i))then\n cnt = cnt + 1\n end if\n end do\n print *, cnt\nend program", "language": "Fortran", "metadata": {"date": 1599231033, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Fortran/s632295755.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s632295755", "user_id": "u622206408"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program tenki\n implicit none\n integer :: i, cnt = 0\n character s(3), t(3)\n read *, s\n read *, t\n do i = 1, 3\n if(s(i) .eq. t(i))then\n cnt = cnt + 1\n end if\n end do\n print *, cnt\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 3140}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s544416625", "group_id": "codeNet:p02921", "input_text": "program main\n\tcharacter*3::s,t\n integer::ans=0\n integer i\n read *,s\n read *,t\n do i=1,3\n \tif(s(i:i)==t(i:i)) then\n \tans=ans+1\n end if\n end do\n print '(i0)',ans\nend program main", "language": "Fortran", "metadata": {"date": 1567371409, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Fortran/s544416625.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s544416625", "user_id": "u128527648"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n\tcharacter*3::s,t\n integer::ans=0\n integer i\n read *,s\n read *,t\n do i=1,3\n \tif(s(i:i)==t(i:i)) then\n \tans=ans+1\n end if\n end do\n print '(i0)',ans\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s348208521", "group_id": "codeNet:p02921", "input_text": "program test\nimplicit none\ncharacter*3,S,T\ninteger::i,ans\nread*,S,T\nans=0\ndo i=1,3\n if(S(i:i)==T(i:i))then\n \tans=ans+1\n else\n \tans=ans\n end if\nend do\nprint*,ans\nend program test", "language": "Fortran", "metadata": {"date": 1567364691, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02921.html", "problem_id": "p02921", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02921/input.txt", "sample_output_relpath": "derived/input_output/data/p02921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02921/Fortran/s348208521.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348208521", "user_id": "u723571904"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program test\nimplicit none\ncharacter*3,S,T\ninteger::i,ans\nread*,S,T\nans=0\ndo i=1,3\n if(S(i:i)==T(i:i))then\n \tans=ans+1\n else\n \tans=ans\n end if\nend do\nprint*,ans\nend program test", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s385704331", "group_id": "codeNet:p02922", "input_text": "program bbb\n\nimplicit none\ninteger :: i, a, b, res, sum\n\nread(*,*) a, b\n\nsum = 1\nres = 0\n\ndo i = 1, b\nsum = sum + (a-1)\nres = res + 1\nif (sum>=b) exit\nend do\n\nwrite(*,'(i0)') res\n\nend program", "language": "Fortran", "metadata": {"date": 1568615319, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Fortran/s385704331.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s385704331", "user_id": "u039189422"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program bbb\n\nimplicit none\ninteger :: i, a, b, res, sum\n\nread(*,*) a, b\n\nsum = 1\nres = 0\n\ndo i = 1, b\nsum = sum + (a-1)\nres = res + 1\nif (sum>=b) exit\nend do\n\nwrite(*,'(i0)') res\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 191, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s849046295", "group_id": "codeNet:p02922", "input_text": "program main\ninteger :: i = 0,a,b\n\nread *,a,b\n\ndo \nif (b == 1) exit\ni = i + 1 \nif ((a-1)*i + 1 >= b) exit\nend do\n\nprint *,i\n\nend program", "language": "Fortran", "metadata": {"date": 1567368844, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Fortran/s849046295.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849046295", "user_id": "u850779832"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\ninteger :: i = 0,a,b\n\nread *,a,b\n\ndo \nif (b == 1) exit\ni = i + 1 \nif ((a-1)*i + 1 >= b) exit\nend do\n\nprint *,i\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 136, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s375063640", "group_id": "codeNet:p02922", "input_text": "program main\ninteger :: ans = 0,i = 0,a,b\n\nread *,a,b\ndo \ni = i + 1 \nif ((a-1)*i + 1 >= b) exit\nend do\n\nprint *,i\nend program", "language": "Fortran", "metadata": {"date": 1567368073, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02922.html", "problem_id": "p02922", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02922/input.txt", "sample_output_relpath": "derived/input_output/data/p02922/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02922/Fortran/s375063640.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s375063640", "user_id": "u850779832"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\ninteger :: ans = 0,i = 0,a,b\n\nread *,a,b\ndo \ni = i + 1 \nif ((a-1)*i + 1 >= b) exit\nend do\n\nprint *,i\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s704093401", "group_id": "codeNet:p02923", "input_text": "program ccc\n\nimplicit none\ninteger(8) :: i, n, res1, res2\ninteger(8),allocatable,dimension(:) :: h\n\nread(*,*) n\nallocate(h(n))\nread(*,*) h\n\nres1 = 0\nres2 = 0\n\ndo i=n,2,-1\nif (h(i-1)>=h(i)) then\nres1 = res1 + 1\nres2 = max(res1,res2)\nelse\nres1 = 0\nend if\nend do\n\nwrite(*,'(i0)') res2\n\nend program", "language": "Fortran", "metadata": {"date": 1568625431, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02923.html", "problem_id": "p02923", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02923/input.txt", "sample_output_relpath": "derived/input_output/data/p02923/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02923/Fortran/s704093401.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s704093401", "user_id": "u039189422"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ccc\n\nimplicit none\ninteger(8) :: i, n, res1, res2\ninteger(8),allocatable,dimension(:) :: h\n\nread(*,*) n\nallocate(h(n))\nread(*,*) h\n\nres1 = 0\nres2 = 0\n\ndo i=n,2,-1\nif (h(i-1)>=h(i)) then\nres1 = res1 + 1\nres2 = max(res1,res2)\nelse\nres1 = 0\nend if\nend do\n\nwrite(*,'(i0)') res2\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "sample_input": "5\n10 4 8 7 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02923", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 35, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s250199288", "group_id": "codeNet:p02924", "input_text": "program main\n implicit none\n integer(8) :: N\n integer(8) :: i,num\n read *, N\n num = 0\n do n = 1, N\n num = num + (n-1)\n enddo\n print *, num\nend program", "language": "Fortran", "metadata": {"date": 1586246119, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02924.html", "problem_id": "p02924", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02924/input.txt", "sample_output_relpath": "derived/input_output/data/p02924/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02924/Fortran/s250199288.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250199288", "user_id": "u310855433"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: N\n integer(8) :: i,num\n read *, N\n num = 0\n do n = 1, N\n num = num + (n-1)\n enddo\n print *, num\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "sample_input": "2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02924", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 620, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s251779627", "group_id": "codeNet:p02924", "input_text": "program main\n implicit none\n integer :: n\n read (*, *) n\n write (*, \"(i0)\") (n * (n - 1)) / 2\nend program main\n", "language": "Fortran", "metadata": {"date": 1585083410, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02924.html", "problem_id": "p02924", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02924/input.txt", "sample_output_relpath": "derived/input_output/data/p02924/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02924/Fortran/s251779627.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s251779627", "user_id": "u388927326"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer :: n\n read (*, *) n\n write (*, \"(i0)\") (n * (n - 1)) / 2\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "sample_input": "2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02924", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s117854240", "group_id": "codeNet:p02925", "input_text": "program main\n implicit none\n integer:: N,i, no, day\n logical:: battle, flag\n integer, allocatable:: A(:,:), noind(:)\n logical, allocatable:: isbattled(:)\n no = 0\n read*, N\n allocate(A(N,N-1), noind(N), isbattled(N))\n\n do i=1,N\n read*, A(i,1:N-1)\n enddo\n noind(1:N) = 1 \n day = 1\n battle = .true.\n do while(.true.)\n ! print*, '--- ---day', day, battle\n battle = .false.\n isbattled(1:N) = .false.\n do i = 1, N\n if((noind(i)) == N) cycle\n if(isbattled(i) .eqv. .true.) cycle\n no = A(i, noind(i))\n if(isbattled(no) .eqv. .true.) cycle\n\n if(A(no, noind(no)) == i)then\n ! print*, i , 'vs' ,no\n noind(i) = noind(i) + 1\n noind(no) = noind(no) + 1\n isbattled(i) = .true.\n isbattled(no) = .true.\n battle = .true.\n endif\n enddo\n\n if (.not. battle) then\n day = day - 1\n exit\n end if\n\n day = day + 1\n enddo\n\n ! print*, noind\n flag = .true.\n do i = 1, N\n if(noind(i) /= N)then\n flag = .false.\n endif\n enddo\n\n if(flag) then\n print'(i0)',day\n else\n print*, '-1'\n endif\n\n\nend program", "language": "Fortran", "metadata": {"date": 1567371258, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/Fortran/s117854240.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117854240", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer:: N,i, no, day\n logical:: battle, flag\n integer, allocatable:: A(:,:), noind(:)\n logical, allocatable:: isbattled(:)\n no = 0\n read*, N\n allocate(A(N,N-1), noind(N), isbattled(N))\n\n do i=1,N\n read*, A(i,1:N-1)\n enddo\n noind(1:N) = 1 \n day = 1\n battle = .true.\n do while(.true.)\n ! print*, '--- ---day', day, battle\n battle = .false.\n isbattled(1:N) = .false.\n do i = 1, N\n if((noind(i)) == N) cycle\n if(isbattled(i) .eqv. .true.) cycle\n no = A(i, noind(i))\n if(isbattled(no) .eqv. .true.) cycle\n\n if(A(no, noind(no)) == i)then\n ! print*, i , 'vs' ,no\n noind(i) = noind(i) + 1\n noind(no) = noind(no) + 1\n isbattled(i) = .true.\n isbattled(no) = .true.\n battle = .true.\n endif\n enddo\n\n if (.not. battle) then\n day = day - 1\n exit\n end if\n\n day = day + 1\n enddo\n\n ! print*, noind\n flag = .true.\n do i = 1, N\n if(noind(i) /= N)then\n flag = .false.\n endif\n enddo\n\n if(flag) then\n print'(i0)',day\n else\n print*, '-1'\n endif\n\n\nend program", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1312, "cpu_time_ms": 1613, "memory_kb": 4096}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s427062334", "group_id": "codeNet:p02926", "input_text": "program engines\n implicit none\n integer :: n, i, j\n real(8) :: x(100) = 0.d0, y(100) = 0.d0, a, b, ans = 0.d0\n character(64) :: tmp\n read(*,*) n\n do i = 1, n\n read(*,*) x(i), y(i)\n end do\n do i = 1, n\n a = x(i)\n b = y(i)\n do j = 1, n\n if (j == i) cycle\n if (d(a+x(j),b+y(j)) > d(a,b)) then\n a = a+x(j)\n b = b+y(j)\n end if\n end do\n ans = max(ans,d(a,b))\n end do\n write(tmp,'(f32.16)') ans\n write(*,'(a)') trim(adjustl(tmp))\ncontains\n real(8) function d(x,y)\n real(8), intent(in) :: x, y\n d = sqrt(x*x+y*y)\n end\nend program engines", "language": "Fortran", "metadata": {"date": 1567367888, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02926.html", "problem_id": "p02926", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02926/input.txt", "sample_output_relpath": "derived/input_output/data/p02926/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02926/Fortran/s427062334.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s427062334", "user_id": "u506403362"}, "prompt_components": {"gold_output": "10.000000000000000000000000000000000000000000000000\n", "input_to_evaluate": "program engines\n implicit none\n integer :: n, i, j\n real(8) :: x(100) = 0.d0, y(100) = 0.d0, a, b, ans = 0.d0\n character(64) :: tmp\n read(*,*) n\n do i = 1, n\n read(*,*) x(i), y(i)\n end do\n do i = 1, n\n a = x(i)\n b = y(i)\n do j = 1, n\n if (j == i) cycle\n if (d(a+x(j),b+y(j)) > d(a,b)) then\n a = a+x(j)\n b = b+y(j)\n end if\n end do\n ans = max(ans,d(a,b))\n end do\n write(tmp,'(f32.16)') ans\n write(*,'(a)') trim(adjustl(tmp))\ncontains\n real(8) function d(x,y)\n real(8), intent(in) :: x, y\n d = sqrt(x*x+y*y)\n end\nend program engines", "problem_context": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "sample_input": "3\n0 10\n5 -5\n-5 -5\n"}, "reference_outputs": ["10.000000000000000000000000000000000000000000000000\n"], "source_document_id": "p02926", "source_text": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s761078106", "group_id": "codeNet:p02927", "input_text": "program kadai\n implicit none\n integer :: M,D\n integer :: dd(2)\ninteger :: num,i,j,k\n\n\nread(*,*) M,D\n\nif(D<22) then\n write(*,*) 0\n stop\nend if\n\n!write(*,*) M,D,dd(1),dd(2)\n\nnum=0\ndo i=1,M\n do j=22,D\n dd(1)=j-(j/10)*10\n dd(2)=j/10\n write(*,*) dd(2),dd(1)\n if (dd(1)>1 .and. dd(1)*dd(2)==i) then\n num=num+1\n end if\n end do\nend do\n\nwrite(*,*) num\n\n\nstop\ncontains\n\n\nend program kadai", "language": "Fortran", "metadata": {"date": 1566695756, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02927.html", "problem_id": "p02927", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02927/input.txt", "sample_output_relpath": "derived/input_output/data/p02927/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02927/Fortran/s761078106.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761078106", "user_id": "u286754585"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program kadai\n implicit none\n integer :: M,D\n integer :: dd(2)\ninteger :: num,i,j,k\n\n\nread(*,*) M,D\n\nif(D<22) then\n write(*,*) 0\n stop\nend if\n\n!write(*,*) M,D,dd(1),dd(2)\n\nnum=0\ndo i=1,M\n do j=22,D\n dd(1)=j-(j/10)*10\n dd(2)=j/10\n write(*,*) dd(2),dd(1)\n if (dd(1)>1 .and. dd(1)*dd(2)==i) then\n num=num+1\n end if\n end do\nend do\n\nwrite(*,*) num\n\n\nstop\ncontains\n\n\nend program kadai", "problem_context": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "15 40\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02927", "source_text": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 14, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s016500749", "group_id": "codeNet:p02928", "input_text": "program kadai\n implicit none\n integer :: n,k\n integer,allocatable :: a(:)\n integer :: i,j\n integer :: big\n integer(8) :: num1,num2,num\n integer :: small\n integer(8) :: kari\n\n read(*,*) n,k\n allocate(a(n))\n read(*,*) a\n\n num=0\n big=0\n small=0\n\n do i=1,n-1\n do j=i+1,n\n if (a(i)>a(j)) then\n big=big+1\n end if\n if (a(i)a(j)) then\n big=big+1\n end if\n if (a(i) B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "sample_input": "2 2\n2 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02928", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a sequence of N integers A~=~A_0,~A_1,~...,~A_{N - 1}.\n\nLet B be a sequence of K \\times N integers obtained by concatenating K copies of A. For example, if A~=~1,~3,~2 and K~=~2, B~=~1,~3,~2,~1,~3,~2.\n\nFind the inversion number of B, modulo 10^9 + 7.\n\nHere the inversion number of B is defined as the number of ordered pairs of integers (i,~j)~(0 \\leq i < j \\leq K \\times N - 1) such that B_i > B_j.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_0 A_1 ... A_{N - 1}\n\nOutput\n\nPrint the inversion number of B, modulo 10^9 + 7.\n\nSample Input 1\n\n2 2\n2 1\n\nSample Output 1\n\n3\n\nIn this case, B~=~2,~1,~2,~1. We have:\n\nB_0 > B_1\n\nB_0 > B_3\n\nB_2 > B_3\n\nThus, the inversion number of B is 3.\n\nSample Input 2\n\n3 5\n1 1 1\n\nSample Output 2\n\n0\n\nA may contain multiple occurrences of the same number.\n\nSample Input 3\n\n10 998244353\n10 9 8 7 5 6 3 4 2 1\n\nSample Output 3\n\n185297239\n\nBe sure to print the output modulo 10^9 + 7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 902, "cpu_time_ms": 7, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s462199440", "group_id": "codeNet:p02929", "input_text": "module Factwithmod\n implicit none\n integer(16),allocatable,dimension(:)::Kaijo\n contains\nsubroutine initiationFactorial(maxnum,mo)\n implicit none\n integer(16)::maxnum\n integer(16)::mo\n integer(16)::i\n\n allocate(Kaijo(0:maxnum))\n Kaijo(0)=1\n do i=1,maxnum\n Kaijo(i)=mod(Kaijo(i-1)*i,mo)\n end do\nend subroutine\n\nfunction combination(n,k,l)\nimplicit none\ninteger(16),intent(in)::n,k,l\ninteger combination\n\ncombination=mod(Kaijo(N)*inv(Kaijo(K),l)*inv(Kaijo(N-K),l),l)\n\nend function\n\nfunction inv(K,L)\ninteger(16),intent(in)::k,l\ninteger(16) l2,y\ninteger(16) inv\ninv=1\nl2=l-2\ny=k\ndo\n if(mod(l2,2)==1)inv=mod(inv*y,l)\n y=mod(y*y,l)\n l2=l2/2\n if(l2==0)exit\nend do\nend function\n\nfunction permutation(n,k,mo)\nimplicit none\n integer(16)::n,k\n integer(16)::mo,permutation\n permutation=mod(Kaijo(N)*inv(Kaijo(N-K),mo),mo)\nend function\nend module\n\nuse Factwithmod\ninteger(16) N\ncharacter(200000) S\ninteger(16) match\ninteger(16)ans,mo,i\nmo=10**9+7\nread*,N\nread*,S\ncall initiationFactorial(N,mo)\nmatch=0\nans=1\ndo i=1,2*N\n if(mod(I,2)==1)then\n if(S(I:I)==\"B\")then\n match=match+1\n else\n ans=ans*match\n match=match-1\n endif\n else\n if(S(I:I)==\"W\")then\n match=match+1\n else\n ans=mod(ans*match,mo)\n match=match-1\n endif\n end if\nend do\nif(match/=0)ans=0\nans=mod(ans*kaijo(N),mo)\nprint\"(I0)\",ans\nend", "language": "Fortran", "metadata": {"date": 1566700479, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02929.html", "problem_id": "p02929", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02929/input.txt", "sample_output_relpath": "derived/input_output/data/p02929/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02929/Fortran/s462199440.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462199440", "user_id": "u598073939"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module Factwithmod\n implicit none\n integer(16),allocatable,dimension(:)::Kaijo\n contains\nsubroutine initiationFactorial(maxnum,mo)\n implicit none\n integer(16)::maxnum\n integer(16)::mo\n integer(16)::i\n\n allocate(Kaijo(0:maxnum))\n Kaijo(0)=1\n do i=1,maxnum\n Kaijo(i)=mod(Kaijo(i-1)*i,mo)\n end do\nend subroutine\n\nfunction combination(n,k,l)\nimplicit none\ninteger(16),intent(in)::n,k,l\ninteger combination\n\ncombination=mod(Kaijo(N)*inv(Kaijo(K),l)*inv(Kaijo(N-K),l),l)\n\nend function\n\nfunction inv(K,L)\ninteger(16),intent(in)::k,l\ninteger(16) l2,y\ninteger(16) inv\ninv=1\nl2=l-2\ny=k\ndo\n if(mod(l2,2)==1)inv=mod(inv*y,l)\n y=mod(y*y,l)\n l2=l2/2\n if(l2==0)exit\nend do\nend function\n\nfunction permutation(n,k,mo)\nimplicit none\n integer(16)::n,k\n integer(16)::mo,permutation\n permutation=mod(Kaijo(N)*inv(Kaijo(N-K),mo),mo)\nend function\nend module\n\nuse Factwithmod\ninteger(16) N\ncharacter(200000) S\ninteger(16) match\ninteger(16)ans,mo,i\nmo=10**9+7\nread*,N\nread*,S\ncall initiationFactorial(N,mo)\nmatch=0\nans=1\ndo i=1,2*N\n if(mod(I,2)==1)then\n if(S(I:I)==\"B\")then\n match=match+1\n else\n ans=ans*match\n match=match-1\n endif\n else\n if(S(I:I)==\"W\")then\n match=match+1\n else\n ans=mod(ans*match,mo)\n match=match-1\n endif\n end if\nend do\nif(match/=0)ans=0\nans=mod(ans*kaijo(N),mo)\nprint\"(I0)\",ans\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.\n\nThe color of the i-th square from the left is black if the i-th character of S is B, and white if that character is W.\n\nYou will perform the following operation exactly N times: choose two distinct squares, then invert the colors of these squares and the squares between them. Here, to invert the color of a square is to make it white if it is black, and vice versa.\n\nThroughout this process, you cannot choose the same square twice or more. That is, each square has to be chosen exactly once.\n\nFind the number of ways to make all the squares white at the end of the process, modulo 10^9+7.\n\nTwo ways to make the squares white are considered different if and only if there exists i (1 \\leq i \\leq N) such that the pair of the squares chosen in the i-th operation is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = 2N\n\nEach character of S is B or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of ways to make all the squares white at the end of the process, modulo 10^9+7. If there are no such ways, print 0.\n\nSample Input 1\n\n2\nBWWB\n\nSample Output 1\n\n4\n\nThere are four ways to make all the squares white, as follows:\n\nChoose Squares 1, 3 in the first operation, and choose Squares 2, 4 in the second operation.\n\nChoose Squares 2, 4 in the first operation, and choose Squares 1, 3 in the second operation.\n\nChoose Squares 1, 4 in the first operation, and choose Squares 2, 3 in the second operation.\n\nChoose Squares 2, 3 in the first operation, and choose Squares 1, 4 in the second operation.\n\nSample Input 2\n\n4\nBWBBWWWB\n\nSample Output 2\n\n288\n\nSample Input 3\n\n5\nWWWWWWWWWW\n\nSample Output 3\n\n0", "sample_input": "2\nBWWB\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02929", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.\n\nThe color of the i-th square from the left is black if the i-th character of S is B, and white if that character is W.\n\nYou will perform the following operation exactly N times: choose two distinct squares, then invert the colors of these squares and the squares between them. Here, to invert the color of a square is to make it white if it is black, and vice versa.\n\nThroughout this process, you cannot choose the same square twice or more. That is, each square has to be chosen exactly once.\n\nFind the number of ways to make all the squares white at the end of the process, modulo 10^9+7.\n\nTwo ways to make the squares white are considered different if and only if there exists i (1 \\leq i \\leq N) such that the pair of the squares chosen in the i-th operation is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = 2N\n\nEach character of S is B or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of ways to make all the squares white at the end of the process, modulo 10^9+7. If there are no such ways, print 0.\n\nSample Input 1\n\n2\nBWWB\n\nSample Output 1\n\n4\n\nThere are four ways to make all the squares white, as follows:\n\nChoose Squares 1, 3 in the first operation, and choose Squares 2, 4 in the second operation.\n\nChoose Squares 2, 4 in the first operation, and choose Squares 1, 3 in the second operation.\n\nChoose Squares 1, 4 in the first operation, and choose Squares 2, 3 in the second operation.\n\nChoose Squares 2, 3 in the first operation, and choose Squares 1, 4 in the second operation.\n\nSample Input 2\n\n4\nBWBBWWWB\n\nSample Output 2\n\n288\n\nSample Input 3\n\n5\nWWWWWWWWWW\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1349, "cpu_time_ms": 9, "memory_kb": 2316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s110541608", "group_id": "codeNet:p02934", "input_text": "program main\n\timplicit none\n integer n,i\n double precision,allocatable::a(:)\n double precision::s=0\n read *, n\n allocate(a(n))\n read *, (a(i), i=1,n)\n do i=1,n\n \ts=s+1/(1.0*a(i))\n end do\n print '(f0.12)',1/s\nend program main", "language": "Fortran", "metadata": {"date": 1567054254, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02934.html", "problem_id": "p02934", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02934/input.txt", "sample_output_relpath": "derived/input_output/data/p02934/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02934/Fortran/s110541608.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110541608", "user_id": "u128527648"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "program main\n\timplicit none\n integer n,i\n double precision,allocatable::a(:)\n double precision::s=0\n read *, n\n allocate(a(n))\n read *, (a(i), i=1,n)\n do i=1,n\n \ts=s+1/(1.0*a(i))\n end do\n print '(f0.12)',1/s\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "sample_input": "2\n10 30\n"}, "reference_outputs": ["7.5\n"], "source_document_id": "p02934", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 254, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s908364727", "group_id": "codeNet:p02934", "input_text": "module ABC138\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n private :: calc_solution\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer :: len_data\n\n ! arrays for this \n real(REAL64), dimension(:), allocatable :: val_data\n\n ! STEP.01\n ! read out the given data (length of the given data)\n read(unit=INPUT_UNIT, fmt=*) len_data\n\n ! STEP.02\n ! allocate the array to store the given data\n allocate( val_data(1:len_data) )\n\n ! STEP.03\n ! read out given data (value)\n read(unit=INPUT_UNIT, fmt=*) val_data(:)\n\n ! STEP.04\n ! calculate & output the answer of this task\n write(unit=OUTPUT_UNIT, fmt='(ES23.15e3)', advance='yes') calc_solution( val_data(:) )\n\n ! STEP.05\n ! deallocate the array to store the given data\n deallocate( val_data )\n\n ! STEP.END\n return\n\n end subroutine task_B\n\n pure function calc_solution (array) result(solution)\n\n ! arguments for this \n real(REAL64), dimension(:), intent(in) :: array\n\n ! return value of this \n real(REAL64) :: solution\n\n ! support variables for this \n integer :: itr\n\n solution = 0.0_REAL64\n\n do itr = 1, size(array(:), dim=1), 1\n solution = solution + 1.0_REAL64 / array(itr)\n end do\n\n solution = 1.0_REAL64 / solution\n\n end function calc_solution\n\nend module ABC138\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC138\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "language": "Fortran", "metadata": {"date": 1566179013, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02934.html", "problem_id": "p02934", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02934/input.txt", "sample_output_relpath": "derived/input_output/data/p02934/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02934/Fortran/s908364727.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908364727", "user_id": "u484703930"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "module ABC138\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n private :: calc_solution\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer :: len_data\n\n ! arrays for this \n real(REAL64), dimension(:), allocatable :: val_data\n\n ! STEP.01\n ! read out the given data (length of the given data)\n read(unit=INPUT_UNIT, fmt=*) len_data\n\n ! STEP.02\n ! allocate the array to store the given data\n allocate( val_data(1:len_data) )\n\n ! STEP.03\n ! read out given data (value)\n read(unit=INPUT_UNIT, fmt=*) val_data(:)\n\n ! STEP.04\n ! calculate & output the answer of this task\n write(unit=OUTPUT_UNIT, fmt='(ES23.15e3)', advance='yes') calc_solution( val_data(:) )\n\n ! STEP.05\n ! deallocate the array to store the given data\n deallocate( val_data )\n\n ! STEP.END\n return\n\n end subroutine task_B\n\n pure function calc_solution (array) result(solution)\n\n ! arguments for this \n real(REAL64), dimension(:), intent(in) :: array\n\n ! return value of this \n real(REAL64) :: solution\n\n ! support variables for this \n integer :: itr\n\n solution = 0.0_REAL64\n\n do itr = 1, size(array(:), dim=1), 1\n solution = solution + 1.0_REAL64 / array(itr)\n end do\n\n solution = 1.0_REAL64 / solution\n\n end function calc_solution\n\nend module ABC138\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC138\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "sample_input": "2\n10 30\n"}, "reference_outputs": ["7.5\n"], "source_document_id": "p02934", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1779, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s975593125", "group_id": "codeNet:p02935", "input_text": "module UIntegerSort\n implicit none\n \n private\n \n public QuickSortInteger\n \ncontains\n \n !!\n ! ピボット値の取得\n !\n subroutine GetPivotIntegerValue(array, n, a, b, pivot_value)\n integer, intent(inout) :: array(:), pivot_value\n integer, intent(in) :: n, a, b\n \n pivot_value = array((a + b) / 2)\n end subroutine\n \n !!\n ! ピボット値に従って値を分離\n !\n subroutine GetPartitionInteger(array, n, a, b, pivot)\n integer, intent(inout) :: array(:)\n integer, intent(in) :: n, a, b\n integer, intent(out) :: pivot\n \n integer :: buffer, pivot_value\n integer :: l, r\n \n if (a == b) then\n pivot = 0\n return\n end if\n \n call GetPivotIntegerValue(array, n, a, b, pivot_value)\n \n l = a\n r = b\n \n do while(.true.)\n do while(array(l) < pivot_value)\n if (l >= b) exit\n l = l + 1\n end do\n \n do while(pivot_value < array(r))\n if (r <= a) exit\n r = r - 1\n end do\n \n if(r <= l) exit\n \n buffer = array(l)\n array(l) = array(r)\n array(r) = buffer\n \n l = l + 1\n r = r - 1\n end do\n \n pivot = r\n end subroutine\n \n !!\n ! 配列の一部分をソートする。\n !\n recursive subroutine QuickSortIntegerSubarray(array, n, a, b)\n integer, intent(inout) :: array(:)\n integer, intent(in) :: n, a, b\n \n integer :: pivot\n \n call GetPartitionInteger(array, n, a, b, pivot)\n if (pivot /= 0) then\n call QuickSortIntegerSubarray(array, n, a, pivot)\n call QuickSortIntegerSubarray(array, n, pivot + 1, b)\n end if\n end subroutine\n \n !!\n ! 配列全体をソートする\n !\n subroutine QuickSortInteger(array, n)\n integer :: array(:)\n integer :: n\n \n call QuickSortIntegerSubarray(array, n, 1, n)\n end subroutine\n \nend module\n \nprogram TestIntegerSort\n use UIntegerSort\n \n implicit none\n integer,allocatable::a(:)\n integer :: N,i\n real(8)::ans\n read*,N\n allocate(a(N))\n read(*,*)(a(i),i=1,N)\n call QuickSortInteger(a, N)\n ans=a(1)\n do i=2,N\n ans=(ans+a(i))/2\n end do\nprint*,ans\nend program", "language": "Fortran", "metadata": {"date": 1566184769, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02935.html", "problem_id": "p02935", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02935/input.txt", "sample_output_relpath": "derived/input_output/data/p02935/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02935/Fortran/s975593125.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s975593125", "user_id": "u723571904"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "module UIntegerSort\n implicit none\n \n private\n \n public QuickSortInteger\n \ncontains\n \n !!\n ! ピボット値の取得\n !\n subroutine GetPivotIntegerValue(array, n, a, b, pivot_value)\n integer, intent(inout) :: array(:), pivot_value\n integer, intent(in) :: n, a, b\n \n pivot_value = array((a + b) / 2)\n end subroutine\n \n !!\n ! ピボット値に従って値を分離\n !\n subroutine GetPartitionInteger(array, n, a, b, pivot)\n integer, intent(inout) :: array(:)\n integer, intent(in) :: n, a, b\n integer, intent(out) :: pivot\n \n integer :: buffer, pivot_value\n integer :: l, r\n \n if (a == b) then\n pivot = 0\n return\n end if\n \n call GetPivotIntegerValue(array, n, a, b, pivot_value)\n \n l = a\n r = b\n \n do while(.true.)\n do while(array(l) < pivot_value)\n if (l >= b) exit\n l = l + 1\n end do\n \n do while(pivot_value < array(r))\n if (r <= a) exit\n r = r - 1\n end do\n \n if(r <= l) exit\n \n buffer = array(l)\n array(l) = array(r)\n array(r) = buffer\n \n l = l + 1\n r = r - 1\n end do\n \n pivot = r\n end subroutine\n \n !!\n ! 配列の一部分をソートする。\n !\n recursive subroutine QuickSortIntegerSubarray(array, n, a, b)\n integer, intent(inout) :: array(:)\n integer, intent(in) :: n, a, b\n \n integer :: pivot\n \n call GetPartitionInteger(array, n, a, b, pivot)\n if (pivot /= 0) then\n call QuickSortIntegerSubarray(array, n, a, pivot)\n call QuickSortIntegerSubarray(array, n, pivot + 1, b)\n end if\n end subroutine\n \n !!\n ! 配列全体をソートする\n !\n subroutine QuickSortInteger(array, n)\n integer :: array(:)\n integer :: n\n \n call QuickSortIntegerSubarray(array, n, 1, n)\n end subroutine\n \nend module\n \nprogram TestIntegerSort\n use UIntegerSort\n \n implicit none\n integer,allocatable::a(:)\n integer :: N,i\n real(8)::ans\n read*,N\n allocate(a(N))\n read(*,*)(a(i),i=1,N)\n call QuickSortInteger(a, N)\n ans=a(1)\n do i=2,N\n ans=(ans+a(i))/2\n end do\nprint*,ans\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "sample_input": "2\n3 4\n"}, "reference_outputs": ["3.5\n"], "source_document_id": "p02935", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2081, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s015942809", "group_id": "codeNet:p02937", "input_text": "program kadai\n implicit none\n character(len=100000) :: s\n character(len=100000) :: t\n character(len=1),allocatable :: sos(:)\n character(len=1),allocatable :: sot(:)\n integer :: i,all\n integer(8) :: count\n integer :: size_s,size_t\n integer :: flag,sflag,j\n\n read(*,*) s\n read(*,*) t\n\n size_s=len_trim(s)\n size_t=len_trim(t)\n allocate(sos(size_s))\n allocate(sot(size_t))\n !write(*,*) len_trim(s),len_trim(t)\n\n do i=1,size_s\n sos(i)=s(i:i)\n end do\n do i=1,size_t\n sot(i)=t(i:i)\n end do\n\n call qsort(sos)\n call qsort(sot)\n !write(*,*) sos\n !write(*,*) sot\n j=1\n flag=0\n sflag=0\n do i=1,size_s\n if (sos(i)==sot(j)) then\n do while(sos(i)==sot(j))\n flag=flag+1\n j=j+1\n end do\n end if\n if (j==size_t+1) then\n sflag=1\n exit\n end if\n end do\n\n if (sflag==0) then\n write(*,*) -1\n stop\n end if\n\n\n all=1\n count=1\n j=1\n do\n do i=1,size_s\n if (s(i:i)==t(j:j)) then\n j=j+1\n end if\n count=count+1\n if (j==size_t+1) then\n write(*,*) count-1\n stop\n end if\n end do\n end do\n\nstop\ncontains\n\nsubroutine swap(a,b)\nimplicit none\ncharacter(len=*),intent(inout) :: a,b\ncharacter(len=10) :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x)\nimplicit none\ncharacter(len=*), intent(inout) :: x(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,first,last)\nimplicit none\ncharacter(len=*), intent(inout) :: x(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ncharacter(len=10) :: n\nn=x((first+last)/2)\ni=first\nj=last\ndo\ndo while (x(i)n)\nj=j-1\nend do\nif (i>j .or. i==j) then\nexit\nend if\ncall swap(x(i),x(j))\ni=i+1\nj=j-1\nend do\nif (firstj+1) then\nfir=j+1\ncall q2sort(x,fir,last)\nend if\nend subroutine q2sort\n\n\nend program kadai\n", "language": "Fortran", "metadata": {"date": 1566283257, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02937.html", "problem_id": "p02937", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02937/input.txt", "sample_output_relpath": "derived/input_output/data/p02937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02937/Fortran/s015942809.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s015942809", "user_id": "u286754585"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program kadai\n implicit none\n character(len=100000) :: s\n character(len=100000) :: t\n character(len=1),allocatable :: sos(:)\n character(len=1),allocatable :: sot(:)\n integer :: i,all\n integer(8) :: count\n integer :: size_s,size_t\n integer :: flag,sflag,j\n\n read(*,*) s\n read(*,*) t\n\n size_s=len_trim(s)\n size_t=len_trim(t)\n allocate(sos(size_s))\n allocate(sot(size_t))\n !write(*,*) len_trim(s),len_trim(t)\n\n do i=1,size_s\n sos(i)=s(i:i)\n end do\n do i=1,size_t\n sot(i)=t(i:i)\n end do\n\n call qsort(sos)\n call qsort(sot)\n !write(*,*) sos\n !write(*,*) sot\n j=1\n flag=0\n sflag=0\n do i=1,size_s\n if (sos(i)==sot(j)) then\n do while(sos(i)==sot(j))\n flag=flag+1\n j=j+1\n end do\n end if\n if (j==size_t+1) then\n sflag=1\n exit\n end if\n end do\n\n if (sflag==0) then\n write(*,*) -1\n stop\n end if\n\n\n all=1\n count=1\n j=1\n do\n do i=1,size_s\n if (s(i:i)==t(j:j)) then\n j=j+1\n end if\n count=count+1\n if (j==size_t+1) then\n write(*,*) count-1\n stop\n end if\n end do\n end do\n\nstop\ncontains\n\nsubroutine swap(a,b)\nimplicit none\ncharacter(len=*),intent(inout) :: a,b\ncharacter(len=10) :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x)\nimplicit none\ncharacter(len=*), intent(inout) :: x(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,first,last)\nimplicit none\ncharacter(len=*), intent(inout) :: x(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ncharacter(len=10) :: n\nn=x((first+last)/2)\ni=first\nj=last\ndo\ndo while (x(i)n)\nj=j-1\nend do\nif (i>j .or. i==j) then\nexit\nend if\ncall swap(x(i),x(j))\ni=i+1\nj=j-1\nend do\nif (firstj+1) then\nfir=j+1\ncall q2sort(x,fir,last)\nend if\nend subroutine q2sort\n\n\nend program kadai\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "contest\nson\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02937", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are two strings s and t consisting of lowercase English letters. Determine if there exists an integer i satisfying the following condition, and find the minimum such i if it exists.\n\nLet s' be the concatenation of 10^{100} copies of s. t is a subsequence of the string {s'}_1{s'}_2\\ldots{s'}_i (the first i characters in s').\n\nNotes\n\nA subsequence of a string a is a string obtained by deleting zero or more characters from a and concatenating the remaining characters without changing the relative order. For example, the subsequences of contest include net, c, and contest.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\n1 \\leq |t| \\leq 10^5\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf there exists an integer i satisfying the following condition, print the minimum such i; otherwise, print -1.\n\nSample Input 1\n\ncontest\nson\n\nSample Output 1\n\n10\n\nt = son is a subsequence of the string contestcon (the first 10 characters in s' = contestcontestcontest...), so i = 10 satisfies the condition.\n\nOn the other hand, t is not a subsequence of the string contestco (the first 9 characters in s'), so i = 9 does not satisfy the condition.\n\nSimilarly, any integer less than 9 does not satisfy the condition, either. Thus, the minimum integer i satisfying the condition is 10.\n\nSample Input 2\n\ncontest\nprogramming\n\nSample Output 2\n\n-1\n\nt = programming is not a substring of s' = contestcontestcontest.... Thus, there is no integer i satisfying the condition.\n\nSample Input 3\n\ncontest\nsentence\n\nSample Output 3\n\n33\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2179, "cpu_time_ms": 2103, "memory_kb": 828}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s449896532", "group_id": "codeNet:p02939", "input_text": "program prob3\n implicit none\n character(len=200005) :: s\n integer, allocatable :: dp1(:), dp2(:)\n integer :: n, m\n\n read(*,*) s\n n = len_trim(s)\n allocate(dp1(n))\n allocate(dp2(n))\n \n dp1(1) = 1\n dp1(2) = 1\n dp2(1) = 0\n dp2(2) = 1\n if(s(1:1) /= s(2:2)) then\n dp1(2) = dp1(2) + 1\n end if\n\n do m = 3, n\n if(s(m-1:m-1) == s(m:m)) then\n dp1(m) = dp2(m-1) + 1\n else\n dp1(m) = max(dp1(m-1) + 1, dp2(m-1) + 1)\n end if\n if(m == 3) then\n dp2(m) = dp1(m-2) + 1\n else if(s(m-3:m-2) == s(m-1:m)) then\n dp2(m) = dp2(m-2) + 1 \n else\n dp2(m) = max(dp1(m-2) + 1, dp2(m-2) + 1)\n end if\n end do\n\n write(*,*) max(dp1(n), dp2(n))\n\n deallocate(dp2) \n deallocate(dp1)\n stop\ncontains\nend program prob3", "language": "Fortran", "metadata": {"date": 1592013960, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02939.html", "problem_id": "p02939", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02939/input.txt", "sample_output_relpath": "derived/input_output/data/p02939/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02939/Fortran/s449896532.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s449896532", "user_id": "u478462004"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program prob3\n implicit none\n character(len=200005) :: s\n integer, allocatable :: dp1(:), dp2(:)\n integer :: n, m\n\n read(*,*) s\n n = len_trim(s)\n allocate(dp1(n))\n allocate(dp2(n))\n \n dp1(1) = 1\n dp1(2) = 1\n dp2(1) = 0\n dp2(2) = 1\n if(s(1:1) /= s(2:2)) then\n dp1(2) = dp1(2) + 1\n end if\n\n do m = 3, n\n if(s(m-1:m-1) == s(m:m)) then\n dp1(m) = dp2(m-1) + 1\n else\n dp1(m) = max(dp1(m-1) + 1, dp2(m-1) + 1)\n end if\n if(m == 3) then\n dp2(m) = dp1(m-2) + 1\n else if(s(m-3:m-2) == s(m-1:m)) then\n dp2(m) = dp2(m-2) + 1 \n else\n dp2(m) = max(dp1(m-2) + 1, dp2(m-2) + 1)\n end if\n end do\n\n write(*,*) max(dp1(n), dp2(n))\n\n deallocate(dp2) \n deallocate(dp1)\n stop\ncontains\nend program prob3", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "sample_input": "aabbaa\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02939", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 858, "cpu_time_ms": 8, "memory_kb": 2316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s228841920", "group_id": "codeNet:p02939", "input_text": "program AGC37_A\n character(200000)::S\n integer(8)::ans=1,N,i=1,L\n read(*,*)S\n N=len_trim(S)-1\n L=len_trim(S)\n do while(N>0)\n if(S(i:i)==S(i+1:i+1) .and. N>1) then\n N=N-2\n ans=ans+1\n i=i+2\n if(N/=2 .or. S(L-1:L-1)/=S(L:L)) then\n N=N-1\n ans=ans+1\n i=i+1\n else\n N=N-2\n ans=ans+1\n i=i+2\n end if\n else\n if(N/=2 .or. S(L-1:L-1)/=S(L:L)) then\n N=N-1\n ans=ans+1\n i=i+1\n else\n N=N-2\n ans=ans+1\n i=i+2\n end if\n end if\n end do\n write(*,*)ans\nend program AGC37_A", "language": "Fortran", "metadata": {"date": 1590258282, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02939.html", "problem_id": "p02939", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02939/input.txt", "sample_output_relpath": "derived/input_output/data/p02939/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02939/Fortran/s228841920.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s228841920", "user_id": "u359178469"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program AGC37_A\n character(200000)::S\n integer(8)::ans=1,N,i=1,L\n read(*,*)S\n N=len_trim(S)-1\n L=len_trim(S)\n do while(N>0)\n if(S(i:i)==S(i+1:i+1) .and. N>1) then\n N=N-2\n ans=ans+1\n i=i+2\n if(N/=2 .or. S(L-1:L-1)/=S(L:L)) then\n N=N-1\n ans=ans+1\n i=i+1\n else\n N=N-2\n ans=ans+1\n i=i+2\n end if\n else\n if(N/=2 .or. S(L-1:L-1)/=S(L:L)) then\n N=N-1\n ans=ans+1\n i=i+1\n else\n N=N-2\n ans=ans+1\n i=i+2\n end if\n end if\n end do\n write(*,*)ans\nend program AGC37_A", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "sample_input": "aabbaa\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02939", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 653, "cpu_time_ms": 5, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s258539225", "group_id": "codeNet:p02939", "input_text": "program main\n implicit none\n integer :: n, i, cnt = 1\n character(200000) :: s\n logical :: skip = .false., skipped = .false.\n\n read *, s\n n = len_trim(s)\n\n do i = 2, n\n if (skip) then\n skip = .false.\n skipped = .true.\n cycle\n end if\n cnt = cnt + 1\n if (s(i:i) == s(i-1:i-1)) then\n if (skipped) then\n skipped = .false.\n else\n skip = .true.\n end if\n else\n skipped = .false.\n end if\n end do\n if (skip) cnt = cnt - 1\n print '(i0)', cnt\nend program", "language": "Fortran", "metadata": {"date": 1566093733, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02939.html", "problem_id": "p02939", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02939/input.txt", "sample_output_relpath": "derived/input_output/data/p02939/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02939/Fortran/s258539225.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s258539225", "user_id": "u282360873"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, cnt = 1\n character(200000) :: s\n logical :: skip = .false., skipped = .false.\n\n read *, s\n n = len_trim(s)\n\n do i = 2, n\n if (skip) then\n skip = .false.\n skipped = .true.\n cycle\n end if\n cnt = cnt + 1\n if (s(i:i) == s(i-1:i-1)) then\n if (skipped) then\n skipped = .false.\n else\n skip = .true.\n end if\n else\n skipped = .false.\n end if\n end do\n if (skip) cnt = cnt - 1\n print '(i0)', cnt\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "sample_input": "aabbaa\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02939", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 519, "cpu_time_ms": 9, "memory_kb": 1468}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s001042923", "group_id": "codeNet:p02945", "input_text": "integer a,b\nread*,a,b\nprint*,max(a+b,a-b,a*b)\nend", "language": "Fortran", "metadata": {"date": 1571904094, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02945.html", "problem_id": "p02945", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02945/input.txt", "sample_output_relpath": "derived/input_output/data/p02945/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02945/Fortran/s001042923.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s001042923", "user_id": "u244203620"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "integer a,b\nread*,a,b\nprint*,max(a+b,a-b,a*b)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s647113354", "group_id": "codeNet:p02946", "input_text": "program main\n implicit none\n\n integer k,x,m,n,i\n\n read(*,*)k,x\n m = 1 - k\n n = k - 1\n\n write(*,*) (i + x, i = m, n)\n\nend program main", "language": "Fortran", "metadata": {"date": 1566153927, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02946/input.txt", "sample_output_relpath": "derived/input_output/data/p02946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02946/Fortran/s647113354.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s647113354", "user_id": "u287431190"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "program main\n implicit none\n\n integer k,x,m,n,i\n\n read(*,*)k,x\n m = 1 - k\n n = k - 1\n\n write(*,*) (i + x, i = m, n)\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "sample_input": "3 7\n"}, "reference_outputs": ["5 6 7 8 9\n"], "source_document_id": "p02946", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s287105599", "group_id": "codeNet:p02947", "input_text": "program prob4\n implicit none\n integer(8) :: n\n integer(8), allocatable :: a(:)\n integer(8) :: p(10)\n integer(8) :: s(10)\n integer(8) :: i, j\n integer(8) :: ans\n integer(8) :: cnt\n character(10) :: tmp\n integer(8) :: inttmp\n\n read(*,*) n\n allocate(a(n))\n\n p(1) = 1\n do i = 2, 10\n p(i) = p(i-1) * 26\n end do\n do i = 1, n\n read(*,*) tmp\n do j = 1, 10\n s(j) = ichar(tmp(j:j)) - ichar('a')\n end do\n call msort(s)\n a(i) = 0\n do j = 1, 10\n a(i) = a(i) + s(j) * p(j)\n end do\n end do\n\n call msort(a)\n\n cnt = 1\n inttmp = a(1)\n ans = 0\n do i = 2, n\n if(a(i) == inttmp)then\n cnt = cnt + 1\n else\n ans = ans + cnt * (cnt - 1) / 2\n inttmp = a(i)\n cnt = 1\n end if\n end do\n ans = ans + cnt * (cnt - 1) / 2\n\n write(*,*) ans\n\n\n\n deallocate(a)\n\n stop\ncontains\n\n\n !\n ! swap two arguments\n !\nsubroutine swap(a, b)\n implicit none\n integer(8), intent(inout) :: a, b\n\n integer(8) :: c\n\n c = a\n a = b\n b = c\n\n end subroutine swap\n\n !\n ! merge sort\n !\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n\n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n\n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n\n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n\n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n\n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n\n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\nend program prob4", "language": "Fortran", "metadata": {"date": 1596595485, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/Fortran/s287105599.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s287105599", "user_id": "u478462004"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program prob4\n implicit none\n integer(8) :: n\n integer(8), allocatable :: a(:)\n integer(8) :: p(10)\n integer(8) :: s(10)\n integer(8) :: i, j\n integer(8) :: ans\n integer(8) :: cnt\n character(10) :: tmp\n integer(8) :: inttmp\n\n read(*,*) n\n allocate(a(n))\n\n p(1) = 1\n do i = 2, 10\n p(i) = p(i-1) * 26\n end do\n do i = 1, n\n read(*,*) tmp\n do j = 1, 10\n s(j) = ichar(tmp(j:j)) - ichar('a')\n end do\n call msort(s)\n a(i) = 0\n do j = 1, 10\n a(i) = a(i) + s(j) * p(j)\n end do\n end do\n\n call msort(a)\n\n cnt = 1\n inttmp = a(1)\n ans = 0\n do i = 2, n\n if(a(i) == inttmp)then\n cnt = cnt + 1\n else\n ans = ans + cnt * (cnt - 1) / 2\n inttmp = a(i)\n cnt = 1\n end if\n end do\n ans = ans + cnt * (cnt - 1) / 2\n\n write(*,*) ans\n\n\n\n deallocate(a)\n\n stop\ncontains\n\n\n !\n ! swap two arguments\n !\nsubroutine swap(a, b)\n implicit none\n integer(8), intent(inout) :: a, b\n\n integer(8) :: c\n\n c = a\n a = b\n b = c\n\n end subroutine swap\n\n !\n ! merge sort\n !\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n\n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n\n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n\n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n\n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n\n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n\n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\nend program prob4", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2448, "cpu_time_ms": 90, "memory_kb": 4196}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s482332718", "group_id": "codeNet:p02947", "input_text": "program ccc\n\nimplicit none\ninteger :: n, i, j\ninteger :: co, res1 = 0, res2 = 0\ninteger,dimension(26) :: alp = [2,3,5,7,11,13,17,19,&\n&23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101]\ninteger,allocatable,dimension(:) :: bet\ncharacter(10),allocatable,dimension(:) :: s\n\nread*, n\nallocate(s(n))\nallocate(bet(n))\nbet = 1\n\nread*, s\n\ndo i=1, n\n do j=1,10\n bet(i)=bet(i)*(alp(ichar(s(i)(j:j))-96))\n end do\nend do\n\ncall heapsort(n,bet)\n\nco=bet(1)\ndo i=2,n\n if(co==bet(i)) then\n res1=res1+1\n else\n co=bet(i)\n res2=res2+res1*(res1+1)/2\n res1=0\n end if\nend do\n\nres2=res2+res1*(res1+1)/2\n\nwrite(*,'(i0)') res2\n\nend program\n\n\nsubroutine heapsort(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort", "language": "Fortran", "metadata": {"date": 1568837893, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/Fortran/s482332718.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s482332718", "user_id": "u039189422"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ccc\n\nimplicit none\ninteger :: n, i, j\ninteger :: co, res1 = 0, res2 = 0\ninteger,dimension(26) :: alp = [2,3,5,7,11,13,17,19,&\n&23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101]\ninteger,allocatable,dimension(:) :: bet\ncharacter(10),allocatable,dimension(:) :: s\n\nread*, n\nallocate(s(n))\nallocate(bet(n))\nbet = 1\n\nread*, s\n\ndo i=1, n\n do j=1,10\n bet(i)=bet(i)*(alp(ichar(s(i)(j:j))-96))\n end do\nend do\n\ncall heapsort(n,bet)\n\nco=bet(1)\ndo i=2,n\n if(co==bet(i)) then\n res1=res1+1\n else\n co=bet(i)\n res2=res2+res1*(res1+1)/2\n res1=0\n end if\nend do\n\nres2=res2+res1*(res1+1)/2\n\nwrite(*,'(i0)') res2\n\nend program\n\n\nsubroutine heapsort(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1426, "cpu_time_ms": 41, "memory_kb": 2176}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s805817722", "group_id": "codeNet:p02947", "input_text": "program kadai\nimplicit none\ninteger :: n\ncharacter(len=10),allocatable :: s(:)\ncharacter(len=10) :: hako\ncharacter(len=1) :: word(10)\ninteger :: i,j,k\ninteger(8) :: num\ninteger(8) :: ans\n\nread(*,*) n\n\nallocate(s(n))\n\ndo i=1,n\n read(*,*) s(i)\nend do\n\ndo i=1,n\n hako=s(i)\n do j=1,10\n word(j)=hako(j:j)\n end do\n call qsort(word)\n do j=1,10\n hako(j:j)=word(j)\n end do\n s(i)=hako\nend do\n\n\nnum=0\ncall qsort(s)\n\n!do i=1,n\n! write(*,*) s(i)\n!end do\n\ni=1\nnum=0\nans=0\ndo while (in)\nj=j-1\nend do\nif (i>j .or. i==j) then\nexit\nend if\ncall swap(x(i),x(j))\ni=i+1\nj=j-1\nend do\nif (firstj+1) then\nfir=j+1\ncall q2sort(x,fir,last)\nend if\nend subroutine q2sort\n\n\nend program kadai\n", "language": "Fortran", "metadata": {"date": 1565488830, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02947/input.txt", "sample_output_relpath": "derived/input_output/data/p02947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02947/Fortran/s805817722.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805817722", "user_id": "u286754585"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program kadai\nimplicit none\ninteger :: n\ncharacter(len=10),allocatable :: s(:)\ncharacter(len=10) :: hako\ncharacter(len=1) :: word(10)\ninteger :: i,j,k\ninteger(8) :: num\ninteger(8) :: ans\n\nread(*,*) n\n\nallocate(s(n))\n\ndo i=1,n\n read(*,*) s(i)\nend do\n\ndo i=1,n\n hako=s(i)\n do j=1,10\n word(j)=hako(j:j)\n end do\n call qsort(word)\n do j=1,10\n hako(j:j)=word(j)\n end do\n s(i)=hako\nend do\n\n\nnum=0\ncall qsort(s)\n\n!do i=1,n\n! write(*,*) s(i)\n!end do\n\ni=1\nnum=0\nans=0\ndo while (in)\nj=j-1\nend do\nif (i>j .or. i==j) then\nexit\nend if\ncall swap(x(i),x(j))\ni=i+1\nj=j-1\nend do\nif (firstj+1) then\nfir=j+1\ncall q2sort(x,fir,last)\nend if\nend subroutine q2sort\n\n\nend program kadai\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "sample_input": "3\nacornistnt\npeanutbomb\nconstraint\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02947", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will call a string obtained by arranging the characters contained in a string a in some order, an anagram of a.\n\nFor example, greenbin is an anagram of beginner. As seen here, when the same character occurs multiple times, that character must be used that number of times.\n\nGiven are N strings s_1, s_2, \\ldots, s_N. Each of these strings has a length of 10 and consists of lowercase English characters. Additionally, all of these strings are distinct. Find the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\ns_i is a string of length 10.\n\nEach character in s_i is a lowercase English letter.\n\ns_1, s_2, \\ldots, s_N are all distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the number of pairs of integers i, j (1 \\leq i < j \\leq N) such that s_i is an anagram of s_j.\n\nSample Input 1\n\n3\nacornistnt\npeanutbomb\nconstraint\n\nSample Output 1\n\n1\n\ns_1 = acornistnt is an anagram of s_3 = constraint. There are no other pairs i, j such that s_i is an anagram of s_j, so the answer is 1.\n\nSample Input 2\n\n2\noneplustwo\nninemodsix\n\nSample Output 2\n\n0\n\nIf there is no pair i, j such that s_i is an anagram of s_j, print 0.\n\nSample Input 3\n\n5\nabaaaaaaaa\noneplustwo\naaaaaaaaba\ntwoplusone\naaaabaaaaa\n\nSample Output 3\n\n4\n\nNote that the answer may not fit into a 32-bit integer type, though we cannot put such a case here.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1618, "cpu_time_ms": 183, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s275732001", "group_id": "codeNet:p02948", "input_text": "program kadai\nimplicit none\ninteger :: n,m\ninteger,allocatable :: a(:),b(:)\ninteger :: i,k,j\ninteger :: ans\ninteger :: loc\n\nread(*,*) n,m\nallocate(a(n))\nallocate(b(n))\n\ndo i=1,n\n read(*,*) a(i),b(i)\nend do\n\n\nans=0\ncall qsort(a,b)\nj=1\n\ndo while (m>0)\n !write(*,*) a\n !write(*,*) \"\"\n do i=j,n\n if (a(i)>m .or. a(i)<0) then\n a(i)=0\n b(i)=0\n j=j+1\n else\n exit\n end if\n end do\n if (a(j)==0) then\n write(*,*) ans,j,\"koko\"\n stop\n end if\n !write(*,*) a\n !write(*,*) \"\"\n\n loc=maxloc(b,1)\n ans=ans+maxval(b)\n a(loc)=-1\n b(loc)=0\n m=m-1\n\n !write(*,*) loc,ans,m\n\nend do\n\nwrite(*,*) ans\n\n\nstop\n\ncontains\n\n\nsubroutine swap(a,b)\nimplicit none\ninteger,intent(inout) :: a,b\ninteger :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x,y)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,y,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,y,first,last)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ninteger :: n\n n=x((first+last)/2)\n i=first\n j=last\n do\n do while (x(i)>n)\n i=i+1\n end do\n do while(x(j)j .or. i==j) then\n exit\n end if\n call swap(x(i),x(j))\n call swap(y(i),y(j))\n i=i+1\n j=j-1\n end do\n if (firstj+1) then\n fir=j+1\n call q2sort(x,y,fir,last)\n end if\nend subroutine q2sort\n\nend program kadai", "language": "Fortran", "metadata": {"date": 1565491061, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02948/input.txt", "sample_output_relpath": "derived/input_output/data/p02948/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02948/Fortran/s275732001.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s275732001", "user_id": "u286754585"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program kadai\nimplicit none\ninteger :: n,m\ninteger,allocatable :: a(:),b(:)\ninteger :: i,k,j\ninteger :: ans\ninteger :: loc\n\nread(*,*) n,m\nallocate(a(n))\nallocate(b(n))\n\ndo i=1,n\n read(*,*) a(i),b(i)\nend do\n\n\nans=0\ncall qsort(a,b)\nj=1\n\ndo while (m>0)\n !write(*,*) a\n !write(*,*) \"\"\n do i=j,n\n if (a(i)>m .or. a(i)<0) then\n a(i)=0\n b(i)=0\n j=j+1\n else\n exit\n end if\n end do\n if (a(j)==0) then\n write(*,*) ans,j,\"koko\"\n stop\n end if\n !write(*,*) a\n !write(*,*) \"\"\n\n loc=maxloc(b,1)\n ans=ans+maxval(b)\n a(loc)=-1\n b(loc)=0\n m=m-1\n\n !write(*,*) loc,ans,m\n\nend do\n\nwrite(*,*) ans\n\n\nstop\n\ncontains\n\n\nsubroutine swap(a,b)\nimplicit none\ninteger,intent(inout) :: a,b\ninteger :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x,y)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,y,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,y,first,last)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ninteger :: n\n n=x((first+last)/2)\n i=first\n j=last\n do\n do while (x(i)>n)\n i=i+1\n end do\n do while(x(j)j .or. i==j) then\n exit\n end if\n call swap(x(i),x(j))\n call swap(y(i),y(j))\n i=i+1\n j=j-1\n end do\n if (firstj+1) then\n fir=j+1\n call q2sort(x,y,fir,last)\n end if\nend subroutine q2sort\n\nend program kadai", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1803, "cpu_time_ms": 2103, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s083352392", "group_id": "codeNet:p02948", "input_text": "program kadai\nimplicit none\ninteger :: n,m\ninteger,allocatable :: a(:),b(:)\ninteger :: i,k,j\ninteger :: ans\ninteger :: loc\n\nread(*,*) n,m\nallocate(a(n))\nallocate(b(n))\n\ndo i=1,n\n read(*,*) a(i),b(i)\nend do\n\n\nans=0\ncall qsort(a,b)\nj=1\n\ndo while (m>0)\n !write(*,*) a\n !write(*,*) \"\"\n if (a(1)==0) then\n write(*,*) ans\n stop\n end if\n do i=j,n\n if (a(i)>M) then\n a(i)=0\n b(i)=0\n j=j+1\n else\n exit\n end if\n end do\n !write(*,*) a\n !write(*,*) \"\"\n\n loc=maxloc(b,1)\n ans=ans+maxval(b)\n a(loc)=0\n b(loc)=0\n m=m-1\n\n !write(*,*) loc,ans,m\n\nend do\n\nwrite(*,*) ans\n\n\nstop\n\ncontains\n\n\nsubroutine swap(a,b)\nimplicit none\ninteger,intent(inout) :: a,b\ninteger :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x,y)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,y,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,y,first,last)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ninteger :: n\n n=x((first+last)/2)\n i=first\n j=last\n do\n do while (x(i)>n)\n i=i+1\n end do\n do while(x(j)j .or. i==j) then\n exit\n end if\n call swap(x(i),x(j))\n call swap(y(i),y(j))\n i=i+1\n j=j-1\n end do\n if (firstj+1) then\n fir=j+1\n call q2sort(x,y,fir,last)\n end if\nend subroutine q2sort\n\n\n\n\n\nend program kadai\n", "language": "Fortran", "metadata": {"date": 1565490112, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02948/input.txt", "sample_output_relpath": "derived/input_output/data/p02948/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02948/Fortran/s083352392.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s083352392", "user_id": "u286754585"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program kadai\nimplicit none\ninteger :: n,m\ninteger,allocatable :: a(:),b(:)\ninteger :: i,k,j\ninteger :: ans\ninteger :: loc\n\nread(*,*) n,m\nallocate(a(n))\nallocate(b(n))\n\ndo i=1,n\n read(*,*) a(i),b(i)\nend do\n\n\nans=0\ncall qsort(a,b)\nj=1\n\ndo while (m>0)\n !write(*,*) a\n !write(*,*) \"\"\n if (a(1)==0) then\n write(*,*) ans\n stop\n end if\n do i=j,n\n if (a(i)>M) then\n a(i)=0\n b(i)=0\n j=j+1\n else\n exit\n end if\n end do\n !write(*,*) a\n !write(*,*) \"\"\n\n loc=maxloc(b,1)\n ans=ans+maxval(b)\n a(loc)=0\n b(loc)=0\n m=m-1\n\n !write(*,*) loc,ans,m\n\nend do\n\nwrite(*,*) ans\n\n\nstop\n\ncontains\n\n\nsubroutine swap(a,b)\nimplicit none\ninteger,intent(inout) :: a,b\ninteger :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x,y)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,y,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,y,first,last)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ninteger :: n\n n=x((first+last)/2)\n i=first\n j=last\n do\n do while (x(i)>n)\n i=i+1\n end do\n do while(x(j)j .or. i==j) then\n exit\n end if\n call swap(x(i),x(j))\n call swap(y(i),y(j))\n i=i+1\n j=j-1\n end do\n if (firstj+1) then\n fir=j+1\n call q2sort(x,y,fir,last)\n end if\nend subroutine q2sort\n\n\n\n\n\nend program kadai\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1786, "cpu_time_ms": 69, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s730232466", "group_id": "codeNet:p02948", "input_text": "program kadai\nimplicit none\ninteger :: n,m\ninteger,allocatable :: a(:),b(:)\ninteger :: i,k\ninteger :: ans\ninteger :: loc\n\nread(*,*) n,m\nallocate(a(n))\nallocate(b(n))\n\ndo i=1,n\n read(*,*) a(i),b(i)\nend do\n\n\nans=0\n\ndo while (m>0)\n call qsort(a,b)\n !write(*,*) a\n !write(*,*) \"\"\n if (a(1)==0) then\n write(*,*) ans\n stop\n end if\n do i=1,n\n if (a(i)>M) then\n a(i)=0\n b(i)=0\n else\n exit\n end if\n end do\n !write(*,*) a\n !write(*,*) \"\"\n\n loc=maxloc(b,1)\n ans=ans+maxval(b)\n a(loc)=0\n b(loc)=0\n m=m-1\n\n !write(*,*) loc,ans,m\n\nend do\n\nwrite(*,*) ans\n\n\n\n\nstop\n\ncontains\n\n\nsubroutine swap(a,b)\nimplicit none\ninteger,intent(inout) :: a,b\ninteger :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x,y)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,y,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,y,first,last)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ninteger :: n\n n=x((first+last)/2)\n i=first\n j=last\n do\n do while (x(i)>n)\n i=i+1\n end do\n do while(x(j)j .or. i==j) then\n exit\n end if\n call swap(x(i),x(j))\n call swap(y(i),y(j))\n i=i+1\n j=j-1\n end do\n if (firstj+1) then\n fir=j+1\n call q2sort(x,y,fir,last)\n end if\nend subroutine q2sort\n\n\n\n\n\nend program kadai\n", "language": "Fortran", "metadata": {"date": 1565489887, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02948/input.txt", "sample_output_relpath": "derived/input_output/data/p02948/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02948/Fortran/s730232466.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s730232466", "user_id": "u286754585"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program kadai\nimplicit none\ninteger :: n,m\ninteger,allocatable :: a(:),b(:)\ninteger :: i,k\ninteger :: ans\ninteger :: loc\n\nread(*,*) n,m\nallocate(a(n))\nallocate(b(n))\n\ndo i=1,n\n read(*,*) a(i),b(i)\nend do\n\n\nans=0\n\ndo while (m>0)\n call qsort(a,b)\n !write(*,*) a\n !write(*,*) \"\"\n if (a(1)==0) then\n write(*,*) ans\n stop\n end if\n do i=1,n\n if (a(i)>M) then\n a(i)=0\n b(i)=0\n else\n exit\n end if\n end do\n !write(*,*) a\n !write(*,*) \"\"\n\n loc=maxloc(b,1)\n ans=ans+maxval(b)\n a(loc)=0\n b(loc)=0\n m=m-1\n\n !write(*,*) loc,ans,m\n\nend do\n\nwrite(*,*) ans\n\n\n\n\nstop\n\ncontains\n\n\nsubroutine swap(a,b)\nimplicit none\ninteger,intent(inout) :: a,b\ninteger :: c\nc=a\na=b\nb=c\nend subroutine swap\n\nsubroutine qsort(x,y)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger :: first,last\nfirst=1\nlast=size(x)\ncall q2sort(x,y,first,last)\nreturn\nend subroutine qsort\n\nrecursive subroutine q2sort(x,y,first,last)\nimplicit none\ninteger, intent(inout) :: x(:)\ninteger, intent(inout) :: y(:)\ninteger, intent(inout) :: first,last\ninteger :: fir, las\ninteger :: i,j\ninteger :: n\n n=x((first+last)/2)\n i=first\n j=last\n do\n do while (x(i)>n)\n i=i+1\n end do\n do while(x(j)j .or. i==j) then\n exit\n end if\n call swap(x(i),x(j))\n call swap(y(i),y(j))\n i=i+1\n j=j-1\n end do\n if (firstj+1) then\n fir=j+1\n call q2sort(x,y,fir,last)\n end if\nend subroutine q2sort\n\n\n\n\n\nend program kadai\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1768, "cpu_time_ms": 2103, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s947076286", "group_id": "codeNet:p02948", "input_text": "integer N,M,x,y,maxhi\ninteger,allocatable,dimension(:,:)::A\ninteger,allocatable,dimension(:)::B\ninteger(16)ans\nread*,N,M\nallocate(A(1:M,0:N),B(M))\nA=0\nB=0\ndo i=1,N\n read*,x,y\n if(x<=M)then\n B(x)=B(x)+1\n A(x,B(x))=y\n endif\nend do\nans=0\ndo i=1,M\n if(B(i)/=0)then\n call Heapsort(B(i),A(i,1:B(i)))\n end if\n maxhi=0\n do j=1,i\n maxhi=max(maxhi,A(j,B(j)))\n end do\n if(maxhi/=0)then\n do j=1,i\n if(maxhi==A(j,B(j)))then\n B(j)=B(j)-1\n exit\n endif\n end do\n endif\n ans=ans+maxhi\nend do\n\nprint\"(I0)\",ans\ncontains\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n integer::i,k,j,l\n integer:: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend", "language": "Fortran", "metadata": {"date": 1565489338, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02948/input.txt", "sample_output_relpath": "derived/input_output/data/p02948/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02948/Fortran/s947076286.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s947076286", "user_id": "u598073939"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "integer N,M,x,y,maxhi\ninteger,allocatable,dimension(:,:)::A\ninteger,allocatable,dimension(:)::B\ninteger(16)ans\nread*,N,M\nallocate(A(1:M,0:N),B(M))\nA=0\nB=0\ndo i=1,N\n read*,x,y\n if(x<=M)then\n B(x)=B(x)+1\n A(x,B(x))=y\n endif\nend do\nans=0\ndo i=1,M\n if(B(i)/=0)then\n call Heapsort(B(i),A(i,1:B(i)))\n end if\n maxhi=0\n do j=1,i\n maxhi=max(maxhi,A(j,B(j)))\n end do\n if(maxhi/=0)then\n do j=1,i\n if(maxhi==A(j,B(j)))then\n B(j)=B(j)-1\n exit\n endif\n end do\n endif\n ans=ans+maxhi\nend do\n\nprint\"(I0)\",ans\ncontains\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n integer::i,k,j,l\n integer:: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1319, "cpu_time_ms": 2123, "memory_kb": 898432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s533135604", "group_id": "codeNet:p02951", "input_text": "program main\n\timplicit none\n integer::a,b,c\n read(*,*)a,b,c\n write(*,*) max(c-(a-b),0)\n stop\nend program main\n", "language": "Fortran", "metadata": {"date": 1592627375, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02951.html", "problem_id": "p02951", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02951/input.txt", "sample_output_relpath": "derived/input_output/data/p02951/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02951/Fortran/s533135604.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s533135604", "user_id": "u884601206"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n\timplicit none\n integer::a,b,c\n read(*,*)a,b,c\n write(*,*) max(c-(a-b),0)\n stop\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "sample_input": "6 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02951", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two bottles for holding water.\n\nBottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.\n\nBottle 2 contains C milliliters of water.\n\nWe will transfer water from Bottle 2 to Bottle 1 as much as possible.\n\nHow much amount of water will remain in Bottle 2?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B \\leq A \\leq 20\n\n1 \\leq C \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the integer representing the amount of water, in milliliters, that will remain in Bottle 2.\n\nSample Input 1\n\n6 4 3\n\nSample Output 1\n\n1\n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.\n\nSample Input 2\n\n8 3 9\n\nSample Output 2\n\n4\n\nSample Input 3\n\n12 3 7\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 11, "memory_kb": 2724}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s634541819", "group_id": "codeNet:p02952", "input_text": "program main\n implicit none\n integer :: n, i, l, res\n character(10) :: s\n read (*, *) n\n res = 0\n do i = 1, n\n write (s, \"(i0)\") i\n l = len(trim(s))\n res = res + mod(l, 2)\n end do\n write (*, \"(i0)\") res\nend program main\n", "language": "Fortran", "metadata": {"date": 1583005719, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02952.html", "problem_id": "p02952", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02952/input.txt", "sample_output_relpath": "derived/input_output/data/p02952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02952/Fortran/s634541819.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s634541819", "user_id": "u388927326"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, l, res\n character(10) :: s\n read (*, *) n\n res = 0\n do i = 1, n\n write (s, \"(i0)\") i\n l = len(trim(s))\n res = res + mod(l, 2)\n end do\n write (*, \"(i0)\") res\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "sample_input": "11\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02952", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 74, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s391970511", "group_id": "codeNet:p02952", "input_text": "program abc136b\n implicit none\n integer :: n\n integer :: digit, counter\n\n read(*,*) n\n\n digit = int(log10(real(n))) + 1\n\n\n if ( digit == 6 ) then\n write(*,*) 90909\n stop\n endif\n\n counter = 0\n if ( digit == 5 ) then\n counter = (n - 9999)\n counter = counter + 909\n else if (digit == 4) then\n counter = 909\n else if ( digit == 3) then\n counter = (n - 99) + 9\n else if ( digit == 2) then\n counter = 9\n else if (digit == 1 ) then\n counter = n\n end if\n\n write(*,*) counter\n\nend program abc136b\n", "language": "Fortran", "metadata": {"date": 1564968526, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02952.html", "problem_id": "p02952", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02952/input.txt", "sample_output_relpath": "derived/input_output/data/p02952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02952/Fortran/s391970511.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391970511", "user_id": "u210113718"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program abc136b\n implicit none\n integer :: n\n integer :: digit, counter\n\n read(*,*) n\n\n digit = int(log10(real(n))) + 1\n\n\n if ( digit == 6 ) then\n write(*,*) 90909\n stop\n endif\n\n counter = 0\n if ( digit == 5 ) then\n counter = (n - 9999)\n counter = counter + 909\n else if (digit == 4) then\n counter = 909\n else if ( digit == 3) then\n counter = (n - 99) + 9\n else if ( digit == 2) then\n counter = 9\n else if (digit == 1 ) then\n counter = n\n end if\n\n write(*,*) counter\n\nend program abc136b\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "sample_input": "11\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02952", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s010642591", "group_id": "codeNet:p02952", "input_text": "program uneven_numbers\n implicit none\n integer :: n, ans = 0\n read(*,*) n\n if (n > 0) ans = ans + min(9,n)\n if (n > 99) ans = ans + min(900,n-99)\n if (n > 9999) ans = ans + min(90000,n-9999)\n write(*,'(i0)') ans\n stop\nend program uneven_numbers", "language": "Fortran", "metadata": {"date": 1564967400, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02952.html", "problem_id": "p02952", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02952/input.txt", "sample_output_relpath": "derived/input_output/data/p02952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02952/Fortran/s010642591.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010642591", "user_id": "u506403362"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program uneven_numbers\n implicit none\n integer :: n, ans = 0\n read(*,*) n\n if (n > 0) ans = ans + min(9,n)\n if (n > 99) ans = ans + min(900,n-99)\n if (n > 9999) ans = ans + min(90000,n-9999)\n write(*,'(i0)') ans\n stop\nend program uneven_numbers", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "sample_input": "11\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02952", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is an integer N. Find the number of positive integers less than or equal to N that have an odd number of digits (in base ten without leading zeros).\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of positive integers less than or equal to N that have an odd number of digits.\n\nSample Input 1\n\n11\n\nSample Output 1\n\n9\n\nAmong the positive integers less than or equal to 11, nine integers have an odd number of digits: 1, 2, \\ldots, 9.\n\nSample Input 2\n\n136\n\nSample Output 2\n\n46\n\nIn addition to 1, 2, \\ldots, 9, another 37 integers also have an odd number of digits: 100, 101, \\ldots, 136.\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n90909", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s664455832", "group_id": "codeNet:p02954", "input_text": "program sample\n implicit none\n character(200000)::s\n integer(8) :: i,j,m,n\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n n=len_trim(s)\n allocate(x(n))\n x(:)=1\n do i=1,n-1\n\n if(s(i:i+1) .eq. 'RR')then\n x(i+2)=x(i+2)+x(i)\n x(i)=0\n end if\n end do\n do i=n,2,-1\n\n if(s(i-1:i) .eq. 'LL')then\n x(i-2)=x(i-2)+x(i)\n x(i)=0\n end if\n end do\n\n \n write(*,*) x\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1594574927, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02954.html", "problem_id": "p02954", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02954/input.txt", "sample_output_relpath": "derived/input_output/data/p02954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02954/Fortran/s664455832.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664455832", "user_id": "u713568912"}, "prompt_components": {"gold_output": "0 1 2 1 1\n", "input_to_evaluate": "program sample\n implicit none\n character(200000)::s\n integer(8) :: i,j,m,n\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n n=len_trim(s)\n allocate(x(n))\n x(:)=1\n do i=1,n-1\n\n if(s(i:i+1) .eq. 'RR')then\n x(i+2)=x(i+2)+x(i)\n x(i)=0\n end if\n end do\n do i=n,2,-1\n\n if(s(i-1:i) .eq. 'LL')then\n x(i-2)=x(i-2)+x(i)\n x(i)=0\n end if\n end do\n\n \n write(*,*) x\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "sample_input": "RRLRL\n"}, "reference_outputs": ["0 1 2 1 1\n"], "source_document_id": "p02954", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S consisting of L and R.\n\nLet N be the length of S. There are N squares arranged from left to right, and the i-th character of S from the left is written on the i-th square from the left.\n\nThe character written on the leftmost square is always R, and the character written on the rightmost square is always L.\n\nInitially, one child is standing on each square.\n\nEach child will perform the move below 10^{100} times:\n\nMove one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.\n\nFind the number of children standing on each square after the children performed the moves.\n\nConstraints\n\nS is a string of length between 2 and 10^5 (inclusive).\n\nEach character of S is L or R.\n\nThe first and last characters of S are R and L, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of children standing on each square after the children performed the moves, in order from left to right.\n\nSample Input 1\n\nRRLRL\n\nSample Output 1\n\n0 1 2 1 1\n\nAfter each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n\nAfter each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nAfter each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\nSample Input 2\n\nRRLLLLRLRRLL\n\nSample Output 2\n\n0 3 3 0 0 0 1 1 0 2 2 0\n\nSample Input 3\n\nRRRLLRLLRRRLLLLL\n\nSample Output 3\n\n0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 4500}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s954415416", "group_id": "codeNet:p02955", "input_text": "program max_gcd\n implicit none\n integer :: n, k, a(500) = 0, s, d(100000) = 0, num = 0, i, j\n integer :: x(500) = 0, m, p, q\n read(*,*) n, k\n read(*,*) a(1:n)\n s = sum(a(1:n))\n do i = 1, s\n if (i*i > s) exit\n if (mod(s,i) /= 0) cycle\n num = num+1\n d(num) = i\n if (s/i /= i) then\n num = num+1\n d(num) = s/i\n end if\n end do\n call quick_sort(d(1:num))\n do i = num, 1, -1\n x(1:n) = mod(a(1:n),d(i))\n call quick_sort(x(1:n))\n m = 10**9\n q = sum(d(i)-x(1:n))\n p = 0\n do j = 1, n\n p = p+x(j)\n q = q-(d(i)-x(j))\n m = min(m,max(p,q))\n end do\n if (m <= k) then\n write(*,'(i0)') d(i)\n stop\n end if\n end do\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: p, c\n integer :: n, l, r, m\n n = size(a)\n l = 1\n r = n\n m = (l+r)/2\n p = a(l)+a(m)+a(r)-max(a(l),a(m),a(r))-min(a(l),a(m),a(r))\n do\n do while (a(l) < p)\n l = l+1\n end do\n do while (a(r) > p)\n r = r-1\n end do\n if (l >= r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l > 2) call quick_sort(a(1:l-1))\n if (n > r+1) call quick_sort(a(r+1:n))\n end subroutine quick_sort\nend program max_gcd", "language": "Fortran", "metadata": {"date": 1564980313, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02955.html", "problem_id": "p02955", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02955/input.txt", "sample_output_relpath": "derived/input_output/data/p02955/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02955/Fortran/s954415416.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s954415416", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program max_gcd\n implicit none\n integer :: n, k, a(500) = 0, s, d(100000) = 0, num = 0, i, j\n integer :: x(500) = 0, m, p, q\n read(*,*) n, k\n read(*,*) a(1:n)\n s = sum(a(1:n))\n do i = 1, s\n if (i*i > s) exit\n if (mod(s,i) /= 0) cycle\n num = num+1\n d(num) = i\n if (s/i /= i) then\n num = num+1\n d(num) = s/i\n end if\n end do\n call quick_sort(d(1:num))\n do i = num, 1, -1\n x(1:n) = mod(a(1:n),d(i))\n call quick_sort(x(1:n))\n m = 10**9\n q = sum(d(i)-x(1:n))\n p = 0\n do j = 1, n\n p = p+x(j)\n q = q-(d(i)-x(j))\n m = min(m,max(p,q))\n end do\n if (m <= k) then\n write(*,'(i0)') d(i)\n stop\n end if\n end do\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: p, c\n integer :: n, l, r, m\n n = size(a)\n l = 1\n r = n\n m = (l+r)/2\n p = a(l)+a(m)+a(r)-max(a(l),a(m),a(r))-min(a(l),a(m),a(r))\n do\n do while (a(l) < p)\n l = l+1\n end do\n do while (a(r) > p)\n r = r-1\n end do\n if (l >= r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l > 2) call quick_sort(a(1:l-1))\n if (n > r+1) call quick_sort(a(r+1:n))\n end subroutine quick_sort\nend program max_gcd", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a sequence of N integers: A_1, A_2, \\cdots, A_N.\n\nYou can perform the following operation between 0 and K times (inclusive):\n\nChoose two integers i and j such that i \\neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, possibly producing a negative element.\n\nCompute the maximum possible positive integer that divides every element of A after the operations. Here a positive integer x divides an integer y if and only if there exists an integer z such that y = xz.\n\nConstraints\n\n2 \\leq N \\leq 500\n\n1 \\leq A_i \\leq 10^6\n\n0 \\leq K \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\cdots A_{N-1} A_{N}\n\nOutput\n\nPrint the maximum possible positive integer that divides every element of A after the operations.\n\nSample Input 1\n\n2 3\n8 20\n\nSample Output 1\n\n7\n\n7 will divide every element of A if, for example, we perform the following operation:\n\nChoose i = 2, j = 1. A becomes (7, 21).\n\nWe cannot reach the situation where 8 or greater integer divides every element of A.\n\nSample Input 2\n\n2 10\n3 5\n\nSample Output 2\n\n8\n\nConsider performing the following five operations:\n\nChoose i = 2, j = 1. A becomes (2, 6).\n\nChoose i = 2, j = 1. A becomes (1, 7).\n\nChoose i = 2, j = 1. A becomes (0, 8).\n\nChoose i = 2, j = 1. A becomes (-1, 9).\n\nChoose i = 1, j = 2. A becomes (0, 8).\n\nThen, 0 = 8 \\times 0 and 8 = 8 \\times 1, so 8 divides every element of A. We cannot reach the situation where 9 or greater integer divides every element of A.\n\nSample Input 3\n\n4 5\n10 1 2 22\n\nSample Output 3\n\n7\n\nSample Input 4\n\n8 7\n1 7 5 6 8 2 6 5\n\nSample Output 4\n\n5", "sample_input": "2 3\n8 20\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02955", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a sequence of N integers: A_1, A_2, \\cdots, A_N.\n\nYou can perform the following operation between 0 and K times (inclusive):\n\nChoose two integers i and j such that i \\neq j, each between 1 and N (inclusive). Add 1 to A_i and -1 to A_j, possibly producing a negative element.\n\nCompute the maximum possible positive integer that divides every element of A after the operations. Here a positive integer x divides an integer y if and only if there exists an integer z such that y = xz.\n\nConstraints\n\n2 \\leq N \\leq 500\n\n1 \\leq A_i \\leq 10^6\n\n0 \\leq K \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\cdots A_{N-1} A_{N}\n\nOutput\n\nPrint the maximum possible positive integer that divides every element of A after the operations.\n\nSample Input 1\n\n2 3\n8 20\n\nSample Output 1\n\n7\n\n7 will divide every element of A if, for example, we perform the following operation:\n\nChoose i = 2, j = 1. A becomes (7, 21).\n\nWe cannot reach the situation where 8 or greater integer divides every element of A.\n\nSample Input 2\n\n2 10\n3 5\n\nSample Output 2\n\n8\n\nConsider performing the following five operations:\n\nChoose i = 2, j = 1. A becomes (2, 6).\n\nChoose i = 2, j = 1. A becomes (1, 7).\n\nChoose i = 2, j = 1. A becomes (0, 8).\n\nChoose i = 2, j = 1. A becomes (-1, 9).\n\nChoose i = 1, j = 2. A becomes (0, 8).\n\nThen, 0 = 8 \\times 0 and 8 = 8 \\times 1, so 8 divides every element of A. We cannot reach the situation where 9 or greater integer divides every element of A.\n\nSample Input 3\n\n4 5\n10 1 2 22\n\nSample Output 3\n\n7\n\nSample Input 4\n\n8 7\n1 7 5 6 8 2 6 5\n\nSample Output 4\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1311, "cpu_time_ms": 27, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s456327590", "group_id": "codeNet:p02957", "input_text": "program main\n implicit none\n integer n, d\n integer km, i\n integer, allocatable :: m(:), y(:)\n read*,n\n allocate(m(n+1), y(n))\n\n read*, m\n read*, y\n\n km = 0\n\n do i=1,n\n d = y(i) - m(i)\n if(d>=0)then\n km = km + m(i)\n y(i) = y(i) - m(i)\n m(i) = 0\n\n else\n km = km + y(i)\n m(i) = m(i) - y(i)\n y(i) = 0\n endif\n\n if ( y(i)>0) then\n if(y(i) > m(i+1))then\n km = km + m(i+1) \n y(i) = y(i) - m(i+1)\n m(i+1) = 0\n \n else\n km = km + y(i)\n m(i+1) = m(i+1) - y(i)\n y(i) = 0\n endif\n \n end if\n enddo\n print'(i0)', km\n \nend program main", "language": "Fortran", "metadata": {"date": 1564281108, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02957.html", "problem_id": "p02957", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02957/input.txt", "sample_output_relpath": "derived/input_output/data/p02957/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02957/Fortran/s456327590.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s456327590", "user_id": "u234636620"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n integer n, d\n integer km, i\n integer, allocatable :: m(:), y(:)\n read*,n\n allocate(m(n+1), y(n))\n\n read*, m\n read*, y\n\n km = 0\n\n do i=1,n\n d = y(i) - m(i)\n if(d>=0)then\n km = km + m(i)\n y(i) = y(i) - m(i)\n m(i) = 0\n\n else\n km = km + y(i)\n m(i) = m(i) - y(i)\n y(i) = 0\n endif\n\n if ( y(i)>0) then\n if(y(i) > m(i+1))then\n km = km + m(i+1) \n y(i) = y(i) - m(i+1)\n m(i+1) = 0\n \n else\n km = km + y(i)\n m(i+1) = m(i+1) - y(i)\n y(i) = 0\n endif\n \n end if\n enddo\n print'(i0)', km\n \nend program main", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe have two distinct integers A and B.\n\nPrint the integer K such that |A - K| = |B - K|.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A,\\ B \\leq 10^9\n\nA and B are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the integer K satisfying the condition.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nSample Input 1\n\n2 16\n\nSample Output 1\n\n9\n\n|2 - 9| = 7 and |16 - 9| = 7, so 9 satisfies the condition.\n\nSample Input 2\n\n0 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo integer satisfies the condition.\n\nSample Input 3\n\n998244353 99824435\n\nSample Output 3\n\n549034394", "sample_input": "2 16\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02957", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe have two distinct integers A and B.\n\nPrint the integer K such that |A - K| = |B - K|.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A,\\ B \\leq 10^9\n\nA and B are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the integer K satisfying the condition.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nSample Input 1\n\n2 16\n\nSample Output 1\n\n9\n\n|2 - 9| = 7 and |16 - 9| = 7, so 9 satisfies the condition.\n\nSample Input 2\n\n0 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo integer satisfies the condition.\n\nSample Input 3\n\n998244353 99824435\n\nSample Output 3\n\n549034394", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 808, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s538758144", "group_id": "codeNet:p02957", "input_text": "program abc135a\n implicit none\n integer :: a, b, k\n\n read(*,*) a, b\n\n if (mod(a+b,2)==0) then\n k = (a+b)/2\n write(*,*) k\n else\n write(*,*) \"IMPOSSIBLE\"\n end if\n\nend program abc135a\n", "language": "Fortran", "metadata": {"date": 1564276131, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02957.html", "problem_id": "p02957", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02957/input.txt", "sample_output_relpath": "derived/input_output/data/p02957/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02957/Fortran/s538758144.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538758144", "user_id": "u210113718"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program abc135a\n implicit none\n integer :: a, b, k\n\n read(*,*) a, b\n\n if (mod(a+b,2)==0) then\n k = (a+b)/2\n write(*,*) k\n else\n write(*,*) \"IMPOSSIBLE\"\n end if\n\nend program abc135a\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe have two distinct integers A and B.\n\nPrint the integer K such that |A - K| = |B - K|.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A,\\ B \\leq 10^9\n\nA and B are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the integer K satisfying the condition.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nSample Input 1\n\n2 16\n\nSample Output 1\n\n9\n\n|2 - 9| = 7 and |16 - 9| = 7, so 9 satisfies the condition.\n\nSample Input 2\n\n0 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo integer satisfies the condition.\n\nSample Input 3\n\n998244353 99824435\n\nSample Output 3\n\n549034394", "sample_input": "2 16\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02957", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe have two distinct integers A and B.\n\nPrint the integer K such that |A - K| = |B - K|.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A,\\ B \\leq 10^9\n\nA and B are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the integer K satisfying the condition.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nSample Input 1\n\n2 16\n\nSample Output 1\n\n9\n\n|2 - 9| = 7 and |16 - 9| = 7, so 9 satisfies the condition.\n\nSample Input 2\n\n0 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo integer satisfies the condition.\n\nSample Input 3\n\n998244353 99824435\n\nSample Output 3\n\n549034394", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s377137401", "group_id": "codeNet:p02958", "input_text": "implicit none\n\ninteger :: N\ninteger, allocatable :: p(:)\ninteger :: i,s\n\nread *, N\nallocate(p(N))\n\nread *, (p(i),i=1,N)\n\ns = 0\ndo i = 1, N\n if (p(i) /= i) then\n s = s + 1\n endif\nenddo\n\nif (s == 0 .or. s == 2) then\n write(6,'(a)') 'YES'\nelse\n write(6,'(a)') 'NO'\nendif\nstop\nend", "language": "Fortran", "metadata": {"date": 1565045060, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02958.html", "problem_id": "p02958", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02958/input.txt", "sample_output_relpath": "derived/input_output/data/p02958/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02958/Fortran/s377137401.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377137401", "user_id": "u193540507"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "implicit none\n\ninteger :: N\ninteger, allocatable :: p(:)\ninteger :: i,s\n\nread *, N\nallocate(p(N))\n\nread *, (p(i),i=1,N)\n\ns = 0\ndo i = 1, N\n if (p(i) /= i) then\n s = s + 1\n endif\nenddo\n\nif (s == 0 .or. s == 2) then\n write(6,'(a)') 'YES'\nelse\n write(6,'(a)') 'NO'\nendif\nstop\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "sample_input": "5\n5 2 3 4 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02958", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 289, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s602436593", "group_id": "codeNet:p02959", "input_text": "program answer\n implicit none\n integer(8) :: i, N\n integer, allocatable :: A(:), B(:), ato(:)\n read(*,*) N\n allocate(A(N+1),B(N),ato(N+1))\n read(*,*) A\n read(*,*) B\n ato=A\n do i = 1, N\n if(ato(i)<=B(i)) then\n if(ato(i+1)+ato(i)<=B(i)) then\n ato(i)=0\n ato(i+1)=0\n else\n ato(i+1)=ato(i+1)-(B(i)-ato(i))\n ato(i)=0\n end if\n else\n ato(i)=ato(i)-B(i)\n end if\n end do\n\n write(*,*) sum(A)-sum(ato)\n stop\n end program answer\n", "language": "Fortran", "metadata": {"date": 1600537921, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02959.html", "problem_id": "p02959", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02959/input.txt", "sample_output_relpath": "derived/input_output/data/p02959/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02959/Fortran/s602436593.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s602436593", "user_id": "u873780029"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program answer\n implicit none\n integer(8) :: i, N\n integer, allocatable :: A(:), B(:), ato(:)\n read(*,*) N\n allocate(A(N+1),B(N),ato(N+1))\n read(*,*) A\n read(*,*) B\n ato=A\n do i = 1, N\n if(ato(i)<=B(i)) then\n if(ato(i+1)+ato(i)<=B(i)) then\n ato(i)=0\n ato(i+1)=0\n else\n ato(i+1)=ato(i+1)-(B(i)-ato(i))\n ato(i)=0\n end if\n else\n ato(i)=ato(i)-B(i)\n end if\n end do\n\n write(*,*) sum(A)-sum(ato)\n stop\n end program answer\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "sample_input": "2\n3 5 2\n4 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02959", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 4200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s754445048", "group_id": "codeNet:p02959", "input_text": "program prob1\n implicit none\n integer(8) :: n, i, ans\n integer(8), allocatable :: a(:), b(:)\n read(*,*) n\n allocate(a(n+1), b(n))\n read(*,*) a\n read(*,*) b\n ans = 0\n do i = 1, n\n if(a(i) >= b(i)) then\n ans = ans + b(i)\n a(i) = a(i) - b(i)\n b(i) = 0\n else\n ans = ans + a(i)\n b(i) = b(i) - a(i)\n a(i) = 0\n end if\n if(a(i+1) >= b(i)) then\n ans = ans + b(i)\n a(i+1) = a(i+1) - b(i)\n b(i) = 0\n else\n ans = ans + a(i+1)\n b(i) = b(i) - a(i+1)\n a(i+1) = 0\n end if\n end do\n write(*,*) ans\n \n stop\ncontains\nend program prob1", "language": "Fortran", "metadata": {"date": 1600478945, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02959.html", "problem_id": "p02959", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02959/input.txt", "sample_output_relpath": "derived/input_output/data/p02959/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02959/Fortran/s754445048.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s754445048", "user_id": "u478462004"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program prob1\n implicit none\n integer(8) :: n, i, ans\n integer(8), allocatable :: a(:), b(:)\n read(*,*) n\n allocate(a(n+1), b(n))\n read(*,*) a\n read(*,*) b\n ans = 0\n do i = 1, n\n if(a(i) >= b(i)) then\n ans = ans + b(i)\n a(i) = a(i) - b(i)\n b(i) = 0\n else\n ans = ans + a(i)\n b(i) = b(i) - a(i)\n a(i) = 0\n end if\n if(a(i+1) >= b(i)) then\n ans = ans + b(i)\n a(i+1) = a(i+1) - b(i)\n b(i) = 0\n else\n ans = ans + a(i+1)\n b(i) = b(i) - a(i+1)\n a(i+1) = 0\n end if\n end do\n write(*,*) ans\n \n stop\ncontains\nend program prob1", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "sample_input": "2\n3 5 2\n4 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02959", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 731, "cpu_time_ms": 60, "memory_kb": 4660}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s325575198", "group_id": "codeNet:p02960", "input_text": "program digits_parade\n implicit none\n integer(8), parameter :: md = 1000000007_8\n character(100000) :: s\n integer :: n, i, j, k, l = 0\n integer(8) :: dp(0:1,0:12) = 0_8\n read(*,*) s\n s = trim(adjustl(s))\n n = len_trim(s)\n dp(0,0) = 1_8\n do i = 1, n\n l = 1-l\n dp(l,:) = 0_8\n if (s(i:i) == \"?\") then\n do k = 0, 9\n do j = 0, 12\n dp(l,mod(10*j+k,13)) = mod(dp(l,mod(10*j+k,13))+dp(1-l,j),md)\n end do\n end do\n else\n k = ichar(s(i:i))-48\n do j = 0, 12\n dp(l,mod(10*j+k,13)) = dp(1-l,j)\n end do\n end if\n end do\n write(*,'(i0)') dp(l,5)\n stop\nend program digits_parade", "language": "Fortran", "metadata": {"date": 1564284316, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02960.html", "problem_id": "p02960", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02960/input.txt", "sample_output_relpath": "derived/input_output/data/p02960/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02960/Fortran/s325575198.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s325575198", "user_id": "u506403362"}, "prompt_components": {"gold_output": "768\n", "input_to_evaluate": "program digits_parade\n implicit none\n integer(8), parameter :: md = 1000000007_8\n character(100000) :: s\n integer :: n, i, j, k, l = 0\n integer(8) :: dp(0:1,0:12) = 0_8\n read(*,*) s\n s = trim(adjustl(s))\n n = len_trim(s)\n dp(0,0) = 1_8\n do i = 1, n\n l = 1-l\n dp(l,:) = 0_8\n if (s(i:i) == \"?\") then\n do k = 0, 9\n do j = 0, 12\n dp(l,mod(10*j+k,13)) = mod(dp(l,mod(10*j+k,13))+dp(1-l,j),md)\n end do\n end do\n else\n k = ichar(s(i:i))-48\n do j = 0, 12\n dp(l,mod(10*j+k,13)) = dp(1-l,j)\n end do\n end if\n end do\n write(*,'(i0)') dp(l,5)\n stop\nend program digits_parade", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S. Each character in S is either a digit (0, ..., 9) or ?.\n\nAmong the integers obtained by replacing each occurrence of ? with a digit, how many have a remainder of 5 when divided by 13? An integer may begin with 0.\n\nSince the answer can be enormous, print the count modulo 10^9+7.\n\nConstraints\n\nS is a string consisting of digits (0, ..., 9) and ?.\n\n1 \\leq |S| \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of integers satisfying the condition, modulo 10^9+7.\n\nSample Input 1\n\n??2??5\n\nSample Output 1\n\n768\n\nFor example, 482305, 002865, and 972665 satisfy the condition.\n\nSample Input 2\n\n?44\n\nSample Output 2\n\n1\n\nOnly 044 satisfies the condition.\n\nSample Input 3\n\n7?4\n\nSample Output 3\n\n0\n\nWe may not be able to produce an integer satisfying the condition.\n\nSample Input 4\n\n?6?42???8??2??06243????9??3???7258??5??7???????774????4?1??17???9?5?70???76???\n\nSample Output 4\n\n153716888", "sample_input": "??2??5\n"}, "reference_outputs": ["768\n"], "source_document_id": "p02960", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a string S. Each character in S is either a digit (0, ..., 9) or ?.\n\nAmong the integers obtained by replacing each occurrence of ? with a digit, how many have a remainder of 5 when divided by 13? An integer may begin with 0.\n\nSince the answer can be enormous, print the count modulo 10^9+7.\n\nConstraints\n\nS is a string consisting of digits (0, ..., 9) and ?.\n\n1 \\leq |S| \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the number of integers satisfying the condition, modulo 10^9+7.\n\nSample Input 1\n\n??2??5\n\nSample Output 1\n\n768\n\nFor example, 482305, 002865, and 972665 satisfy the condition.\n\nSample Input 2\n\n?44\n\nSample Output 2\n\n1\n\nOnly 044 satisfies the condition.\n\nSample Input 3\n\n7?4\n\nSample Output 3\n\n0\n\nWe may not be able to produce an integer satisfying the condition.\n\nSample Input 4\n\n?6?42???8??2??06243????9??3???7258??5??7???????774????4?1??17???9?5?70???76???\n\nSample Output 4\n\n153716888", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 49, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s723584989", "group_id": "codeNet:p02963", "input_text": "program AGC36_A\n integer(8)::X(3)=[0,2,0],Y(3),S\n read(*,*)S\n Y(1)=0\n Y(2)=0\n Y(3)=S\n write(*,*)X(1),Y(1),X(2),Y(2),X(3),Y(3)\nend program AGC36_A", "language": "Fortran", "metadata": {"date": 1590259677, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02963.html", "problem_id": "p02963", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02963/input.txt", "sample_output_relpath": "derived/input_output/data/p02963/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02963/Fortran/s723584989.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s723584989", "user_id": "u359178469"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "program AGC36_A\n integer(8)::X(3)=[0,2,0],Y(3),S\n read(*,*)S\n Y(1)=0\n Y(2)=0\n Y(3)=S\n write(*,*)X(1),Y(1),X(2),Y(2),X(3),Y(3)\nend program AGC36_A", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "sample_input": "3\n"}, "reference_outputs": ["1 0 2 2 0 1\n"], "source_document_id": "p02963", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s281268929", "group_id": "codeNet:p02963", "input_text": "program triangle\n implicit none\n integer(8) :: s, h, w, a, b, d\n integer(8) :: x1, y1, x2, y2, x3, y3, i\n read(*,*) s\n x1 = 0_8\n y1 = 0_8\n h = int(ceiling(sqrt(real(s,8))),8)\n w = h\n d = h*w-s\n a = 0_8\n b = 0_8\n if (d > 0_8) then\n a = int(floor(sqrt(real(d,8))),8)\n do while (a > 0_8)\n if (mod(d,a) == 0_8) exit\n a = a-1_8\n end do\n b = d/a\n end if\n x2 = a\n y2 = h\n x3 = w\n y3 = b\n write(*,'(i0,x,i0,x,i0,x,i0,x,i0,x,i0)') x1, y1, x2, y2, x3, y3\n stop\nend program triangle", "language": "Fortran", "metadata": {"date": 1563759002, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02963.html", "problem_id": "p02963", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02963/input.txt", "sample_output_relpath": "derived/input_output/data/p02963/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02963/Fortran/s281268929.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281268929", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "program triangle\n implicit none\n integer(8) :: s, h, w, a, b, d\n integer(8) :: x1, y1, x2, y2, x3, y3, i\n read(*,*) s\n x1 = 0_8\n y1 = 0_8\n h = int(ceiling(sqrt(real(s,8))),8)\n w = h\n d = h*w-s\n a = 0_8\n b = 0_8\n if (d > 0_8) then\n a = int(floor(sqrt(real(d,8))),8)\n do while (a > 0_8)\n if (mod(d,a) == 0_8) exit\n a = a-1_8\n end do\n b = d/a\n end if\n x2 = a\n y2 = h\n x3 = w\n y3 = b\n write(*,'(i0,x,i0,x,i0,x,i0,x,i0,x,i0)') x1, y1, x2, y2, x3, y3\n stop\nend program triangle", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "sample_input": "3\n"}, "reference_outputs": ["1 0 2 2 0 1\n"], "source_document_id": "p02963", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 512, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s005520313", "group_id": "codeNet:p02969", "input_text": "program aaa\nimplicit none\ninteger(8) :: r\nread*, r\nwrite(*,'(i0)') 3*r**2\nend program", "language": "Fortran", "metadata": {"date": 1569954582, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02969.html", "problem_id": "p02969", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02969/input.txt", "sample_output_relpath": "derived/input_output/data/p02969/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02969/Fortran/s005520313.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s005520313", "user_id": "u039189422"}, "prompt_components": {"gold_output": "48\n", "input_to_evaluate": "program aaa\nimplicit none\ninteger(8) :: r\nread*, r\nwrite(*,'(i0)') 3*r**2\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nr is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n48\n\nThe area of the regular dodecagon is 3 \\times 4^2 = 48.\n\nSample Input 2\n\n15\n\nSample Output 2\n\n675\n\nSample Input 3\n\n80\n\nSample Output 3\n\n19200", "sample_input": "4\n"}, "reference_outputs": ["48\n"], "source_document_id": "p02969", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nr is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n48\n\nThe area of the regular dodecagon is 3 \\times 4^2 = 48.\n\nSample Input 2\n\n15\n\nSample Output 2\n\n675\n\nSample Input 3\n\n80\n\nSample Output 3\n\n19200", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s344931191", "group_id": "codeNet:p02970", "input_text": "program main\nimplicit none\ninteger :: i, j, k\ninteger :: n, d\n\nread(*,*) n, d\ni = (n-1)/(2*d) +1\nwrite(*,'(i0)') i\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1563815675, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02970.html", "problem_id": "p02970", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02970/input.txt", "sample_output_relpath": "derived/input_output/data/p02970/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02970/Fortran/s344931191.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s344931191", "user_id": "u696547932"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, k\ninteger :: n, d\n\nread(*,*) n, d\ni = (n-1)/(2*d) +1\nwrite(*,'(i0)') i\n\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N apple trees in a row. People say that one of them will bear golden apples.\n\nWe want to deploy some number of inspectors so that each of these trees will be inspected.\n\nEach inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \\leq i \\leq N) will inspect the trees with numbers between i-D and i+D (inclusive).\n\nFind the minimum number of inspectors that we need to deploy to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq D \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\n\nOutput\n\nPrint the minimum number of inspectors that we need to deploy to achieve the objective.\n\nSample Input 1\n\n6 2\n\nSample Output 1\n\n2\n\nWe can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.\n\nSample Input 2\n\n14 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n20 4\n\nSample Output 3\n\n3", "sample_input": "6 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02970", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N apple trees in a row. People say that one of them will bear golden apples.\n\nWe want to deploy some number of inspectors so that each of these trees will be inspected.\n\nEach inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector deployed under the i-th tree (1 \\leq i \\leq N) will inspect the trees with numbers between i-D and i+D (inclusive).\n\nFind the minimum number of inspectors that we need to deploy to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq D \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\n\nOutput\n\nPrint the minimum number of inspectors that we need to deploy to achieve the objective.\n\nSample Input 1\n\n6 2\n\nSample Output 1\n\n2\n\nWe can achieve the objective by, for example, placing an inspector under Tree 3 and Tree 4.\n\nSample Input 2\n\n14 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n20 4\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s548610891", "group_id": "codeNet:p02971", "input_text": "program main\n implicit none\n integer :: n, i, largest, second\n integer, allocatable :: a(:)\n read (*, *) n\n allocate (a(n))\n read (*, *) (a(i), i = 1, n)\n largest = 0\n second = 0\n do i = 1, n\n if (a(i) > largest) then\n second = largest\n largest = a(i)\n else if (a(i) > second) then\n second = a(i)\n end if\n end do\n\n do i = 1, n\n if (a(i) == largest) then\n write (*, \"(i0)\") second\n else\n write (*, \"(i0)\") largest\n end if\n end do\nend program main\n", "language": "Fortran", "metadata": {"date": 1583463714, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02971/input.txt", "sample_output_relpath": "derived/input_output/data/p02971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02971/Fortran/s548610891.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s548610891", "user_id": "u388927326"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, largest, second\n integer, allocatable :: a(:)\n read (*, *) n\n allocate (a(n))\n read (*, *) (a(i), i = 1, n)\n largest = 0\n second = 0\n do i = 1, n\n if (a(i) > largest) then\n second = largest\n largest = a(i)\n else if (a(i) > second) then\n second = a(i)\n end if\n end do\n\n do i = 1, n\n if (a(i) == largest) then\n write (*, \"(i0)\") second\n else\n write (*, \"(i0)\") largest\n end if\n end do\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "sample_input": "3\n1\n4\n3\n"}, "reference_outputs": ["4\n3\n4\n"], "source_document_id": "p02971", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 137, "memory_kb": 2944}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s605008185", "group_id": "codeNet:p02971", "input_text": "program abc134c2\n implicit none\n integer(8) :: n, i, lowMax, ans, highmax\n integer(8), allocatable :: a(:)\n\n read(*,*) n\n allocate(a(n))\n do i = 1, n\n read(*,*) a(i)\n enddo\n\n highmax = 0\n lowMax = 0\n do i = 1, n\n if (i ==1) then\n write(*,*) maxval(a(2:n))\n lowMax = a(1)\n cycle\n else if ( i == n) then\n write(*,*) lowMax\n cycle\n endif\n\n !lowMax = max(lowmax, a(i-1))\n highmax = maxval(a(i+1:n))\n write(*,*) max(lowMax, highMax)\n lowMax = max(lowmax, a(i))\n enddo\n\nend\n", "language": "Fortran", "metadata": {"date": 1563673069, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02971/input.txt", "sample_output_relpath": "derived/input_output/data/p02971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02971/Fortran/s605008185.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s605008185", "user_id": "u210113718"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "program abc134c2\n implicit none\n integer(8) :: n, i, lowMax, ans, highmax\n integer(8), allocatable :: a(:)\n\n read(*,*) n\n allocate(a(n))\n do i = 1, n\n read(*,*) a(i)\n enddo\n\n highmax = 0\n lowMax = 0\n do i = 1, n\n if (i ==1) then\n write(*,*) maxval(a(2:n))\n lowMax = a(1)\n cycle\n else if ( i == n) then\n write(*,*) lowMax\n cycle\n endif\n\n !lowMax = max(lowmax, a(i-1))\n highmax = maxval(a(i+1:n))\n write(*,*) max(lowMax, highMax)\n lowMax = max(lowmax, a(i))\n enddo\n\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "sample_input": "3\n1\n4\n3\n"}, "reference_outputs": ["4\n3\n4\n"], "source_document_id": "p02971", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s296916417", "group_id": "codeNet:p02971", "input_text": "program c\n integer :: N,i,mx,mx1\n integer,allocatable :: A(:),left(:,:)\n read(*,*) N\n allocate(A(N))\n do i=1,N\n read(*,*) A(i)\n enddo\n allocate(left(N,2))\n mx=maxval(A)\n left(1,1)=A(1)\n left(1,2)=A(N)\n do i=2,N\n left(i,1)=max(left(i-1,1),A(i))\n left(i,2)=max(left(i-1,2),A(N-i+1))\n enddo\n\n do i=1,N\n if(mx.eq.A(i)) then\n if(i.eq.1) then\n write(*,'(i0)') left(N-1,2)\n elseif(i.eq.N) then\n write(*,'(i0)') left(N-1,1)\n else\n write(*,'(i0)') max(left(i-1,1),left(N-i,2))\n endif\n else\n write(*,'(i0)') mx\n endif\n enddo\n\nend program c", "language": "Fortran", "metadata": {"date": 1563672967, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02971/input.txt", "sample_output_relpath": "derived/input_output/data/p02971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02971/Fortran/s296916417.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s296916417", "user_id": "u613124399"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "program c\n integer :: N,i,mx,mx1\n integer,allocatable :: A(:),left(:,:)\n read(*,*) N\n allocate(A(N))\n do i=1,N\n read(*,*) A(i)\n enddo\n allocate(left(N,2))\n mx=maxval(A)\n left(1,1)=A(1)\n left(1,2)=A(N)\n do i=2,N\n left(i,1)=max(left(i-1,1),A(i))\n left(i,2)=max(left(i-1,2),A(N-i+1))\n enddo\n\n do i=1,N\n if(mx.eq.A(i)) then\n if(i.eq.1) then\n write(*,'(i0)') left(N-1,2)\n elseif(i.eq.N) then\n write(*,'(i0)') left(N-1,1)\n else\n write(*,'(i0)') max(left(i-1,1),left(N-i,2))\n endif\n else\n write(*,'(i0)') mx\n endif\n enddo\n\nend program c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "sample_input": "3\n1\n4\n3\n"}, "reference_outputs": ["4\n3\n4\n"], "source_document_id": "p02971", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 629, "cpu_time_ms": 150, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s922383850", "group_id": "codeNet:p02971", "input_text": "program abc134c\n implicit none\n integer(8) :: n, i\n integer(8), allocatable :: a(:)\n\n read(*,*) n\n allocate(a(n))\n do i = 1, n\n read(*,*) a(i)\n enddo\n\n ! i = 1\n write(*,*) maxval(a(2:n))\n\n do i = 2, n-1\n write(*,*) max(maxval(a(1:i-1)), maxval(a(i+1:n)) )\n end do\n\n ! i = n\n write(*,*) maxval(a(1:n-1))\n\n stop\nend\n", "language": "Fortran", "metadata": {"date": 1563672190, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02971/input.txt", "sample_output_relpath": "derived/input_output/data/p02971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02971/Fortran/s922383850.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s922383850", "user_id": "u210113718"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "program abc134c\n implicit none\n integer(8) :: n, i\n integer(8), allocatable :: a(:)\n\n read(*,*) n\n allocate(a(n))\n do i = 1, n\n read(*,*) a(i)\n enddo\n\n ! i = 1\n write(*,*) maxval(a(2:n))\n\n do i = 2, n-1\n write(*,*) max(maxval(a(1:i-1)), maxval(a(i+1:n)) )\n end do\n\n ! i = n\n write(*,*) maxval(a(1:n-1))\n\n stop\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "sample_input": "3\n1\n4\n3\n"}, "reference_outputs": ["4\n3\n4\n"], "source_document_id": "p02971", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s126789887", "group_id": "codeNet:p02971", "input_text": "program main\n implicit none\n integer i,N,maxA,maxA2,maxl\n integer, allocatable :: A(:)\n !read(*, *) (L(i), i = 1,N)\n read(*, *) N\n allocate(A(N))\n do i = 1,N\n read(*,*) A(i)\n end do\n maxA = maxval(A)\n do i = 1,N\n if (A(i) == maxA) then\n A(i) = 0\n maxl = i\n exit\n end if\n end do\n do i = 1,N\n if (i == maxl) then\n write(*,*) maxval(A)\n else\n write(*, *) maxA\n end if\n end do\nend program main\n", "language": "Fortran", "metadata": {"date": 1563671544, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02971/input.txt", "sample_output_relpath": "derived/input_output/data/p02971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02971/Fortran/s126789887.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126789887", "user_id": "u050276949"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "program main\n implicit none\n integer i,N,maxA,maxA2,maxl\n integer, allocatable :: A(:)\n !read(*, *) (L(i), i = 1,N)\n read(*, *) N\n allocate(A(N))\n do i = 1,N\n read(*,*) A(i)\n end do\n maxA = maxval(A)\n do i = 1,N\n if (A(i) == maxA) then\n A(i) = 0\n maxl = i\n exit\n end if\n end do\n do i = 1,N\n if (i == maxl) then\n write(*,*) maxval(A)\n else\n write(*, *) maxA\n end if\n end do\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "sample_input": "3\n1\n4\n3\n"}, "reference_outputs": ["4\n3\n4\n"], "source_document_id": "p02971", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of length N: A_1, A_2, ..., A_N.\nFor each integer i between 1 and N (inclusive), answer the following question:\n\nFind the maximum value among the N-1 elements other than A_i in the sequence.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 200000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint N lines. The i-th line (1 \\leq i \\leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.\n\nSample Input 1\n\n3\n1\n4\n3\n\nSample Output 1\n\n4\n3\n4\n\nThe maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.\n\nThe maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.\n\nThe maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.\n\nSample Input 2\n\n2\n5\n5\n\nSample Output 2\n\n5\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 132, "memory_kb": 3584}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s843568597", "group_id": "codeNet:p02972", "input_text": "program A319D\n implicit none\n integer(8)::N,calc,i,j,bcount\n integer(8),allocatable,dimension(:)::A,ans\n read*,N\n allocate(A(N))\n allocate(ans(N))\n read*,A\n ans=0\n bcount=0\n do i=0,N-1\n calc=0\n do j=1,N/(N-i)\n calc=calc+ans(j*(N-i))\n end do\n if(A(N-i)==0)then\n if(mod(calc,2)==1)then\n ans(N-i)=1\n bcount=bcount+1\n end if\n else\n if(mod(calc,2)==0)then\n ans(N-i)=1\n bcount=bcount+1\n end if\n end if\n end do\n\n print'(i0)',bcount\n do i=1,N\n if(ans(i)==1)write(*,fmt='(i0,1x)',advance='no')i\n end do\n print'(A)',\"\"\nend program A319D", "language": "Fortran", "metadata": {"date": 1584634151, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Fortran/s843568597.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s843568597", "user_id": "u414699019"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "program A319D\n implicit none\n integer(8)::N,calc,i,j,bcount\n integer(8),allocatable,dimension(:)::A,ans\n read*,N\n allocate(A(N))\n allocate(ans(N))\n read*,A\n ans=0\n bcount=0\n do i=0,N-1\n calc=0\n do j=1,N/(N-i)\n calc=calc+ans(j*(N-i))\n end do\n if(A(N-i)==0)then\n if(mod(calc,2)==1)then\n ans(N-i)=1\n bcount=bcount+1\n end if\n else\n if(mod(calc,2)==0)then\n ans(N-i)=1\n bcount=bcount+1\n end if\n end if\n end do\n\n print'(i0)',bcount\n do i=1,N\n if(ans(i)==1)write(*,fmt='(i0,1x)',advance='no')i\n end do\n print'(A)',\"\"\nend program A319D", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 735, "cpu_time_ms": 90, "memory_kb": 4480}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s513292648", "group_id": "codeNet:p02972", "input_text": "program preparing_boxes\n implicit none\n integer(4):: n, i, j\n integer(4), allocatable:: a(:), b(:)\n \n\n read*, n\n allocate(a(n), b(n))\n read*, a(:)\n b(:)=0\n do i=n, 1,-1\n if (a(i) > 1)then\n print*, -1\n stop\n else if (a(i) == 1) then\n b(i) = 1\n do j=2,nint(sqrt(dble(i)))\n if (mod(i,j) == 0) a(i/j)=a(i/j)-1\n end do\n end if\n ! print*, 'b',b(:)\n end do\n\n print*, sum(b(:))\n do i=1,n\n if (b(i)==1) write(*,'(i0,1x)', advance='no') i \n end do\nend program preparing_boxes", "language": "Fortran", "metadata": {"date": 1581572437, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Fortran/s513292648.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s513292648", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "program preparing_boxes\n implicit none\n integer(4):: n, i, j\n integer(4), allocatable:: a(:), b(:)\n \n\n read*, n\n allocate(a(n), b(n))\n read*, a(:)\n b(:)=0\n do i=n, 1,-1\n if (a(i) > 1)then\n print*, -1\n stop\n else if (a(i) == 1) then\n b(i) = 1\n do j=2,nint(sqrt(dble(i)))\n if (mod(i,j) == 0) a(i/j)=a(i/j)-1\n end do\n end if\n ! print*, 'b',b(:)\n end do\n\n print*, sum(b(:))\n do i=1,n\n if (b(i)==1) write(*,'(i0,1x)', advance='no') i \n end do\nend program preparing_boxes", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 609, "cpu_time_ms": 172, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s173777889", "group_id": "codeNet:p02972", "input_text": "integer N\ninteger,allocatable,dimension(:)::A,C\ninteger i,j,cnt\nread*,N\nallocate(A(N),C(N))\nread*,A\ncnt=0\ndo i=n,1,-1\n if(A(i)/=0)then\n cnt=cnt+1\n c=[i,c]\n do j=1,i\n if(j*j>i)exit\n if(mod(i,j)==0)then\n A(j)=xor(A(j),1)\n if(j*j/=i)A(i/j)=xor(A(i/j),1)\n endif\n end do\n endif\nend do\nprint\"(I0)\",cnt\ndo i=1,cnt\n if(i==1)then\n write(*,'(i0)', advance='no')c(i)\n else\n write(*,'(x,i0)', advance='no')c(i)\n endif\nend do\nend", "language": "Fortran", "metadata": {"date": 1563676032, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Fortran/s173777889.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s173777889", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "integer N\ninteger,allocatable,dimension(:)::A,C\ninteger i,j,cnt\nread*,N\nallocate(A(N),C(N))\nread*,A\ncnt=0\ndo i=n,1,-1\n if(A(i)/=0)then\n cnt=cnt+1\n c=[i,c]\n do j=1,i\n if(j*j>i)exit\n if(mod(i,j)==0)then\n A(j)=xor(A(j),1)\n if(j*j/=i)A(i/j)=xor(A(i/j),1)\n endif\n end do\n endif\nend do\nprint\"(I0)\",cnt\ndo i=1,cnt\n if(i==1)then\n write(*,'(i0)', advance='no')c(i)\n else\n write(*,'(x,i0)', advance='no')c(i)\n endif\nend do\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 464, "cpu_time_ms": 2103, "memory_kb": 3072}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s332831076", "group_id": "codeNet:p02972", "input_text": "program main\n implicit none\n integer i,N,i2,ball,j,t\n integer,allocatable :: a(:),b(:),b2(:)\n !read(*, *) (L(i), i = 1,N)\n read(*, *) N\n allocate(a(N))\n allocate(b(N))\n allocate(b2(N))\n read(*, *) (a(i), i = 1,N)\n b2 = a\n t = 1\n do i = 1,N\n i2 = N-i+1\n ball = 0\n do j = 1,N/i2\n ball = ball+b2(i2*j)\n end do\n !b(i2) = mod(ball,2)\n ball = mod(ball,2)\n b2(i2) = ball\n if (ball == 1) then\n b(t) = i2\n t = t+1\n end if\n end do\n write(*, *) t-1\n if (t /= 1) then\n write(*, *) b(1:t-1)\n end if\nend program main\n", "language": "Fortran", "metadata": {"date": 1563673462, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Fortran/s332831076.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s332831076", "user_id": "u050276949"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "program main\n implicit none\n integer i,N,i2,ball,j,t\n integer,allocatable :: a(:),b(:),b2(:)\n !read(*, *) (L(i), i = 1,N)\n read(*, *) N\n allocate(a(N))\n allocate(b(N))\n allocate(b2(N))\n read(*, *) (a(i), i = 1,N)\n b2 = a\n t = 1\n do i = 1,N\n i2 = N-i+1\n ball = 0\n do j = 1,N/i2\n ball = ball+b2(i2*j)\n end do\n !b(i2) = mod(ball,2)\n ball = mod(ball,2)\n b2(i2) = ball\n if (ball == 1) then\n b(t) = i2\n t = t+1\n end if\n end do\n write(*, *) t-1\n if (t /= 1) then\n write(*, *) b(1:t-1)\n end if\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 57, "memory_kb": 4608}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s097952623", "group_id": "codeNet:p02973", "input_text": "program sequence_decomposing\n implicit none\n integer(4):: n,i,c,cmax\n integer(8):: a1,a2\n\n read*,n\n read*,a1\n c=0\n cmax=0\n do i=1,n-1\n read*, a2\n\n if (a2 <= a1)then\n c=c+1\n else\n c=0\n end if\n cmax=max(cmax,c)\n a1=a2\n end do\n\n print*,cmax+1\n\n\n\n\nend program sequence_decomposing", "language": "Fortran", "metadata": {"date": 1581747609, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02973.html", "problem_id": "p02973", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02973/input.txt", "sample_output_relpath": "derived/input_output/data/p02973/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02973/Fortran/s097952623.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s097952623", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sequence_decomposing\n implicit none\n integer(4):: n,i,c,cmax\n integer(8):: a1,a2\n\n read*,n\n read*,a1\n c=0\n cmax=0\n do i=1,n-1\n read*, a2\n\n if (a2 <= a1)then\n c=c+1\n else\n c=0\n end if\n cmax=max(cmax,c)\n a1=a2\n end do\n\n print*,cmax+1\n\n\n\n\nend program sequence_decomposing", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence with N integers: A = \\{ A_1, A_2, \\cdots, A_N \\}.\nFor each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:\n\nIf A_i and A_j (i < j) are painted with the same color, A_i < A_j.\n\nFind the minimum number of colors required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the minimum number of colors required to satisfy the condition.\n\nSample Input 1\n\n5\n2\n1\n4\n5\n3\n\nSample Output 1\n\n2\n\nWe can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.\n\nSample Input 2\n\n4\n0\n0\n0\n0\n\nSample Output 2\n\n4\n\nWe have to paint all the integers with distinct colors.", "sample_input": "5\n2\n1\n4\n5\n3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02973", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence with N integers: A = \\{ A_1, A_2, \\cdots, A_N \\}.\nFor each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:\n\nIf A_i and A_j (i < j) are painted with the same color, A_i < A_j.\n\nFind the minimum number of colors required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the minimum number of colors required to satisfy the condition.\n\nSample Input 1\n\n5\n2\n1\n4\n5\n3\n\nSample Output 1\n\n2\n\nWe can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.\n\nSample Input 2\n\n4\n0\n0\n0\n0\n\nSample Output 2\n\n4\n\nWe have to paint all the integers with distinct colors.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 44, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s985152712", "group_id": "codeNet:p02973", "input_text": "program main\n implicit none\n integer n,val,ind,i,j\n integer, allocatable::a(:)\n read(*,*) n\n allocate(a(1:n))\n do i=1,n\n a(i) = -1\n end do\n read(*,*) val\n ind = 1\n a(1) = val\n do i=2,n\n read(*,*) val\n if(a(ind) >= val) then\n a(ind+1) = val\n ind = ind+1\n else\n do j=1,ind\n if(a(j) < val) then\n a(j) = val\n exit\n end if\n end do\n end if\n end do\n write(*,*) ind\nend program main", "language": "Fortran", "metadata": {"date": 1563675773, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02973.html", "problem_id": "p02973", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02973/input.txt", "sample_output_relpath": "derived/input_output/data/p02973/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02973/Fortran/s985152712.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985152712", "user_id": "u671401989"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n,val,ind,i,j\n integer, allocatable::a(:)\n read(*,*) n\n allocate(a(1:n))\n do i=1,n\n a(i) = -1\n end do\n read(*,*) val\n ind = 1\n a(1) = val\n do i=2,n\n read(*,*) val\n if(a(ind) >= val) then\n a(ind+1) = val\n ind = ind+1\n else\n do j=1,ind\n if(a(j) < val) then\n a(j) = val\n exit\n end if\n end do\n end if\n end do\n write(*,*) ind\nend program main", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence with N integers: A = \\{ A_1, A_2, \\cdots, A_N \\}.\nFor each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:\n\nIf A_i and A_j (i < j) are painted with the same color, A_i < A_j.\n\nFind the minimum number of colors required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the minimum number of colors required to satisfy the condition.\n\nSample Input 1\n\n5\n2\n1\n4\n5\n3\n\nSample Output 1\n\n2\n\nWe can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.\n\nSample Input 2\n\n4\n0\n0\n0\n0\n\nSample Output 2\n\n4\n\nWe have to paint all the integers with distinct colors.", "sample_input": "5\n2\n1\n4\n5\n3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02973", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence with N integers: A = \\{ A_1, A_2, \\cdots, A_N \\}.\nFor each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:\n\nIf A_i and A_j (i < j) are painted with the same color, A_i < A_j.\n\nFind the minimum number of colors required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the minimum number of colors required to satisfy the condition.\n\nSample Input 1\n\n5\n2\n1\n4\n5\n3\n\nSample Output 1\n\n2\n\nWe can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.\n\nSample Input 2\n\n4\n0\n0\n0\n0\n\nSample Output 2\n\n4\n\nWe have to paint all the integers with distinct colors.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 830, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s996805119", "group_id": "codeNet:p02975", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,n1,n2\n integer(int32), allocatable:: a(:)\n\n read*, n\n\n \n\n n1 = n/3\n n2 = 2*n1\n allocate(a(n))\n read*, a(:)\n call merge_sort(a,1,n)\n if (a(n)==0) then\n print'(a)', 'Yes'\n stop\n end if\n if (mod(n,3) /= 0) then\n print'(a)', 'No'\n stop\n end if\n\n if (a(n1) == 0 .and. a(n1+1) > 0 .and. a(n1+1) == a(n)) then\n print'(a)', 'Yes'\n stop\n end if\n\n if (a(1)==(a(n1)) .and. a(n1+1)==a(n2) .and. a(n2+1)==a(n)) then\n if (xor(a(1),a(n1+1)) == a(n2+1)) then\n print'(a)', 'Yes'\n stop\n end if\n end if\n\n print'(a)', 'No'\ncontains\n recursive subroutine merge_sort(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call merge_sort(ar, fst, mdl)\n call merge_sort(ar, mdl+1, lst)\n call merge_(ar, fst, mdl, lst)\n end subroutine\n\n subroutine merge_(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n subroutine swap(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\nend program name", "language": "Fortran", "metadata": {"date": 1588041039, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02975/input.txt", "sample_output_relpath": "derived/input_output/data/p02975/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02975/Fortran/s996805119.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996805119", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,n1,n2\n integer(int32), allocatable:: a(:)\n\n read*, n\n\n \n\n n1 = n/3\n n2 = 2*n1\n allocate(a(n))\n read*, a(:)\n call merge_sort(a,1,n)\n if (a(n)==0) then\n print'(a)', 'Yes'\n stop\n end if\n if (mod(n,3) /= 0) then\n print'(a)', 'No'\n stop\n end if\n\n if (a(n1) == 0 .and. a(n1+1) > 0 .and. a(n1+1) == a(n)) then\n print'(a)', 'Yes'\n stop\n end if\n\n if (a(1)==(a(n1)) .and. a(n1+1)==a(n2) .and. a(n2+1)==a(n)) then\n if (xor(a(1),a(n1+1)) == a(n2+1)) then\n print'(a)', 'Yes'\n stop\n end if\n end if\n\n print'(a)', 'No'\ncontains\n recursive subroutine merge_sort(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call merge_sort(ar, fst, mdl)\n call merge_sort(ar, mdl+1, lst)\n call merge_(ar, fst, mdl, lst)\n end subroutine\n\n subroutine merge_(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n subroutine swap(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2137, "cpu_time_ms": 40, "memory_kb": 1724}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s764451869", "group_id": "codeNet:p02975", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,t\n integer(int32), allocatable:: a(:)\n\n read*, n\n\n if (mod(n,3) /= 0) then\n print'(a)', 'No'\n stop\n end if\n\n allocate(a(n))\n read*, a(:)\n call merge_sort(a,1,n)\n\n t=1\n do i=1,n-1\n if (a(i) == a(i+1)) cycle\n if (n/3*t==i) then\n t=t+1\n else\n print'(a)', 'No'\n stop\n end if\n end do\n\n print'(a)', 'Yes'\n\n\n\n\ncontains\n recursive subroutine merge_sort(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call merge_sort(ar, fst, mdl)\n call merge_sort(ar, mdl+1, lst)\n call merge_(ar, fst, mdl, lst)\n end subroutine\n\n subroutine merge_(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n subroutine swap(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\nend program name", "language": "Fortran", "metadata": {"date": 1588012913, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02975/input.txt", "sample_output_relpath": "derived/input_output/data/p02975/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02975/Fortran/s764451869.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s764451869", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,t\n integer(int32), allocatable:: a(:)\n\n read*, n\n\n if (mod(n,3) /= 0) then\n print'(a)', 'No'\n stop\n end if\n\n allocate(a(n))\n read*, a(:)\n call merge_sort(a,1,n)\n\n t=1\n do i=1,n-1\n if (a(i) == a(i+1)) cycle\n if (n/3*t==i) then\n t=t+1\n else\n print'(a)', 'No'\n stop\n end if\n end do\n\n print'(a)', 'Yes'\n\n\n\n\ncontains\n recursive subroutine merge_sort(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call merge_sort(ar, fst, mdl)\n call merge_sort(ar, mdl+1, lst)\n call merge_(ar, fst, mdl, lst)\n end subroutine\n\n subroutine merge_(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n subroutine swap(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1918, "cpu_time_ms": 40, "memory_kb": 1724}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s417094017", "group_id": "codeNet:p02981", "input_text": "program kadai\nimplicit none\ninteger :: n,a,b\ninteger :: ans\n\nread(*,*) n,a,b\n\nif (n*a>b) then\n ans=b\nelse\n ans=n*a\nend if\nwrite(*,*) ans\n\n\nstop\n\nend program kadai", "language": "Fortran", "metadata": {"date": 1562550813, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02981.html", "problem_id": "p02981", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02981/input.txt", "sample_output_relpath": "derived/input_output/data/p02981/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02981/Fortran/s417094017.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417094017", "user_id": "u286754585"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program kadai\nimplicit none\ninteger :: n,a,b\ninteger :: ans\n\nread(*,*) n,a,b\n\nif (n*a>b) then\n ans=b\nelse\n ans=n*a\nend if\nwrite(*,*) ans\n\n\nstop\n\nend program kadai", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 172, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s926567080", "group_id": "codeNet:p02982", "input_text": "module ABC133\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n private :: calc_distance2\n private :: is_GoodDistance\n\n ! variables for this \n integer(INT32) :: num_point_all\n integer(INT32) :: num_point_GD\n integer(INT32) :: val_dimension\n\n ! arrays for this \n integer(INT32), dimension(:,:), allocatable :: coordinate\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! support variables for this \n integer(INT32) :: itr\n integer(INT32) :: itr_orign, itr_target\n\n ! STEP.01\n ! read out the given data (1/2)\n read(unit=INPUT_UNIT, fmt=*) num_point_all, val_dimension\n\n ! STEP.02\n ! allocate the array to store the data of the points\n allocate( coordinate(1:val_dimension, 1:num_point_all) )\n\n ! STEP.03\n ! read out the given data (1/2)\n do itr = 1, num_point_all, 1\n read(unit=INPUT_UNIT, fmt=*) coordinate(:, itr)\n end do\n\n ! STEP.04\n ! calculate the answer of this task\n num_point_GD = 0_INT32\n\n do itr_orign = 1, num_point_all, 1\n do itr_target = itr_orign + 1, num_point_all, 1\n\n if ( is_GoodDistance( calc_distance2( coordinate(:, itr_orign), coordinate(:, itr_target) ) ) ) then\n num_point_GD = num_point_GD + 1_INT32\n else\n continue\n end if\n\n end do\n end do\n\n ! STEP.05\n ! output the answer of this task\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') num_point_GD\n\n ! STEP.06\n ! deallocate the array to store the data of the points\n deallocate( coordinate )\n\n ! STEP.END\n return\n\n end subroutine task_B\n\n pure function calc_distance2 (coordinate_orign, coordinate_target) result(distance)\n\n ! arguments for this \n integer(INT32), dimension(1:val_dimension), intent(in) :: coordinate_orign\n integer(INT32), dimension(1:val_dimension), intent(in) :: coordinate_target\n\n ! return value of this \n integer(INT32) :: distance\n\n ! support variables for this \n integer(INT32) :: difference\n integer(INT32) :: itr\n\n distance = 0_INT32\n\n do itr = 1, val_dimension, 1\n difference = coordinate_target(itr) - coordinate_orign(itr)\n distance = distance + difference * difference\n end do\n\n return\n\n end function calc_distance2\n\n pure function is_GoodDistance (val_distance) result(stat)\n\n ! arguments for this \n integer(INT32), intent(in) :: val_distance\n\n ! return value of this \n logical :: stat\n\n ! support variables for this \n integer(INT32) :: itr, itr2\n\n stat = .false.\n\n do itr = 0_INT32, val_distance, 1_INT32\n\n itr2 = itr * itr\n\n if (itr2 .eq. val_distance) then\n stat = .true.\n exit\n end if\n\n end do\n\n return\n\n end function is_GoodDistance\n\nend module ABC133\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC133\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "language": "Fortran", "metadata": {"date": 1562637136, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02982.html", "problem_id": "p02982", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02982/input.txt", "sample_output_relpath": "derived/input_output/data/p02982/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02982/Fortran/s926567080.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926567080", "user_id": "u484703930"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module ABC133\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n private :: calc_distance2\n private :: is_GoodDistance\n\n ! variables for this \n integer(INT32) :: num_point_all\n integer(INT32) :: num_point_GD\n integer(INT32) :: val_dimension\n\n ! arrays for this \n integer(INT32), dimension(:,:), allocatable :: coordinate\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! support variables for this \n integer(INT32) :: itr\n integer(INT32) :: itr_orign, itr_target\n\n ! STEP.01\n ! read out the given data (1/2)\n read(unit=INPUT_UNIT, fmt=*) num_point_all, val_dimension\n\n ! STEP.02\n ! allocate the array to store the data of the points\n allocate( coordinate(1:val_dimension, 1:num_point_all) )\n\n ! STEP.03\n ! read out the given data (1/2)\n do itr = 1, num_point_all, 1\n read(unit=INPUT_UNIT, fmt=*) coordinate(:, itr)\n end do\n\n ! STEP.04\n ! calculate the answer of this task\n num_point_GD = 0_INT32\n\n do itr_orign = 1, num_point_all, 1\n do itr_target = itr_orign + 1, num_point_all, 1\n\n if ( is_GoodDistance( calc_distance2( coordinate(:, itr_orign), coordinate(:, itr_target) ) ) ) then\n num_point_GD = num_point_GD + 1_INT32\n else\n continue\n end if\n\n end do\n end do\n\n ! STEP.05\n ! output the answer of this task\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') num_point_GD\n\n ! STEP.06\n ! deallocate the array to store the data of the points\n deallocate( coordinate )\n\n ! STEP.END\n return\n\n end subroutine task_B\n\n pure function calc_distance2 (coordinate_orign, coordinate_target) result(distance)\n\n ! arguments for this \n integer(INT32), dimension(1:val_dimension), intent(in) :: coordinate_orign\n integer(INT32), dimension(1:val_dimension), intent(in) :: coordinate_target\n\n ! return value of this \n integer(INT32) :: distance\n\n ! support variables for this \n integer(INT32) :: difference\n integer(INT32) :: itr\n\n distance = 0_INT32\n\n do itr = 1, val_dimension, 1\n difference = coordinate_target(itr) - coordinate_orign(itr)\n distance = distance + difference * difference\n end do\n\n return\n\n end function calc_distance2\n\n pure function is_GoodDistance (val_distance) result(stat)\n\n ! arguments for this \n integer(INT32), intent(in) :: val_distance\n\n ! return value of this \n logical :: stat\n\n ! support variables for this \n integer(INT32) :: itr, itr2\n\n stat = .false.\n\n do itr = 0_INT32, val_distance, 1_INT32\n\n itr2 = itr * itr\n\n if (itr2 .eq. val_distance) then\n stat = .true.\n exit\n end if\n\n end do\n\n return\n\n end function is_GoodDistance\n\nend module ABC133\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC133\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3189, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s742793596", "group_id": "codeNet:p02984", "input_text": "program abc133d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer :: n, i\n integer(int64) :: x\n integer,dimension(:),allocatable :: a, ans\n integer,dimension(:,:),allocatable :: b\n\n read *, n\n allocate(a(n),ans(n))\n read *, a\n b = reshape(a(2:),[2,n/2])\n x = sum(a) - sum(b(1,:)) * 2\n ans(1) = x\n do i = 1,n-1\n x = a(i) * 2 - x\n ans(i+1) = x\n end do\n print *, ans\nend program abc133d\n", "language": "Fortran", "metadata": {"date": 1562910670, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02984.html", "problem_id": "p02984", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02984/input.txt", "sample_output_relpath": "derived/input_output/data/p02984/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02984/Fortran/s742793596.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742793596", "user_id": "u081445141"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "program abc133d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer :: n, i\n integer(int64) :: x\n integer,dimension(:),allocatable :: a, ans\n integer,dimension(:,:),allocatable :: b\n\n read *, n\n allocate(a(n),ans(n))\n read *, a\n b = reshape(a(2:),[2,n/2])\n x = sum(a) - sum(b(1,:)) * 2\n ans(1) = x\n do i = 1,n-1\n x = a(i) * 2 - x\n ans(i+1) = x\n end do\n print *, ans\nend program abc133d\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "sample_input": "3\n2 2 4\n"}, "reference_outputs": ["4 0 4\n"], "source_document_id": "p02984", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 415, "cpu_time_ms": 61, "memory_kb": 3712}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s727934010", "group_id": "codeNet:p02984", "input_text": "program main\n implicit none\n integer(8) i,N,n_min,j,t1\n integer(8),allocatable :: A(:)\n integer(8),allocatable :: rain(:)\n integer,allocatable :: V(:,:)\n read(*, *) N\n allocate(A(N))\n allocate(rain(N))\n allocate(V(N,N))\n read(*, *) (A(i), i = 1,N)\n V = 1\n do i = 1,N\n do j = 1,(N-1)/2\n if (i+2*j-1>N) then\n t1 = mod(i+2*j-1,N)\n else \n t1 = i+2*j-1\n end if\n V(i,t1) = -1\n end do\n end do\n rain = 0\n do i = 1,N\n do j = 1,N\n rain(i) = rain(i) + A(j)*V(i,j)\n end do\n end do\n rain = rain\n write(*,*) rain\nend program main\n", "language": "Fortran", "metadata": {"date": 1562552307, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02984.html", "problem_id": "p02984", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02984/input.txt", "sample_output_relpath": "derived/input_output/data/p02984/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02984/Fortran/s727934010.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s727934010", "user_id": "u050276949"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "program main\n implicit none\n integer(8) i,N,n_min,j,t1\n integer(8),allocatable :: A(:)\n integer(8),allocatable :: rain(:)\n integer,allocatable :: V(:,:)\n read(*, *) N\n allocate(A(N))\n allocate(rain(N))\n allocate(V(N,N))\n read(*, *) (A(i), i = 1,N)\n V = 1\n do i = 1,N\n do j = 1,(N-1)/2\n if (i+2*j-1>N) then\n t1 = mod(i+2*j-1,N)\n else \n t1 = i+2*j-1\n end if\n V(i,t1) = -1\n end do\n end do\n rain = 0\n do i = 1,N\n do j = 1,N\n rain(i) = rain(i) + A(j)*V(i,j)\n end do\n end do\n rain = rain\n write(*,*) rain\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "sample_input": "3\n2 2 4\n"}, "reference_outputs": ["4 0 4\n"], "source_document_id": "p02984", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N integers representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 585, "cpu_time_ms": 179, "memory_kb": 74368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s265712885", "group_id": "codeNet:p02987", "input_text": "program fifty_fifty\n implicit none\n integer(4):: i,ai,alphabet_counts(26) = 0, count\n character(4):: s\n\n read*, s\n\n do i=1,4\n ai=ichar(s(i:i))-64\n alphabet_counts(ai)=alphabet_counts(ai)+1\n end do\n\n do i=1,26\n count = alphabet_counts(i)\n if (count /= 2 .and. count/= 0) then\n print*, 'No'\n stop\n end if\n end do\n\n print*, 'Yes'\nend program fifty_fifty", "language": "Fortran", "metadata": {"date": 1582035075, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Fortran/s265712885.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s265712885", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program fifty_fifty\n implicit none\n integer(4):: i,ai,alphabet_counts(26) = 0, count\n character(4):: s\n\n read*, s\n\n do i=1,4\n ai=ichar(s(i:i))-64\n alphabet_counts(ai)=alphabet_counts(ai)+1\n end do\n\n do i=1,26\n count = alphabet_counts(i)\n if (count /= 2 .and. count/= 0) then\n print*, 'No'\n stop\n end if\n end do\n\n print*, 'Yes'\nend program fifty_fifty", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 434, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s189398088", "group_id": "codeNet:p02987", "input_text": "program aaa\nimplicit none\n\ninteger :: one, two, three, four\ninteger :: a, b, c\ncharacter(4) :: s\n\nread*, s\n\none=iachar(s(1:1)) + 1000\ntwo=iachar(s(2:2)) + 1000\nthree=iachar(s(3:3))+ 1000\nfour=iachar(s(4:4)) + 1000\n\na=(one-two)+(three-four)\nb=(one-three)+(two-four)\nc=(one-four)+(two-three)\n\nif(a==0.or.b==0.or.c==0) then\nwrite(*,'(a3)') 'Yes'\nelse\nwrite(*,'(a2)') 'No'\nend if\nend program", "language": "Fortran", "metadata": {"date": 1570209975, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Fortran/s189398088.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s189398088", "user_id": "u039189422"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program aaa\nimplicit none\n\ninteger :: one, two, three, four\ninteger :: a, b, c\ncharacter(4) :: s\n\nread*, s\n\none=iachar(s(1:1)) + 1000\ntwo=iachar(s(2:2)) + 1000\nthree=iachar(s(3:3))+ 1000\nfour=iachar(s(4:4)) + 1000\n\na=(one-two)+(three-four)\nb=(one-three)+(two-four)\nc=(one-four)+(two-three)\n\nif(a==0.or.b==0.or.c==0) then\nwrite(*,'(a3)') 'Yes'\nelse\nwrite(*,'(a2)') 'No'\nend if\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 389, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s823732808", "group_id": "codeNet:p02987", "input_text": "program main\n implicit none\n character(4) S\n integer i,j,ans,x\n !read(*, *) (L(i), i = 1,N)\n read(*, *) S\n ans = 1\n do i = 1,4\n x = 0\n do j = 1,4\n if(S(i:i) == S(j:j)) then\n x = x + 1\n end if\n \n end do\n if(x < 2) then\n ans = 0\n end if\n end do\n \n if (ans == 0) then\n write(*, *) 'No'\n else\n write(*, *) 'Yes'\n end if\nend program main\n", "language": "Fortran", "metadata": {"date": 1561857098, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Fortran/s823732808.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s823732808", "user_id": "u050276949"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n character(4) S\n integer i,j,ans,x\n !read(*, *) (L(i), i = 1,N)\n read(*, *) S\n ans = 1\n do i = 1,4\n x = 0\n do j = 1,4\n if(S(i:i) == S(j:j)) then\n x = x + 1\n end if\n \n end do\n if(x < 2) then\n ans = 0\n end if\n end do\n \n if (ans == 0) then\n write(*, *) 'No'\n else\n write(*, *) 'Yes'\n end if\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s141605809", "group_id": "codeNet:p02987", "input_text": "program fifty_fifty\n implicit none\n character(4) :: s\n integer :: a(26), i\n a = 0\n read(*,*) s\n do i = 1, 4\n a(ichar(s(i:i))-64) = a(ichar(s(i:i))-64)+1\n end do\n if (maxval(a).eq.2.and.minval(a,a.gt.0).eq.2) then\n write(*,'(a)') \"Yes\"\n else\n write(*,'(a)') \"No\"\n end if\n stop\nend program fifty_fifty", "language": "Fortran", "metadata": {"date": 1561856656, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02987.html", "problem_id": "p02987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02987/input.txt", "sample_output_relpath": "derived/input_output/data/p02987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02987/Fortran/s141605809.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141605809", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program fifty_fifty\n implicit none\n character(4) :: s\n integer :: a(26), i\n a = 0\n read(*,*) s\n do i = 1, 4\n a(ichar(s(i:i))-64) = a(ichar(s(i:i))-64)+1\n end do\n if (maxval(a).eq.2.and.minval(a,a.gt.0).eq.2) then\n write(*,'(a)') \"Yes\"\n else\n write(*,'(a)') \"No\"\n end if\n stop\nend program fifty_fifty", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s700339027", "group_id": "codeNet:p02988", "input_text": "program ABC132B\n implicit none\n integer::n,i,ans=0\n integer,allocatable::P(:)\n read*,n\n allocate(P(n))\n read*,P\n do i=1,n-2\n if(P(i+1)/=maxval(P(i:i+2)).and.P(i+1)/=minval(P(i:i+2)))ans=ans+1\n end do\n print'(i0)',ans\nend program ABC132B", "language": "Fortran", "metadata": {"date": 1597358056, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02988.html", "problem_id": "p02988", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02988/input.txt", "sample_output_relpath": "derived/input_output/data/p02988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02988/Fortran/s700339027.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s700339027", "user_id": "u414699019"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ABC132B\n implicit none\n integer::n,i,ans=0\n integer,allocatable::P(:)\n read*,n\n allocate(P(n))\n read*,P\n do i=1,n-2\n if(P(i+1)/=maxval(P(i:i+2)).and.P(i+1)/=minval(P(i:i+2)))ans=ans+1\n end do\n print'(i0)',ans\nend program ABC132B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2904}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s194923628", "group_id": "codeNet:p02988", "input_text": "integer :: n,p(20)\ninteger :: i,ans\n\nread*,n\nread*,p(1:n)\n\nans = 0\n\ndo i = 2,n-1\n if( (p(i-1)p(i) .and. p(i)>p(i+1))) ans = ans + 1\nend do\nprint*,ans\nend program\n", "language": "Fortran", "metadata": {"date": 1589424487, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02988.html", "problem_id": "p02988", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02988/input.txt", "sample_output_relpath": "derived/input_output/data/p02988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02988/Fortran/s194923628.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s194923628", "user_id": "u171356453"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "integer :: n,p(20)\ninteger :: i,ans\n\nread*,n\nread*,p(1:n)\n\nans = 0\n\ndo i = 2,n-1\n if( (p(i-1)p(i) .and. p(i)>p(i+1))) ans = ans + 1\nend do\nprint*,ans\nend program\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 3, "memory_kb": 2792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s996401541", "group_id": "codeNet:p02989", "input_text": "program Divide_the_problems\n implicit none\n integer(4):: n\n integer(4),allocatable:: d(:)\n\n read*, n\n allocate(d(n))\n read*, d(:)\n\n call merge_sort(d,1,n)\n print*, d(n/2+1)-d(n/2)\ncontains\n recursive subroutine merge_sort(ar, fst, lst)\n integer(4),intent(inout):: ar(:)\n integer(4),intent(in):: fst,lst\n integer(4):: mdl\n\n if (lst - fst < 2) then\n if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call merge_sort(ar,fst,mdl)\n call merge_sort(ar,mdl+1,lst)\n call merge_(ar,fst,mdl,lst)\n end subroutine\n\n subroutine merge_(ar,fst,mdl,lst)\n integer(4),intent(inout):: ar(:)\n integer(4),intent(in):: fst,mdl,lst\n integer(4),allocatable:: tmp(:)\n integer(4):: li,ri,ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap(x,y)\n integer(4),intent(inout):: x,y\n integer(4):: t\n t=x\n x=y\n y=t\n end subroutine\nend program Divide_the_problems", "language": "Fortran", "metadata": {"date": 1585966193, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/Fortran/s996401541.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996401541", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program Divide_the_problems\n implicit none\n integer(4):: n\n integer(4),allocatable:: d(:)\n\n read*, n\n allocate(d(n))\n read*, d(:)\n\n call merge_sort(d,1,n)\n print*, d(n/2+1)-d(n/2)\ncontains\n recursive subroutine merge_sort(ar, fst, lst)\n integer(4),intent(inout):: ar(:)\n integer(4),intent(in):: fst,lst\n integer(4):: mdl\n\n if (lst - fst < 2) then\n if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call merge_sort(ar,fst,mdl)\n call merge_sort(ar,mdl+1,lst)\n call merge_(ar,fst,mdl,lst)\n end subroutine\n\n subroutine merge_(ar,fst,mdl,lst)\n integer(4),intent(inout):: ar(:)\n integer(4),intent(in):: fst,mdl,lst\n integer(4),allocatable:: tmp(:)\n integer(4):: li,ri,ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap(x,y)\n integer(4),intent(inout):: x,y\n integer(4):: t\n t=x\n x=y\n y=t\n end subroutine\nend program Divide_the_problems", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1570, "cpu_time_ms": 40, "memory_kb": 1724}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s981734782", "group_id": "codeNet:p02989", "input_text": "program abc132c\n implicit none\n\n integer :: n, diff\n integer, allocatable :: d(:)\n\n read(*,*) n\n allocate( d(n) )\n read(*,*) d(:)\n\n call heapsort(n, d(:))\n\n diff = d(n/2+1) - d(n/2)\n print *, diff\n deallocate( d )\n stop\n\ncontains\n\n subroutine heapsort(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n\n integer ::i,k,j,l\n integer :: t\n\n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\n end subroutine heapsort\n\nend program abc132c\n", "language": "Fortran", "metadata": {"date": 1561858868, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/Fortran/s981734782.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981734782", "user_id": "u210113718"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program abc132c\n implicit none\n\n integer :: n, diff\n integer, allocatable :: d(:)\n\n read(*,*) n\n allocate( d(n) )\n read(*,*) d(:)\n\n call heapsort(n, d(:))\n\n diff = d(n/2+1) - d(n/2)\n print *, diff\n deallocate( d )\n stop\n\ncontains\n\n subroutine heapsort(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n\n integer ::i,k,j,l\n integer :: t\n\n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\n end subroutine heapsort\n\nend program abc132c\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1155, "cpu_time_ms": 35, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s936826289", "group_id": "codeNet:p02990", "input_text": "program main\n implicit none\n integer(8) :: n, k, i, m, res\n read (*, *) n, k\n m = 10 ** 9 + 7\n do i = 1, k\n if (n - k - i + 1 < 0) then\n res = 0\n else\n res = combi(k - 1, k - i, m) * combi(n - k + 1, n - k - i + 1, m)\n res = mod(res, m)\n end if\n write (*, \"(i0)\") res\n end do\n contains\n\n function combi(n, k, m)\n implicit none\n integer(8), intent(in) :: n, k, m\n integer(8) :: combi, numera, denomi\n numera = perm(n, k, m)\n denomi = mod(fact(k, m), m)\n combi = mod(numera * inv(denomi, m), m)\n end function combi\n\n function perm(n, k, m)\n integer(8), intent(in) :: n, k, m\n integer(8) :: i, perm\n perm = 1\n do i = n, n - k + 1, -1\n perm = mod(perm * i, m)\n end do\n end function perm\n\n function fact(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: i, fact\n fact = 1\n do i = 1, n\n fact = mod(fact * i, m)\n end do\n end function fact\n\n function inv(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: inv\n inv = pow(n, m - 2, m)\n end function inv\n\n recursive function pow(n, p, m) result(res)\n implicit none\n integer(8), intent(in) :: n, p, m\n integer(8) :: res\n if (p == 0) then\n res = 1\n else if (mod(p, 2_8) == 0) then\n res = mod(pow(n, p / 2, m) ** 2, m)\n else\n res = mod(pow(n, p - 1, m) * n, m)\n end if\n end function pow\nend program main\n", "language": "Fortran", "metadata": {"date": 1585600234, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Fortran/s936826289.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s936826289", "user_id": "u388927326"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: n, k, i, m, res\n read (*, *) n, k\n m = 10 ** 9 + 7\n do i = 1, k\n if (n - k - i + 1 < 0) then\n res = 0\n else\n res = combi(k - 1, k - i, m) * combi(n - k + 1, n - k - i + 1, m)\n res = mod(res, m)\n end if\n write (*, \"(i0)\") res\n end do\n contains\n\n function combi(n, k, m)\n implicit none\n integer(8), intent(in) :: n, k, m\n integer(8) :: combi, numera, denomi\n numera = perm(n, k, m)\n denomi = mod(fact(k, m), m)\n combi = mod(numera * inv(denomi, m), m)\n end function combi\n\n function perm(n, k, m)\n integer(8), intent(in) :: n, k, m\n integer(8) :: i, perm\n perm = 1\n do i = n, n - k + 1, -1\n perm = mod(perm * i, m)\n end do\n end function perm\n\n function fact(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: i, fact\n fact = 1\n do i = 1, n\n fact = mod(fact * i, m)\n end do\n end function fact\n\n function inv(n, m)\n implicit none\n integer(8), intent(in) :: n, m\n integer(8) :: inv\n inv = pow(n, m - 2, m)\n end function inv\n\n recursive function pow(n, p, m) result(res)\n implicit none\n integer(8), intent(in) :: n, p, m\n integer(8) :: res\n if (p == 0) then\n res = 1\n else if (mod(p, 2_8) == 0) then\n res = mod(pow(n, p / 2, m) ** 2, m)\n else\n res = mod(pow(n, p - 1, m) * n, m)\n end if\n end function pow\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1429, "cpu_time_ms": 31, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s198080617", "group_id": "codeNet:p02990", "input_text": "program BlueandRedBalls\n implicit none\n integer(8):: n, k, i\n integer(8), allocatable:: frac(:), ifrac(:)\n integer(8), parameter:: md = 1000000007\n\n read*, n, k\n\n call make_frac()\n\n do i=1,k\n print*, mod(comb(n-k+1,i)*comb(k-1,i-1),md)\n end do\n\n\ncontains\n\nfunction comb(a,b) result(ret)\n integer(8):: a,b\n integer(8):: ret\n\n ret = mod(mod(frac(a)*ifrac(b), md)*ifrac(a-b),md)\nend function\n\n\nsubroutine make_frac\n integer(8):: i\n allocate(frac(0:n), ifrac(0:n))\n\n frac(0) = 1\n ifrac(0) = 1\n\n do i=1,n\n frac(i) = mod(frac(i-1)*i, md)\n ifrac(i) = inv(frac(i))\n end do\nend subroutine\n\n\nfunction inv(x) result(ret)\n integer(8):: x, ret\n integer(8):: num, mul, pow\n\n num = md-2\n mul = x\n ret = 1\n\n do while (num >= 1)\n if (mod(num,2) == 1) then\n ret = mod(ret * mul, md)\n end if\n num=num/2\n mul=mod(mul*mul, md)\n end do\nend function\nend program BlueandRedBalls", "language": "Fortran", "metadata": {"date": 1585147124, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Fortran/s198080617.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198080617", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "program BlueandRedBalls\n implicit none\n integer(8):: n, k, i\n integer(8), allocatable:: frac(:), ifrac(:)\n integer(8), parameter:: md = 1000000007\n\n read*, n, k\n\n call make_frac()\n\n do i=1,k\n print*, mod(comb(n-k+1,i)*comb(k-1,i-1),md)\n end do\n\n\ncontains\n\nfunction comb(a,b) result(ret)\n integer(8):: a,b\n integer(8):: ret\n\n ret = mod(mod(frac(a)*ifrac(b), md)*ifrac(a-b),md)\nend function\n\n\nsubroutine make_frac\n integer(8):: i\n allocate(frac(0:n), ifrac(0:n))\n\n frac(0) = 1\n ifrac(0) = 1\n\n do i=1,n\n frac(i) = mod(frac(i-1)*i, md)\n ifrac(i) = inv(frac(i))\n end do\nend subroutine\n\n\nfunction inv(x) result(ret)\n integer(8):: x, ret\n integer(8):: num, mul, pow\n\n num = md-2\n mul = x\n ret = 1\n\n do while (num >= 1)\n if (mod(num,2) == 1) then\n ret = mod(ret * mul, md)\n end if\n num=num/2\n mul=mod(mul*mul, md)\n end do\nend function\nend program BlueandRedBalls", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 986, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s723218006", "group_id": "codeNet:p02991", "input_text": "module mod_t_item\n implicit none\n type :: t_item\n integer :: pos, cost\n end type t_item\n private\n public :: t_item, itemize, compare, swap\ncontains\n function itemize(pos,cost) result(i)\n implicit none\n integer :: pos, cost\n type(t_item) :: i\n i%pos = pos\n i%cost = cost\n return\n end function itemize\n function compare(i1,i2) result(c)\n implicit none\n type(t_item), intent(in) :: i1, i2\n integer :: c\n c = i1%cost-i2%cost\n return\n end function compare\n subroutine swap(i1,i2)\n implicit none\n type(t_item), intent(inout) :: i1, i2\n type(t_item) :: i\n i = i1\n i1 = i2\n i2 = i\n return\n end subroutine swap\nend module mod_t_item\nmodule mod_t_list\n use mod_t_item\n implicit none\n type :: t_list\n integer :: vol\n type(t_item), pointer :: arr(:)\n end type t_list\n private\n public :: t_list, init_list, release_list,push_back\n public :: pop_back, get_at, size_of_list\ncontains\n subroutine init_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n list%vol = 0\n allocate(list%arr(1))\n return\n end subroutine init_list\n subroutine release_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n return\n end subroutine release_list\n subroutine push_back(list,item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item), intent(in) :: item\n type(t_item), allocatable :: tmp(:)\n if (size(list%arr).eq.list%vol) then\n allocate(tmp(list%vol))\n tmp = list%arr\n deallocate(list%arr)\n allocate(list%arr(2*list%vol))\n list%arr(1:list%vol) = tmp\n deallocate(tmp)\n end if\n list%vol = list%vol+1\n list%arr(list%vol) = item\n return\n end subroutine push_back\n function pop_back(list) result(item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item) :: item\n item = list%arr(list%vol)\n list%vol = list%vol-1\n return\n end function pop_back\n function get_at(list,i) result(item)\n implicit none\n type(t_list), intent(in) :: list\n integer, intent(in) :: i\n type(t_item) :: item\n item = list%arr(i)\n return\n end function get_at\n function size_of_list(list) result(s)\n implicit none\n type(t_list), intent(in) :: list\n integer :: s\n s = list%vol\n return\n end function size_of_list\nend module mod_t_list\nmodule mod_t_priority_queue\n use mod_t_item\n use mod_t_list\n implicit none\n type :: t_heap\n type(t_list) :: list\n end type t_heap\n private\n public :: t_heap, init_heap, release_heap, push, pop, size_of_heap\ncontains\n subroutine init_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call init_list(heap%list)\n return\n end subroutine init_heap\n subroutine release_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call release_list(heap%list)\n return\n end subroutine release_heap\n subroutine push(heap,item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item), intent(in) :: item\n integer :: n, i\n call push_back(heap%list,item)\n n = heap%list%vol\n do while (n.gt.1)\n i = n/2\n if (compare(heap%list%arr(n),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(n),heap%list%arr(i))\n end if\n n = i\n end do\n return\n end subroutine push\n function pop(heap) result(item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item) :: item, tmp\n integer :: n, i, j\n n = heap%list%vol\n item = heap%list%arr(1)\n heap%list%arr(1) = heap%list%arr(n)\n tmp = pop_back(heap%list)\n i = 1\n do while (2*i.lt.n)\n j = 2*i\n if ((j.lt.n-1).and.(compare(heap%list%arr(j+1),heap%list%arr(j)).lt.0_8)) then\n j = j+1\n end if\n if (compare(heap%list%arr(j),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(j),heap%list%arr(i))\n end if\n i = j\n end do\n return\n end function pop\n function size_of_heap(heap) result(s)\n implicit none\n type(t_heap), intent(in) :: heap\n integer :: s\n s = size_of_list(heap%list)\n return\n end function size_of_heap\nend module mod_t_priority_queue\nmodule mod_t_graph\n use mod_t_item\n use mod_t_list\n use mod_t_priority_queue\n implicit none\n integer, parameter :: infty = 1000000000\n type :: t_graph\n type(t_list), pointer :: edges(:)\n end type t_graph\n private\n public :: infty\n public :: t_graph, init_graph, release_graph, add_edge, add, dijkstra, dfs\ncontains\n subroutine init_graph(graph,n)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: n\n integer :: i\n allocate(graph%edges(n))\n do i = 1, n\n call init_list(graph%edges(i))\n end do\n return\n end subroutine init_graph\n subroutine release_graph(graph)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer :: n, i\n if (.not.associated(graph%edges)) return\n n = size(graph%edges)\n do i = 1, n\n call release_list(graph%edges(i))\n end do\n deallocate(graph%edges)\n return\n end subroutine release_graph\n subroutine add_edge(graph,i,edge)\n implicit none\n type(t_graph), intent(inout) :: graph\n type(t_item), intent(in) :: edge\n integer, intent(in) :: i\n call push_back(graph%edges(i),edge)\n return\n end subroutine add_edge\n subroutine add(graph,i,pos,cost)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: i, pos, cost\n call push_back(graph%edges(i),itemize(pos,cost))\n return\n end subroutine add\n function dijkstra(graph,start) result(c)\n implicit none\n type(t_graph), intent(in) :: graph\n integer, intent(in) :: start\n type(t_heap) :: pq\n type(t_item) :: now, next\n integer :: n, i, c(size(graph%edges))\n n = size(graph%edges)\n c = infty\n call init_heap(pq)\n c(start) = 0\n call push(pq,itemize(start,c(start)))\n do while (size_of_heap(pq).gt.0)\n now = pop(pq)\n if (now%cost.gt.c(now%pos)) cycle\n do i = 1, size_of_list(graph%edges(now%pos))\n next = get_at(graph%edges(now%pos),i)\n if (c(next%pos).gt.c(now%pos)+next%cost) then\n c(next%pos) = c(now%pos)+next%cost\n call push(pq,itemize(next%pos,c(next%pos)))\n end if\n end do\n end do\n call release_heap(pq)\n return\n end function dijkstra\n recursive subroutine dfs(graph,newgraph,s,v,c)\n implicit none\n type(t_graph), intent(in) :: graph\n type(t_graph), intent(inout) :: newgraph\n integer, intent(in) :: s, v, c\n type(t_item) :: next\n integer :: i\n if (c.eq.3) then\n call add(newgraph,s,v,1)\n return\n end if\n do i = 1, size_of_list(graph%edges(v))\n next = get_at(graph%edges(v),i)\n call dfs(graph,newgraph,s,next%pos,c+1)\n end do\n return\n end subroutine dfs\nend module mod_t_graph\nprogram hopscotch_addict\n use mod_t_graph\n implicit none\n type(t_graph) :: org, kng\n integer :: n, m, u, v, s, t, d(100000), i, k\n d = 0\n read(*,*) n, m\n call init_graph(org,n)\n call init_graph(kng,n)\n do i = 1, m\n read(*,*) u, v\n call add(org,u,v,1)\n end do\n read(*,*) s, t\n do i = 1, n\n call dfs(org,kng,i,i,0)\n end do\n d(1:n) = dijkstra(kng,s)\n if (d(t).eq.infty) then\n write(*,'(i0)') -1\n else\n write(*,'(i0)') d(t)\n end if\n call release_graph(org)\n call release_graph(kng)\n stop\nend program hopscotch_addict", "language": "Fortran", "metadata": {"date": 1561860004, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02991.html", "problem_id": "p02991", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02991/input.txt", "sample_output_relpath": "derived/input_output/data/p02991/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02991/Fortran/s723218006.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s723218006", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module mod_t_item\n implicit none\n type :: t_item\n integer :: pos, cost\n end type t_item\n private\n public :: t_item, itemize, compare, swap\ncontains\n function itemize(pos,cost) result(i)\n implicit none\n integer :: pos, cost\n type(t_item) :: i\n i%pos = pos\n i%cost = cost\n return\n end function itemize\n function compare(i1,i2) result(c)\n implicit none\n type(t_item), intent(in) :: i1, i2\n integer :: c\n c = i1%cost-i2%cost\n return\n end function compare\n subroutine swap(i1,i2)\n implicit none\n type(t_item), intent(inout) :: i1, i2\n type(t_item) :: i\n i = i1\n i1 = i2\n i2 = i\n return\n end subroutine swap\nend module mod_t_item\nmodule mod_t_list\n use mod_t_item\n implicit none\n type :: t_list\n integer :: vol\n type(t_item), pointer :: arr(:)\n end type t_list\n private\n public :: t_list, init_list, release_list,push_back\n public :: pop_back, get_at, size_of_list\ncontains\n subroutine init_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n list%vol = 0\n allocate(list%arr(1))\n return\n end subroutine init_list\n subroutine release_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n return\n end subroutine release_list\n subroutine push_back(list,item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item), intent(in) :: item\n type(t_item), allocatable :: tmp(:)\n if (size(list%arr).eq.list%vol) then\n allocate(tmp(list%vol))\n tmp = list%arr\n deallocate(list%arr)\n allocate(list%arr(2*list%vol))\n list%arr(1:list%vol) = tmp\n deallocate(tmp)\n end if\n list%vol = list%vol+1\n list%arr(list%vol) = item\n return\n end subroutine push_back\n function pop_back(list) result(item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item) :: item\n item = list%arr(list%vol)\n list%vol = list%vol-1\n return\n end function pop_back\n function get_at(list,i) result(item)\n implicit none\n type(t_list), intent(in) :: list\n integer, intent(in) :: i\n type(t_item) :: item\n item = list%arr(i)\n return\n end function get_at\n function size_of_list(list) result(s)\n implicit none\n type(t_list), intent(in) :: list\n integer :: s\n s = list%vol\n return\n end function size_of_list\nend module mod_t_list\nmodule mod_t_priority_queue\n use mod_t_item\n use mod_t_list\n implicit none\n type :: t_heap\n type(t_list) :: list\n end type t_heap\n private\n public :: t_heap, init_heap, release_heap, push, pop, size_of_heap\ncontains\n subroutine init_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call init_list(heap%list)\n return\n end subroutine init_heap\n subroutine release_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call release_list(heap%list)\n return\n end subroutine release_heap\n subroutine push(heap,item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item), intent(in) :: item\n integer :: n, i\n call push_back(heap%list,item)\n n = heap%list%vol\n do while (n.gt.1)\n i = n/2\n if (compare(heap%list%arr(n),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(n),heap%list%arr(i))\n end if\n n = i\n end do\n return\n end subroutine push\n function pop(heap) result(item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item) :: item, tmp\n integer :: n, i, j\n n = heap%list%vol\n item = heap%list%arr(1)\n heap%list%arr(1) = heap%list%arr(n)\n tmp = pop_back(heap%list)\n i = 1\n do while (2*i.lt.n)\n j = 2*i\n if ((j.lt.n-1).and.(compare(heap%list%arr(j+1),heap%list%arr(j)).lt.0_8)) then\n j = j+1\n end if\n if (compare(heap%list%arr(j),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(j),heap%list%arr(i))\n end if\n i = j\n end do\n return\n end function pop\n function size_of_heap(heap) result(s)\n implicit none\n type(t_heap), intent(in) :: heap\n integer :: s\n s = size_of_list(heap%list)\n return\n end function size_of_heap\nend module mod_t_priority_queue\nmodule mod_t_graph\n use mod_t_item\n use mod_t_list\n use mod_t_priority_queue\n implicit none\n integer, parameter :: infty = 1000000000\n type :: t_graph\n type(t_list), pointer :: edges(:)\n end type t_graph\n private\n public :: infty\n public :: t_graph, init_graph, release_graph, add_edge, add, dijkstra, dfs\ncontains\n subroutine init_graph(graph,n)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: n\n integer :: i\n allocate(graph%edges(n))\n do i = 1, n\n call init_list(graph%edges(i))\n end do\n return\n end subroutine init_graph\n subroutine release_graph(graph)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer :: n, i\n if (.not.associated(graph%edges)) return\n n = size(graph%edges)\n do i = 1, n\n call release_list(graph%edges(i))\n end do\n deallocate(graph%edges)\n return\n end subroutine release_graph\n subroutine add_edge(graph,i,edge)\n implicit none\n type(t_graph), intent(inout) :: graph\n type(t_item), intent(in) :: edge\n integer, intent(in) :: i\n call push_back(graph%edges(i),edge)\n return\n end subroutine add_edge\n subroutine add(graph,i,pos,cost)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: i, pos, cost\n call push_back(graph%edges(i),itemize(pos,cost))\n return\n end subroutine add\n function dijkstra(graph,start) result(c)\n implicit none\n type(t_graph), intent(in) :: graph\n integer, intent(in) :: start\n type(t_heap) :: pq\n type(t_item) :: now, next\n integer :: n, i, c(size(graph%edges))\n n = size(graph%edges)\n c = infty\n call init_heap(pq)\n c(start) = 0\n call push(pq,itemize(start,c(start)))\n do while (size_of_heap(pq).gt.0)\n now = pop(pq)\n if (now%cost.gt.c(now%pos)) cycle\n do i = 1, size_of_list(graph%edges(now%pos))\n next = get_at(graph%edges(now%pos),i)\n if (c(next%pos).gt.c(now%pos)+next%cost) then\n c(next%pos) = c(now%pos)+next%cost\n call push(pq,itemize(next%pos,c(next%pos)))\n end if\n end do\n end do\n call release_heap(pq)\n return\n end function dijkstra\n recursive subroutine dfs(graph,newgraph,s,v,c)\n implicit none\n type(t_graph), intent(in) :: graph\n type(t_graph), intent(inout) :: newgraph\n integer, intent(in) :: s, v, c\n type(t_item) :: next\n integer :: i\n if (c.eq.3) then\n call add(newgraph,s,v,1)\n return\n end if\n do i = 1, size_of_list(graph%edges(v))\n next = get_at(graph%edges(v),i)\n call dfs(graph,newgraph,s,next%pos,c+1)\n end do\n return\n end subroutine dfs\nend module mod_t_graph\nprogram hopscotch_addict\n use mod_t_graph\n implicit none\n type(t_graph) :: org, kng\n integer :: n, m, u, v, s, t, d(100000), i, k\n d = 0\n read(*,*) n, m\n call init_graph(org,n)\n call init_graph(kng,n)\n do i = 1, m\n read(*,*) u, v\n call add(org,u,v,1)\n end do\n read(*,*) s, t\n do i = 1, n\n call dfs(org,kng,i,i,0)\n end do\n d(1:n) = dijkstra(kng,s)\n if (d(t).eq.infty) then\n write(*,'(i0)') -1\n else\n write(*,'(i0)') d(t)\n end if\n call release_graph(org)\n call release_graph(kng)\n stop\nend program hopscotch_addict", "problem_context": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02991", "source_text": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7409, "cpu_time_ms": 2145, "memory_kb": 1059460}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s377510650", "group_id": "codeNet:p02993", "input_text": "program main\ncharacter::S*4\ninteger::i,check\nread*,S\ncheck=0\ndo i=1,3\n\tif(S(i:i)==S(i+1:i+1))then\n \tcheck=check+1\n else\n \tcheck=check\n end if\nend do\nif(check==0)then\nprint*,'Good'\nelse\nprint*,'Bad'\nend if\nend program main", "language": "Fortran", "metadata": {"date": 1568004045, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02993.html", "problem_id": "p02993", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02993/input.txt", "sample_output_relpath": "derived/input_output/data/p02993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02993/Fortran/s377510650.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377510650", "user_id": "u129978636"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "program main\ncharacter::S*4\ninteger::i,check\nread*,S\ncheck=0\ndo i=1,3\n\tif(S(i:i)==S(i+1:i+1))then\n \tcheck=check+1\n else\n \tcheck=check\n end if\nend do\nif(check==0)then\nprint*,'Good'\nelse\nprint*,'Bad'\nend if\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s320371439", "group_id": "codeNet:p02993", "input_text": "program main\n implicit none\n character*80 s,a\n integer*8 i,j\n \n read(*,*) s\n a = s(1:1)\n j = 0\n do i=2,len_trim(s)\n if (a == s(i:i))then\n j = 1\n end if\n a = s(i:i)\n end do\n if(j==0) then\n write(*,*) 'Good'\n else\n write(*,*) 'Bad'\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1561253648, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02993.html", "problem_id": "p02993", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02993/input.txt", "sample_output_relpath": "derived/input_output/data/p02993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02993/Fortran/s320371439.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s320371439", "user_id": "u671401989"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "program main\n implicit none\n character*80 s,a\n integer*8 i,j\n \n read(*,*) s\n a = s(1:1)\n j = 0\n do i=2,len_trim(s)\n if (a == s(i:i))then\n j = 1\n end if\n a = s(i:i)\n end do\n if(j==0) then\n write(*,*) 'Good'\n else\n write(*,*) 'Bad'\n end if\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s918554156", "group_id": "codeNet:p02993", "input_text": "program a\nimplicit none\ncharacter(4) s\ncharacter(1) i, j\ninteger n\nread*, s\n do n=1, 3\n i=s(n:n)\n j=s(n+1:n+1)\n if (i.eq.j) then\n print*, \"Bad\"\n return\n end if\n end do\nprint*, \"Good\"\nend program", "language": "Fortran", "metadata": {"date": 1561251944, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02993.html", "problem_id": "p02993", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02993/input.txt", "sample_output_relpath": "derived/input_output/data/p02993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02993/Fortran/s918554156.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s918554156", "user_id": "u039189422"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "program a\nimplicit none\ncharacter(4) s\ncharacter(1) i, j\ninteger n\nread*, s\n do n=1, 3\n i=s(n:n)\n j=s(n+1:n+1)\n if (i.eq.j) then\n print*, \"Bad\"\n return\n end if\n end do\nprint*, \"Good\"\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s037236524", "group_id": "codeNet:p02993", "input_text": "program main\nimplicit none\ninteger :: i\ncharacter :: s*4\n\nread(*,*) s\ndo i = 1, 3\n if( s(i+1:i+1) == s(i:i) ) then\n write(*,*) 'Bad'\n stop\n end if\nend do\nwrite(*,*) 'Good'\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1561251734, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02993.html", "problem_id": "p02993", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02993/input.txt", "sample_output_relpath": "derived/input_output/data/p02993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02993/Fortran/s037236524.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037236524", "user_id": "u696547932"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i\ncharacter :: s*4\n\nread(*,*) s\ndo i = 1, 3\n if( s(i+1:i+1) == s(i:i) ) then\n write(*,*) 'Bad'\n stop\n end if\nend do\nwrite(*,*) 'Good'\n\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s554410928", "group_id": "codeNet:p02994", "input_text": "program pie\n implicit none\n integer ::N,L,ful,kake,i,sa\n integer :: tabe\n\n read(*,*) N,L\n ful=L*N+N*(N-1)/2\n sa=N*1000\n do i=1,N\n kake=ful-L-(i-1)\n if(abs(kake-ful).lt.sa) then\n sa=abs(kake-ful)\n tabe=kake\n endif\n enddo\n write(*,'(i0)') tabe\n\nend program pie", "language": "Fortran", "metadata": {"date": 1561252502, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02994.html", "problem_id": "p02994", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02994/input.txt", "sample_output_relpath": "derived/input_output/data/p02994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02994/Fortran/s554410928.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s554410928", "user_id": "u613124399"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "program pie\n implicit none\n integer ::N,L,ful,kake,i,sa\n integer :: tabe\n\n read(*,*) N,L\n ful=L*N+N*(N-1)/2\n sa=N*1000\n do i=1,N\n kake=ful-L-(i-1)\n if(abs(kake-ful).lt.sa) then\n sa=abs(kake-ful)\n tabe=kake\n endif\n enddo\n write(*,'(i0)') tabe\n\nend program pie", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "sample_input": "5 2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p02994", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s513681568", "group_id": "codeNet:p02995", "input_text": "integer(8) A,B,C,D,E\ninteger(8) ans\nread*,A,B,C,D\nE=C*D/gcd(C,D)\nans=B-A+1\n\nans=ans-(B-A+1)/C-(B-A+1)/D +(B-A+1)/E\nif(mod(B,C)= j) exit\n t = a(i)\n a(i) = a(j)\n a(j) = t\n s = b(i)\n b(i) = b(j)\n b(j) = s\n i=i+1\n j=j-1\n end do\n if (first < i - 1) call quicksort(n, a, b, first, i - 1)\n if (j + 1 < last) call quicksort(n, a, b, j + 1, last)\nend subroutine quicksort\nend program main\n", "language": "Fortran", "metadata": {"date": 1561239351, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02996.html", "problem_id": "p02996", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02996/input.txt", "sample_output_relpath": "derived/input_output/data/p02996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02996/Fortran/s349913529.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349913529", "user_id": "u696547932"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: n\ninteger , allocatable :: a(:), b(:)\ninteger :: i, j, s\n\nread(*,*) n\nallocate( a(n) )\nallocate( b(n) )\ndo i = 1, n\n read(*,*) a(i), b(i)\nend do\ncall quicksort(n, b, a, 1, n)\ns = 0.\ndo i = 1, n\n s = s + a(i)\n if(s .gt. b(i) ) then\n write(*,*) 'No'\n stop\n end if\nend do\nwrite(*,*) 'Yes'\n\nstop\ncontains\nrecursive subroutine quicksort(n, a, b, first, last)\n implicit none\n integer :: a(n), b(n)\n integer :: first, last\n integer :: i, j, n\n integer :: x, y, t, s\n \n x = a( (first+last) / 2 )\n i = first\n j = last\n do\n do while (a(i) < x)\n i=i+1\n end do\n do while (x < a(j))\n j=j-1\n end do\n if (i >= j) exit\n t = a(i)\n a(i) = a(j)\n a(j) = t\n s = b(i)\n b(i) = b(j)\n b(j) = s\n i=i+1\n j=j-1\n end do\n if (first < i - 1) call quicksort(n, a, b, first, i - 1)\n if (j + 1 < last) call quicksort(n, a, b, j + 1, last)\nend subroutine quicksort\nend program main\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 978, "cpu_time_ms": 147, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s123644629", "group_id": "codeNet:p02996", "input_text": "program main\nimplicit none\ninteger :: n\ninteger , allocatable :: a(:), b(:)\ninteger :: i, j\n\nread(*,*) n\nallocate( a(n) )\nallocate( b(n) )\ndo i = 1, n\n read(*,*) a(i), b(i)\nend do\ncall quicksort(n, b, a, 1, n)\ndo i = 1, n\n if(sum(a(1:i)) .gt. b(i) ) then\n write(*,*) 'No'\n stop\n end if\nend do\nwrite(*,*) 'Yes'\n\nstop\ncontains\nrecursive subroutine quicksort(n, a, b, first, last)\n implicit none\n integer :: a(n), b(n)\n integer :: first, last\n integer :: i, j, n\n integer :: x, y, t, s\n \n x = a( (first+last) / 2 )\n i = first\n j = last\n do\n do while (a(i) < x)\n i=i+1\n end do\n do while (x < a(j))\n j=j-1\n end do\n if (i >= j) exit\n t = a(i)\n a(i) = a(j)\n a(j) = t\n s = b(i)\n b(i) = b(j)\n b(j) = s\n i=i+1\n j=j-1\n end do\n if (first < i - 1) call quicksort(n, a, b, first, i - 1)\n if (j + 1 < last) call quicksort(n, a, b, j + 1, last)\nend subroutine quicksort\nend program main\n", "language": "Fortran", "metadata": {"date": 1561235605, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02996.html", "problem_id": "p02996", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02996/input.txt", "sample_output_relpath": "derived/input_output/data/p02996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02996/Fortran/s123644629.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s123644629", "user_id": "u696547932"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: n\ninteger , allocatable :: a(:), b(:)\ninteger :: i, j\n\nread(*,*) n\nallocate( a(n) )\nallocate( b(n) )\ndo i = 1, n\n read(*,*) a(i), b(i)\nend do\ncall quicksort(n, b, a, 1, n)\ndo i = 1, n\n if(sum(a(1:i)) .gt. b(i) ) then\n write(*,*) 'No'\n stop\n end if\nend do\nwrite(*,*) 'Yes'\n\nstop\ncontains\nrecursive subroutine quicksort(n, a, b, first, last)\n implicit none\n integer :: a(n), b(n)\n integer :: first, last\n integer :: i, j, n\n integer :: x, y, t, s\n \n x = a( (first+last) / 2 )\n i = first\n j = last\n do\n do while (a(i) < x)\n i=i+1\n end do\n do while (x < a(j))\n j=j-1\n end do\n if (i >= j) exit\n t = a(i)\n a(i) = a(j)\n a(j) = t\n s = b(i)\n b(i) = b(j)\n b(j) = s\n i=i+1\n j=j-1\n end do\n if (first < i - 1) call quicksort(n, a, b, first, i - 1)\n if (j + 1 < last) call quicksort(n, a, b, j + 1, last)\nend subroutine quicksort\nend program main\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 962, "cpu_time_ms": 2103, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s271160861", "group_id": "codeNet:p02997", "input_text": "program friendships\n implicit none\n integer :: n, k, m, x, i, j\n read(*,*) n, k\n m = ((n-1)*(n-2))/2\n if (k.gt.m) then\n write(*,'(i0)') -1\n stop\n end if\n write(*,'(i0)') n-1+m-k\n do i = 2, n\n write(*,'(i0,x,i0)') 1, i\n end do\n x = 0\n do i = 2, n-1\n do j = i+1, n\n if (x.eq.m-k) stop\n x = x+1\n write(*,'(i0,x,i0)') i, j\n end do\n end do\n stop\nend program friendships", "language": "Fortran", "metadata": {"date": 1561232437, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02997.html", "problem_id": "p02997", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02997/input.txt", "sample_output_relpath": "derived/input_output/data/p02997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02997/Fortran/s271160861.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271160861", "user_id": "u506403362"}, "prompt_components": {"gold_output": "5\n4 3\n1 2\n3 1\n4 5\n2 3\n", "input_to_evaluate": "program friendships\n implicit none\n integer :: n, k, m, x, i, j\n read(*,*) n, k\n m = ((n-1)*(n-2))/2\n if (k.gt.m) then\n write(*,'(i0)') -1\n stop\n end if\n write(*,'(i0)') n-1+m-k\n do i = 2, n\n write(*,'(i0,x,i0)') 1, i\n end do\n x = 0\n do i = 2, n-1\n do j = i+1, n\n if (x.eq.m-k) stop\n x = x+1\n write(*,'(i0,x,i0)') i, j\n end do\n end do\n stop\nend program friendships", "problem_context": "Score: 500 points\n\nProblem Statement\n\nDoes there exist an undirected graph with N vertices satisfying the following conditions?\n\nThe graph is simple and connected.\n\nThe vertices are numbered 1, 2, ..., N.\n\nLet M be the number of edges in the graph. The edges are numbered 1, 2, ..., M, the length of each edge is 1, and Edge i connects Vertex u_i and Vertex v_i.\n\nThere are exactly K pairs of vertices (i,\\ j)\\ (i < j) such that the shortest distance between them is 2.\n\nIf there exists such a graph, construct an example.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq K \\leq \\frac{N(N - 1)}{2}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf there does not exist an undirected graph with N vertices satisfying the conditions, print -1.\n\nIf there exists such a graph, print an example in the following format (refer to Problem Statement for what the symbols stand for):\n\nM\nu_1 v_1\n:\nu_M v_M\n\nIf there exist multiple graphs satisfying the conditions, any of them will be accepted.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n5\n4 3\n1 2\n3 1\n4 5\n2 3\n\nThis graph has three pairs of vertices such that the shortest distance between them is 2: (1,\\ 4), (2,\\ 4), and (3,\\ 5). Thus, the condition is satisfied.\n\nSample Input 2\n\n5 8\n\nSample Output 2\n\n-1\n\nThere is no graph satisfying the conditions.", "sample_input": "5 3\n"}, "reference_outputs": ["5\n4 3\n1 2\n3 1\n4 5\n2 3\n"], "source_document_id": "p02997", "source_text": "Score: 500 points\n\nProblem Statement\n\nDoes there exist an undirected graph with N vertices satisfying the following conditions?\n\nThe graph is simple and connected.\n\nThe vertices are numbered 1, 2, ..., N.\n\nLet M be the number of edges in the graph. The edges are numbered 1, 2, ..., M, the length of each edge is 1, and Edge i connects Vertex u_i and Vertex v_i.\n\nThere are exactly K pairs of vertices (i,\\ j)\\ (i < j) such that the shortest distance between them is 2.\n\nIf there exists such a graph, construct an example.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq K \\leq \\frac{N(N - 1)}{2}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf there does not exist an undirected graph with N vertices satisfying the conditions, print -1.\n\nIf there exists such a graph, print an example in the following format (refer to Problem Statement for what the symbols stand for):\n\nM\nu_1 v_1\n:\nu_M v_M\n\nIf there exist multiple graphs satisfying the conditions, any of them will be accepted.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n5\n4 3\n1 2\n3 1\n4 5\n2 3\n\nThis graph has three pairs of vertices such that the shortest distance between them is 2: (1,\\ 4), (2,\\ 4), and (3,\\ 5). Thus, the condition is satisfied.\n\nSample Input 2\n\n5 8\n\nSample Output 2\n\n-1\n\nThere is no graph satisfying the conditions.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 407, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s022312270", "group_id": "codeNet:p02998", "input_text": "module mod_union_find\n implicit none\n type union_find\n integer :: n\n integer, pointer :: par(:), rnk(:), siz(:)\n end type union_find\n private\n public :: union_find\n public :: init_union_find, release_union_find, find, same, unite, size_of\ncontains\n subroutine init_union_find(uf,n)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: n\n integer :: i\n allocate(uf%par(-n:n),uf%rnk(-n:n),uf%siz(-n:n))\n uf%rnk = 0\n uf%siz = 1\n do i = -n, n\n uf%par(i) = i\n end do\n return\n end subroutine init_union_find\n subroutine release_union_find(uf)\n implicit none\n type(union_find), intent(inout) :: uf\n if (associated(uf%par)) deallocate(uf%par)\n if (associated(uf%rnk)) deallocate(uf%rnk)\n if (associated(uf%siz)) deallocate(uf%siz)\n return\n end subroutine release_union_find\n recursive function find(uf,i) result(j)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i\n integer :: j\n if (uf%par(i).ne.i) then\n uf%par(i) = find(uf,uf%par(i))\n end if\n j = uf%par(i)\n return\n end function find\n function same(uf,i,j) result(y)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i, j\n logical :: y\n y = find(uf,i).eq.find(uf,j)\n end function same\n subroutine unite(uf,i,j)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i, j\n integer :: x, y\n x = find(uf,i)\n y = find(uf,j)\n if (x.eq.y) return\n if (uf%rnk(x).lt.uf%rnk(y)) then\n uf%par(x) = y\n uf%siz(y) = uf%siz(y)+uf%siz(x)\n else\n uf%par(y) = x\n uf%siz(x) = uf%siz(x)+uf%siz(y)\n if (uf%rnk(x).eq.uf%rnk(y)) uf%rnk(x) = uf%rnk(x)+1\n end if\n return\n end subroutine unite\n function size_of(uf,i) result(s)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i\n integer :: s\n s = uf%siz(find(uf,i))\n end function size_of\nend module mod_union_find\nprogram must_be_rectangular\n use mod_union_find\n implicit none\n type(union_find) :: uf\n integer :: n, x, y, m(-100000:100001,2), i, j\n integer(8) :: z\n call init_union_find(uf,100000)\n m = 0\n read(*,*) n\n do i = 1, n\n read(*,*) x, y\n call unite(uf,x,-y)\n end do\n m(-100000:100000,1) = uf%par\n m(100001,1) = 1000010000\n do i = -100000, 100000\n m(i,2) = i\n end do\n call merge_sort(m(-100000:100000,1:2),1)\n i = -100000\n z = 0_8\n do while (i.lt.100001)\n x = 0\n y = 0\n do j = i, 100001\n if (m(i,1).eq.m(j,1)) then\n if (m(j,2).gt.0) then\n x = x+1\n else\n y = y+1\n end if\n else\n z = z+int(x,8)*int(y,8)\n i = j\n exit\n end if\n end do\n end do\n write(*,'(i0)') z-int(n,8)\n stop\ncontains\n subroutine merge_sort(c,k)\n implicit none\n integer, intent(inout) :: c(:,:)\n integer, intent(in) :: k\n integer :: n, m, l, u, i\n n = size(c(:,1))\n m = n\n l = 1\n do while (m.gt.1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(c(2*(i-1)*l+1:(2*i-1)*l,:),c((2*i-1)*l+1:u,:),k)\n end do\n l = 2*l\n m = (m+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merger(c1,c2,k)\n implicit none\n integer, intent(inout) :: c1(:,:), c2(:,:)\n integer, intent(in) :: k\n integer :: c(size(c1(:,1))+size(c2(:,1)),size(c2(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while ((i1.le.n1).and.(i2.le.n2))\n if (c1(i1,k).le.c2(i2,k)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2.le.n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merger\nend program must_be_rectangular", "language": "Fortran", "metadata": {"date": 1561242693, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02998.html", "problem_id": "p02998", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02998/input.txt", "sample_output_relpath": "derived/input_output/data/p02998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02998/Fortran/s022312270.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s022312270", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module mod_union_find\n implicit none\n type union_find\n integer :: n\n integer, pointer :: par(:), rnk(:), siz(:)\n end type union_find\n private\n public :: union_find\n public :: init_union_find, release_union_find, find, same, unite, size_of\ncontains\n subroutine init_union_find(uf,n)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: n\n integer :: i\n allocate(uf%par(-n:n),uf%rnk(-n:n),uf%siz(-n:n))\n uf%rnk = 0\n uf%siz = 1\n do i = -n, n\n uf%par(i) = i\n end do\n return\n end subroutine init_union_find\n subroutine release_union_find(uf)\n implicit none\n type(union_find), intent(inout) :: uf\n if (associated(uf%par)) deallocate(uf%par)\n if (associated(uf%rnk)) deallocate(uf%rnk)\n if (associated(uf%siz)) deallocate(uf%siz)\n return\n end subroutine release_union_find\n recursive function find(uf,i) result(j)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i\n integer :: j\n if (uf%par(i).ne.i) then\n uf%par(i) = find(uf,uf%par(i))\n end if\n j = uf%par(i)\n return\n end function find\n function same(uf,i,j) result(y)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i, j\n logical :: y\n y = find(uf,i).eq.find(uf,j)\n end function same\n subroutine unite(uf,i,j)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i, j\n integer :: x, y\n x = find(uf,i)\n y = find(uf,j)\n if (x.eq.y) return\n if (uf%rnk(x).lt.uf%rnk(y)) then\n uf%par(x) = y\n uf%siz(y) = uf%siz(y)+uf%siz(x)\n else\n uf%par(y) = x\n uf%siz(x) = uf%siz(x)+uf%siz(y)\n if (uf%rnk(x).eq.uf%rnk(y)) uf%rnk(x) = uf%rnk(x)+1\n end if\n return\n end subroutine unite\n function size_of(uf,i) result(s)\n implicit none\n type(union_find), intent(inout) :: uf\n integer, intent(in) :: i\n integer :: s\n s = uf%siz(find(uf,i))\n end function size_of\nend module mod_union_find\nprogram must_be_rectangular\n use mod_union_find\n implicit none\n type(union_find) :: uf\n integer :: n, x, y, m(-100000:100001,2), i, j\n integer(8) :: z\n call init_union_find(uf,100000)\n m = 0\n read(*,*) n\n do i = 1, n\n read(*,*) x, y\n call unite(uf,x,-y)\n end do\n m(-100000:100000,1) = uf%par\n m(100001,1) = 1000010000\n do i = -100000, 100000\n m(i,2) = i\n end do\n call merge_sort(m(-100000:100000,1:2),1)\n i = -100000\n z = 0_8\n do while (i.lt.100001)\n x = 0\n y = 0\n do j = i, 100001\n if (m(i,1).eq.m(j,1)) then\n if (m(j,2).gt.0) then\n x = x+1\n else\n y = y+1\n end if\n else\n z = z+int(x,8)*int(y,8)\n i = j\n exit\n end if\n end do\n end do\n write(*,'(i0)') z-int(n,8)\n stop\ncontains\n subroutine merge_sort(c,k)\n implicit none\n integer, intent(inout) :: c(:,:)\n integer, intent(in) :: k\n integer :: n, m, l, u, i\n n = size(c(:,1))\n m = n\n l = 1\n do while (m.gt.1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(c(2*(i-1)*l+1:(2*i-1)*l,:),c((2*i-1)*l+1:u,:),k)\n end do\n l = 2*l\n m = (m+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merger(c1,c2,k)\n implicit none\n integer, intent(inout) :: c1(:,:), c2(:,:)\n integer, intent(in) :: k\n integer :: c(size(c1(:,1))+size(c2(:,1)),size(c2(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while ((i1.le.n1).and.(i2.le.n2))\n if (c1(i1,k).le.c2(i2,k)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2.le.n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merger\nend program must_be_rectangular", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "sample_input": "3\n1 1\n5 1\n5 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02998", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3963, "cpu_time_ms": 97, "memory_kb": 6260}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s731375257", "group_id": "codeNet:p02999", "input_text": "program prob51\n implicit none\n integer :: x,a\n read(*,*) x,a\n if(x >= a)then\n write(*,*) \"10\"\n else\n write(*,*) \"0\"\n end if\n\n stop\ncontains\nend program prob51", "language": "Fortran", "metadata": {"date": 1592610149, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p02999.html", "problem_id": "p02999", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02999/input.txt", "sample_output_relpath": "derived/input_output/data/p02999/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02999/Fortran/s731375257.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s731375257", "user_id": "u478462004"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "program prob51\n implicit none\n integer :: x,a\n read(*,*) x,a\n if(x >= a)then\n write(*,*) \"10\"\n else\n write(*,*) \"0\"\n end if\n\n stop\ncontains\nend program prob51", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 6, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s727399449", "group_id": "codeNet:p02999", "input_text": "integer :: x,a\nread*,a,x\n\nif(x>=a)then\nprint*,10\nelse\nprint*,0\nendif\nend", "language": "Fortran", "metadata": {"date": 1575495026, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p02999.html", "problem_id": "p02999", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02999/input.txt", "sample_output_relpath": "derived/input_output/data/p02999/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02999/Fortran/s727399449.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s727399449", "user_id": "u171356453"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "integer :: x,a\nread*,a,x\n\nif(x>=a)then\nprint*,10\nelse\nprint*,0\nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s947233465", "group_id": "codeNet:p03000", "input_text": "implicit none\ninteger :: n,x\ninteger :: l(100)\ninteger :: i,d,ans\nread *,n,x\nread *,(l(i),i=1,n)\n\nans = 0\nd = 0\ndo i = 1, n+1\n if (d <= x) ans = ans + 1\n d = d + l(i)\nenddo\n\nprint '(i0)',ans\nend", "language": "Fortran", "metadata": {"date": 1565519638, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Fortran/s947233465.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947233465", "user_id": "u193540507"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "implicit none\ninteger :: n,x\ninteger :: l(100)\ninteger :: i,d,ans\nread *,n,x\nread *,(l(i),i=1,n)\n\nans = 0\nd = 0\ndo i = 1, n+1\n if (d <= x) ans = ans + 1\n d = d + l(i)\nenddo\n\nprint '(i0)',ans\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s951096394", "group_id": "codeNet:p03000", "input_text": "module ABC130\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer(INT32) :: num_bound_total\n integer(INT32) :: coordinate_limit\n integer(INT32), allocatable, dimension(:) :: coordinate_bound\n integer(INT32) :: coordinate_current\n\n ! support variables for this \n integer(INT32) :: counter\n\n ! STEP.01\n ! read out the number of bound\n ! read out the limit of coordinate\n read(unit=INPUT_UNIT, fmt=*) num_bound_total, coordinate_limit\n\n ! STEP.02\n ! allocate the arrays\n allocate(coordinate_bound(1:num_bound_total))\n\n ! STEP.03\n ! read out the coordinate where to bound\n read(unit=INPUT_UNIT, fmt=*) coordinate_bound(1:num_bound_total)\n\n ! STEP.04\n ! count the number of bound which satisfies the given condition\n coordinate_current = 0_INT32\n counter = 0_INT32\n\n do while (coordinate_current .le. coordinate_limit .or. counter .eq. num_bound_total)\n coordinate_current = coordinate_current + coordinate_bound(counter+1)\n counter = counter + 1\n end do\n\n ! STEP.04\n ! output the result\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') counter\n\n ! STEP.END\n return\n\n end subroutine task_B\n\nend module ABC130\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC130\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "language": "Fortran", "metadata": {"date": 1560713131, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Fortran/s951096394.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s951096394", "user_id": "u484703930"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module ABC130\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer(INT32) :: num_bound_total\n integer(INT32) :: coordinate_limit\n integer(INT32), allocatable, dimension(:) :: coordinate_bound\n integer(INT32) :: coordinate_current\n\n ! support variables for this \n integer(INT32) :: counter\n\n ! STEP.01\n ! read out the number of bound\n ! read out the limit of coordinate\n read(unit=INPUT_UNIT, fmt=*) num_bound_total, coordinate_limit\n\n ! STEP.02\n ! allocate the arrays\n allocate(coordinate_bound(1:num_bound_total))\n\n ! STEP.03\n ! read out the coordinate where to bound\n read(unit=INPUT_UNIT, fmt=*) coordinate_bound(1:num_bound_total)\n\n ! STEP.04\n ! count the number of bound which satisfies the given condition\n coordinate_current = 0_INT32\n counter = 0_INT32\n\n do while (coordinate_current .le. coordinate_limit .or. counter .eq. num_bound_total)\n coordinate_current = coordinate_current + coordinate_bound(counter+1)\n counter = counter + 1\n end do\n\n ! STEP.04\n ! output the result\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') counter\n\n ! STEP.END\n return\n\n end subroutine task_B\n\nend module ABC130\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC130\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s356358049", "group_id": "codeNet:p03000", "input_text": "program main\nimplicit none\ninteger :: n, x\ninteger , allocatable :: l(:)\ninteger :: i, nc, j\n\nread(*,*) n, x\nallocate( l(n))\nread(*,*) l(:)\nj = 0\nnc = 1\ndo i = 1, n\n j = j+l(i)\n if( j .le. x ) then\n nc = nc + 1\n end if\nend do\nwrite(*,'(i0)') nc\n\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1560711904, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03000.html", "problem_id": "p03000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03000/input.txt", "sample_output_relpath": "derived/input_output/data/p03000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03000/Fortran/s356358049.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s356358049", "user_id": "u696547932"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: n, x\ninteger , allocatable :: l(:)\ninteger :: i, nc, j\n\nread(*,*) n, x\nallocate( l(n))\nread(*,*) l(:)\nj = 0\nnc = 1\ndo i = 1, n\n j = j+l(i)\n if( j .le. x ) then\n nc = nc + 1\n end if\nend do\nwrite(*,'(i0)') nc\n\n\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s966064465", "group_id": "codeNet:p03001", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,w,h,x,y\n real(8)::a,b\n \n read(*,*) w,h,x,y\n\n \n write(*,'(f29.10)',advance='no') w/2.0*h\n if (mod(w,2)==1 .or. mod(h,2)==1)then\n write(*,*)0\n else\n if (x==w/2 .and. y==h/2) then\n write(*,*)1\n else\n write(*,*)0\n end if\n end if\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1593202068, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03001.html", "problem_id": "p03001", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03001/input.txt", "sample_output_relpath": "derived/input_output/data/p03001/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03001/Fortran/s966064465.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s966064465", "user_id": "u713568912"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,w,h,x,y\n real(8)::a,b\n \n read(*,*) w,h,x,y\n\n \n write(*,'(f29.10)',advance='no') w/2.0*h\n if (mod(w,2)==1 .or. mod(h,2)==1)then\n write(*,*)0\n else\n if (x==w/2 .and. y==h/2) then\n write(*,*)1\n else\n write(*,*)0\n end if\n end if\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2948}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s373674096", "group_id": "codeNet:p03001", "input_text": "program prob3\n implicit none\n integer(8)::W, H, x, y\n real(16):: xm,ym, ans\n read(*,*) W, H, x, y\n xm = real(W,kind=16)/2.0_16\n ym = real(H,kind=16)/2.0_16\n\n ans = real(H*W,kind=16)/2.0_16\n if(mod(W,2)==0 .and. mod(H,2)==0)then\n if(x == W/2 .and. y == H/2)then\n write(*,*) ans, 1\n stop\n end if\n end if\n\n write(*,*) ans,0\n\n stop\nend program", "language": "Fortran", "metadata": {"date": 1593200399, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03001.html", "problem_id": "p03001", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03001/input.txt", "sample_output_relpath": "derived/input_output/data/p03001/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03001/Fortran/s373674096.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s373674096", "user_id": "u841856382"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "program prob3\n implicit none\n integer(8)::W, H, x, y\n real(16):: xm,ym, ans\n read(*,*) W, H, x, y\n xm = real(W,kind=16)/2.0_16\n ym = real(H,kind=16)/2.0_16\n\n ans = real(H*W,kind=16)/2.0_16\n if(mod(W,2)==0 .and. mod(H,2)==0)then\n if(x == W/2 .and. y == H/2)then\n write(*,*) ans, 1\n stop\n end if\n end if\n\n write(*,*) ans,0\n\n stop\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 11, "memory_kb": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s875643047", "group_id": "codeNet:p03001", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: w,h,x,y,bunkatsu\n\n read*, w,h,x,y\n bunkatsu=0\n if (2*x == w .and. 2*y==h) bunkatsu=1\n print'(f11.9,1x,i0)', dble(w*h)/2d0, bunkatsu\nend program name", "language": "Fortran", "metadata": {"date": 1587120727, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03001.html", "problem_id": "p03001", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03001/input.txt", "sample_output_relpath": "derived/input_output/data/p03001/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03001/Fortran/s875643047.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s875643047", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: w,h,x,y,bunkatsu\n\n read*, w,h,x,y\n bunkatsu=0\n if (2*x == w .and. 2*y==h) bunkatsu=1\n print'(f11.9,1x,i0)', dble(w*h)/2d0, bunkatsu\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s603258062", "group_id": "codeNet:p03001", "input_text": "program main\n implicit none\n integer :: x, y, w, h\n real :: area\n integer :: flag\n\n read(*,*) w, h, x, y\n area = w*h/2.0\n\n if (x == w/2 .and. y == h/2) then\n flag = 1\n else\n flag = 0\n endif\n\n\n write(*,*) area, flag\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1561273304, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03001.html", "problem_id": "p03001", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03001/input.txt", "sample_output_relpath": "derived/input_output/data/p03001/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03001/Fortran/s603258062.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s603258062", "user_id": "u210113718"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "program main\n implicit none\n integer :: x, y, w, h\n real :: area\n integer :: flag\n\n read(*,*) w, h, x, y\n area = w*h/2.0\n\n if (x == w/2 .and. y == h/2) then\n flag = 1\n else\n flag = 0\n endif\n\n\n write(*,*) area, flag\n\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s725562541", "group_id": "codeNet:p03003", "input_text": "program kadai\n implicit none\ninteger(8) :: n,m,i,j,a,b\ninteger(8),allocatable :: s(:),t(:)\ninteger(8),allocatable :: dp(:,:),sum(:,:)\ninteger(8) :: sa\n\n\nread(*,*) n,m\n\nallocate(s(n))\nallocate(t(m))\nallocate(dp(n,m))\nallocate(sum(n,m))\nread(*,*) s\nread(*,*) t\n\nsum=0\ndp=0\ndo i=1,n\n do j=1,m\n if (s(i)==t(j)) then\n if (i>1 .and. j>1) then\n dp(i,j)=sum(i-1,j-1)\n end if\n dp(i,j)=dp(i,j)+1\n else\n dp(i,j)=0\n end if\n if (i>1 .and. j>1) then\n sum(i,j)=sum(i-1,j)+sum(i,j-1)-sum(i-1,j-1)+dp(i,j)\n elseif (i==1 .and. j>1) then\n sum(1,j)=sum(1,j-1)+dp(1,j)\n elseif (i>1 .and. j==1) then\n sum(i,1)=sum(i-1,1)+dp(i,1)\n else\n sum(1,1)=dp(1,1)\n end if\n sum(i,j)=mod(sum(i,j),10**9+7)\n end do\nend do\n\n\nwrite(*,*) mod(sum(n,m)+1,10**9+7)\n\n\nstop\ncontains\n\nend program kadai\n", "language": "Fortran", "metadata": {"date": 1566756755, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03003.html", "problem_id": "p03003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03003/input.txt", "sample_output_relpath": "derived/input_output/data/p03003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03003/Fortran/s725562541.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s725562541", "user_id": "u286754585"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program kadai\n implicit none\ninteger(8) :: n,m,i,j,a,b\ninteger(8),allocatable :: s(:),t(:)\ninteger(8),allocatable :: dp(:,:),sum(:,:)\ninteger(8) :: sa\n\n\nread(*,*) n,m\n\nallocate(s(n))\nallocate(t(m))\nallocate(dp(n,m))\nallocate(sum(n,m))\nread(*,*) s\nread(*,*) t\n\nsum=0\ndp=0\ndo i=1,n\n do j=1,m\n if (s(i)==t(j)) then\n if (i>1 .and. j>1) then\n dp(i,j)=sum(i-1,j-1)\n end if\n dp(i,j)=dp(i,j)+1\n else\n dp(i,j)=0\n end if\n if (i>1 .and. j>1) then\n sum(i,j)=sum(i-1,j)+sum(i,j-1)-sum(i-1,j-1)+dp(i,j)\n elseif (i==1 .and. j>1) then\n sum(1,j)=sum(1,j-1)+dp(1,j)\n elseif (i>1 .and. j==1) then\n sum(i,1)=sum(i-1,1)+dp(i,1)\n else\n sum(1,1)=dp(1,1)\n end if\n sum(i,j)=mod(sum(i,j),10**9+7)\n end do\nend do\n\n\nwrite(*,*) mod(sum(n,m)+1,10**9+7)\n\n\nstop\ncontains\n\nend program kadai\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given two integer sequences S and T of length N and M, respectively, both consisting of integers between 1 and 10^5 (inclusive).\n\nIn how many pairs of a subsequence of S and a subsequence of T do the two subsequences are the same in content?\n\nHere the subsequence of A is a sequence obtained by removing zero or more elements from A and concatenating the remaining elements without changing the order.\n\nFor both S and T, we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSince the answer can be tremendous, print the number modulo 10^9+7.\n\nConstraints\n\n1 \\leq N, M \\leq 2 \\times 10^3\n\nThe length of S is N.\n\nThe length of T is M.\n\n1 \\leq S_i, T_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1 S_2 ... S_{N-1} S_{N}\nT_1 T_2 ... T_{M-1} T_{M}\n\nOutput\n\nPrint the number of pairs of a subsequence of S and a subsequence of T such that the subsequences are the same in content, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n1 3\n3 1\n\nSample Output 1\n\n3\n\nS has four subsequences: (), (1), (3), (1, 3).\n\nT has four subsequences: (), (3), (1), (3, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 1 \\times 1 pair of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (3), for a total of three pairs.\n\nSample Input 2\n\n2 2\n1 1\n1 1\n\nSample Output 2\n\n6\n\nS has four subsequences: (), (1), (1), (1, 1).\n\nT has four subsequences: (), (1), (1), (1, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 2 \\times 2 pairs of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (1,1), for a total of six pairs.\nNote again that we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSample Input 3\n\n4 4\n3 4 5 6\n3 4 5 6\n\nSample Output 3\n\n16\n\nSample Input 4\n\n10 9\n9 6 5 7 5 9 8 5 6 7\n8 6 8 5 5 7 9 9 7\n\nSample Output 4\n\n191\n\nSample Input 5\n\n20 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n\nSample Output 5\n\n846527861\n\nBe sure to print the number modulo 10^9+7.", "sample_input": "2 2\n1 3\n3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03003", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given two integer sequences S and T of length N and M, respectively, both consisting of integers between 1 and 10^5 (inclusive).\n\nIn how many pairs of a subsequence of S and a subsequence of T do the two subsequences are the same in content?\n\nHere the subsequence of A is a sequence obtained by removing zero or more elements from A and concatenating the remaining elements without changing the order.\n\nFor both S and T, we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSince the answer can be tremendous, print the number modulo 10^9+7.\n\nConstraints\n\n1 \\leq N, M \\leq 2 \\times 10^3\n\nThe length of S is N.\n\nThe length of T is M.\n\n1 \\leq S_i, T_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1 S_2 ... S_{N-1} S_{N}\nT_1 T_2 ... T_{M-1} T_{M}\n\nOutput\n\nPrint the number of pairs of a subsequence of S and a subsequence of T such that the subsequences are the same in content, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n1 3\n3 1\n\nSample Output 1\n\n3\n\nS has four subsequences: (), (1), (3), (1, 3).\n\nT has four subsequences: (), (3), (1), (3, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 1 \\times 1 pair of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (3), for a total of three pairs.\n\nSample Input 2\n\n2 2\n1 1\n1 1\n\nSample Output 2\n\n6\n\nS has four subsequences: (), (1), (1), (1, 1).\n\nT has four subsequences: (), (1), (1), (1, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 2 \\times 2 pairs of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (1,1), for a total of six pairs.\nNote again that we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSample Input 3\n\n4 4\n3 4 5 6\n3 4 5 6\n\nSample Output 3\n\n16\n\nSample Input 4\n\n10 9\n9 6 5 7 5 9 8 5 6 7\n8 6 8 5 5 7 9 9 7\n\nSample Output 4\n\n191\n\nSample Input 5\n\n20 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n\nSample Output 5\n\n846527861\n\nBe sure to print the number modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 940, "cpu_time_ms": 61, "memory_kb": 62720}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s372739960", "group_id": "codeNet:p03003", "input_text": "program common_subsequence\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer :: n, m, s(2000), t(2000), i, j\n integer(8) :: dp(0:2000,0:2000)\n s = 0\n t = 0\n dp = 0_8\n read(*,*) n, m\n read(*,*) s(1:n)\n read(*,*) t(1:m)\n do i = 1, n\n do j = 1, m\n if (s(i).eq.t(j)) then\n dp(i,j) = mod(1_8+dp(i,j-1)+dp(i-1,j),md)\n else\n dp(i,j) = mod(mod(dp(i,j-1)+dp(i-1,j),md)+mod(md-dp(i-1,j-1),md),md)\n end if\n end do\n end do\n write(*,'(i0)') dp(n,m)+1_8\n stop\nend program common_subsequence", "language": "Fortran", "metadata": {"date": 1560741326, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03003.html", "problem_id": "p03003", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03003/input.txt", "sample_output_relpath": "derived/input_output/data/p03003/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03003/Fortran/s372739960.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s372739960", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program common_subsequence\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer :: n, m, s(2000), t(2000), i, j\n integer(8) :: dp(0:2000,0:2000)\n s = 0\n t = 0\n dp = 0_8\n read(*,*) n, m\n read(*,*) s(1:n)\n read(*,*) t(1:m)\n do i = 1, n\n do j = 1, m\n if (s(i).eq.t(j)) then\n dp(i,j) = mod(1_8+dp(i,j-1)+dp(i-1,j),md)\n else\n dp(i,j) = mod(mod(dp(i,j-1)+dp(i-1,j),md)+mod(md-dp(i-1,j-1),md),md)\n end if\n end do\n end do\n write(*,'(i0)') dp(n,m)+1_8\n stop\nend program common_subsequence", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given two integer sequences S and T of length N and M, respectively, both consisting of integers between 1 and 10^5 (inclusive).\n\nIn how many pairs of a subsequence of S and a subsequence of T do the two subsequences are the same in content?\n\nHere the subsequence of A is a sequence obtained by removing zero or more elements from A and concatenating the remaining elements without changing the order.\n\nFor both S and T, we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSince the answer can be tremendous, print the number modulo 10^9+7.\n\nConstraints\n\n1 \\leq N, M \\leq 2 \\times 10^3\n\nThe length of S is N.\n\nThe length of T is M.\n\n1 \\leq S_i, T_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1 S_2 ... S_{N-1} S_{N}\nT_1 T_2 ... T_{M-1} T_{M}\n\nOutput\n\nPrint the number of pairs of a subsequence of S and a subsequence of T such that the subsequences are the same in content, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n1 3\n3 1\n\nSample Output 1\n\n3\n\nS has four subsequences: (), (1), (3), (1, 3).\n\nT has four subsequences: (), (3), (1), (3, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 1 \\times 1 pair of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (3), for a total of three pairs.\n\nSample Input 2\n\n2 2\n1 1\n1 1\n\nSample Output 2\n\n6\n\nS has four subsequences: (), (1), (1), (1, 1).\n\nT has four subsequences: (), (1), (1), (1, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 2 \\times 2 pairs of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (1,1), for a total of six pairs.\nNote again that we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSample Input 3\n\n4 4\n3 4 5 6\n3 4 5 6\n\nSample Output 3\n\n16\n\nSample Input 4\n\n10 9\n9 6 5 7 5 9 8 5 6 7\n8 6 8 5 5 7 9 9 7\n\nSample Output 4\n\n191\n\nSample Input 5\n\n20 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n\nSample Output 5\n\n846527861\n\nBe sure to print the number modulo 10^9+7.", "sample_input": "2 2\n1 3\n3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03003", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given two integer sequences S and T of length N and M, respectively, both consisting of integers between 1 and 10^5 (inclusive).\n\nIn how many pairs of a subsequence of S and a subsequence of T do the two subsequences are the same in content?\n\nHere the subsequence of A is a sequence obtained by removing zero or more elements from A and concatenating the remaining elements without changing the order.\n\nFor both S and T, we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSince the answer can be tremendous, print the number modulo 10^9+7.\n\nConstraints\n\n1 \\leq N, M \\leq 2 \\times 10^3\n\nThe length of S is N.\n\nThe length of T is M.\n\n1 \\leq S_i, T_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1 S_2 ... S_{N-1} S_{N}\nT_1 T_2 ... T_{M-1} T_{M}\n\nOutput\n\nPrint the number of pairs of a subsequence of S and a subsequence of T such that the subsequences are the same in content, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n1 3\n3 1\n\nSample Output 1\n\n3\n\nS has four subsequences: (), (1), (3), (1, 3).\n\nT has four subsequences: (), (3), (1), (3, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 1 \\times 1 pair of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (3), for a total of three pairs.\n\nSample Input 2\n\n2 2\n1 1\n1 1\n\nSample Output 2\n\n6\n\nS has four subsequences: (), (1), (1), (1, 1).\n\nT has four subsequences: (), (1), (1), (1, 1).\n\nThere are 1 \\times 1 pair of subsequences in which the subsequences are both (), 2 \\times 2 pairs of subsequences in which the subsequences are both (1), and 1 \\times 1 pair of subsequences in which the subsequences are both (1,1), for a total of six pairs.\nNote again that we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.\n\nSample Input 3\n\n4 4\n3 4 5 6\n3 4 5 6\n\nSample Output 3\n\n16\n\nSample Input 4\n\n10 9\n9 6 5 7 5 9 8 5 6 7\n8 6 8 5 5 7 9 9 7\n\nSample Output 4\n\n191\n\nSample Input 5\n\n20 20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n\nSample Output 5\n\n846527861\n\nBe sure to print the number modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 543, "cpu_time_ms": 51, "memory_kb": 31488}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s444913828", "group_id": "codeNet:p03004", "input_text": "module mod_bounding_box\n implicit none\n real(8), parameter :: infty = 1.e12\n type :: bounding_box\n real(8) :: l(-1:1), r(-1:1)\n end type bounding_box\n private\n public :: infty\n public :: mins, maxs\n public :: bounding_box, init, add, get, event\ncontains\n subroutine mins(x,y)\n implicit none\n real(8), intent(inout) :: x\n real(8), intent(in) :: y\n x = min(x,y)\n return\n end subroutine mins\n subroutine maxs(x,y)\n implicit none\n real(8), intent(inout) :: x\n real(8), intent(in) :: y\n x = max(x,y)\n return\n end subroutine maxs\n subroutine init(bb)\n implicit none\n type(bounding_box), intent(inout) :: bb\n bb%l = infty\n bb%r = -infty\n return\n end subroutine init\n subroutine add(bb,z,i)\n implicit none\n type(bounding_box), intent(inout) :: bb\n real(8), intent(in) :: z\n integer :: i\n call mins(bb%l(i),z)\n call maxs(bb%r(i),z)\n return\n end subroutine add\n function get(bb,t) result(d)\n implicit none\n type(bounding_box), intent(in) :: bb\n real(8), intent(in) :: t\n real(8) :: d, l, r\n integer :: i\n l = infty\n r = -infty\n do i = -1, 1\n call mins(l,bb%l(i)+real(i,8)*t)\n call maxs(r,bb%r(i)+real(i,8)*t)\n end do\n d = r-l\n return\n end function get\n function event(bb) result(t)\n implicit none\n type(bounding_box), intent(in) :: bb\n real(8) :: t(6)\n t(1) = bb%l(-1)-bb%l(0)\n t(2) = 0.5d0*(bb%l(-1)-bb%l(1))\n t(3) = bb%l(0)-bb%l(1)\n t(4) = bb%r(-1)-bb%r(0)\n t(5) = 0.5d0*(bb%r(-1)-bb%r(1))\n t(6) = bb%r(0)-bb%r(1)\n return\n end function event\nend module mod_bounding_box\nprogram minimum_bounding_box\n use mod_bounding_box\n implicit none\n integer :: n, i\n real(8) :: x, y, ans, events(14)\n type(bounding_box) :: xbb, ybb\n character(1) :: d\n character(64) :: s\n call init(xbb)\n call init(ybb)\n events = 0.d0\n read(*,*) n\n do i = 1, n\n read(*,*) x, y, d\n select case(d)\n case(\"R\")\n call add(xbb,x,1)\n call add(ybb,y,0)\n case(\"L\")\n call add(xbb,x,-1)\n call add(ybb,y,0)\n case(\"U\")\n call add(xbb,x,0)\n call add(ybb,y,1)\n case(\"D\")\n call add(xbb,x,0)\n call add(ybb,y,-1)\n end select\n end do\n events(1:6) = event(xbb)\n events(7:12) = event(ybb)\n events(13) = 0.d0\n events(14) = infty\n ans = infty**3\n do i = 1, 14\n if (events(i).lt.0.d0) cycle\n call mins(ans,get(xbb,events(i))*get(ybb,events(i)))\n end do\n write(s,'(f40.16)') ans\n write(*,'(a)') trim(adjustl(s))\n stop\nend program minimum_bounding_box", "language": "Fortran", "metadata": {"date": 1560749745, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03004.html", "problem_id": "p03004", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03004/input.txt", "sample_output_relpath": "derived/input_output/data/p03004/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03004/Fortran/s444913828.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s444913828", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "module mod_bounding_box\n implicit none\n real(8), parameter :: infty = 1.e12\n type :: bounding_box\n real(8) :: l(-1:1), r(-1:1)\n end type bounding_box\n private\n public :: infty\n public :: mins, maxs\n public :: bounding_box, init, add, get, event\ncontains\n subroutine mins(x,y)\n implicit none\n real(8), intent(inout) :: x\n real(8), intent(in) :: y\n x = min(x,y)\n return\n end subroutine mins\n subroutine maxs(x,y)\n implicit none\n real(8), intent(inout) :: x\n real(8), intent(in) :: y\n x = max(x,y)\n return\n end subroutine maxs\n subroutine init(bb)\n implicit none\n type(bounding_box), intent(inout) :: bb\n bb%l = infty\n bb%r = -infty\n return\n end subroutine init\n subroutine add(bb,z,i)\n implicit none\n type(bounding_box), intent(inout) :: bb\n real(8), intent(in) :: z\n integer :: i\n call mins(bb%l(i),z)\n call maxs(bb%r(i),z)\n return\n end subroutine add\n function get(bb,t) result(d)\n implicit none\n type(bounding_box), intent(in) :: bb\n real(8), intent(in) :: t\n real(8) :: d, l, r\n integer :: i\n l = infty\n r = -infty\n do i = -1, 1\n call mins(l,bb%l(i)+real(i,8)*t)\n call maxs(r,bb%r(i)+real(i,8)*t)\n end do\n d = r-l\n return\n end function get\n function event(bb) result(t)\n implicit none\n type(bounding_box), intent(in) :: bb\n real(8) :: t(6)\n t(1) = bb%l(-1)-bb%l(0)\n t(2) = 0.5d0*(bb%l(-1)-bb%l(1))\n t(3) = bb%l(0)-bb%l(1)\n t(4) = bb%r(-1)-bb%r(0)\n t(5) = 0.5d0*(bb%r(-1)-bb%r(1))\n t(6) = bb%r(0)-bb%r(1)\n return\n end function event\nend module mod_bounding_box\nprogram minimum_bounding_box\n use mod_bounding_box\n implicit none\n integer :: n, i\n real(8) :: x, y, ans, events(14)\n type(bounding_box) :: xbb, ybb\n character(1) :: d\n character(64) :: s\n call init(xbb)\n call init(ybb)\n events = 0.d0\n read(*,*) n\n do i = 1, n\n read(*,*) x, y, d\n select case(d)\n case(\"R\")\n call add(xbb,x,1)\n call add(ybb,y,0)\n case(\"L\")\n call add(xbb,x,-1)\n call add(ybb,y,0)\n case(\"U\")\n call add(xbb,x,0)\n call add(ybb,y,1)\n case(\"D\")\n call add(xbb,x,0)\n call add(ybb,y,-1)\n end select\n end do\n events(1:6) = event(xbb)\n events(7:12) = event(ybb)\n events(13) = 0.d0\n events(14) = infty\n ans = infty**3\n do i = 1, 14\n if (events(i).lt.0.d0) cycle\n call mins(ans,get(xbb,events(i))*get(ybb,events(i)))\n end do\n write(s,'(f40.16)') ans\n write(*,'(a)') trim(adjustl(s))\n stop\nend program minimum_bounding_box", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:\n\nIf d_i = R, the i-th point moves in the positive x direction;\n\nIf d_i = L, the i-th point moves in the negative x direction;\n\nIf d_i = U, the i-th point moves in the positive y direction;\n\nIf d_i = D, the i-th point moves in the negative y direction.\n\nYou can stop all the points at some moment of your choice after they start moving (including the moment they start moving).\nThen, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.\n\nFind the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}) and print it.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n-10^8 \\leq x_i,\\ y_i \\leq 10^8\n\nx_i and y_i are integers.\n\nd_i is R, L, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 d_1\nx_2 y_2 d_2\n.\n.\n.\nx_N y_N d_N\n\nOutput\n\nPrint the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}).\n\nThe output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.\n\nSample Input 1\n\n2\n0 3 D\n3 0 L\n\nSample Output 1\n\n0\n\nAfter three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.\n\nSample Input 2\n\n5\n-7 -10 U\n7 -6 U\n-8 7 D\n-3 3 D\n0 -6 R\n\nSample Output 2\n\n97.5\n\nThe answer may not be an integer.\n\nSample Input 3\n\n20\n6 -10 R\n-4 -9 U\n9 6 D\n-3 -2 R\n0 7 D\n4 5 D\n10 -10 U\n-1 -8 U\n10 -6 D\n8 -5 U\n6 4 D\n0 3 D\n7 9 R\n9 -4 R\n3 10 D\n1 9 U\n1 -6 U\n9 -8 R\n6 7 D\n7 -3 D\n\nSample Output 3\n\n273", "sample_input": "2\n0 3 D\n3 0 L\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03004", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N points in a two-dimensional plane. The initial coordinates of the i-th point are (x_i, y_i). Now, each point starts moving at a speed of 1 per second, in a direction parallel to the x- or y- axis. You are given a character d_i that represents the specific direction in which the i-th point moves, as follows:\n\nIf d_i = R, the i-th point moves in the positive x direction;\n\nIf d_i = L, the i-th point moves in the negative x direction;\n\nIf d_i = U, the i-th point moves in the positive y direction;\n\nIf d_i = D, the i-th point moves in the negative y direction.\n\nYou can stop all the points at some moment of your choice after they start moving (including the moment they start moving).\nThen, let x_{max} and x_{min} be the maximum and minimum among the x-coordinates of the N points, respectively. Similarly, let y_{max} and y_{min} be the maximum and minimum among the y-coordinates of the N points, respectively.\n\nFind the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}) and print it.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n-10^8 \\leq x_i,\\ y_i \\leq 10^8\n\nx_i and y_i are integers.\n\nd_i is R, L, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1 d_1\nx_2 y_2 d_2\n.\n.\n.\nx_N y_N d_N\n\nOutput\n\nPrint the minimum possible value of (x_{max} - x_{min}) \\times (y_{max} - y_{min}).\n\nThe output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-9}.\n\nSample Input 1\n\n2\n0 3 D\n3 0 L\n\nSample Output 1\n\n0\n\nAfter three seconds, the two points will meet at the origin. The value in question will be 0 at that moment.\n\nSample Input 2\n\n5\n-7 -10 U\n7 -6 U\n-8 7 D\n-3 3 D\n0 -6 R\n\nSample Output 2\n\n97.5\n\nThe answer may not be an integer.\n\nSample Input 3\n\n20\n6 -10 R\n-4 -9 U\n9 6 D\n-3 -2 R\n0 7 D\n4 5 D\n10 -10 U\n-1 -8 U\n10 -6 D\n8 -5 U\n6 4 D\n0 3 D\n7 9 R\n9 -4 R\n3 10 D\n1 9 U\n1 -6 U\n9 -8 R\n6 7 D\n7 -3 D\n\nSample Output 3\n\n273", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2538, "cpu_time_ms": 111, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s847973272", "group_id": "codeNet:p03005", "input_text": "program main\n implicit none\n integer(8)::K,N\n read*,N,K\n print'(i0)',mod(N,K)\nend program main", "language": "Fortran", "metadata": {"date": 1599478332, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03005.html", "problem_id": "p03005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03005/input.txt", "sample_output_relpath": "derived/input_output/data/p03005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03005/Fortran/s847973272.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s847973272", "user_id": "u414699019"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer(8)::K,N\n read*,N,K\n print'(i0)',mod(N,K)\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "sample_input": "3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03005", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is distributing N balls to K persons.\n\nIf each person has to receive at least one ball, what is the maximum possible difference in the number of balls received between the person with the most balls and the person with the fewest balls?\n\nConstraints\n\n1 \\leq K \\leq N \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the maximum possible difference in the number of balls received.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n1\n\nThe only way to distribute three balls to two persons so that each of them receives at least one ball is to give one ball to one person and give two balls to the other person.\n\nThus, the maximum possible difference in the number of balls received is 1.\n\nSample Input 2\n\n3 1\n\nSample Output 2\n\n0\n\nWe have no choice but to give three balls to the only person, in which case the difference in the number of balls received is 0.\n\nSample Input 3\n\n8 5\n\nSample Output 3\n\n3\n\nFor example, if we give 1, 4, 1, 1, 1 balls to the five persons, the number of balls received between the person with the most balls and the person with the fewest balls would be 3, which is the maximum result.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 2932}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s146470555", "group_id": "codeNet:p03006", "input_text": "program diverta2019_2_b\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,j,p,q,cost\n integer(int32), allocatable:: x(:), y(:)\n logical,allocatable:: u(:)\n\n read*, n\n allocate(x(n), y(n), u(n))\n\n do i=1,n\n read*, x(i), y(i)\n end do\n cost = 0\n do i=1,n\n do j=1,n\n if (j==i) cycle\n p = x(j)-x(i)\n q = y(j)-y(i)\n u(:) = .false.\n cost = max(cost, calc_cost(p,q))\n end do\n end do\n print'(i0)', n-cost\ncontains\n recursive function calc_cost(p,q) result(ret)\n integer(int32):: p,q,ret\n integer(int32):: i,j\n ret = 0\n do i=1,n\n do j=1,n\n if (x(j)-x(i) == p .and. y(j)-y(i) == q) ret=ret+1\n end do\n end do\n end function\nend program diverta2019_2_b", "language": "Fortran", "metadata": {"date": 1591322397, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03006.html", "problem_id": "p03006", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03006/input.txt", "sample_output_relpath": "derived/input_output/data/p03006/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03006/Fortran/s146470555.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146470555", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program diverta2019_2_b\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,j,p,q,cost\n integer(int32), allocatable:: x(:), y(:)\n logical,allocatable:: u(:)\n\n read*, n\n allocate(x(n), y(n), u(n))\n\n do i=1,n\n read*, x(i), y(i)\n end do\n cost = 0\n do i=1,n\n do j=1,n\n if (j==i) cycle\n p = x(j)-x(i)\n q = y(j)-y(i)\n u(:) = .false.\n cost = max(cost, calc_cost(p,q))\n end do\n end do\n print'(i0)', n-cost\ncontains\n recursive function calc_cost(p,q) result(ret)\n integer(int32):: p,q,ret\n integer(int32):: i,j\n ret = 0\n do i=1,n\n do j=1,n\n if (x(j)-x(i) == p .and. y(j)-y(i) == q) ret=ret+1\n end do\n end do\n end function\nend program diverta2019_2_b", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).\n\nWe will collect all of these balls, by choosing two integers p and q such that p \\neq 0 or q \\neq 0 and then repeating the following operation:\n\nChoose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.\n\nFind the minimum total cost required to collect all the balls when we optimally choose p and q.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n|x_i|, |y_i| \\leq 10^9\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum total cost required to collect all the balls.\n\nSample Input 1\n\n2\n1 1\n2 2\n\nSample Output 1\n\n1\n\nIf we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).\n\nSample Input 2\n\n3\n1 4\n4 6\n7 8\n\nSample Output 2\n\n1\n\nIf we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).\n\nSample Input 3\n\n4\n1 1\n1 2\n2 1\n2 2\n\nSample Output 3\n\n2", "sample_input": "2\n1 1\n2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03006", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).\n\nWe will collect all of these balls, by choosing two integers p and q such that p \\neq 0 or q \\neq 0 and then repeating the following operation:\n\nChoose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.\n\nFind the minimum total cost required to collect all the balls when we optimally choose p and q.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n|x_i|, |y_i| \\leq 10^9\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum total cost required to collect all the balls.\n\nSample Input 1\n\n2\n1 1\n2 2\n\nSample Output 1\n\n1\n\nIf we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).\n\nSample Input 2\n\n3\n1 4\n4 6\n7 8\n\nSample Output 2\n\n1\n\nIf we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).\n\nSample Input 3\n\n4\n1 1\n1 2\n2 1\n2 2\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 852, "cpu_time_ms": 7, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s466439307", "group_id": "codeNet:p03007", "input_text": "program successive_subtraction\n implicit none\n integer :: n, i, l, r\n integer(8) :: a(100000), m, s\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n call quick_sort(a(1:n))\n l = 0\n do while ((l.lt.n).and.(a(l+1).lt.0))\n l = l+1\n end do\n if (l.eq.0) then\n write(*,'(i0)') sum(a(1:n))-2_8*a(1)\n m = a(1)\n do i = 2, n-1\n write(*,'(i0,x,i0)') m, a(i)\n m = m-a(i)\n end do\n write(*,'(i0,x,i0)') a(n), m\n stop\n end if\n r = n+1\n do while ((r.gt.2).and.(a(r-1).gt.0))\n r = r-1\n end do\n if (r.eq.n+1) then\n write(*,'(i0)') 2_8*a(n)-sum(a(1:n))\n m = a(n)\n do i = n-1, 1, -1\n write(*,'(i0,x,i0)') m, a(i)\n m = m-a(i)\n end do\n stop\n end if\n write(*,'(i0)') sum(a(r:n))-sum(a(1:l))\n m = a(n)\n do i = 2, r-1\n write(*,'(i0,x,i0)') m, a(i)\n m = m-a(i)\n end do\n s = a(1)\n do i = r, n-1\n write(*,'(i0,x,i0)') s, a(i)\n s = s-a(i)\n end do\n write(*,'(i0,x,i0)') m, s\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer(8), intent(inout) :: a(:)\n integer(8) :: p, c\n integer :: n, l, r\n n = size(a)\n l = 1\n r = n\n p = a((l+r)/2)+a(l)+a(r)-max(a((l+r)/2),a(l),a(r))-min(a((l+r)/2),a(l),a(r))\n do\n do while (a(l).lt.p)\n l = l+1\n end do\n do while (a(r).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1))\n if (n.gt.r+1) call quick_sort(a(r+1:n))\n end subroutine quick_sort\nend program successive_subtraction", "language": "Fortran", "metadata": {"date": 1560656883, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03007.html", "problem_id": "p03007", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03007/input.txt", "sample_output_relpath": "derived/input_output/data/p03007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03007/Fortran/s466439307.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466439307", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "program successive_subtraction\n implicit none\n integer :: n, i, l, r\n integer(8) :: a(100000), m, s\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n call quick_sort(a(1:n))\n l = 0\n do while ((l.lt.n).and.(a(l+1).lt.0))\n l = l+1\n end do\n if (l.eq.0) then\n write(*,'(i0)') sum(a(1:n))-2_8*a(1)\n m = a(1)\n do i = 2, n-1\n write(*,'(i0,x,i0)') m, a(i)\n m = m-a(i)\n end do\n write(*,'(i0,x,i0)') a(n), m\n stop\n end if\n r = n+1\n do while ((r.gt.2).and.(a(r-1).gt.0))\n r = r-1\n end do\n if (r.eq.n+1) then\n write(*,'(i0)') 2_8*a(n)-sum(a(1:n))\n m = a(n)\n do i = n-1, 1, -1\n write(*,'(i0,x,i0)') m, a(i)\n m = m-a(i)\n end do\n stop\n end if\n write(*,'(i0)') sum(a(r:n))-sum(a(1:l))\n m = a(n)\n do i = 2, r-1\n write(*,'(i0,x,i0)') m, a(i)\n m = m-a(i)\n end do\n s = a(1)\n do i = r, n-1\n write(*,'(i0,x,i0)') s, a(i)\n s = s-a(i)\n end do\n write(*,'(i0,x,i0)') m, s\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer(8), intent(inout) :: a(:)\n integer(8) :: p, c\n integer :: n, l, r\n n = size(a)\n l = 1\n r = n\n p = a((l+r)/2)+a(l)+a(r)-max(a((l+r)/2),a(l),a(r))-min(a((l+r)/2),a(l),a(r))\n do\n do while (a(l).lt.p)\n l = l+1\n end do\n do while (a(r).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1))\n if (n.gt.r+1) call quick_sort(a(r+1:n))\n end subroutine quick_sort\nend program successive_subtraction", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1582, "cpu_time_ms": 96, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s771845227", "group_id": "codeNet:p03007", "input_text": "integer N\ninteger,allocatable,dimension(:)::X\ninteger(8),allocatable,dimension(:)::ansx,ansy\ninteger(8) ans\nread*,N\nallocate(X(N))\nread*,X\ncall heapsort(N,X)\n\nallocate(ansx(N-1),ansy(N-1))\nif(mod(N,2)==1)then\n ansx(1)=x(1)\n ansy(1)=x(N)\n do i=2,N-1\n if(mod(i,2)==0)then\n ansx(i)=x(1+i/2)\n else\n ansx(i)=x(N-i/2)\n endif\n ansy(i)=ansx(i-1)-ansy(i-1)\n end do\nelse\n ansx(1)=x(N)\n ansy(1)=x(1)\n do i=2,N-1\n if(mod(i,2)==0)then\n ansx(i)=x(1+i/2)\n else\n ansx(i)=x(N-i/2)\n endif\n ansy(i)=ansx(i-1)-ansy(i-1)\n end do\nendif\n\nans=ansx(N-1)-ansy(N-1)\n\nprint\"(i0)\",ans\ndo i=1,N-1\n print\"(i0,A,i0)\",ansx(i),\" \",ansy(i)\nend do\ncontains\n\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n integer::i,k,j,l\n integer:: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend", "language": "Fortran", "metadata": {"date": 1560650450, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03007.html", "problem_id": "p03007", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03007/input.txt", "sample_output_relpath": "derived/input_output/data/p03007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03007/Fortran/s771845227.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s771845227", "user_id": "u598073939"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "integer N\ninteger,allocatable,dimension(:)::X\ninteger(8),allocatable,dimension(:)::ansx,ansy\ninteger(8) ans\nread*,N\nallocate(X(N))\nread*,X\ncall heapsort(N,X)\n\nallocate(ansx(N-1),ansy(N-1))\nif(mod(N,2)==1)then\n ansx(1)=x(1)\n ansy(1)=x(N)\n do i=2,N-1\n if(mod(i,2)==0)then\n ansx(i)=x(1+i/2)\n else\n ansx(i)=x(N-i/2)\n endif\n ansy(i)=ansx(i-1)-ansy(i-1)\n end do\nelse\n ansx(1)=x(N)\n ansy(1)=x(1)\n do i=2,N-1\n if(mod(i,2)==0)then\n ansx(i)=x(1+i/2)\n else\n ansx(i)=x(N-i/2)\n endif\n ansy(i)=ansx(i-1)-ansy(i-1)\n end do\nendif\n\nans=ansx(N-1)-ansy(N-1)\n\nprint\"(i0)\",ans\ndo i=1,N-1\n print\"(i0,A,i0)\",ansx(i),\" \",ansy(i)\nend do\ncontains\n\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n integer::i,k,j,l\n integer:: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1435, "cpu_time_ms": 110, "memory_kb": 4352}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s083200766", "group_id": "codeNet:p03007", "input_text": "program successive_subtraction\n implicit none\n integer :: n, i\n integer(8) :: a(100000), m\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n call merge_sort(n,a(1:n))\n if (mod(n,2).eq.1) then\n m = a(n)\n do i = 1, n/2\n m = m+a(n-i)-a(i)\n end do\n write(*,'(i0)') m\n do i = 1, n/2\n write(*,'(i0,x,i0)') a(i), a(n-i)\n end do\n m = a(n)\n do i = 1, n/2\n write(*,'(i0,x,i0)') m, a(i)-a(n-i)\n m = m+a(n-i)-a(i)\n end do\n else\n m = a(n)-a(1)\n do i = 2, n/2\n m = m+a(n-i+1)-a(i)\n end do\n write(*,'(i0)') m\n write(*,'(i0)') a(n), a(1)\n do i = 2, n/2\n write(*,'(i0,x,i0)') a(i), a(n-i+1)\n end do\n m = a(n)-a(1)\n do i = 2, n/2\n write(*,'(i0,x,i0)') m, a(i)-a(n-i+1)\n m = m+a(n-i+1)-a(i)\n end do\n end if\n stop\ncontains\n subroutine merge_sort(n,c)\n implicit none\n integer, intent(in) :: n\n integer(8), intent(inout) :: c(n)\n integer :: m, l, i, u\n m = n\n l = 1\n do while (m.gt.1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merge(c(2*(i-1)*l+1:(2*i-1)*l),c((2*i-1)*l+1:u))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merge(c1,c2)\n implicit none\n integer(8), intent(inout) :: c1(:), c2(:)\n integer(8) :: c(size(c1)+size(c2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1)\n n2 = size(c2)\n do while (i1.le.n1.and.i2.le.n2)\n if (c1(i1).le.c2(i2)) then\n c(i1+i2-1) = c1(i1)\n i1 = i1+1\n else\n c(i1+i2-1) = c2(i2)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2) = c1(i1:n1)\n else if (i2.le.n2) then\n c(i1+i2-1:n1+n2) = c2(i2:n2)\n end if\n c1 = c(1:n1)\n c2 = c(n1+1:n1+n2)\n return\n end subroutine merge\nend program successive_subtraction", "language": "Fortran", "metadata": {"date": 1560648729, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03007.html", "problem_id": "p03007", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03007/input.txt", "sample_output_relpath": "derived/input_output/data/p03007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03007/Fortran/s083200766.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s083200766", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "program successive_subtraction\n implicit none\n integer :: n, i\n integer(8) :: a(100000), m\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n call merge_sort(n,a(1:n))\n if (mod(n,2).eq.1) then\n m = a(n)\n do i = 1, n/2\n m = m+a(n-i)-a(i)\n end do\n write(*,'(i0)') m\n do i = 1, n/2\n write(*,'(i0,x,i0)') a(i), a(n-i)\n end do\n m = a(n)\n do i = 1, n/2\n write(*,'(i0,x,i0)') m, a(i)-a(n-i)\n m = m+a(n-i)-a(i)\n end do\n else\n m = a(n)-a(1)\n do i = 2, n/2\n m = m+a(n-i+1)-a(i)\n end do\n write(*,'(i0)') m\n write(*,'(i0)') a(n), a(1)\n do i = 2, n/2\n write(*,'(i0,x,i0)') a(i), a(n-i+1)\n end do\n m = a(n)-a(1)\n do i = 2, n/2\n write(*,'(i0,x,i0)') m, a(i)-a(n-i+1)\n m = m+a(n-i+1)-a(i)\n end do\n end if\n stop\ncontains\n subroutine merge_sort(n,c)\n implicit none\n integer, intent(in) :: n\n integer(8), intent(inout) :: c(n)\n integer :: m, l, i, u\n m = n\n l = 1\n do while (m.gt.1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merge(c(2*(i-1)*l+1:(2*i-1)*l),c((2*i-1)*l+1:u))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merge(c1,c2)\n implicit none\n integer(8), intent(inout) :: c1(:), c2(:)\n integer(8) :: c(size(c1)+size(c2))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1)\n n2 = size(c2)\n do while (i1.le.n1.and.i2.le.n2)\n if (c1(i1).le.c2(i2)) then\n c(i1+i2-1) = c1(i1)\n i1 = i1+1\n else\n c(i1+i2-1) = c2(i2)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2) = c1(i1:n1)\n else if (i2.le.n2) then\n c(i1+i2-1:n1+n2) = c2(i2:n2)\n end if\n c1 = c(1:n1)\n c2 = c(n1+1:n1+n2)\n return\n end subroutine merge\nend program successive_subtraction", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1841, "cpu_time_ms": 99, "memory_kb": 3176}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s653305893", "group_id": "codeNet:p03010", "input_text": "program diverta_city\n integer :: n, i, j\n integer(8), dimension(10) :: a = (/0,1,2,4,7,12,20,29,38,52/), f = 0\n read(*,*) n\n f(3) = 1\n do i = 4, n\n f(i) = f(i-1)*(a(i-1)+a(i-2)+1)\n end do\n do i = 1, n\n do j = 1, n\n if (i == j) then\n write(*,'(i0,x)',advance='no') 0\n cycle\n end if\n write(*,'(i0,x)',advance='no') f(max(i,j))*a(min(i,j)+1)+1\n end do\n write(*,*)\n end do\nend program diverta_city", "language": "Fortran", "metadata": {"date": 1571213315, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03010.html", "problem_id": "p03010", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03010/input.txt", "sample_output_relpath": "derived/input_output/data/p03010/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03010/Fortran/s653305893.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s653305893", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0 6 15\n6 0 21\n15 21 0\n", "input_to_evaluate": "program diverta_city\n integer :: n, i, j\n integer(8), dimension(10) :: a = (/0,1,2,4,7,12,20,29,38,52/), f = 0\n read(*,*) n\n f(3) = 1\n do i = 4, n\n f(i) = f(i-1)*(a(i-1)+a(i-2)+1)\n end do\n do i = 1, n\n do j = 1, n\n if (i == j) then\n write(*,'(i0,x)',advance='no') 0\n cycle\n end if\n write(*,'(i0,x)',advance='no') f(max(i,j))*a(min(i,j)+1)+1\n end do\n write(*,*)\n end do\nend program diverta_city", "problem_context": "Score : 900 points\n\nProblem Statement\n\nDiverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is planning to connect every pair of two different towns with a bidirectional road. The length of each road is undecided.\n\nA Hamiltonian path is a path that starts at one of the towns and visits each of the other towns exactly once.\nThe reversal of a Hamiltonian path is considered the same as the original Hamiltonian path.\n\nThere are N! / 2 Hamiltonian paths. Ringo wants all these paths to have distinct total lengths (the sum of the lengths of the roads on a path), to make the city diverse.\n\nFind one such set of the lengths of the roads, under the following conditions:\n\nThe length of each road must be a positive integer.\n\nThe maximum total length of a Hamiltonian path must be at most 10^{11}.\n\nConstraints\n\nN is a integer between 2 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint a set of the lengths of the roads that meets the objective, in the following format:\n\nw_{1, 1} \\ w_{1, 2} \\ w_{1, 3} \\ ... \\ w_{1, N}\nw_{2, 1} \\ w_{2, 2} \\ w_{2, 3} \\ ... \\ w_{2, N}\n: : :\nw_{N, 1} \\ w_{N, 2} \\ w_{N, 3} \\ ... \\ w_{N, N}\n\nwhere w_{i, j} is the length of the road connecting Town i and Town j, which must satisfy the following conditions:\n\nw_{i, i} = 0\n\nw_{i, j} = w_{j, i} \\ (i \\neq j)\n\n1 \\leq w_{i, j} \\leq 10^{11} \\ (i \\neq j)\n\nIf there are multiple sets of lengths of the roads that meet the objective, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n0 6 15\n6 0 21\n15 21 0\n\nThere are three Hamiltonian paths. The total lengths of these paths are as follows:\n\n1 → 2 → 3: The total length is 6 + 21 = 27.\n\n1 → 3 → 2: The total length is 15 + 21 = 36.\n\n2 → 1 → 3: The total length is 6 + 15 = 21.\n\nThey are distinct, so the objective is met.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0\n\nThere are 12 Hamiltonian paths, with distinct total lengths.", "sample_input": "3\n"}, "reference_outputs": ["0 6 15\n6 0 21\n15 21 0\n"], "source_document_id": "p03010", "source_text": "Score : 900 points\n\nProblem Statement\n\nDiverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is planning to connect every pair of two different towns with a bidirectional road. The length of each road is undecided.\n\nA Hamiltonian path is a path that starts at one of the towns and visits each of the other towns exactly once.\nThe reversal of a Hamiltonian path is considered the same as the original Hamiltonian path.\n\nThere are N! / 2 Hamiltonian paths. Ringo wants all these paths to have distinct total lengths (the sum of the lengths of the roads on a path), to make the city diverse.\n\nFind one such set of the lengths of the roads, under the following conditions:\n\nThe length of each road must be a positive integer.\n\nThe maximum total length of a Hamiltonian path must be at most 10^{11}.\n\nConstraints\n\nN is a integer between 2 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint a set of the lengths of the roads that meets the objective, in the following format:\n\nw_{1, 1} \\ w_{1, 2} \\ w_{1, 3} \\ ... \\ w_{1, N}\nw_{2, 1} \\ w_{2, 2} \\ w_{2, 3} \\ ... \\ w_{2, N}\n: : :\nw_{N, 1} \\ w_{N, 2} \\ w_{N, 3} \\ ... \\ w_{N, N}\n\nwhere w_{i, j} is the length of the road connecting Town i and Town j, which must satisfy the following conditions:\n\nw_{i, i} = 0\n\nw_{i, j} = w_{j, i} \\ (i \\neq j)\n\n1 \\leq w_{i, j} \\leq 10^{11} \\ (i \\neq j)\n\nIf there are multiple sets of lengths of the roads that meet the objective, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n0 6 15\n6 0 21\n15 21 0\n\nThere are three Hamiltonian paths. The total lengths of these paths are as follows:\n\n1 → 2 → 3: The total length is 6 + 21 = 27.\n\n1 → 3 → 2: The total length is 15 + 21 = 36.\n\n2 → 1 → 3: The total length is 6 + 15 = 21.\n\nThey are distinct, so the objective is met.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0\n\nThere are 12 Hamiltonian paths, with distinct total lengths.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s822135900", "group_id": "codeNet:p03011", "input_text": "program main\n\timplicit none\n integer :: p, q, r, a(3), minimum\n read(*, *) p, q, r\n a(1) = p + q\n a(2) = q + r\n a(3) = r + p\n minimum = minval(a)\n write(*, *) minimum\nstop\nend program main", "language": "Fortran", "metadata": {"date": 1560363060, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/Fortran/s822135900.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822135900", "user_id": "u337929351"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n\timplicit none\n integer :: p, q, r, a(3), minimum\n read(*, *) p, q, r\n a(1) = p + q\n a(2) = q + r\n a(3) = r + p\n minimum = minval(a)\n write(*, *) minimum\nstop\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s334141363", "group_id": "codeNet:p03012", "input_text": "program a\n implicit none\n integer :: N,i,ale,ue,dif\n integer,allocatable :: W(:)\n read(*,*) N\n allocate(W(N))\n read(*,*) W\n ale=sum(W)\n dif=ale\n do i=1,N\n ue=sum(W(1:i))\n if(dif.gt.abs(ale-2*ue)) then\n dif=abs(ale-2*ue)\n endif\n enddo\n write(*,'(i0)') dif\n\n deallocate(W)\nend program a\n\n\n", "language": "Fortran", "metadata": {"date": 1560129117, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03012.html", "problem_id": "p03012", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03012/input.txt", "sample_output_relpath": "derived/input_output/data/p03012/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03012/Fortran/s334141363.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334141363", "user_id": "u613124399"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "program a\n implicit none\n integer :: N,i,ale,ue,dif\n integer,allocatable :: W(:)\n read(*,*) N\n allocate(W(N))\n read(*,*) W\n ale=sum(W)\n dif=ale\n do i=1,N\n ue=sum(W(1:i))\n if(dif.gt.abs(ale-2*ue)) then\n dif=abs(ale-2*ue)\n endif\n enddo\n write(*,'(i0)') dif\n\n deallocate(W)\nend program a\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03012", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N weights indexed 1 to N. The \bmass of the weight indexed i is W_i.\n\nWe will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \\leq T < N. Let S_1 be the sum of the masses of the weights in the former group, and S_2 be the sum of the masses of the weights in the latter group.\n\nConsider all possible such divisions and find the minimum possible absolute difference of S_1 and S_2.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq W_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nW_1 W_2 ... W_{N-1} W_N\n\nOutput\n\nPrint the minimum possible absolute difference of S_1 and S_2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n0\n\nIf T = 2, S_1 = 1 + 2 = 3 and S_2 = 3, with the absolute difference of 0.\n\nSample Input 2\n\n4\n1 3 1 1\n\nSample Output 2\n\n2\n\nIf T = 2, S_1 = 1 + 3 = 4 and S_2 = 1 + 1 = 2, with the absolute difference of 2. We cannot have a smaller absolute difference.\n\nSample Input 3\n\n8\n27 23 76 2 3 5 62 52\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s516113263", "group_id": "codeNet:p03013", "input_text": "program abc129c\n implicit none\n integer :: n, m, i\n integer,dimension(:),allocatable :: s, a\n read *, n, m\n allocate(s(-1:n))\n s = 1\n s(-1) = 0\n if (m/=0) then\n allocate(a(m))\n read *, a\n s(a) = 0\n end if\n do i = 1,n\n if (s(i)/=0) s(i) = mod(s(i-1)+s(i-2),10**9+7)\n end do\n print *, s(n)\nend program abc129c\n", "language": "Fortran", "metadata": {"date": 1560269638, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03013.html", "problem_id": "p03013", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03013/input.txt", "sample_output_relpath": "derived/input_output/data/p03013/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03013/Fortran/s516113263.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s516113263", "user_id": "u081445141"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program abc129c\n implicit none\n integer :: n, m, i\n integer,dimension(:),allocatable :: s, a\n read *, n, m\n allocate(s(-1:n))\n s = 1\n s(-1) = 0\n if (m/=0) then\n allocate(a(m))\n read *, a\n s(a) = 0\n end if\n do i = 1,n\n if (s(i)/=0) s(i) = mod(s(i-1)+s(i-2),10**9+7)\n end do\n print *, s(n)\nend program abc129c\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "sample_input": "6 1\n3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03013", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 26, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s425951157", "group_id": "codeNet:p03014", "input_text": "program abc129_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h,w,x,y\n integer(int32):: l\n integer(int32), allocatable:: a(:,:),ta(:)\n character(1), allocatable:: s(:,:)\n\n\n read*, h,w\n allocate(a(w,h), s(w,h))\n\n input_s : block\n character(w):: inpt_s\n do y=1,h\n read*, inpt_s\n do x=1,w\n s(x,y) = inpt_s(x:x)\n end do\n end do\n end block input_s\n\n allocate(ta(0:w+1))\n a(:,:) = 0\n do y=1,h\n ta(:) = 0\n do x=1,w\n if (s(x,y) == '.') then\n ta(x) = ta(x-1) + 1\n else\n ta(x) = 0\n end if\n end do\n a(:,y) = a(:,y) + ta(1:w)\n ta(:) = 0\n do x=w,1,-1\n if (s(x,y) == '.') then\n ta(x) = ta(x+1)+1\n else\n ta(x) = 0\n end if\n end do\n a(:,y) = a(:,y) + ta(1:w)\n end do\n\n deallocate(ta)\n allocate(ta(0:h+1))\n\n do x=1,w\n ta(:) = 0\n do y=1,h\n if (s(x,y) == '.') then\n ta(y) = ta(y-1) + 1\n else\n ta(y) = 0\n end if\n end do\n a(x,:) = a(x,:) + ta(1:h)\n ta(:) = 0\n do y=h,1,-1\n if (s(x,y) == '.') then\n ta(y) = ta(y+1) + 1\n else\n ta(y) = 0\n end if\n end do\n a(x,:) = a(x,:) + ta(1:h)\n end do\n\n a(:,:)=a(:,:)-3\n print'(i0)', maxval(a)\nend program abc129_d", "language": "Fortran", "metadata": {"date": 1591388309, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03014.html", "problem_id": "p03014", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03014/input.txt", "sample_output_relpath": "derived/input_output/data/p03014/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03014/Fortran/s425951157.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s425951157", "user_id": "u234636620"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program abc129_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h,w,x,y\n integer(int32):: l\n integer(int32), allocatable:: a(:,:),ta(:)\n character(1), allocatable:: s(:,:)\n\n\n read*, h,w\n allocate(a(w,h), s(w,h))\n\n input_s : block\n character(w):: inpt_s\n do y=1,h\n read*, inpt_s\n do x=1,w\n s(x,y) = inpt_s(x:x)\n end do\n end do\n end block input_s\n\n allocate(ta(0:w+1))\n a(:,:) = 0\n do y=1,h\n ta(:) = 0\n do x=1,w\n if (s(x,y) == '.') then\n ta(x) = ta(x-1) + 1\n else\n ta(x) = 0\n end if\n end do\n a(:,y) = a(:,y) + ta(1:w)\n ta(:) = 0\n do x=w,1,-1\n if (s(x,y) == '.') then\n ta(x) = ta(x+1)+1\n else\n ta(x) = 0\n end if\n end do\n a(:,y) = a(:,y) + ta(1:w)\n end do\n\n deallocate(ta)\n allocate(ta(0:h+1))\n\n do x=1,w\n ta(:) = 0\n do y=1,h\n if (s(x,y) == '.') then\n ta(y) = ta(y-1) + 1\n else\n ta(y) = 0\n end if\n end do\n a(x,:) = a(x,:) + ta(1:h)\n ta(:) = 0\n do y=h,1,-1\n if (s(x,y) == '.') then\n ta(y) = ta(y+1) + 1\n else\n ta(y) = 0\n end if\n end do\n a(x,:) = a(x,:) + ta(1:h)\n end do\n\n a(:,:)=a(:,:)-3\n print'(i0)', maxval(a)\nend program abc129_d", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "sample_input": "4 6\n#..#..\n.....#\n....#.\n#.#...\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03014", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1541, "cpu_time_ms": 206, "memory_kb": 19712}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s514929980", "group_id": "codeNet:p03014", "input_text": "program abc129d\n implicit none\n character(2000),dimension(:),allocatable :: s\n integer :: h, w, i, j\n integer,dimension(:,:,:),allocatable :: grid\n\n read *, h, w\n allocate(s(h),grid(w,h,3))\n read *, s\n\n do i = 1,h\n do j = 1,w\n grid(j,i,:) = merge(0,1,s(i)(j:j)=='#')\n end do\n end do\n\n do j = 2,w\n grid(j,:,2) = merge(grid(j,:,2)+grid(j-1,:,2),grid(j,:,2),grid(j,:,1)/=0)\n end do\n\n do j = w-1,1,-1\n grid(j,:,2) = merge(grid(j+1,:,2),grid(j,:,2),grid(j,:,1)/=0.and.grid(j+1,:,1)/=0)\n end do\n\n do i = 2,h\n grid(:,i,3) = merge(grid(:,i,3)+grid(:,i-1,3),grid(:,i,3),grid(:,i,1)/=0)\n end do\n\n do i = h-1,1,-1\n grid(:,i,3) = merge(grid(:,i+1,3),grid(:,i,3),grid(:,i,1)/=0.and.grid(:,i+1,1)/=0)\n end do\n\n print *, maxval(grid(:,:,2)+grid(:,:,3))-1\nend program abc129d\n", "language": "Fortran", "metadata": {"date": 1560249372, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03014.html", "problem_id": "p03014", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03014/input.txt", "sample_output_relpath": "derived/input_output/data/p03014/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03014/Fortran/s514929980.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514929980", "user_id": "u081445141"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program abc129d\n implicit none\n character(2000),dimension(:),allocatable :: s\n integer :: h, w, i, j\n integer,dimension(:,:,:),allocatable :: grid\n\n read *, h, w\n allocate(s(h),grid(w,h,3))\n read *, s\n\n do i = 1,h\n do j = 1,w\n grid(j,i,:) = merge(0,1,s(i)(j:j)=='#')\n end do\n end do\n\n do j = 2,w\n grid(j,:,2) = merge(grid(j,:,2)+grid(j-1,:,2),grid(j,:,2),grid(j,:,1)/=0)\n end do\n\n do j = w-1,1,-1\n grid(j,:,2) = merge(grid(j+1,:,2),grid(j,:,2),grid(j,:,1)/=0.and.grid(j+1,:,1)/=0)\n end do\n\n do i = 2,h\n grid(:,i,3) = merge(grid(:,i,3)+grid(:,i-1,3),grid(:,i,3),grid(:,i,1)/=0)\n end do\n\n do i = h-1,1,-1\n grid(:,i,3) = merge(grid(:,i+1,3),grid(:,i,3),grid(:,i,1)/=0.and.grid(:,i+1,1)/=0)\n end do\n\n print *, maxval(grid(:,:,2)+grid(:,:,3))-1\nend program abc129d\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "sample_input": "4 6\n#..#..\n.....#\n....#.\n#.#...\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03014", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 809, "cpu_time_ms": 156, "memory_kb": 51584}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s010629181", "group_id": "codeNet:p03016", "input_text": "module mod_modint\n implicit none\n integer(8) :: modulus = 998244353_8\n type modint\n private\n integer(8) :: num\n contains\n procedure :: get => getnum\n end type\n interface change_modulus\n module procedure :: change_modulus64, change_modulus32\n end interface change_modulus\n interface assignment(=)\n module procedure :: setm, seti64, seti32\n end interface assignment(=)\n\n interface operator(+)\n module procedure :: posm, addmm, addmi64, addmi32, addi64m, addi32m\n end interface operator(+)\n\n interface operator(-)\n module procedure :: negm, submm, submi64, submi32, subi64m, subi32m\n end interface operator(-)\n\n interface operator(*)\n module procedure :: mulmm, mulmi64, mulmi32, muli64m, muli32m\n end interface operator(*)\n\n interface operator(/)\n module procedure :: divmm, divmi64, divmi32, divi64m, divi32m\n end interface operator(/)\n\n interface operator(**)\n module procedure :: powmi64, powmi32\n end interface operator(**)\n\n interface inv\n module procedure :: invm\n end interface inv\n\ncontains\n subroutine change_modulus64(newmod)\n integer(8), intent(in) :: newmod\n if (newmod == 0_8) then\n write(*,'(a)') \"Error: Invalid value (newmod == 0). (modint, change_modulus64)\"\n stop\n end if\n modulus = newmod\n end\n\n subroutine change_modulus32(newmod)\n integer, intent(in) :: newmod\n if (newmod == 0) then\n write(*,'(a)') \"Error: Invalid value (newmod == 0). (modint, change_modulus32)\"\n stop\n end if\n modulus = int(newmod,8)\n end\n integer(8) function getnum(this)\n class(modint), intent(in) :: this\n getnum = this%num\n end\n\n pure elemental type(modint) function newm()\n newm%num = 0_8\n end\n\n pure elemental subroutine setm(x,y)\n type(modint), intent(inout) :: x\n type(modint), intent(in) :: y\n x%num = y%num\n end\n\n pure elemental function posm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = x%num\n end\n\n pure elemental function negm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = modulus-x%num\n end\n\n pure elemental function addmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num+y%num\n if (n%num >= modulus) n%num = n%num-modulus\n end\n\n pure elemental function submm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num-y%num\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n pure elemental function mulmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = mod(x%num*y%num,modulus)\n end\n\n impure elemental function invm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n integer(8) :: a, b, c, q, r, v\n a = x%num\n if (a == 0_8) then\n write(*,'(a)') \"Error: Division by zero (x == 0). (modint, invm)\"\n stop\n end if\n b = modulus\n c = 0_8\n v = 1_8\n do while (b /= 0_8)\n q = a/b\n r = mod(a,b)\n a = b\n b = r\n r = c\n c = v-c*q\n v = r\n end do\n n%num = mod(v,modulus)\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n impure elemental function divmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n = mulmm(x,invm(y))\n end\n\n impure elemental type(modint) function newi(i)\n class(*), intent(in) :: i\n select type(i)\n type is (integer(8))\n newi%num = i\n type is (integer)\n newi%num = int(i,8)\n type is (integer(2))\n newi%num = int(i,8)\n type is (integer(1))\n newi%num = int(i,8)\n class default\n write(*,'(a)') \"Error: Invalid value (i is not integer). (modint, newi)\"\n stop\n end select\n newi%num = mod(newi%num,modulus)\n if (newi%num < 0_8) newi%num = newi%num+modulus\n end\n\n impure elemental subroutine seti64(x,i)\n type(modint), intent(inout) :: x\n integer(8), intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental subroutine seti32(x,i)\n type(modint), intent(inout) :: x\n integer, intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental function addmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function addi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function submi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function submi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function subi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function subi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function mulmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function mulmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function muli64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function muli32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function divmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function divi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function powmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n, p\n integer(8) :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0_8) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0_8)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\n impure elemental function powmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n, p\n integer :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\nend module mod_modint\nprogram main\n use mod_modint\n implicit none\n integer(8)::L,A,B\n integer::M\n type(modint)::mat(3,3),matd(3,3)\n integer(16)::C_d\n integer::i,j\n type(modint)::ANS(3)\n read*,L,A,B,M\n call change_modulus(M)\n\n ANS(1)=0;ANS(2)=A;ANS(3)=1\n matd=0\n matd(1,1)=1;matd(1,2)=1\n matd(2,2)=1;matd(2,3)=B\n matd(3,3)=1\n do i=1,18\n C_d=cnt(10_16**i)-cnt(10_16**(i-1))\n matd(1,1)=matd(1,1)*10\n mat=Mat_Pow(matd,C_d)\n ANS=mat_vec(mat,ANS)\n end do\n print\"(i0)\",getnum(ANS(1))\ncontains\n function cnt(N)\n integer(16)::N\n integer(16)::cnt\n cnt=merge( 0_16,(N - A + B-1)/ B,N<=A)\n cnt=min(cnt,L)\n end function\n function Mat_Pow(Re,N)result(res)\n type(modint),intent(in)::Re(3,3)\n integer(16)::N\n type(modint)::res(3,3),B(3,3)\n integer::i\n res=0\n do i=1,3\n res(i,i)=1\n end do\n B=Re\n do i=1,bit_size(N)\n if(btest(N,i-1))res=mat_mul(res,B)\n B=mat_mul(B,B)\n end do\n end function\n function mat_mul(A,B)result(res)\n type(modint),intent(in)::A(3,3),B(3,3)\n type(modint)::res(3,3)\n integer::i,j,k\n res=0\n do i=1,3\n do j=1,3\n do k=1,3\n res(i,j)=res(i,j)+A(i,k)*B(k,j)\n end do\n end do\n end do\n end function\n function mat_vec(A,B)result(res)\n type(modint),intent(in)::A(3,3),B(3)\n type(modint)::res(3)\n integer::i,j\n res=0\n do i=1,3\n do j=1,3\n res(i)=res(i)+A(i,j)*B(j)\n end do\n end do\n end function\nend program main", "language": "Fortran", "metadata": {"date": 1584852159, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03016.html", "problem_id": "p03016", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03016/input.txt", "sample_output_relpath": "derived/input_output/data/p03016/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03016/Fortran/s010629181.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010629181", "user_id": "u598073939"}, "prompt_components": {"gold_output": "5563\n", "input_to_evaluate": "module mod_modint\n implicit none\n integer(8) :: modulus = 998244353_8\n type modint\n private\n integer(8) :: num\n contains\n procedure :: get => getnum\n end type\n interface change_modulus\n module procedure :: change_modulus64, change_modulus32\n end interface change_modulus\n interface assignment(=)\n module procedure :: setm, seti64, seti32\n end interface assignment(=)\n\n interface operator(+)\n module procedure :: posm, addmm, addmi64, addmi32, addi64m, addi32m\n end interface operator(+)\n\n interface operator(-)\n module procedure :: negm, submm, submi64, submi32, subi64m, subi32m\n end interface operator(-)\n\n interface operator(*)\n module procedure :: mulmm, mulmi64, mulmi32, muli64m, muli32m\n end interface operator(*)\n\n interface operator(/)\n module procedure :: divmm, divmi64, divmi32, divi64m, divi32m\n end interface operator(/)\n\n interface operator(**)\n module procedure :: powmi64, powmi32\n end interface operator(**)\n\n interface inv\n module procedure :: invm\n end interface inv\n\ncontains\n subroutine change_modulus64(newmod)\n integer(8), intent(in) :: newmod\n if (newmod == 0_8) then\n write(*,'(a)') \"Error: Invalid value (newmod == 0). (modint, change_modulus64)\"\n stop\n end if\n modulus = newmod\n end\n\n subroutine change_modulus32(newmod)\n integer, intent(in) :: newmod\n if (newmod == 0) then\n write(*,'(a)') \"Error: Invalid value (newmod == 0). (modint, change_modulus32)\"\n stop\n end if\n modulus = int(newmod,8)\n end\n integer(8) function getnum(this)\n class(modint), intent(in) :: this\n getnum = this%num\n end\n\n pure elemental type(modint) function newm()\n newm%num = 0_8\n end\n\n pure elemental subroutine setm(x,y)\n type(modint), intent(inout) :: x\n type(modint), intent(in) :: y\n x%num = y%num\n end\n\n pure elemental function posm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = x%num\n end\n\n pure elemental function negm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = modulus-x%num\n end\n\n pure elemental function addmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num+y%num\n if (n%num >= modulus) n%num = n%num-modulus\n end\n\n pure elemental function submm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num-y%num\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n pure elemental function mulmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = mod(x%num*y%num,modulus)\n end\n\n impure elemental function invm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n integer(8) :: a, b, c, q, r, v\n a = x%num\n if (a == 0_8) then\n write(*,'(a)') \"Error: Division by zero (x == 0). (modint, invm)\"\n stop\n end if\n b = modulus\n c = 0_8\n v = 1_8\n do while (b /= 0_8)\n q = a/b\n r = mod(a,b)\n a = b\n b = r\n r = c\n c = v-c*q\n v = r\n end do\n n%num = mod(v,modulus)\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n impure elemental function divmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n = mulmm(x,invm(y))\n end\n\n impure elemental type(modint) function newi(i)\n class(*), intent(in) :: i\n select type(i)\n type is (integer(8))\n newi%num = i\n type is (integer)\n newi%num = int(i,8)\n type is (integer(2))\n newi%num = int(i,8)\n type is (integer(1))\n newi%num = int(i,8)\n class default\n write(*,'(a)') \"Error: Invalid value (i is not integer). (modint, newi)\"\n stop\n end select\n newi%num = mod(newi%num,modulus)\n if (newi%num < 0_8) newi%num = newi%num+modulus\n end\n\n impure elemental subroutine seti64(x,i)\n type(modint), intent(inout) :: x\n integer(8), intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental subroutine seti32(x,i)\n type(modint), intent(inout) :: x\n integer, intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental function addmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function addi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function submi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function submi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function subi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function subi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function mulmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function mulmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function muli64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function muli32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function divmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function divi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function powmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n, p\n integer(8) :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0_8) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0_8)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\n impure elemental function powmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n, p\n integer :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\nend module mod_modint\nprogram main\n use mod_modint\n implicit none\n integer(8)::L,A,B\n integer::M\n type(modint)::mat(3,3),matd(3,3)\n integer(16)::C_d\n integer::i,j\n type(modint)::ANS(3)\n read*,L,A,B,M\n call change_modulus(M)\n\n ANS(1)=0;ANS(2)=A;ANS(3)=1\n matd=0\n matd(1,1)=1;matd(1,2)=1\n matd(2,2)=1;matd(2,3)=B\n matd(3,3)=1\n do i=1,18\n C_d=cnt(10_16**i)-cnt(10_16**(i-1))\n matd(1,1)=matd(1,1)*10\n mat=Mat_Pow(matd,C_d)\n ANS=mat_vec(mat,ANS)\n end do\n print\"(i0)\",getnum(ANS(1))\ncontains\n function cnt(N)\n integer(16)::N\n integer(16)::cnt\n cnt=merge( 0_16,(N - A + B-1)/ B,N<=A)\n cnt=min(cnt,L)\n end function\n function Mat_Pow(Re,N)result(res)\n type(modint),intent(in)::Re(3,3)\n integer(16)::N\n type(modint)::res(3,3),B(3,3)\n integer::i\n res=0\n do i=1,3\n res(i,i)=1\n end do\n B=Re\n do i=1,bit_size(N)\n if(btest(N,i-1))res=mat_mul(res,B)\n B=mat_mul(B,B)\n end do\n end function\n function mat_mul(A,B)result(res)\n type(modint),intent(in)::A(3,3),B(3,3)\n type(modint)::res(3,3)\n integer::i,j,k\n res=0\n do i=1,3\n do j=1,3\n do k=1,3\n res(i,j)=res(i,j)+A(i,k)*B(k,j)\n end do\n end do\n end do\n end function\n function mat_vec(A,B)result(res)\n type(modint),intent(in)::A(3,3),B(3)\n type(modint)::res(3)\n integer::i,j\n res=0\n do i=1,3\n do j=1,3\n res(i)=res(i)+A(i,j)*B(j)\n end do\n end do\n end function\nend program main", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is an arithmetic progression with L terms: s_0, s_1, s_2, ... , s_{L-1}.\n\nThe initial term is A, and the common difference is B. That is, s_i = A + B \\times i holds.\n\nConsider the integer obtained by concatenating the terms written in base ten without leading zeros. For example, the sequence 3, 7, 11, 15, 19 would be concatenated into 37111519. What is the remainder when that integer is divided by M?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L, A, B < 10^{18}\n\n2 \\leq M \\leq 10^9\n\nAll terms in the arithmetic progression are less than 10^{18}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL A B M\n\nOutput\n\nPrint the remainder when the integer obtained by concatenating the terms is divided by M.\n\nSample Input 1\n\n5 3 4 10007\n\nSample Output 1\n\n5563\n\nOur arithmetic progression is 3, 7, 11, 15, 19, so the answer is 37111519 mod 10007, that is, 5563.\n\nSample Input 2\n\n4 8 1 1000000\n\nSample Output 2\n\n891011\n\nSample Input 3\n\n107 10000000000007 1000000000000007 998244353\n\nSample Output 3\n\n39122908", "sample_input": "5 3 4 10007\n"}, "reference_outputs": ["5563\n"], "source_document_id": "p03016", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is an arithmetic progression with L terms: s_0, s_1, s_2, ... , s_{L-1}.\n\nThe initial term is A, and the common difference is B. That is, s_i = A + B \\times i holds.\n\nConsider the integer obtained by concatenating the terms written in base ten without leading zeros. For example, the sequence 3, 7, 11, 15, 19 would be concatenated into 37111519. What is the remainder when that integer is divided by M?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq L, A, B < 10^{18}\n\n2 \\leq M \\leq 10^9\n\nAll terms in the arithmetic progression are less than 10^{18}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL A B M\n\nOutput\n\nPrint the remainder when the integer obtained by concatenating the terms is divided by M.\n\nSample Input 1\n\n5 3 4 10007\n\nSample Output 1\n\n5563\n\nOur arithmetic progression is 3, 7, 11, 15, 19, so the answer is 37111519 mod 10007, that is, 5563.\n\nSample Input 2\n\n4 8 1 1000000\n\nSample Output 2\n\n891011\n\nSample Input 3\n\n107 10000000000007 1000000000000007 998244353\n\nSample Output 3\n\n39122908", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 9027, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s859902363", "group_id": "codeNet:p03017", "input_text": "program AGC034A\ninteger N,A,B,C,D\ncharacter(2*10**5) S\nlogical over,rock2,openspace\nread*,N,A,B,C,D\nread*,S\nrock2=.false.\nopenspace=.false.\ndo i=A,C-1\n if(S(i:i+1)==\"##\")rock2=.true.\nend do\ndo i=B,D-1\n if(S(i:i+1)==\"##\")rock2=.true.\nend do\nif(rock2)then\n print\"(A)\",\"No\"\n stop\nendif\ndo i=B-1,D-1\n if(S(i:i+2)==\"...\")openspace=.true.\nend do\nover=(C>D)\nif(over)then\n if(.not.openspace)then\n print\"(A)\",\"No\"\n stop\n endif\nendif\nprint\"(A)\",\"Yes\"\nend", "language": "Fortran", "metadata": {"date": 1573879495, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03017.html", "problem_id": "p03017", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03017/input.txt", "sample_output_relpath": "derived/input_output/data/p03017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03017/Fortran/s859902363.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s859902363", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program AGC034A\ninteger N,A,B,C,D\ncharacter(2*10**5) S\nlogical over,rock2,openspace\nread*,N,A,B,C,D\nread*,S\nrock2=.false.\nopenspace=.false.\ndo i=A,C-1\n if(S(i:i+1)==\"##\")rock2=.true.\nend do\ndo i=B,D-1\n if(S(i:i+1)==\"##\")rock2=.true.\nend do\nif(rock2)then\n print\"(A)\",\"No\"\n stop\nendif\ndo i=B-1,D-1\n if(S(i:i+2)==\"...\")openspace=.true.\nend do\nover=(C>D)\nif(over)then\n if(.not.openspace)then\n print\"(A)\",\"No\"\n stop\n endif\nendif\nprint\"(A)\",\"Yes\"\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 463, "cpu_time_ms": 9, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s882467334", "group_id": "codeNet:p03017", "input_text": "program kenken\n implicit none\n integer n, a, b, c, d\n integer i, p, q, r, sum\n character(200001) s\n read*, n, a, b, c, d\n read*, s\n p=0\n q=0\n r=0\n sum=0\n \n if (c < d) then\n \n do i=b+1, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do i=a+1, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n print*, \"Yes\"\n return\n end if\n \n if (c > d) then\n \n do i=b,d-2\n p=index(s(i:i),\".\")\n q=index(s(i+1:i+1),\".\")\n r=index(s(i+2:i+2),\".\")\n if((p+q+r).eq.3) then\n sum = i+1\n exit\n end if\n end do\n \n if(sum.ne.0) then\n s(sum:sum)=\"#\"\n do i=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(c:c)=\"#\"\n do i=sum+1, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n print*, \"Yes\"\n return\n end if\n \n if (sum.eq.0) then\n do i=b+1, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do i=a+1, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n print*, \"Yes\"\n return\n end if\n end if\nend program", "language": "Fortran", "metadata": {"date": 1559528369, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03017.html", "problem_id": "p03017", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03017/input.txt", "sample_output_relpath": "derived/input_output/data/p03017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03017/Fortran/s882467334.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s882467334", "user_id": "u039189422"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program kenken\n implicit none\n integer n, a, b, c, d\n integer i, p, q, r, sum\n character(200001) s\n read*, n, a, b, c, d\n read*, s\n p=0\n q=0\n r=0\n sum=0\n \n if (c < d) then\n \n do i=b+1, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do i=a+1, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n print*, \"Yes\"\n return\n end if\n \n if (c > d) then\n \n do i=b,d-2\n p=index(s(i:i),\".\")\n q=index(s(i+1:i+1),\".\")\n r=index(s(i+2:i+2),\".\")\n if((p+q+r).eq.3) then\n sum = i+1\n exit\n end if\n end do\n \n if(sum.ne.0) then\n s(sum:sum)=\"#\"\n do i=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(c:c)=\"#\"\n do i=sum+1, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n print*, \"Yes\"\n return\n end if\n \n if (sum.eq.0) then\n do i=b+1, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do i=a+1, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"No\"\n return\n end if\n end do\n print*, \"Yes\"\n return\n end if\n end if\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1381, "cpu_time_ms": 8, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s271299612", "group_id": "codeNet:p03017", "input_text": "program kenken\n implicit none\n integer n, a, b, c, d\n integer i, j, p, q, r, sum\n character(20000) s\n read*, n, a, b, c, d\n read*, s\n p=0\n q=0\n r=0\n sum=0\n \n if (c < d) then\n \n do j=b, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do j=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n print*, \"YES\"\n return\n end if\n \n if (c > d) then\n \n do i=b,d-2\n p=index(s(i:i),\".\")\n q=index(s(i+1:i+1),\".\")\n r=index(s(i+2:i+2),\".\")\n if((p+q+r).eq.3) then\n sum = i+1\n p=0\n q=0\n r=0\n end if\n end do\n \n if(sum.ne.0) then\n s(sum:sum)=\"#\"\n do j=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(c:c)=\"#\"\n do j=b, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n print*, sum\n return\n end if\n end do\n print*, \"YES\"\n return\n end if\n \n if (sum.eq.0) then\n do j=b, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do j=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n print*, \"YES\"\n return\n end if\n end if\nend program", "language": "Fortran", "metadata": {"date": 1559526840, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03017.html", "problem_id": "p03017", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03017/input.txt", "sample_output_relpath": "derived/input_output/data/p03017/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03017/Fortran/s271299612.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s271299612", "user_id": "u039189422"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program kenken\n implicit none\n integer n, a, b, c, d\n integer i, j, p, q, r, sum\n character(20000) s\n read*, n, a, b, c, d\n read*, s\n p=0\n q=0\n r=0\n sum=0\n \n if (c < d) then\n \n do j=b, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do j=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n print*, \"YES\"\n return\n end if\n \n if (c > d) then\n \n do i=b,d-2\n p=index(s(i:i),\".\")\n q=index(s(i+1:i+1),\".\")\n r=index(s(i+2:i+2),\".\")\n if((p+q+r).eq.3) then\n sum = i+1\n p=0\n q=0\n r=0\n end if\n end do\n \n if(sum.ne.0) then\n s(sum:sum)=\"#\"\n do j=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(c:c)=\"#\"\n do j=b, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n print*, sum\n return\n end if\n end do\n print*, \"YES\"\n return\n end if\n \n if (sum.eq.0) then\n do j=b, d-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n s(d:d)=\"#\"\n do j=a, c-1\n p=index(s(i:i),\"#\")\n q=index(s(i+1:i+1),\"#\")\n if ((p+q).eq.2) then\n print*, \"NO\"\n return\n end if\n end do\n print*, \"YES\"\n return\n end if\n end if\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1399, "cpu_time_ms": 255, "memory_kb": 1000}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s381805105", "group_id": "codeNet:p03023", "input_text": "program angle\n implicit none\n integer n, m\n read*, n\n m=180*(n-2)\n write(*,*) m\nend program", "language": "Fortran", "metadata": {"date": 1559437860, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03023.html", "problem_id": "p03023", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03023/input.txt", "sample_output_relpath": "derived/input_output/data/p03023/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03023/Fortran/s381805105.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s381805105", "user_id": "u039189422"}, "prompt_components": {"gold_output": "180\n", "input_to_evaluate": "program angle\n implicit none\n integer n, m\n read*, n\n m=180*(n-2)\n write(*,*) m\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.\n\nPrint the answer in degrees, but do not print units.\n\nConstraints\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint an integer representing the sum of the interior angles of a regular polygon with N sides.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n180\n\nThe sum of the interior angles of a regular triangle is 180 degrees.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n17640", "sample_input": "3\n"}, "reference_outputs": ["180\n"], "source_document_id": "p03023", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer N not less than 3, find the sum of the interior angles of a regular polygon with N sides.\n\nPrint the answer in degrees, but do not print units.\n\nConstraints\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint an integer representing the sum of the interior angles of a regular polygon with N sides.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n180\n\nThe sum of the interior angles of a regular triangle is 180 degrees.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n17640", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s504319857", "group_id": "codeNet:p03024", "input_text": "program example\n\timplicit none\n\n\tcharacter(15) S\n integer :: i=1,j,wa=0,k\n \n read(*,*) S\n \n k=len_trim(adjustl(S))\n \n do\n \tif (i>k) then\n \texit\n end if\n \n \tj=index(S(i:),\"o\")\n \n \tif(j/=0) then\n \twa=wa+1\n i=i+j\n else\n \ti=i+1\n end if\n end do\n \n if(wa>=8) then\n \twrite(*,*) \"Yes\"\n\n\telse\n \tif((15-k)+wa>=8) then\n \twrite(*,*) \"Yes\"\n \telse\n \twrite(*,*) \"No\"\n end if\n end if\nend program example", "language": "Fortran", "metadata": {"date": 1584308091, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03024.html", "problem_id": "p03024", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03024/input.txt", "sample_output_relpath": "derived/input_output/data/p03024/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03024/Fortran/s504319857.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504319857", "user_id": "u374107737"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program example\n\timplicit none\n\n\tcharacter(15) S\n integer :: i=1,j,wa=0,k\n \n read(*,*) S\n \n k=len_trim(adjustl(S))\n \n do\n \tif (i>k) then\n \texit\n end if\n \n \tj=index(S(i:),\"o\")\n \n \tif(j/=0) then\n \twa=wa+1\n i=i+j\n else\n \ti=i+1\n end if\n end do\n \n if(wa>=8) then\n \twrite(*,*) \"Yes\"\n\n\telse\n \tif((15-k)+wa>=8) then\n \twrite(*,*) \"Yes\"\n \telse\n \twrite(*,*) \"No\"\n end if\n end if\nend program example", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is competing in a sumo tournament.\nThe tournament lasts for 15 days, during which he performs in one match per day.\nIf he wins 8 or more matches, he can also participate in the next tournament.\n\nThe matches for the first k days have finished.\nYou are given the results of Takahashi's matches as a string S consisting of o and x.\nIf the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.\n\nConstraints\n\n1 \\leq k \\leq 15\n\nS is a string of length k consisting of o and x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.\n\nSample Input 1\n\noxoxoxoxoxoxox\n\nSample Output 1\n\nYES\n\nTakahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.\n\nSample Input 2\n\nxxxxxxxx\n\nSample Output 2\n\nNO", "sample_input": "oxoxoxoxoxoxox\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03024", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is competing in a sumo tournament.\nThe tournament lasts for 15 days, during which he performs in one match per day.\nIf he wins 8 or more matches, he can also participate in the next tournament.\n\nThe matches for the first k days have finished.\nYou are given the results of Takahashi's matches as a string S consisting of o and x.\nIf the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.\n\nConstraints\n\n1 \\leq k \\leq 15\n\nS is a string of length k consisting of o and x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.\n\nSample Input 1\n\noxoxoxoxoxoxox\n\nSample Output 1\n\nYES\n\nTakahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.\n\nSample Input 2\n\nxxxxxxxx\n\nSample Output 2\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s140896721", "group_id": "codeNet:p03026", "input_text": "program prob5\n implicit none\n integer :: N\n logical, allocatable :: G(:, :)\n integer :: a, b, i, j\n integer, allocatable :: queue(:), ans(:), c(:)\n integer :: ind, v, last, su\n logical, allocatable :: used(:)\n read(*,*) N\n\n allocate(G(N, N), c(N), ans(N), used(N))\n do i = 1, N\n do j = 1, N\n G(i, j) = .false.\n end do\n end do\n do i = 1, N-1\n read(*,*) a, b\n G(a, b) = .true.\n G(b, a) = .true.\n end do\n read(*,*) c\n call msort(c)\n\n allocate(queue(N))\n do i = 1, N\n queue(i) = 0\n end do\n ind = 1\n last = 2\n queue(1) = 1\n ans(1) = c(N)\n do i = 1, N\n used(i) = .false.\n end do\n used(1) = .true.\n\n do while(last <= N)\n v = queue(ind)\n do i = 1, N\n if(G(v, i) .and. .not. used(i)) then\n queue(last) = i\n last = last + 1\n used(i) = .true.\n end if\n end do\n ind = ind + 1\n end do\n\n do i = 1, N\n ans(queue(i)) = c(N - i + 1)\n end do\n su = 0\n do i = 1, N-1\n su = su + c(i)\n end do\n\n write(*,*) su\n write(*,*) ans\n\n\n\n\n \n deallocate(G, queue, c, ans, used)\n stop\ncontains\n\n !\n ! swap two arguments\n !\nsubroutine swap(a, b)\n implicit none\n integer, intent(inout) :: a, b\n\n integer :: c\n\n c = a\n a = b\n b = c\n\n end subroutine swap\n\n !\n ! merge sort\n !\n recursive subroutine msort(x)\n implicit none\n integer, intent(inout) :: x(:)\n\n integer :: n, mid, i, j, k\n integer, allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n\n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n\n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n\n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n\n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n\n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\n\nend program prob5", "language": "Fortran", "metadata": {"date": 1599270866, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03026.html", "problem_id": "p03026", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03026/input.txt", "sample_output_relpath": "derived/input_output/data/p03026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03026/Fortran/s140896721.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s140896721", "user_id": "u478462004"}, "prompt_components": {"gold_output": "10\n1 2 3 4 5\n", "input_to_evaluate": "program prob5\n implicit none\n integer :: N\n logical, allocatable :: G(:, :)\n integer :: a, b, i, j\n integer, allocatable :: queue(:), ans(:), c(:)\n integer :: ind, v, last, su\n logical, allocatable :: used(:)\n read(*,*) N\n\n allocate(G(N, N), c(N), ans(N), used(N))\n do i = 1, N\n do j = 1, N\n G(i, j) = .false.\n end do\n end do\n do i = 1, N-1\n read(*,*) a, b\n G(a, b) = .true.\n G(b, a) = .true.\n end do\n read(*,*) c\n call msort(c)\n\n allocate(queue(N))\n do i = 1, N\n queue(i) = 0\n end do\n ind = 1\n last = 2\n queue(1) = 1\n ans(1) = c(N)\n do i = 1, N\n used(i) = .false.\n end do\n used(1) = .true.\n\n do while(last <= N)\n v = queue(ind)\n do i = 1, N\n if(G(v, i) .and. .not. used(i)) then\n queue(last) = i\n last = last + 1\n used(i) = .true.\n end if\n end do\n ind = ind + 1\n end do\n\n do i = 1, N\n ans(queue(i)) = c(N - i + 1)\n end do\n su = 0\n do i = 1, N-1\n su = su + c(i)\n end do\n\n write(*,*) su\n write(*,*) ans\n\n\n\n\n \n deallocate(G, queue, c, ans, used)\n stop\ncontains\n\n !\n ! swap two arguments\n !\nsubroutine swap(a, b)\n implicit none\n integer, intent(inout) :: a, b\n\n integer :: c\n\n c = a\n a = b\n b = c\n\n end subroutine swap\n\n !\n ! merge sort\n !\n recursive subroutine msort(x)\n implicit none\n integer, intent(inout) :: x(:)\n\n integer :: n, mid, i, j, k\n integer, allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n\n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n\n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n\n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n\n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n\n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\n\nend program prob5", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "sample_input": "5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n"}, "reference_outputs": ["10\n1 2 3 4 5\n"], "source_document_id": "p03026", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a tree with N vertices 1,2,\\ldots,N, and positive integers c_1,c_2,\\ldots,c_N.\nThe i-th edge in the tree (1 \\leq i \\leq N-1) connects Vertex a_i and Vertex b_i.\n\nWe will write a positive integer on each vertex in T and calculate our score as follows:\n\nOn each edge, write the smaller of the integers written on the two endpoints.\n\nLet our score be the sum of the integers written on all the edges.\n\nFind the maximum possible score when we write each of c_1,c_2,\\ldots,c_N on one vertex in T, and show one way to achieve it. If an integer occurs multiple times in c_1,c_2,\\ldots,c_N, we must use it that number of times.\n\nConstraints\n\n1 \\leq N \\leq 10000\n\n1 \\leq a_i,b_i \\leq N\n\n1 \\leq c_i \\leq 10^5\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\nc_1 \\ldots c_N\n\nOutput\n\nUse the following format:\n\nM\nd_1 \\ldots d_N\n\nwhere M is the maximum possible score, and d_i is the integer to write on Vertex i.\nd_1,d_2,\\ldots,d_N must be a permutation of c_1,c_2,\\ldots,c_N.\nIf there are multiple ways to achieve the maximum score, any of them will be accepted.\n\nSample Input 1\n\n5\n1 2\n2 3\n3 4\n4 5\n1 2 3 4 5\n\nSample Output 1\n\n10\n1 2 3 4 5\n\nIf we write 1,2,3,4,5 on Vertex 1,2,3,4,5, respectively, the integers written on the four edges will be 1,2,3,4, for the score of 10. This is the maximum possible score.\n\nSample Input 2\n\n5\n1 2\n1 3\n1 4\n1 5\n3141 59 26 53 59\n\nSample Output 2\n\n197\n59 26 3141 59 53\n\nc_1,c_2,\\ldots,c_N may not be pairwise distinct.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2708, "cpu_time_ms": 2219, "memory_kb": 393400}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s609921231", "group_id": "codeNet:p03029", "input_text": "program main\n implicit none\n integer :: a, p\n read (*, *) a, p\n p = p + a * 3\n write (*, \"(i0)\") p / 2\nend program main\n", "language": "Fortran", "metadata": {"date": 1578080897, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/Fortran/s609921231.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s609921231", "user_id": "u388927326"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer :: a, p\n read (*, *) a, p\n p = p + a * 3\n write (*, \"(i0)\") p / 2\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s111800548", "group_id": "codeNet:p03029", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: i,j,a,p\n\nread*, a,p\n\nprint'(i0)', (a*3+p)/2\n\nEND PROGRAM ATCODER\n", "language": "Fortran", "metadata": {"date": 1558918915, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/Fortran/s111800548.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111800548", "user_id": "u454557108"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: i,j,a,p\n\nread*, a,p\n\nprint'(i0)', (a*3+p)/2\n\nEND PROGRAM ATCODER\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s295239916", "group_id": "codeNet:p03030", "input_text": "program bbb\nimplicit none\n\ninteger(16) :: n, i, j, l, dumy\ncharacter(10),allocatable,dimension(:) :: s\ninteger(16),allocatable,dimension(:) :: t, p, q\n\nread*, n\nallocate(s(n))\nallocate(t(n))\nallocate(p(n))\nallocate(q(n))\nt=0\n\ndo i=1,n\nread*, s(i), p(i)\nq(i)=i\nend do\n\np=-p\n\ndo i=1,n\nl=len_trim(s(i))\n do j=1,l\n t(i)=t(i)+((iachar(s(i)(j:j))-80))*(10**(2*(11-j)))\n end do\nt(i)=t(i)+p(i)\nend do\n\ndo i=1,n\n do j=i+1,n\n if(t(i)>t(j)) then\n dumy=t(i)\n t(i)=t(j)\n t(j)=dumy\n dumy=q(i)\n q(i)=q(j)\n q(j)=dumy\n end if\n end do\nend do\n\ndo i=1,n\nwrite(*,'(i0)') q(i)\nend do\n\nend program", "language": "Fortran", "metadata": {"date": 1570314355, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03030.html", "problem_id": "p03030", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03030/input.txt", "sample_output_relpath": "derived/input_output/data/p03030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03030/Fortran/s295239916.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s295239916", "user_id": "u039189422"}, "prompt_components": {"gold_output": "3\n4\n6\n1\n5\n2\n", "input_to_evaluate": "program bbb\nimplicit none\n\ninteger(16) :: n, i, j, l, dumy\ncharacter(10),allocatable,dimension(:) :: s\ninteger(16),allocatable,dimension(:) :: t, p, q\n\nread*, n\nallocate(s(n))\nallocate(t(n))\nallocate(p(n))\nallocate(q(n))\nt=0\n\ndo i=1,n\nread*, s(i), p(i)\nq(i)=i\nend do\n\np=-p\n\ndo i=1,n\nl=len_trim(s(i))\n do j=1,l\n t(i)=t(i)+((iachar(s(i)(j:j))-80))*(10**(2*(11-j)))\n end do\nt(i)=t(i)+p(i)\nend do\n\ndo i=1,n\n do j=i+1,n\n if(t(i)>t(j)) then\n dumy=t(i)\n t(i)=t(j)\n t(j)=dumy\n dumy=q(i)\n q(i)=q(j)\n q(j)=dumy\n end if\n end do\nend do\n\ndo i=1,n\nwrite(*,'(i0)') q(i)\nend do\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have decided to write a book introducing good restaurants.\nThere are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.\nNo two restaurants have the same score.\n\nYou want to introduce the restaurants in the following order:\n\nThe restaurants are arranged in lexicographical order of the names of their cities.\n\nIf there are multiple restaurants in the same city, they are arranged in descending order of score.\n\nPrint the identification numbers of the restaurants in the order they are introduced in the book.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nS is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\n0 ≤ P_i ≤ 100\n\nP_i is an integer.\n\nP_i ≠ P_j (1 ≤ i < j ≤ N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 P_1\n:\nS_N P_N\n\nOutput\n\nPrint N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.\n\nSample Input 1\n\n6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n\nSample Output 1\n\n3\n4\n6\n1\n5\n2\n\nThe lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.\n\nSample Input 2\n\n10\nyakutsk 10\nyakutsk 20\nyakutsk 30\nyakutsk 40\nyakutsk 50\nyakutsk 60\nyakutsk 70\nyakutsk 80\nyakutsk 90\nyakutsk 100\n\nSample Output 2\n\n10\n9\n8\n7\n6\n5\n4\n3\n2\n1", "sample_input": "6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n"}, "reference_outputs": ["3\n4\n6\n1\n5\n2\n"], "source_document_id": "p03030", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have decided to write a book introducing good restaurants.\nThere are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.\nNo two restaurants have the same score.\n\nYou want to introduce the restaurants in the following order:\n\nThe restaurants are arranged in lexicographical order of the names of their cities.\n\nIf there are multiple restaurants in the same city, they are arranged in descending order of score.\n\nPrint the identification numbers of the restaurants in the order they are introduced in the book.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nS is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\n0 ≤ P_i ≤ 100\n\nP_i is an integer.\n\nP_i ≠ P_j (1 ≤ i < j ≤ N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 P_1\n:\nS_N P_N\n\nOutput\n\nPrint N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.\n\nSample Input 1\n\n6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n\nSample Output 1\n\n3\n4\n6\n1\n5\n2\n\nThe lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.\n\nSample Input 2\n\n10\nyakutsk 10\nyakutsk 20\nyakutsk 30\nyakutsk 40\nyakutsk 50\nyakutsk 60\nyakutsk 70\nyakutsk 80\nyakutsk 90\nyakutsk 100\n\nSample Output 2\n\n10\n9\n8\n7\n6\n5\n4\n3\n2\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 574, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s198292457", "group_id": "codeNet:p03031", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,m,i,max=1000000,l,count=0,h,j,on,check=0\ninteger,allocatable :: k(:),s(:,:),p(:),sw(:)\n\nread*, n,m\nallocate(k(m),s(m,n),p(m),sw(n))\ns = 0\ndo i = 1, m, 1\n read*, k(i),s(i,1:k(i))\nend do\nread*, p(1:m)\n\ndo i = 0, max, 1\n check = 0\n l = i\n sw = 0\n do j = 1, n, 1\n if ( l == 0 ) exit\n sw(j) = mod(l,2)\n l = l/2\n end do\n if ( minval(sw) == 0 .and. maxval(sw) == 0 .and. i /= 0 ) exit\n do j = 1, m, 1\n on = 0\n do h = 1, k(m), 1\n if ( sw(s(j,h)) == 1 ) then\n on = on + 1\n end if\n end do\n if ( mod(on,2) /= p(j) ) then\n check = 1\n exit\n end if\n end do\n if ( check == 0 ) then\n count = count + 1\n end if\nend do\n\nprint'(i0)', count\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1558924352, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03031.html", "problem_id": "p03031", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03031/input.txt", "sample_output_relpath": "derived/input_output/data/p03031/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03031/Fortran/s198292457.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s198292457", "user_id": "u454557108"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,m,i,max=1000000,l,count=0,h,j,on,check=0\ninteger,allocatable :: k(:),s(:,:),p(:),sw(:)\n\nread*, n,m\nallocate(k(m),s(m,n),p(m),sw(n))\ns = 0\ndo i = 1, m, 1\n read*, k(i),s(i,1:k(i))\nend do\nread*, p(1:m)\n\ndo i = 0, max, 1\n check = 0\n l = i\n sw = 0\n do j = 1, n, 1\n if ( l == 0 ) exit\n sw(j) = mod(l,2)\n l = l/2\n end do\n if ( minval(sw) == 0 .and. maxval(sw) == 0 .and. i /= 0 ) exit\n do j = 1, m, 1\n on = 0\n do h = 1, k(m), 1\n if ( sw(s(j,h)) == 1 ) then\n on = on + 1\n end if\n end do\n if ( mod(on,2) /= p(j) ) then\n check = 1\n exit\n end if\n end do\n if ( check == 0 ) then\n count = count + 1\n end if\nend do\n\nprint'(i0)', count\n\nEND PROGRAM ATCODER", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "sample_input": "2 2\n2 1 2\n1 2\n0 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03031", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s196014095", "group_id": "codeNet:p03032", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: n,k,a,b,cd,i,j,h,c=1\ninteger(16),allocatable :: v(:),m(:),ans(:)\n\nread*, n,k\nallocate(v(n),m(n),ans(k**2))\nread*, v(1:n)\n\ndo i = 0, min(n,k), 1\n a = i\n do j = 0, min(n,k)-i, 1\n m = 10**9\n b = j\n if ( a + b >= min(n,k) + 1 ) exit\n cd = k - (a+b)\n if ( a /= 0 ) then\n do h = 1, a, 1\n m(h) = v(h)\n end do\n end if\n if ( b /= 0 ) then\n do h = 1, b, 1\n m(n+1-h) = v(n+1-h)\n end do\n end if\n call hs(n,m)\n do h = 1, cd\n if ( m(h) > 0 ) then\n cd = h - 1\n exit\n end if \n end do\n m(1:cd) = 0\n do h = 1, n, 1\n if ( m(h) == 10**9 ) then\n m(h) = 0\n end if\n end do\n ans(c) = sum(m)\n c = c + 1\n end do\nend do\n\nprint'(i0)', maxval(ans)\n\ncontains\n subroutine hs(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n \n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine hs\n\nEND PROGRAM ATCODER\n", "language": "Fortran", "metadata": {"date": 1558928870, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03032.html", "problem_id": "p03032", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03032/input.txt", "sample_output_relpath": "derived/input_output/data/p03032/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03032/Fortran/s196014095.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s196014095", "user_id": "u454557108"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: n,k,a,b,cd,i,j,h,c=1\ninteger(16),allocatable :: v(:),m(:),ans(:)\n\nread*, n,k\nallocate(v(n),m(n),ans(k**2))\nread*, v(1:n)\n\ndo i = 0, min(n,k), 1\n a = i\n do j = 0, min(n,k)-i, 1\n m = 10**9\n b = j\n if ( a + b >= min(n,k) + 1 ) exit\n cd = k - (a+b)\n if ( a /= 0 ) then\n do h = 1, a, 1\n m(h) = v(h)\n end do\n end if\n if ( b /= 0 ) then\n do h = 1, b, 1\n m(n+1-h) = v(n+1-h)\n end do\n end if\n call hs(n,m)\n do h = 1, cd\n if ( m(h) > 0 ) then\n cd = h - 1\n exit\n end if \n end do\n m(1:cd) = 0\n do h = 1, n, 1\n if ( m(h) == 10**9 ) then\n m(h) = 0\n end if\n end do\n ans(c) = sum(m)\n c = c + 1\n end do\nend do\n\nprint'(i0)', maxval(ans)\n\ncontains\n subroutine hs(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n \n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine hs\n\nEND PROGRAM ATCODER\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYour friend gave you a dequeue D as a birthday present.\n\nD is a horizontal cylinder that contains a row of N jewels.\n\nThe values of the jewels are V_1, V_2, ..., V_N from left to right. There may be jewels with negative values.\n\nIn the beginning, you have no jewel in your hands.\n\nYou can perform at most K operations on D, chosen from the following, at most K times (possibly zero):\n\nOperation A: Take out the leftmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation B: Take out the rightmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation C: Choose a jewel in your hands and insert it to the left end of D. You cannot do this operation when you have no jewel in your hand.\n\nOperation D: Choose a jewel in your hands and insert it to the right end of D. You cannot do this operation when you have no jewel in your hand.\n\nFind the maximum possible sum of the values of jewels in your hands after the operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq 100\n\n-10^7 \\leq V_i \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nV_1 V_2 ... V_N\n\nOutput\n\nPrint the maximum possible sum of the values of jewels in your hands after the operations.\n\nSample Input 1\n\n6 4\n-10 8 2 1 2 6\n\nSample Output 1\n\n14\n\nAfter the following sequence of operations, you have two jewels of values 8 and 6 in your hands for a total of 14, which is the maximum result.\n\nDo operation A. You take out the jewel of value -10 from the left end of D.\n\nDo operation B. You take out the jewel of value 6 from the right end of D.\n\nDo operation A. You take out the jewel of value 8 from the left end of D.\n\nDo operation D. You insert the jewel of value -10 to the right end of D.\n\nSample Input 2\n\n6 4\n-6 -100 50 -2 -5 -3\n\nSample Output 2\n\n44\n\nSample Input 3\n\n6 3\n-6 -100 50 -2 -5 -3\n\nSample Output 3\n\n0\n\nIt is optimal to do no operation.", "sample_input": "6 4\n-10 8 2 1 2 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03032", "source_text": "Score : 400 points\n\nProblem Statement\n\nYour friend gave you a dequeue D as a birthday present.\n\nD is a horizontal cylinder that contains a row of N jewels.\n\nThe values of the jewels are V_1, V_2, ..., V_N from left to right. There may be jewels with negative values.\n\nIn the beginning, you have no jewel in your hands.\n\nYou can perform at most K operations on D, chosen from the following, at most K times (possibly zero):\n\nOperation A: Take out the leftmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation B: Take out the rightmost jewel contained in D and have it in your hand. You cannot do this operation when D is empty.\n\nOperation C: Choose a jewel in your hands and insert it to the left end of D. You cannot do this operation when you have no jewel in your hand.\n\nOperation D: Choose a jewel in your hands and insert it to the right end of D. You cannot do this operation when you have no jewel in your hand.\n\nFind the maximum possible sum of the values of jewels in your hands after the operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq 100\n\n-10^7 \\leq V_i \\leq 10^7\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nV_1 V_2 ... V_N\n\nOutput\n\nPrint the maximum possible sum of the values of jewels in your hands after the operations.\n\nSample Input 1\n\n6 4\n-10 8 2 1 2 6\n\nSample Output 1\n\n14\n\nAfter the following sequence of operations, you have two jewels of values 8 and 6 in your hands for a total of 14, which is the maximum result.\n\nDo operation A. You take out the jewel of value -10 from the left end of D.\n\nDo operation B. You take out the jewel of value 6 from the right end of D.\n\nDo operation A. You take out the jewel of value 8 from the left end of D.\n\nDo operation D. You insert the jewel of value -10 to the right end of D.\n\nSample Input 2\n\n6 4\n-6 -100 50 -2 -5 -3\n\nSample Output 2\n\n44\n\nSample Input 3\n\n6 3\n-6 -100 50 -2 -5 -3\n\nSample Output 3\n\n0\n\nIt is optimal to do no operation.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1633, "cpu_time_ms": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s524029349", "group_id": "codeNet:p03033", "input_text": "integer N,Q\ninteger,allocatable,dimension(:)::S,T,X\ninteger num\ninteger ans\nread*,N,Q\nallocate(S(N),T(N),X(N))\ndo i=1,N\n read*,S(i),T(i),X(i)\nend do\ndo i=1,Q\n read*,num\n ans=huge(ans)\n do j=1,N\n if(S(j)-X(j)<=num.and.num < T(j)-X(j))then\n ans=min(ans,X(j))\n endif\n end do\n if(ans==huge(ans))ans=-1\n \n print\"(i0)\",ans\nend do\nend", "language": "Fortran", "metadata": {"date": 1558924439, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03033.html", "problem_id": "p03033", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03033/input.txt", "sample_output_relpath": "derived/input_output/data/p03033/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03033/Fortran/s524029349.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s524029349", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2\n2\n10\n-1\n13\n-1\n", "input_to_evaluate": "integer N,Q\ninteger,allocatable,dimension(:)::S,T,X\ninteger num\ninteger ans\nread*,N,Q\nallocate(S(N),T(N),X(N))\ndo i=1,N\n read*,S(i),T(i),X(i)\nend do\ndo i=1,Q\n read*,num\n ans=huge(ans)\n do j=1,N\n if(S(j)-X(j)<=num.and.num < T(j)-X(j))then\n ans=min(ans,X(j))\n endif\n end do\n if(ans==huge(ans))ans=-1\n \n print\"(i0)\",ans\nend do\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an infinitely long street that runs west to east, which we consider as a number line.\n\nThere are N roadworks scheduled on this street.\nThe i-th roadwork blocks the point at coordinate X_i from time S_i - 0.5 to time T_i - 0.5.\n\nQ people are standing at coordinate 0. The i-th person will start the coordinate 0 at time D_i, continue to walk with speed 1 in the positive direction and stop walking when reaching a blocked point.\n\nFind the distance each of the Q people will walk.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, Q \\leq 2 \\times 10^5\n\n0 \\leq S_i < T_i \\leq 10^9\n\n1 \\leq X_i \\leq 10^9\n\n0 \\leq D_1 < D_2 < ... < D_Q \\leq 10^9\n\nIf i \\neq j and X_i = X_j, the intervals [S_i, T_i) and [S_j, T_j) do not overlap.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS_1 T_1 X_1\n:\nS_N T_N X_N\nD_1\n:\nD_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the distance the i-th person will walk or -1 if that person walks forever.\n\nSample Input 1\n\n4 6\n1 3 2\n7 13 10\n18 20 13\n3 4 2\n0\n1\n2\n3\n5\n8\n\nSample Output 1\n\n2\n2\n10\n-1\n13\n-1\n\nThe first person starts coordinate 0 at time 0 and stops walking at coordinate 2 when reaching a point blocked by the first roadwork at time 2.\n\nThe second person starts coordinate 0 at time 1 and reaches coordinate 2 at time 3. The first roadwork has ended, but the fourth roadwork has begun, so this person also stops walking at coordinate 2.\n\nThe fourth and sixth persons encounter no roadworks while walking, so they walk forever. The output for these cases is -1.", "sample_input": "4 6\n1 3 2\n7 13 10\n18 20 13\n3 4 2\n0\n1\n2\n3\n5\n8\n"}, "reference_outputs": ["2\n2\n10\n-1\n13\n-1\n"], "source_document_id": "p03033", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an infinitely long street that runs west to east, which we consider as a number line.\n\nThere are N roadworks scheduled on this street.\nThe i-th roadwork blocks the point at coordinate X_i from time S_i - 0.5 to time T_i - 0.5.\n\nQ people are standing at coordinate 0. The i-th person will start the coordinate 0 at time D_i, continue to walk with speed 1 in the positive direction and stop walking when reaching a blocked point.\n\nFind the distance each of the Q people will walk.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, Q \\leq 2 \\times 10^5\n\n0 \\leq S_i < T_i \\leq 10^9\n\n1 \\leq X_i \\leq 10^9\n\n0 \\leq D_1 < D_2 < ... < D_Q \\leq 10^9\n\nIf i \\neq j and X_i = X_j, the intervals [S_i, T_i) and [S_j, T_j) do not overlap.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS_1 T_1 X_1\n:\nS_N T_N X_N\nD_1\n:\nD_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the distance the i-th person will walk or -1 if that person walks forever.\n\nSample Input 1\n\n4 6\n1 3 2\n7 13 10\n18 20 13\n3 4 2\n0\n1\n2\n3\n5\n8\n\nSample Output 1\n\n2\n2\n10\n-1\n13\n-1\n\nThe first person starts coordinate 0 at time 0 and stops walking at coordinate 2 when reaching a point blocked by the first roadwork at time 2.\n\nThe second person starts coordinate 0 at time 1 and reaches coordinate 2 at time 3. The first roadwork has ended, but the fourth roadwork has begun, so this person also stops walking at coordinate 2.\n\nThe fourth and sixth persons encounter no roadworks while walking, so they walk forever. The output for these cases is -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 2103, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s925078395", "group_id": "codeNet:p03035", "input_text": "integer(16) N,M,K\ninteger(16) waruno\ninteger(16) ans,tmp,i,j,com\nread*,N,M,K\nwaruno=10**9+7\ncom=comb(N*M-2,K-2,waruno)\nans=0\ndo i=0,M-1\n do j=0,N-1\n tmp=mod((i+j)*(M-i)*(N-j)*com*merge(1,2,i*j==0),waruno)\n ans=mod(ans+tmp,waruno)\n end do\nend do\nprint*,ans\n\ncontains\npure function comb(n,k,waruno)\ninteger(16),intent(in)::n,k,waruno\ninteger(16) i,j\ninteger(16),allocatable,dimension(:,:)::Table\ninteger(16) comb\nallocate(Table(0:n,0:k))\nTable=0\nTable(:,0)=1\ndo i=1,N\n do j=1,k\n Table(i,j)=mod(Table(i-1,j-1)+Table(i-1,j),waruno)\n end do\nend do\ncomb=Table(n,k)\nend function comb\nend\n", "language": "Fortran", "metadata": {"date": 1558848383, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/Fortran/s925078395.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s925078395", "user_id": "u598073939"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "integer(16) N,M,K\ninteger(16) waruno\ninteger(16) ans,tmp,i,j,com\nread*,N,M,K\nwaruno=10**9+7\ncom=comb(N*M-2,K-2,waruno)\nans=0\ndo i=0,M-1\n do j=0,N-1\n tmp=mod((i+j)*(M-i)*(N-j)*com*merge(1,2,i*j==0),waruno)\n ans=mod(ans+tmp,waruno)\n end do\nend do\nprint*,ans\n\ncontains\npure function comb(n,k,waruno)\ninteger(16),intent(in)::n,k,waruno\ninteger(16) i,j\ninteger(16),allocatable,dimension(:,:)::Table\ninteger(16) comb\nallocate(Table(0:n,0:k))\nTable=0\nTable(:,0)=1\ndo i=1,N\n do j=1,k\n Table(i,j)=mod(Table(i-1,j-1)+Table(i-1,j),waruno)\n end do\nend do\ncomb=Table(n,k)\nend function comb\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 594, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s077546848", "group_id": "codeNet:p03035", "input_text": "implicit none\n\ninteger A,B,money,n\n\nwrite(6,*) 'A B'\ndo n=1,10\n\tread *,A,B\n\tif(A.gt.0 .and. A.lt.100 .and. B.gt.2 .and. B.lt.1000 .and.mod(B,2)==0) exit\nend do\n\nif(A.ge.13)\t\t\t\t\tmoney=B\nif(A.ge.6 .and. A.le.12) \tmoney=B*0.5\nif(A.le.5)\t\t\t\t\tmoney=0\nwrite(6,'(i4)') money\n\n\nend", "language": "Fortran", "metadata": {"date": 1558834852, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/Fortran/s077546848.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s077546848", "user_id": "u398472825"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "implicit none\n\ninteger A,B,money,n\n\nwrite(6,*) 'A B'\ndo n=1,10\n\tread *,A,B\n\tif(A.gt.0 .and. A.lt.100 .and. B.gt.2 .and. B.lt.1000 .and.mod(B,2)==0) exit\nend do\n\nif(A.ge.13)\t\t\t\t\tmoney=B\nif(A.ge.6 .and. A.le.12) \tmoney=B*0.5\nif(A.le.5)\t\t\t\t\tmoney=0\nwrite(6,'(i4)') money\n\n\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s254461834", "group_id": "codeNet:p03035", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: i,a,b\n\nread*, a,b\n\nif ( a >= 13 ) then\n print'(i0)', b\nelse if ( a <= 5 ) then\n print'(i0)', 0\nelse\n print'(i0)', b/2\nend if\n\nEND PROGRAM ATCODER\n", "language": "Fortran", "metadata": {"date": 1558832572, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/Fortran/s254461834.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s254461834", "user_id": "u454557108"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: i,a,b\n\nread*, a,b\n\nif ( a >= 13 ) then\n print'(i0)', b\nelse if ( a <= 5 ) then\n print'(i0)', 0\nelse\n print'(i0)', b/2\nend if\n\nEND PROGRAM ATCODER\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s778122494", "group_id": "codeNet:p03036", "input_text": "program piyo\n integer :: r,x2000,d,i\n \n read*,r,d,x2000\n \n do i = 1,10\n \n x2000 = r * x2000 - d\n print*,x2000\n end do\nend program\n", "language": "Fortran", "metadata": {"date": 1589050929, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03036.html", "problem_id": "p03036", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03036/input.txt", "sample_output_relpath": "derived/input_output/data/p03036/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03036/Fortran/s778122494.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778122494", "user_id": "u171356453"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "program piyo\n integer :: r,x2000,d,i\n \n read*,r,d,x2000\n \n do i = 1,10\n \n x2000 = r * x2000 - d\n print*,x2000\n end do\nend program\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "sample_input": "2 10 20\n"}, "reference_outputs": ["30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n"], "source_document_id": "p03036", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s914306711", "group_id": "codeNet:p03036", "input_text": "program name\n implicit none\n integer(8):: r,d,x\n integer(8):: i\n \n read*, r,d,x\n\n do i=1,10\n x=r*x-d\n print*, x\n end do\nend program name", "language": "Fortran", "metadata": {"date": 1585715542, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03036.html", "problem_id": "p03036", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03036/input.txt", "sample_output_relpath": "derived/input_output/data/p03036/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03036/Fortran/s914306711.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s914306711", "user_id": "u234636620"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "program name\n implicit none\n integer(8):: r,d,x\n integer(8):: i\n \n read*, r,d,x\n\n do i=1,10\n x=r*x-d\n print*, x\n end do\nend program name", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "sample_input": "2 10 20\n"}, "reference_outputs": ["30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n"], "source_document_id": "p03036", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s497530012", "group_id": "codeNet:p03036", "input_text": "program main\nImplicit None\n\tinteger(8)::r,d,v,i\n\t\n\tread*,r,d,v\n\t\n\tdo i =1,10\n\t\tv = r*v-d\n\t\tprint\"(i0)\",v\n\tenddo\nend program main", "language": "Fortran", "metadata": {"date": 1558832844, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03036.html", "problem_id": "p03036", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03036/input.txt", "sample_output_relpath": "derived/input_output/data/p03036/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03036/Fortran/s497530012.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497530012", "user_id": "u900266249"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "program main\nImplicit None\n\tinteger(8)::r,d,v,i\n\t\n\tread*,r,d,v\n\t\n\tdo i =1,10\n\t\tv = r*v-d\n\t\tprint\"(i0)\",v\n\tenddo\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "sample_input": "2 10 20\n"}, "reference_outputs": ["30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n"], "source_document_id": "p03036", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s504066548", "group_id": "codeNet:p03037", "input_text": "program prison\n integer N, M, i, j, res\n integer :: X(10**5) = 0\n integer,allocatable,dimension(:) :: A\n integer,allocatable,dimension(:) :: B\n res = 0\n read(*,*) N, M\n allocate(A(M))\n allocate(B(M))\n do 100 i=1,M\n read(*,*) A(M), B(M)\n do 200 j=A(M), B(M)\n X(j) = X(j) +1\n 200 continue\n 100 continue\n do 1000 i=1, M\n if (X(i).eq.M) then\n res = res + 1\n end if\n 1000 continue\n write(*,*) res\nend program", "language": "Fortran", "metadata": {"date": 1558834265, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03037.html", "problem_id": "p03037", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03037/input.txt", "sample_output_relpath": "derived/input_output/data/p03037/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03037/Fortran/s504066548.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504066548", "user_id": "u039189422"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program prison\n integer N, M, i, j, res\n integer :: X(10**5) = 0\n integer,allocatable,dimension(:) :: A\n integer,allocatable,dimension(:) :: B\n res = 0\n read(*,*) N, M\n allocate(A(M))\n allocate(B(M))\n do 100 i=1,M\n read(*,*) A(M), B(M)\n do 200 j=A(M), B(M)\n X(j) = X(j) +1\n 200 continue\n 100 continue\n do 1000 i=1, M\n if (X(i).eq.M) then\n res = res + 1\n end if\n 1000 continue\n write(*,*) res\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "sample_input": "4 2\n1 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03037", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 416, "cpu_time_ms": 2103, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s642112668", "group_id": "codeNet:p03038", "input_text": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n,ans\n integer(8)::a,b,c,d\n integer(8),allocatable::x(:),y(:),z(:)\n \n read(*,*) n,m\n allocate(x(n),y(m),z(m))\n read(*,*)x\n do i=1,m\n read(*,*)y(i),z(i)\n end do\n\n call msort(x)\n call m2sort(z,y)\n a=n\n b=m\n c=n\n ans=0\n d=0\n do \n if(x(a)>=z(b))then\n ans=ans+x(a)\n c=c-1\n a=a-1\n if(c==0)then\n exit\n endif\n else\n if(c<=y(b))then\n ans=ans+z(b)*c\n exit\n else\n ans=ans+z(b)*y(b)\n c=c-y(b)\n b=b-1\n if(b==0)then\n do i=1,c\n ans=ans+x(a)\n a=a+1\n end do\n exit\n endif\n end if\n endif\n end do\n write(*,*)ans \n stop\n contains\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n \n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\n\n recursive subroutine m2sort(x,y)\n implicit none\n integer(8), intent(inout) :: x(:),y(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:),tmp2(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call m2sort(x(:mid),y(:mid))\n call m2sort(x(mid+1:),y(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n),tmp2(n))\n tmp(:) = x(:)\n tmp2(:)=y(:)\n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n tmp2(k) = y(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n y(k)=tmp2(i)\n i = i + 1\n else\n x(k) = tmp(j)\n y(k)=tmp2(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp,tmp2)\n return\n end subroutine m2sort\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1597602901, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03038.html", "problem_id": "p03038", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03038/input.txt", "sample_output_relpath": "derived/input_output/data/p03038/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03038/Fortran/s642112668.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s642112668", "user_id": "u713568912"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n,ans\n integer(8)::a,b,c,d\n integer(8),allocatable::x(:),y(:),z(:)\n \n read(*,*) n,m\n allocate(x(n),y(m),z(m))\n read(*,*)x\n do i=1,m\n read(*,*)y(i),z(i)\n end do\n\n call msort(x)\n call m2sort(z,y)\n a=n\n b=m\n c=n\n ans=0\n d=0\n do \n if(x(a)>=z(b))then\n ans=ans+x(a)\n c=c-1\n a=a-1\n if(c==0)then\n exit\n endif\n else\n if(c<=y(b))then\n ans=ans+z(b)*c\n exit\n else\n ans=ans+z(b)*y(b)\n c=c-y(b)\n b=b-1\n if(b==0)then\n do i=1,c\n ans=ans+x(a)\n a=a+1\n end do\n exit\n endif\n end if\n endif\n end do\n write(*,*)ans \n stop\n contains\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n \n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\n\n recursive subroutine m2sort(x,y)\n implicit none\n integer(8), intent(inout) :: x(:),y(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:),tmp2(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call m2sort(x(:mid),y(:mid))\n call m2sort(x(mid+1:),y(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n),tmp2(n))\n tmp(:) = x(:)\n tmp2(:)=y(:)\n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n tmp2(k) = y(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n y(k)=tmp2(i)\n i = i + 1\n else\n x(k) = tmp(j)\n y(k)=tmp2(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp,tmp2)\n return\n end subroutine m2sort\nend program sample\n \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3 2\n5 1 4\n2 3\n1 5\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03038", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3694, "cpu_time_ms": 177, "memory_kb": 6952}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s597379576", "group_id": "codeNet:p03038", "input_text": "program kadai\nimplicit none\n\ninteger :: n,m,i,j\ninteger(16) :: ans\ninteger,allocatable :: A(:)\ninteger,allocatable :: B(:)\ninteger(8),allocatable :: C(:)\n\nread(*,*) n,m\n\nallocate(A(n))\nallocate(B(m))\nallocate(C(m))\n\nread(*,*) A\ndo i=1,m\n read(*,*) B(i),C(i)\nend do\n\ndo i=1,m\n do j=1,B(i)\n if(minval(A)==C(i) .or. minval(A)>C(i)) then\n exit\n end if\n if(minval(A)C(i)) then\n exit\n end if\n if(minval(A) null()!pqの容量\n contains\n procedure :: offer => offer\n procedure :: clear => clear\n procedure :: poll => poll\n procedure :: peek => peek\n procedure :: size => size_of\n end type t_priority_queue\ncontains\n subroutine offer(pq,item)\n class(t_priority_queue), intent(inout) :: pq\n integer, intent(in) :: item\n integer :: n, i, t\n integer, allocatable :: tmp(:)\n if (.not.associated(pq%heap)) allocate(pq%heap(1))\n\n !いっぱいいっぱいのときには拡張している\n if (pq%num == size(pq%heap)) then\n allocate(tmp(pq%num))\n tmp = pq%heap\n deallocate(pq%heap)\n allocate(pq%heap(2*pq%num))\n pq%heap(1:pq%num) = tmp\n deallocate(tmp)\n end if\n\n pq%num = pq%num+1\n pq%heap(pq%num) = item\n n = pq%num\n do while (n > 1)\n i = n/2\n if (pq%heap(n) > pq%heap(i)) then\n t = pq%heap(n)\n pq%heap(n) = pq%heap(i)\n pq%heap(i) = t\n end if\n n = i\n end do\n return\n end subroutine offer\n\n subroutine clear(pq)\n class(t_priority_queue), intent(inout) :: pq\n if (associated(pq%heap)) deallocate(pq%heap)\n pq%num = 0\n return\n end subroutine clear\n\n function poll(pq) result(item)\n class(t_priority_queue), intent(inout) :: pq\n integer :: item, n, i, j, tmp\n n = pq%num\n item = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. pq%heap(j+1) > pq%heap(j)) j = j+1\n if (pq%heap(j) > pq%heap(i)) then\n tmp = pq%heap(j)\n pq%heap(j) = pq%heap(i)\n pq%heap(i) = tmp\n end if\n i = j\n end do\n end function poll\n subroutine pop(pq)\n class(t_priority_queue), intent(inout) :: pq\n integer :: item, n, i, j, tmp\n n = pq%num\n item = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. pq%heap(j+1) > pq%heap(j)) j = j+1\n if (pq%heap(j) > pq%heap(i)) then\n tmp = pq%heap(j)\n pq%heap(j) = pq%heap(i)\n pq%heap(i) = tmp\n end if\n i = j\n end do\n end subroutine \n \n function peek(pq) result(item)\n class(t_priority_queue), intent(inout) :: pq\n integer :: item\n item = pq%heap(1)\n end function peek\n\n integer function size_of(pq)\n class(t_priority_queue), intent(in) :: pq\n size_of = pq%num\n end\nend module mod_priority_queue\n\nprogram am\nuse mod_priority_queue\nimplicit none\ninteger::Q\ninteger::T,A(2)\ninteger(16)::ANS\n\ntype(t_priority_queue)::L,R\ninteger::i\n\nread*,Q\nANS=0\ncall offer(L,-huge(i))\ncall offer(R,-huge(i))\ndo i=1,Q\n read*,T,A(2*T-1:2)\n select case(T)\n case(1)\n ANS=ANS+A(2)\n if(A(1)-peek(R))then\n call offer(l,-peek(R))\n call offer(r,-peek(l))\n call pop(l)\n call pop(r)\n endif\n case(2)\n print\"(i0,a,i0)\",peek(l),\" \",ANS\n end select\nend do\nend program am", "language": "Fortran", "metadata": {"date": 1587078320, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03040.html", "problem_id": "p03040", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03040/input.txt", "sample_output_relpath": "derived/input_output/data/p03040/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03040/Fortran/s038902583.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038902583", "user_id": "u598073939"}, "prompt_components": {"gold_output": "4 2\n1 -3\n", "input_to_evaluate": "module mod_priority_queue\n implicit none\n type t_priority_queue\n private\n integer :: num = 0 !中に入ってる物の数\n integer, pointer :: heap(:) => null()!pqの容量\n contains\n procedure :: offer => offer\n procedure :: clear => clear\n procedure :: poll => poll\n procedure :: peek => peek\n procedure :: size => size_of\n end type t_priority_queue\ncontains\n subroutine offer(pq,item)\n class(t_priority_queue), intent(inout) :: pq\n integer, intent(in) :: item\n integer :: n, i, t\n integer, allocatable :: tmp(:)\n if (.not.associated(pq%heap)) allocate(pq%heap(1))\n\n !いっぱいいっぱいのときには拡張している\n if (pq%num == size(pq%heap)) then\n allocate(tmp(pq%num))\n tmp = pq%heap\n deallocate(pq%heap)\n allocate(pq%heap(2*pq%num))\n pq%heap(1:pq%num) = tmp\n deallocate(tmp)\n end if\n\n pq%num = pq%num+1\n pq%heap(pq%num) = item\n n = pq%num\n do while (n > 1)\n i = n/2\n if (pq%heap(n) > pq%heap(i)) then\n t = pq%heap(n)\n pq%heap(n) = pq%heap(i)\n pq%heap(i) = t\n end if\n n = i\n end do\n return\n end subroutine offer\n\n subroutine clear(pq)\n class(t_priority_queue), intent(inout) :: pq\n if (associated(pq%heap)) deallocate(pq%heap)\n pq%num = 0\n return\n end subroutine clear\n\n function poll(pq) result(item)\n class(t_priority_queue), intent(inout) :: pq\n integer :: item, n, i, j, tmp\n n = pq%num\n item = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. pq%heap(j+1) > pq%heap(j)) j = j+1\n if (pq%heap(j) > pq%heap(i)) then\n tmp = pq%heap(j)\n pq%heap(j) = pq%heap(i)\n pq%heap(i) = tmp\n end if\n i = j\n end do\n end function poll\n subroutine pop(pq)\n class(t_priority_queue), intent(inout) :: pq\n integer :: item, n, i, j, tmp\n n = pq%num\n item = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. pq%heap(j+1) > pq%heap(j)) j = j+1\n if (pq%heap(j) > pq%heap(i)) then\n tmp = pq%heap(j)\n pq%heap(j) = pq%heap(i)\n pq%heap(i) = tmp\n end if\n i = j\n end do\n end subroutine \n \n function peek(pq) result(item)\n class(t_priority_queue), intent(inout) :: pq\n integer :: item\n item = pq%heap(1)\n end function peek\n\n integer function size_of(pq)\n class(t_priority_queue), intent(in) :: pq\n size_of = pq%num\n end\nend module mod_priority_queue\n\nprogram am\nuse mod_priority_queue\nimplicit none\ninteger::Q\ninteger::T,A(2)\ninteger(16)::ANS\n\ntype(t_priority_queue)::L,R\ninteger::i\n\nread*,Q\nANS=0\ncall offer(L,-huge(i))\ncall offer(R,-huge(i))\ndo i=1,Q\n read*,T,A(2*T-1:2)\n select case(T)\n case(1)\n ANS=ANS+A(2)\n if(A(1)-peek(R))then\n call offer(l,-peek(R))\n call offer(r,-peek(l))\n call pop(l)\n call pop(r)\n endif\n case(2)\n print\"(i0,a,i0)\",peek(l),\" \",ANS\n end select\nend do\nend program am", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "sample_input": "4\n1 4 2\n2\n1 1 -8\n2\n"}, "reference_outputs": ["4 2\n1 -3\n"], "source_document_id": "p03040", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3319, "cpu_time_ms": 259, "memory_kb": 4332}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s403622717", "group_id": "codeNet:p03042", "input_text": "program yymm_or_mmyy\n implicit none\n character(4) :: s\n logical :: mmyy, yymm\n read(*,'(a)') s\n mmyy = \"01\" <= s(1:2) .and. s(1:2) <= \"12\"\n yymm = \"01\" <= s(3:4) .and. s(3:4) <= \"12\"\n if (yymm .and. mmyy) then\n write(*,'(a)') \"AMBIGUOUS\"\n else if (yymm) then\n write(*,'(a)') \"YYMM\"\n else if (mmyy) then\n write(*,'(a)') \"MMYY\"\n else\n write(*,'(a)') \"NA\"\n end if\nend program yymm_or_mmyy", "language": "Fortran", "metadata": {"date": 1590766426, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03042/input.txt", "sample_output_relpath": "derived/input_output/data/p03042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03042/Fortran/s403622717.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s403622717", "user_id": "u506403362"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "program yymm_or_mmyy\n implicit none\n character(4) :: s\n logical :: mmyy, yymm\n read(*,'(a)') s\n mmyy = \"01\" <= s(1:2) .and. s(1:2) <= \"12\"\n yymm = \"01\" <= s(3:4) .and. s(3:4) <= \"12\"\n if (yymm .and. mmyy) then\n write(*,'(a)') \"AMBIGUOUS\"\n else if (yymm) then\n write(*,'(a)') \"YYMM\"\n else if (mmyy) then\n write(*,'(a)') \"MMYY\"\n else\n write(*,'(a)') \"NA\"\n end if\nend program yymm_or_mmyy", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s497309733", "group_id": "codeNet:p03042", "input_text": " PROGRAM YYMMorMMYY\n IMPLICIT NONE\n integer :: ant,post\n \n read'(i2i2)',ant,post\n \n \n if( 1<=ant.and.ant<=12 )then\n if( 1<=post.and.post<=12 )then\n print*,'AMBIGUOUS'\n else\n print*,'MMYY'\n end if\n else\n if( 1<=post.and.post<=12 )then\n print*,'YYMM'\n else\n print*,'NA'\n end if\n end if\n \n \n \n END PROGRAM", "language": "Fortran", "metadata": {"date": 1586381964, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03042/input.txt", "sample_output_relpath": "derived/input_output/data/p03042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03042/Fortran/s497309733.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497309733", "user_id": "u171356453"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": " PROGRAM YYMMorMMYY\n IMPLICIT NONE\n integer :: ant,post\n \n read'(i2i2)',ant,post\n \n \n if( 1<=ant.and.ant<=12 )then\n if( 1<=post.and.post<=12 )then\n print*,'AMBIGUOUS'\n else\n print*,'MMYY'\n end if\n else\n if( 1<=post.and.post<=12 )then\n print*,'YYMM'\n else\n print*,'NA'\n end if\n end if\n \n \n \n END PROGRAM", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s858079999", "group_id": "codeNet:p03043", "input_text": "program cc\n implicit none\n integer :: n, k, i,point,sum\n integer,allocatable :: div(:)\n double precision :: prob, ans\n read *, n, k\n allocate(div(n))\n ans = 0\n div = 0\n point = 1\n prob = 1\n do i = 1, n\n point = i\n prob = 1\n do while (point < k)\n point = point * 2\n div(i) = div(i) + 1\n end do\n end do\n sum = 0\n do i = 1, n \n sum = sum + 2**(div(1)-div(i))\n end do \n ans = dble(sum)/(2.0**dble(div(1))*dble(n))\n print '(f15.13)', ans\n stop\nend program cc\n", "language": "Fortran", "metadata": {"date": 1558548278, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03043.html", "problem_id": "p03043", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03043/input.txt", "sample_output_relpath": "derived/input_output/data/p03043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03043/Fortran/s858079999.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s858079999", "user_id": "u121479332"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "program cc\n implicit none\n integer :: n, k, i,point,sum\n integer,allocatable :: div(:)\n double precision :: prob, ans\n read *, n, k\n allocate(div(n))\n ans = 0\n div = 0\n point = 1\n prob = 1\n do i = 1, n\n point = i\n prob = 1\n do while (point < k)\n point = point * 2\n div(i) = div(i) + 1\n end do\n end do\n sum = 0\n do i = 1, n \n sum = sum + 2**(div(1)-div(i))\n end do \n ans = dble(sum)/(2.0**dble(div(1))*dble(n))\n print '(f15.13)', ans\n stop\nend program cc\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 497, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s702070461", "group_id": "codeNet:p03044", "input_text": "module UF\n\timplicit none\n\tprivate\n\ttype Union_Find\n\t\tinteger, allocatable :: par(:), rank(:), counter(:)\n\tend type Union_Find\n\tpublic Union_Find, make_Union_Find, unite, UF_size, root, same\n\t\n\tcontains\n\t\n\tsubroutine make_Union_Find(UFty, N)\n\t\tinteger, intent(in) :: N\n\t\ttype(Union_Find), intent(out) :: UFty\n\t\tallocate(UFty%par(1:N), UFty%rank(1:N), UFty%counter(1:N))\n\t\tcall format_Union_Find(UFty, N)\n\tend subroutine make_Union_Find\n\t\n\tsubroutine format_Union_Find(UFty, N)\n\t\tinteger, intent(in) :: N\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tinteger :: i\n\t\tdo i = 1, N\n\t\t\tUFty%par(i) = i\n\t\tend do\n\t\tUFty%rank = 0\n\t\tUFty%counter = 1\n\tend subroutine format_Union_Find\n\t\n\tsubroutine unite(UFty, x, y)\n\t\tinteger, value :: x, y\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tx = root(UFty, x)\n\t\ty = root(UFty, y)\n\t\tif(x == y) return\n\t\tif(UFty%rank(x) < UFty%rank(y)) then\n\t\t\tUFty%par(x) = y\n\t\t\tUFty%counter(y) = UFty%counter(y) + UFty%counter(x)\t\n\t\telse\n\t\t\tUFty%par(y) = x\n\t\t\tUFty%counter(x) = UFty%counter(x) + UFty%counter(y)\t\n\t\t\tif(UFty%rank(x) == UFty%rank(y)) UFty%rank(x) = UFty%rank(x) + 1\n\t\tend if\n\tend subroutine unite\n\t\n\tfunction UF_size(UFty, x) result(y)\n\t\tinteger, intent(in) :: x\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tinteger :: y\n\t\ty = UFty%counter(root(UFty, x))\n\t\treturn\n\tend function UF_size\n\t\n\trecursive function root(UFty, x) result(root_ans)\n\t\tinteger, intent(in) :: x\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tinteger :: root_ans\n\t\tif(UFty%par(x) == x) then\n\t\t\troot_ans = x\n\t\t\treturn\n\t\telse\n\t\t\tUFty%par(x) = root(UFty, UFty%par(x))\n\t\t\troot_ans = UFty%par(x)\n\t\t\treturn\n\t\tend if\n\tend function root\n\t\n\tlogical function same(UFty, x, y)\n\t\tinteger, intent(in) :: x, y\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tif(root(UFty, x) == root(UFty, y)) then\n\t\t\tsame = .TRUE.\n\t\telse\n\t\t\tsame = .FALSE. \n\t\tend if\n\tend function same\nend module UF\n\nprogram main\n\tuse UF\n\timplicit none\n\ttype(Union_Find) :: X\n\tinteger :: N, i\n\tinteger, allocatable :: u(:), v(:), w(:), ans(:)\n\tread(*, *) N\n\tallocate(u(1:N-1), v(1:N-1), w(1:N-1), ans(1:N-1))\n\tdo i = 1, N-1\n\t\tread(*, *) u(i), v(i), w(i)\n\tend do\n\tans = -1\n\t\n\t\n\tcall make_Union_Find(X, N)\n\tdo i = 1, N-1\n\t\tif(mod(w(i),2) == 0) then\n\t\t\tcall unite(X, u(i), v(i))\n\t\tend if\n\tend do\n\tdo i = 1, N-1\n\t\tif(mod(w(i),2) == 1) then\n\t\t\tif(ans(root(X, u(i))) == 0) then\n\t\t\t\tans(root(X, v(i))) = 1\n\t\t\telse if(ans(root(X, u(i))) == 1) then\n\t\t\t\tans(root(X, v(i))) = 0\n\t\t\telse if(ans(root(X, v(i))) == 0) then\n\t\t\t\tans(root(X, u(i))) = 1\n\t\t\telse if(ans(root(X, v(i))) == 1) then\n\t\t\t\tans(root(X, u(i))) = 0\n\t\t\telse\n\t\t\t\tans(root(X, u(i))) = 1\n\t\t\t\tans(root(X, v(i))) = 0\n\t\t\tend if\n\t\tend if\n\tend do\n\tdo i = 1, N\n\t\twrite(*, *) abs(ans(root(X, i)))\n\tend do\nend program main", "language": "Fortran", "metadata": {"date": 1558319902, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03044.html", "problem_id": "p03044", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03044/input.txt", "sample_output_relpath": "derived/input_output/data/p03044/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03044/Fortran/s702070461.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s702070461", "user_id": "u728000113"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "module UF\n\timplicit none\n\tprivate\n\ttype Union_Find\n\t\tinteger, allocatable :: par(:), rank(:), counter(:)\n\tend type Union_Find\n\tpublic Union_Find, make_Union_Find, unite, UF_size, root, same\n\t\n\tcontains\n\t\n\tsubroutine make_Union_Find(UFty, N)\n\t\tinteger, intent(in) :: N\n\t\ttype(Union_Find), intent(out) :: UFty\n\t\tallocate(UFty%par(1:N), UFty%rank(1:N), UFty%counter(1:N))\n\t\tcall format_Union_Find(UFty, N)\n\tend subroutine make_Union_Find\n\t\n\tsubroutine format_Union_Find(UFty, N)\n\t\tinteger, intent(in) :: N\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tinteger :: i\n\t\tdo i = 1, N\n\t\t\tUFty%par(i) = i\n\t\tend do\n\t\tUFty%rank = 0\n\t\tUFty%counter = 1\n\tend subroutine format_Union_Find\n\t\n\tsubroutine unite(UFty, x, y)\n\t\tinteger, value :: x, y\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tx = root(UFty, x)\n\t\ty = root(UFty, y)\n\t\tif(x == y) return\n\t\tif(UFty%rank(x) < UFty%rank(y)) then\n\t\t\tUFty%par(x) = y\n\t\t\tUFty%counter(y) = UFty%counter(y) + UFty%counter(x)\t\n\t\telse\n\t\t\tUFty%par(y) = x\n\t\t\tUFty%counter(x) = UFty%counter(x) + UFty%counter(y)\t\n\t\t\tif(UFty%rank(x) == UFty%rank(y)) UFty%rank(x) = UFty%rank(x) + 1\n\t\tend if\n\tend subroutine unite\n\t\n\tfunction UF_size(UFty, x) result(y)\n\t\tinteger, intent(in) :: x\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tinteger :: y\n\t\ty = UFty%counter(root(UFty, x))\n\t\treturn\n\tend function UF_size\n\t\n\trecursive function root(UFty, x) result(root_ans)\n\t\tinteger, intent(in) :: x\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tinteger :: root_ans\n\t\tif(UFty%par(x) == x) then\n\t\t\troot_ans = x\n\t\t\treturn\n\t\telse\n\t\t\tUFty%par(x) = root(UFty, UFty%par(x))\n\t\t\troot_ans = UFty%par(x)\n\t\t\treturn\n\t\tend if\n\tend function root\n\t\n\tlogical function same(UFty, x, y)\n\t\tinteger, intent(in) :: x, y\n\t\ttype(Union_Find), intent(inout) :: UFty\n\t\tif(root(UFty, x) == root(UFty, y)) then\n\t\t\tsame = .TRUE.\n\t\telse\n\t\t\tsame = .FALSE. \n\t\tend if\n\tend function same\nend module UF\n\nprogram main\n\tuse UF\n\timplicit none\n\ttype(Union_Find) :: X\n\tinteger :: N, i\n\tinteger, allocatable :: u(:), v(:), w(:), ans(:)\n\tread(*, *) N\n\tallocate(u(1:N-1), v(1:N-1), w(1:N-1), ans(1:N-1))\n\tdo i = 1, N-1\n\t\tread(*, *) u(i), v(i), w(i)\n\tend do\n\tans = -1\n\t\n\t\n\tcall make_Union_Find(X, N)\n\tdo i = 1, N-1\n\t\tif(mod(w(i),2) == 0) then\n\t\t\tcall unite(X, u(i), v(i))\n\t\tend if\n\tend do\n\tdo i = 1, N-1\n\t\tif(mod(w(i),2) == 1) then\n\t\t\tif(ans(root(X, u(i))) == 0) then\n\t\t\t\tans(root(X, v(i))) = 1\n\t\t\telse if(ans(root(X, u(i))) == 1) then\n\t\t\t\tans(root(X, v(i))) = 0\n\t\t\telse if(ans(root(X, v(i))) == 0) then\n\t\t\t\tans(root(X, u(i))) = 1\n\t\t\telse if(ans(root(X, v(i))) == 1) then\n\t\t\t\tans(root(X, u(i))) = 0\n\t\t\telse\n\t\t\t\tans(root(X, u(i))) = 1\n\t\t\t\tans(root(X, v(i))) = 0\n\t\t\tend if\n\t\tend if\n\tend do\n\tdo i = 1, N\n\t\twrite(*, *) abs(ans(root(X, i)))\n\tend do\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "sample_input": "3\n1 2 2\n2 3 1\n"}, "reference_outputs": ["0\n0\n1\n"], "source_document_id": "p03044", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N.\nThe i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.\nYour objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:\n\nFor any two vertices painted in the same color, the distance between them is an even number.\n\nFind a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq u_i < v_i \\leq N\n\n1 \\leq w_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nu_1 v_1 w_1\nu_2 v_2 w_2\n.\n.\n.\nu_{N - 1} v_{N - 1} w_{N - 1}\n\nOutput\n\nPrint a coloring of the vertices that satisfies the condition, in N lines.\nThe i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.\n\nIf there are multiple colorings that satisfy the condition, any of them will be accepted.\n\nSample Input 1\n\n3\n1 2 2\n2 3 1\n\nSample Output 1\n\n0\n0\n1\n\nSample Input 2\n\n5\n2 5 2\n2 3 10\n1 3 8\n3 4 2\n\nSample Output 2\n\n1\n0\n1\n0\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2786, "cpu_time_ms": 117, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s091674719", "group_id": "codeNet:p03047", "input_text": "integer a,b\nread*,a,b\nprint*,a-b+1\nend", "language": "Fortran", "metadata": {"date": 1571911291, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03047.html", "problem_id": "p03047", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03047/input.txt", "sample_output_relpath": "derived/input_output/data/p03047/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03047/Fortran/s091674719.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s091674719", "user_id": "u244203620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "integer a,b\nread*,a,b\nprint*,a-b+1\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "sample_input": "3 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03047", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 38, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s234488733", "group_id": "codeNet:p03047", "input_text": "integer N,K\nread*,N,K\nprint\"(i0)\",N-K+1\nend", "language": "Fortran", "metadata": {"date": 1557623790, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03047.html", "problem_id": "p03047", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03047/input.txt", "sample_output_relpath": "derived/input_output/data/p03047/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03047/Fortran/s234488733.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s234488733", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "integer N,K\nread*,N,K\nprint\"(i0)\",N-K+1\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "sample_input": "3 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03047", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s433477697", "group_id": "codeNet:p03048", "input_text": "program main\n implicit none\n integer :: i, j, k, r, g, b, n, cnt = 0\n \n read *, r, g, b, n \n do i = 0, int(n/r)\n do j = 0, int(n/g)\n if (mod(n - r*i - g*j, b) == 0) cnt = cnt + 1\n end do\n end do\n \n print '(i0)', cnt\nend program", "language": "Fortran", "metadata": {"date": 1557696792, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03048.html", "problem_id": "p03048", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03048/input.txt", "sample_output_relpath": "derived/input_output/data/p03048/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03048/Fortran/s433477697.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s433477697", "user_id": "u282360873"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer :: i, j, k, r, g, b, n, cnt = 0\n \n read *, r, g, b, n \n do i = 0, int(n/r)\n do j = 0, int(n/g)\n if (mod(n - r*i - g*j, b) == 0) cnt = cnt + 1\n end do\n end do\n \n print '(i0)', cnt\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "sample_input": "1 2 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03048", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 27, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s661150109", "group_id": "codeNet:p03049", "input_text": "program diverta2019c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,l\n character(10),allocatable:: s(:)\n integer(int64):: i,j, ca, cb, cab,ans\n\n ca=0; cb=0; cab=0; ans=0\n read*, n\n allocate(s(n))\n do i=1,n\n read*, s(i)\n end do\n\n do i=1,n\n do j=1,len_trim(s(i))-1\n if (s(i)(j:j+1) == 'AB') ans=ans+1\n end do\n end do\n\n do i=1,n\n l = len_trim(s(i))\n if (s(i)(1:1) /= 'B' .and. s(i)(l:l) /= 'A') cycle\n\n if (s(i)(1:1) == 'B' .and. s(i)(l:l) == 'A') then\n cab=cab+1\n else if (s(i)(1:1) == 'B') then\n cb=cb+1\n else\n ca=ca+1\n end if\n end do\n if (ca+cb==0)then\n print'(i0)', ans+cab-1\n else\n print'(i0)', ans+cab+min(ca,cb)\n end if\n\n\nend program diverta2019c", "language": "Fortran", "metadata": {"date": 1590619227, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03049.html", "problem_id": "p03049", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03049/input.txt", "sample_output_relpath": "derived/input_output/data/p03049/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03049/Fortran/s661150109.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s661150109", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program diverta2019c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,l\n character(10),allocatable:: s(:)\n integer(int64):: i,j, ca, cb, cab,ans\n\n ca=0; cb=0; cab=0; ans=0\n read*, n\n allocate(s(n))\n do i=1,n\n read*, s(i)\n end do\n\n do i=1,n\n do j=1,len_trim(s(i))-1\n if (s(i)(j:j+1) == 'AB') ans=ans+1\n end do\n end do\n\n do i=1,n\n l = len_trim(s(i))\n if (s(i)(1:1) /= 'B' .and. s(i)(l:l) /= 'A') cycle\n\n if (s(i)(1:1) == 'B' .and. s(i)(l:l) == 'A') then\n cab=cab+1\n else if (s(i)(1:1) == 'B') then\n cb=cb+1\n else\n ca=ca+1\n end if\n end do\n if (ca+cb==0)then\n print'(i0)', ans+cab-1\n else\n print'(i0)', ans+cab+min(ca,cb)\n end if\n\n\nend program diverta2019c", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 844, "cpu_time_ms": 5, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s342144727", "group_id": "codeNet:p03049", "input_text": "program diverta2019c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,l\n character(10),allocatable:: s(:)\n integer(int32):: i, ca, cb, cab,ans\n\n ca=0; cb=0; cab=0; ans=0\n read*, n\n allocate(s(n))\n do i=1,n\n read*, s(i)\n end do\n\n do i=1,n\n if (index(s(i),'AB') /= 0) ans=ans+1\n end do\n\n do i=1,n\n l = len_trim(s(i))\n if (s(i)(1:1) /= 'B' .and. s(i)(l:l) /= 'A') cycle\n\n if (s(i)(1:1) == 'B' .and. s(i)(l:l) == 'A') then\n cab=cab+1\n else if (s(i)(1:1) == 'B') then\n cb=cb+1\n else\n ca=ca+1\n end if\n end do\n\n if (ca == 0 .and. cb==0) then\n print'(i0)', ans+cab-1\n else\n print'(i0)', ans+min(ca+cab,cb+cab)\n end if\n\nend program diverta2019c", "language": "Fortran", "metadata": {"date": 1590618004, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03049.html", "problem_id": "p03049", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03049/input.txt", "sample_output_relpath": "derived/input_output/data/p03049/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03049/Fortran/s342144727.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s342144727", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program diverta2019c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,l\n character(10),allocatable:: s(:)\n integer(int32):: i, ca, cb, cab,ans\n\n ca=0; cb=0; cab=0; ans=0\n read*, n\n allocate(s(n))\n do i=1,n\n read*, s(i)\n end do\n\n do i=1,n\n if (index(s(i),'AB') /= 0) ans=ans+1\n end do\n\n do i=1,n\n l = len_trim(s(i))\n if (s(i)(1:1) /= 'B' .and. s(i)(l:l) /= 'A') cycle\n\n if (s(i)(1:1) == 'B' .and. s(i)(l:l) == 'A') then\n cab=cab+1\n else if (s(i)(1:1) == 'B') then\n cb=cb+1\n else\n ca=ca+1\n end if\n end do\n\n if (ca == 0 .and. cb==0) then\n print'(i0)', ans+cab-1\n else\n print'(i0)', ans+min(ca+cab,cb+cab)\n end if\n\nend program diverta2019c", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 809, "cpu_time_ms": 5, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s938695756", "group_id": "codeNet:p03049", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: n,i,j,count=0,count_a=0,count_b=0,count_ab=0\ncharacter(len=10),allocatable :: s(:)\n\nread*, n\nallocate(s(n))\nread*, s(1:n)\n\ndo i = 1, n\n do j = 1, len_trim(s(i))-1\n if ( s(i)(j:j+1) == 'AB' ) then\n count = count + 1\n end if\n end do\n if ( s(i)(1:1) == 'B' ) then\n count_b = count_b + 1\n end if \n if ( s(i)(len_trim(s(i)):len_trim(s(i))) == 'A' ) then\n count_a = count_a + 1\n end if\n if ( s(i)(1:1) == 'B' .and. s(i)(len_trim(s(i)):len_trim(s(i))) == 'A' ) then\n count_ab = count_ab + 1\n end if\nend do\n\ncount_a = count_a - count_ab\ncount_b = count_b - count_ab\n\nif ( count_a == 0 .and. count_b == 0 ) then\n print'(i0)', count + count_ab - 1\nelse\n print'(i0)', count + min(count_a,count_b) + count_ab\nend if\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1557637884, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03049.html", "problem_id": "p03049", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03049/input.txt", "sample_output_relpath": "derived/input_output/data/p03049/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03049/Fortran/s938695756.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s938695756", "user_id": "u454557108"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: n,i,j,count=0,count_a=0,count_b=0,count_ab=0\ncharacter(len=10),allocatable :: s(:)\n\nread*, n\nallocate(s(n))\nread*, s(1:n)\n\ndo i = 1, n\n do j = 1, len_trim(s(i))-1\n if ( s(i)(j:j+1) == 'AB' ) then\n count = count + 1\n end if\n end do\n if ( s(i)(1:1) == 'B' ) then\n count_b = count_b + 1\n end if \n if ( s(i)(len_trim(s(i)):len_trim(s(i))) == 'A' ) then\n count_a = count_a + 1\n end if\n if ( s(i)(1:1) == 'B' .and. s(i)(len_trim(s(i)):len_trim(s(i))) == 'A' ) then\n count_ab = count_ab + 1\n end if\nend do\n\ncount_a = count_a - count_ab\ncount_b = count_b - count_ab\n\nif ( count_a == 0 .and. count_b == 0 ) then\n print'(i0)', count + count_ab - 1\nelse\n print'(i0)', count + min(count_a,count_b) + count_ab\nend if\n\nEND PROGRAM ATCODER", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 804, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s776125261", "group_id": "codeNet:p03050", "input_text": "program diverta2019_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,i,ans=0\n\n read*, n\n i=1\n do while(i*i <= n)\n if (mod(n,i) == 0) then\n if (i*(i+1) < n) ans=ans+(n/i-1)\n end if\n i=i+1\n end do\n print'(i0)', ans\nend program diverta2019_d", "language": "Fortran", "metadata": {"date": 1591383210, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03050.html", "problem_id": "p03050", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03050/input.txt", "sample_output_relpath": "derived/input_output/data/p03050/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03050/Fortran/s776125261.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776125261", "user_id": "u234636620"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program diverta2019_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,i,ans=0\n\n read*, n\n i=1\n do while(i*i <= n)\n if (mod(n,i) == 0) then\n if (i*(i+1) < n) ans=ans+(n/i-1)\n end if\n i=i+1\n end do\n print'(i0)', ans\nend program diverta2019_d", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "sample_input": "8\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03050", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 316, "cpu_time_ms": 11, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s988811864", "group_id": "codeNet:p03050", "input_text": "program divertaD\n integer(8) i, N, sum\n read(*, *) N\n sum = 0\n DO 10 i = 1, N\n if (mod(N,i).NE.0) then\n if (((N-mod(N,i))/i).EQ.(mod(N,i))) then\n sum = sum + i\n end if\n end if\n 10 continue\n print '(i0)', sum\nend program", "language": "Fortran", "metadata": {"date": 1557628984, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03050.html", "problem_id": "p03050", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03050/input.txt", "sample_output_relpath": "derived/input_output/data/p03050/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03050/Fortran/s988811864.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s988811864", "user_id": "u039189422"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program divertaD\n integer(8) i, N, sum\n read(*, *) N\n sum = 0\n DO 10 i = 1, N\n if (mod(N,i).NE.0) then\n if (((N-mod(N,i))/i).EQ.(mod(N,i))) then\n sum = sum + i\n end if\n end if\n 10 continue\n print '(i0)', sum\nend program", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "sample_input": "8\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03050", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 2103, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s069072265", "group_id": "codeNet:p03059", "input_text": "program biscuit\n\timplicit none\n integer :: a, b, t, n\n read(*,*) a, b, t\n n = t/a\n n = n*b\n write(*,*) n\n stop\n \nend program biscuit ", "language": "Fortran", "metadata": {"date": 1598663168, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03059.html", "problem_id": "p03059", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03059/input.txt", "sample_output_relpath": "derived/input_output/data/p03059/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03059/Fortran/s069072265.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069072265", "user_id": "u961266059"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program biscuit\n\timplicit none\n integer :: a, b, t, n\n read(*,*) a, b, t\n n = t/a\n n = n*b\n write(*,*) n\n stop\n \nend program biscuit ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 157, "cpu_time_ms": 5, "memory_kb": 2824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s900718883", "group_id": "codeNet:p03059", "input_text": "program main\n implicit none\n integer::a,b,t\n read(*,*)a,b,t\n write(*,*)(t/a*b)\nend program main\n", "language": "Fortran", "metadata": {"date": 1556413308, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03059.html", "problem_id": "p03059", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03059/input.txt", "sample_output_relpath": "derived/input_output/data/p03059/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03059/Fortran/s900718883.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900718883", "user_id": "u539011156"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer::a,b,t\n read(*,*)a,b,t\n write(*,*)(t/a*b)\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s462916615", "group_id": "codeNet:p03060", "input_text": "program main\n implicit none\n \n integer :: i,c(50),v(50),k,s = 0,n\n \n read(*,*)n\n read(*,*)(v(i),i=1,n)\n read(*,*)(c(i),i=1,n)\n \n do i = 1, n\n k = v(i) - c(i)\n if (k > 0) then\n s = s + k\n end if\n end do\n \n write(*,*)s\nend program main\n ", "language": "Fortran", "metadata": {"date": 1570592978, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03060.html", "problem_id": "p03060", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03060/input.txt", "sample_output_relpath": "derived/input_output/data/p03060/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03060/Fortran/s462916615.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462916615", "user_id": "u287431190"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: i,c(50),v(50),k,s = 0,n\n \n read(*,*)n\n read(*,*)(v(i),i=1,n)\n read(*,*)(c(i),i=1,n)\n \n do i = 1, n\n k = v(i) - c(i)\n if (k > 0) then\n s = s + k\n end if\n end do\n \n write(*,*)s\nend program main\n ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "sample_input": "3\n10 2 5\n6 3 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03060", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 246, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s612186980", "group_id": "codeNet:p03060", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,i,ans=0\ninteger,allocatable :: v(:), c(:)\n\nread*, n\nallocate(v(n),c(n))\nread*, v(1:n), c(1:n)\n\ndo i = 1, n, 1\n if ( v(i)-c(i) > 0 ) then\n ans = ans + v(i) - c(i)\n end if\nend do\n\nprint'(i0)', ans \n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1557343830, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03060.html", "problem_id": "p03060", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03060/input.txt", "sample_output_relpath": "derived/input_output/data/p03060/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03060/Fortran/s612186980.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612186980", "user_id": "u454557108"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,i,ans=0\ninteger,allocatable :: v(:), c(:)\n\nread*, n\nallocate(v(n),c(n))\nread*, v(1:n), c(1:n)\n\ndo i = 1, n, 1\n if ( v(i)-c(i) > 0 ) then\n ans = ans + v(i) - c(i)\n end if\nend do\n\nprint'(i0)', ans \n\nEND PROGRAM ATCODER", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "sample_input": "3\n10 2 5\n6 3 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03060", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N gems. The value of the i-th gem is V_i.\n\nYou will choose some of these gems, possibly all or none, and get them.\n\nHowever, you need to pay a cost of C_i to get the i-th gem.\n\nLet X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.\n\nFind the maximum possible value of X-Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq C_i, V_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nV_1 V_2 ... V_N\nC_1 C_2 ... C_N\n\nOutput\n\nPrint the maximum possible value of X-Y.\n\nSample Input 1\n\n3\n10 2 5\n6 3 4\n\nSample Output 1\n\n5\n\nIf we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.\nWe have X-Y = 5 here, which is the maximum possible value.\n\nSample Input 2\n\n4\n13 21 6 19\n11 30 6 15\n\nSample Output 2\n\n6\n\nSample Input 3\n\n1\n1\n50\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s417839520", "group_id": "codeNet:p03062", "input_text": "program main\nimplicit none\n\ninteger :: n,i,ans\ninteger, allocatable :: a(:)\nread(*,*)n\nallocate(a(n))\nread(*,*)a(1:n)\n\ndo i=1,n-1\n\tif (-(a(i) + a(i+1)) > (a(i) + a(i+1))) then\n \ta(i) = -a(i)\n a(i+1) = -a(i+1)\n end if\nend do\nans = sum(a)\nwrite(*,*)ans\n\nend program", "language": "Fortran", "metadata": {"date": 1556505826, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Fortran/s417839520.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s417839520", "user_id": "u850779832"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "program main\nimplicit none\n\ninteger :: n,i,ans\ninteger, allocatable :: a(:)\nread(*,*)n\nallocate(a(n))\nread(*,*)a(1:n)\n\ndo i=1,n-1\n\tif (-(a(i) + a(i+1)) > (a(i) + a(i+1))) then\n \ta(i) = -a(i)\n a(i+1) = -a(i+1)\n end if\nend do\nans = sum(a)\nwrite(*,*)ans\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 276, "cpu_time_ms": 36, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s292514840", "group_id": "codeNet:p03062", "input_text": "program flipping_signs\n implicit none\n integer :: n, i, k\n integer(8) :: a(100000), m\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n m = 10000000000_8\n k = 0\n do i = 1, n\n if (m.gt.abs(a(i))) m = abs(a(i))\n if (a(i).lt.0_8) k = k + 1\n end do\n if (mod(k,2).eq.0) then\n m = sum(abs(a(1:n)))\n else\n m = sum(abs(a(1:n))) - m\n end if\n write(*,'(i0)') m\n stop\nend program flipping_signs", "language": "Fortran", "metadata": {"date": 1556456977, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Fortran/s292514840.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s292514840", "user_id": "u506403362"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "program flipping_signs\n implicit none\n integer :: n, i, k\n integer(8) :: a(100000), m\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n m = 10000000000_8\n k = 0\n do i = 1, n\n if (m.gt.abs(a(i))) m = abs(a(i))\n if (a(i).lt.0_8) k = k + 1\n end do\n if (mod(k,2).eq.0) then\n m = sum(abs(a(1:n)))\n else\n m = sum(abs(a(1:n))) - m\n end if\n write(*,'(i0)') m\n stop\nend program flipping_signs", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 401, "cpu_time_ms": 37, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s825448398", "group_id": "codeNet:p03066", "input_text": "module mod_modulo_util\n implicit none\n integer(8), parameter :: md = 998244353_8\n integer(8), allocatable :: f(:), invf(:)\ncontains\n subroutine init(n)\n integer, intent(in) :: n\n integer :: i\n if (allocated(f)) deallocate(f)\n if (allocated(invf)) deallocate(invf)\n allocate(f(0:n),invf(0:n))\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n end do\n invf(n) = inv(f(n))\n do i = n, 1, -1\n invf(i-1) = mod(invf(i)*int(i,8),md)\n end do\n end\n integer(8) function perm(n,k)\n integer, intent(in) :: n, k\n perm = 0_8\n if (k > n .or. n < 0 .or. k < 0) return\n perm = mod(f(n)*invf(n-k),md)\n end\n integer(8) function comb(n,k)\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n end\n integer(8) function homo(n,k)\n integer, intent(in) :: n, k\n homo = comb(n+k-1,k)\n end\n function inv(n) result(y)\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0_8\n y = 1_8\n do while (b /= 0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n y = mod(mod(y,md)+md,md)\n end\n function pow(a,b) result(r)\n integer(8), intent(in) :: a\n integer, intent(in) :: b\n integer :: i\n integer(8) :: r, p\n r = 1_8\n p = a\n do i = 0, 32\n if (btest(b,i)) r = mod(r*p,md)\n p = mod(p*p,md)\n end do\n end\n integer(8) function fact(n)\n integer, intent(in) :: n\n fact = 0_8\n if (n < 0) return\n fact = f(n)\n end\nend module mod_modulo_util\nprogram banned_x\n use mod_modulo_util\n implicit none\n integer :: n, x, i, j, k, t, w\n integer(8) :: ans = 0_8, tmp\n read(*,*) n, x\n call init(3*n)\n do i = 0, n\n tmp = 0_8\n do j = 0, min(x-1,i)\n if (2*j < x-1) cycle\n k = i-j\n if (i < k) cycle\n t = j-k\n if (t >= 0) then\n w = x-1-j-k\n tmp = mod(tmp+comb(t,w),md)\n else if (2*j == x-1) then\n tmp = mod(tmp+1_8,md)\n end if\n end do\n do j = 0, x-2\n tmp = mod(tmp+comb(i,j-i),md)\n end do\n ans = mod(ans+mod(tmp*comb(n,i),md),md)\n end do\n write(*,'(i0)') ans\nend program banned_x", "language": "Fortran", "metadata": {"date": 1566360018, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03066.html", "problem_id": "p03066", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03066/input.txt", "sample_output_relpath": "derived/input_output/data/p03066/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03066/Fortran/s825448398.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s825448398", "user_id": "u506403362"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "module mod_modulo_util\n implicit none\n integer(8), parameter :: md = 998244353_8\n integer(8), allocatable :: f(:), invf(:)\ncontains\n subroutine init(n)\n integer, intent(in) :: n\n integer :: i\n if (allocated(f)) deallocate(f)\n if (allocated(invf)) deallocate(invf)\n allocate(f(0:n),invf(0:n))\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n end do\n invf(n) = inv(f(n))\n do i = n, 1, -1\n invf(i-1) = mod(invf(i)*int(i,8),md)\n end do\n end\n integer(8) function perm(n,k)\n integer, intent(in) :: n, k\n perm = 0_8\n if (k > n .or. n < 0 .or. k < 0) return\n perm = mod(f(n)*invf(n-k),md)\n end\n integer(8) function comb(n,k)\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n end\n integer(8) function homo(n,k)\n integer, intent(in) :: n, k\n homo = comb(n+k-1,k)\n end\n function inv(n) result(y)\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0_8\n y = 1_8\n do while (b /= 0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n y = mod(mod(y,md)+md,md)\n end\n function pow(a,b) result(r)\n integer(8), intent(in) :: a\n integer, intent(in) :: b\n integer :: i\n integer(8) :: r, p\n r = 1_8\n p = a\n do i = 0, 32\n if (btest(b,i)) r = mod(r*p,md)\n p = mod(p*p,md)\n end do\n end\n integer(8) function fact(n)\n integer, intent(in) :: n\n fact = 0_8\n if (n < 0) return\n fact = f(n)\n end\nend module mod_modulo_util\nprogram banned_x\n use mod_modulo_util\n implicit none\n integer :: n, x, i, j, k, t, w\n integer(8) :: ans = 0_8, tmp\n read(*,*) n, x\n call init(3*n)\n do i = 0, n\n tmp = 0_8\n do j = 0, min(x-1,i)\n if (2*j < x-1) cycle\n k = i-j\n if (i < k) cycle\n t = j-k\n if (t >= 0) then\n w = x-1-j-k\n tmp = mod(tmp+comb(t,w),md)\n else if (2*j == x-1) then\n tmp = mod(tmp+1_8,md)\n end if\n end do\n do j = 0, x-2\n tmp = mod(tmp+comb(i,j-i),md)\n end do\n ans = mod(ans+mod(tmp*comb(n,i),md),md)\n end do\n write(*,'(i0)') ans\nend program banned_x", "problem_context": "Score : 800 points\n\nProblem Statement\n\nFind the number, modulo 998244353, of sequences of length N consisting of 0, 1 and 2 such that none of their contiguous subsequences totals to X.\n\nConstraints\n\n1 \\leq N \\leq 3000\n\n1 \\leq X \\leq 2N\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number, modulo 998244353, of sequences that satisfy the condition.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n14\n\n14 sequences satisfy the condition: (0,0,0),(0,0,1),(0,0,2),(0,1,0),(0,1,1),(0,2,0),(0,2,2),(1,0,0),(1,0,1),(1,1,0),(2,0,0),(2,0,2),(2,2,0) and (2,2,2).\n\nSample Input 2\n\n8 6\n\nSample Output 2\n\n1179\n\nSample Input 3\n\n10 1\n\nSample Output 3\n\n1024\n\nSample Input 4\n\n9 13\n\nSample Output 4\n\n18402\n\nSample Input 5\n\n314 159\n\nSample Output 5\n\n459765451", "sample_input": "3 3\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03066", "source_text": "Score : 800 points\n\nProblem Statement\n\nFind the number, modulo 998244353, of sequences of length N consisting of 0, 1 and 2 such that none of their contiguous subsequences totals to X.\n\nConstraints\n\n1 \\leq N \\leq 3000\n\n1 \\leq X \\leq 2N\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number, modulo 998244353, of sequences that satisfy the condition.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\n14\n\n14 sequences satisfy the condition: (0,0,0),(0,0,1),(0,0,2),(0,1,0),(0,1,1),(0,2,0),(0,2,2),(1,0,0),(1,0,1),(1,1,0),(2,0,0),(2,0,2),(2,2,0) and (2,2,2).\n\nSample Input 2\n\n8 6\n\nSample Output 2\n\n1179\n\nSample Input 3\n\n10 1\n\nSample Output 3\n\n1024\n\nSample Input 4\n\n9 13\n\nSample Output 4\n\n18402\n\nSample Input 5\n\n314 159\n\nSample Output 5\n\n459765451", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2202, "cpu_time_ms": 115, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s476496790", "group_id": "codeNet:p03067", "input_text": "program sample\n\timplicit none\n integer :: i,j,k,l,m\n integer(8) :: x,y,z\n real(8) :: a(4),b(4)\n \n read(*,*) x,y,z\n \n if (x<=z .and. z<=y) then\n \twrite(*,*) 'Yes'\n else if (z<=x .and. y<=z) then\n \twrite(*,*) 'Yes'\n else\n \twrite(*,*) 'No'\n end if\n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1593824594, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03067.html", "problem_id": "p03067", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03067/input.txt", "sample_output_relpath": "derived/input_output/data/p03067/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03067/Fortran/s476496790.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s476496790", "user_id": "u323210830"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program sample\n\timplicit none\n integer :: i,j,k,l,m\n integer(8) :: x,y,z\n real(8) :: a(4),b(4)\n \n read(*,*) x,y,z\n \n if (x<=z .and. z<=y) then\n \twrite(*,*) 'Yes'\n else if (z<=x .and. y<=z) then\n \twrite(*,*) 'Yes'\n else\n \twrite(*,*) 'No'\n end if\n stop\nend program sample", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "sample_input": "3 8 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03067", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 7, "memory_kb": 2768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s973962430", "group_id": "codeNet:p03068", "input_text": "program ee\n implicit none\n integer :: n\n character(10) :: s\n integer :: k\n integer :: i\n character :: m\n read(*,*)n\n read(*,*)s\n read(*,*)k\n m = s(k:k)\n do i = 1,n\n !TODO_statement\n if ( m /= s(i:i) ) then\n s(i:i) = '*'\n end if\n end do\n write(*,*)s\nend program ee", "language": "Fortran", "metadata": {"date": 1555887480, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03068.html", "problem_id": "p03068", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03068/input.txt", "sample_output_relpath": "derived/input_output/data/p03068/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03068/Fortran/s973962430.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s973962430", "user_id": "u690655661"}, "prompt_components": {"gold_output": "*rr*r\n", "input_to_evaluate": "program ee\n implicit none\n integer :: n\n character(10) :: s\n integer :: k\n integer :: i\n character :: m\n read(*,*)n\n read(*,*)s\n read(*,*)k\n m = s(k:k)\n do i = 1,n\n !TODO_statement\n if ( m /= s(i:i) ) then\n s(i:i) = '*'\n end if\n end do\n write(*,*)s\nend program ee", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "sample_input": "5\nerror\n2\n"}, "reference_outputs": ["*rr*r\n"], "source_document_id": "p03068", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 334, "cpu_time_ms": 15, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s163456755", "group_id": "codeNet:p03069", "input_text": "program tenka1_2019_c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,cl,cr,ans\n character(:),allocatable:: s\n\n read*, n\n allocate(character(n):: s)\n read*, s(:)\n cl = 0\n cr = 0\n do i=1,n\n if (s(i:i) == '.') cr=cr+1\n end do\n\n ans = cl+cr\n\n do i=1,n\n if (s(i:i) == '.') then\n cr=cr-1\n else\n cl=cl+1\n end if\n ans = min(ans,cl+cr)\n end do\n\n print'(i0)', ans\nend program tenka1_2019_c", "language": "Fortran", "metadata": {"date": 1591292686, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/Fortran/s163456755.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s163456755", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program tenka1_2019_c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,cl,cr,ans\n character(:),allocatable:: s\n\n read*, n\n allocate(character(n):: s)\n read*, s(:)\n cl = 0\n cr = 0\n do i=1,n\n if (s(i:i) == '.') cr=cr+1\n end do\n\n ans = cl+cr\n\n do i=1,n\n if (s(i:i) == '.') then\n cr=cr-1\n else\n cl=cl+1\n end if\n ans = min(ans,cl+cr)\n end do\n\n print'(i0)', ans\nend program tenka1_2019_c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 505, "cpu_time_ms": 12, "memory_kb": 1468}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s124898322", "group_id": "codeNet:p03069", "input_text": "implicit none\ninteger n,k,i,slen\ninteger :: cnt=0,black=0,white=0\ncharacter(200000) s\nlogical :: cnc=.false.\n\n\nread(5,*) n\nread(5,*) s\n\nslen=len_trim(s)\n\ndo i=1,slen\n\nif(s(i:i).eq.\"#\") then\nblack=black+1\nelse if(s(i:i).eq.\".\") then\nwhite=white+1 \nendif\n\nif(s(i:i+1) .eq. \"#.\") then\ncnc=.true.\nelse if (s(i:i+1) .eq. \".#\" .and. cnc) then\ncnt=cnt+min(black,white)\nwhite=0\nblack=0\ncnc=.false.\nendif\n\nenddo\n\nif(s(slen-1:slen).eq.\"#.\") then\ncnt=cnt+1\nendif\n\nwrite(6,*) cnt\n\nend", "language": "Fortran", "metadata": {"date": 1555813059, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/Fortran/s124898322.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s124898322", "user_id": "u093744128"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "implicit none\ninteger n,k,i,slen\ninteger :: cnt=0,black=0,white=0\ncharacter(200000) s\nlogical :: cnc=.false.\n\n\nread(5,*) n\nread(5,*) s\n\nslen=len_trim(s)\n\ndo i=1,slen\n\nif(s(i:i).eq.\"#\") then\nblack=black+1\nelse if(s(i:i).eq.\".\") then\nwhite=white+1 \nendif\n\nif(s(i:i+1) .eq. \"#.\") then\ncnc=.true.\nelse if (s(i:i+1) .eq. \".#\" .and. cnc) then\ncnt=cnt+min(black,white)\nwhite=0\nblack=0\ncnc=.false.\nendif\n\nenddo\n\nif(s(slen-1:slen).eq.\"#.\") then\ncnt=cnt+1\nendif\n\nwrite(6,*) cnt\n\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 473, "cpu_time_ms": 13, "memory_kb": 1340}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s169350901", "group_id": "codeNet:p03069", "input_text": "program main\n implicit none\n integer ::le,i,j,a=0,b=0,am,bm\n character(300000)::n\n read(*,*)j\n read(*,*)n\n le=len_trim(n)\n do i=1,le\n if(n(i:i)=='.')a=a+1\n if(n(i:i)=='#')b=b+1\n enddo\n am=a\n bm=b\n do j=1,le\n if(n(j:j)=='.')then\n a=a-1\n if(am>a)am=a\n else\n a=a+1\n endif\n enddo\n do j=le,1,-1\n if(n(j:j)=='#')then\n b=b-1\n if(bm>b)bm=b\n else\n b=b+1\n endif\n\n enddo\n write(*,*)min(am,bm)\nend program main\n", "language": "Fortran", "metadata": {"date": 1555811795, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/Fortran/s169350901.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169350901", "user_id": "u539011156"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer ::le,i,j,a=0,b=0,am,bm\n character(300000)::n\n read(*,*)j\n read(*,*)n\n le=len_trim(n)\n do i=1,le\n if(n(i:i)=='.')a=a+1\n if(n(i:i)=='#')b=b+1\n enddo\n am=a\n bm=b\n do j=1,le\n if(n(j:j)=='.')then\n a=a-1\n if(am>a)am=a\n else\n a=a+1\n endif\n enddo\n do j=le,1,-1\n if(n(j:j)=='#')then\n b=b-1\n if(bm>b)bm=b\n else\n b=b+1\n endif\n\n enddo\n write(*,*)min(am,bm)\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s392109950", "group_id": "codeNet:p03069", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,ans=0,i\ncharacter(len=2*10**5) :: s\n\nread*, n,s\n\ndo i = 1, n-1\n if ( s(i:i+1) == '#.' ) then\n ans = ans + 1\n end if\nend do\n\nprint'(i0)', ans\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1555809285, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/Fortran/s392109950.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s392109950", "user_id": "u454557108"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,ans=0,i\ncharacter(len=2*10**5) :: s\n\nread*, n,s\n\ndo i = 1, n-1\n if ( s(i:i+1) == '#.' ) then\n ans = ans + 1\n end if\nend do\n\nprint'(i0)', ans\n\nEND PROGRAM ATCODER", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 10, "memory_kb": 1340}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s745474219", "group_id": "codeNet:p03071", "input_text": "program answer\n implicit none\n\n integer :: N, i, count, sum\n character(len=100000) :: S, p, q\n\n read(*,*) S\n\n N = len_trim(S)\n count = 0\n\n\n do i = 1, N, 2\n p(i:i) = '0'\n q(i:i) = '1'\n end do\n\n do i = 2, N, 2\n p(i:i) = '1'\n q(i:i) = '0'\n end do\n do i = 1, N\n if(S(i:i)/=p(i:i)) then\n count = count + 1\n end if\n end do\n\n sum = 0\n do i = 1, N\n if(S(i:i)/=q(i:i)) then\n sum = sum + 1\n end if\n end do\n\n if(count>=sum) then\n write(*,*) sum\n else\n write(*,*) count\n end if\n\n stop\n end program answer\n", "language": "Fortran", "metadata": {"date": 1592606854, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03071.html", "problem_id": "p03071", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03071/input.txt", "sample_output_relpath": "derived/input_output/data/p03071/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03071/Fortran/s745474219.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745474219", "user_id": "u873780029"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program answer\n implicit none\n\n integer :: N, i, count, sum\n character(len=100000) :: S, p, q\n\n read(*,*) S\n\n N = len_trim(S)\n count = 0\n\n\n do i = 1, N, 2\n p(i:i) = '0'\n q(i:i) = '1'\n end do\n\n do i = 2, N, 2\n p(i:i) = '1'\n q(i:i) = '0'\n end do\n do i = 1, N\n if(S(i:i)/=p(i:i)) then\n count = count + 1\n end if\n end do\n\n sum = 0\n do i = 1, N\n if(S(i:i)/=q(i:i)) then\n sum = sum + 1\n end if\n end do\n\n if(count>=sum) then\n write(*,*) sum\n else\n write(*,*) count\n end if\n\n stop\n end program answer\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 565, "cpu_time_ms": 5, "memory_kb": 2912}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s696458370", "group_id": "codeNet:p03072", "input_text": "module ABC124\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n\n ! constants for this \n integer(kind=INT8), parameter, private :: num_mountains_max = 100_INT8\n\n ! variables for this \n integer(kind=INT8) :: num_mountains_all\n integer(kind=INT8) :: num_mountains_visible\n integer(kind=INT8) :: height_mountain(1:num_mountains_max)\n logical :: is_visible\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer(kind=INT8) :: itr_Mt, itr_ToWest\n\n ! STEP.01\n ! read out the number of the mountains\n read(unit=INPUT_UNIT, fmt=*) num_mountains_all\n\n ! STEP.02\n ! read out the heights of the mountains\n read(unit=INPUT_UNIT, fmt=*) height_mountain(1:num_mountains_all)\n\n ! STEP.03\n ! count up the number of mountains which you can see the sea from the top of the mountain\n num_mountains_visible = 0_INT8\n\n do itr_Mt = 1_INT8, num_mountains_all, 1_INT8\n \n is_visible = .true.\n\n do itr_ToWest = itr_Mt-1_INT8, 1_INT8, -1_INT8\n if (height_mountain(itr_ToWest) .gt. height_mountain(itr_Mt)) then\n is_visible = .false.\n exit\n end if\n end do\n\n if (is_visible) num_mountains_visible = num_mountains_visible + 1_INT8\n\n end do\n\n ! STEP.04\n ! output the result\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') num_mountains_visible\n\n ! STEP.END\n return\n\n end subroutine task_B\n\nend module ABC124\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC124\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "language": "Fortran", "metadata": {"date": 1555183563, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03072.html", "problem_id": "p03072", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03072/input.txt", "sample_output_relpath": "derived/input_output/data/p03072/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03072/Fortran/s696458370.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s696458370", "user_id": "u484703930"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module ABC124\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_B\n\n ! constants for this \n integer(kind=INT8), parameter, private :: num_mountains_max = 100_INT8\n\n ! variables for this \n integer(kind=INT8) :: num_mountains_all\n integer(kind=INT8) :: num_mountains_visible\n integer(kind=INT8) :: height_mountain(1:num_mountains_max)\n logical :: is_visible\n\n ! contained s and s are below\n contains\n\n subroutine task_B\n\n ! variables for this \n integer(kind=INT8) :: itr_Mt, itr_ToWest\n\n ! STEP.01\n ! read out the number of the mountains\n read(unit=INPUT_UNIT, fmt=*) num_mountains_all\n\n ! STEP.02\n ! read out the heights of the mountains\n read(unit=INPUT_UNIT, fmt=*) height_mountain(1:num_mountains_all)\n\n ! STEP.03\n ! count up the number of mountains which you can see the sea from the top of the mountain\n num_mountains_visible = 0_INT8\n\n do itr_Mt = 1_INT8, num_mountains_all, 1_INT8\n \n is_visible = .true.\n\n do itr_ToWest = itr_Mt-1_INT8, 1_INT8, -1_INT8\n if (height_mountain(itr_ToWest) .gt. height_mountain(itr_Mt)) then\n is_visible = .false.\n exit\n end if\n end do\n\n if (is_visible) num_mountains_visible = num_mountains_visible + 1_INT8\n\n end do\n\n ! STEP.04\n ! output the result\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') num_mountains_visible\n\n ! STEP.END\n return\n\n end subroutine task_B\n\nend module ABC124\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC124\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_B\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "sample_input": "4\n6 5 6 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03072", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1843, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s417956600", "group_id": "codeNet:p03072", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,count=0,i\ninteger,allocatable :: h(:)\n\nread*, n\nallocate(h(n))\nread*, h(1:n)\n\ndo i = 1, n, 1\n if ( h(i) >= maxval(h(1:i)) ) then\n count = count + 1\n end if\nend do\n\nprint'(i0)', count\n\nEND PROGRAM ATCODER\n", "language": "Fortran", "metadata": {"date": 1555182381, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03072.html", "problem_id": "p03072", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03072/input.txt", "sample_output_relpath": "derived/input_output/data/p03072/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03072/Fortran/s417956600.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417956600", "user_id": "u454557108"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,count=0,i\ninteger,allocatable :: h(:)\n\nread*, n\nallocate(h(n))\nread*, h(1:n)\n\ndo i = 1, n, 1\n if ( h(i) >= maxval(h(1:i)) ) then\n count = count + 1\n end if\nend do\n\nprint'(i0)', count\n\nEND PROGRAM ATCODER\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "sample_input": "4\n6 5 6 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03072", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s405703708", "group_id": "codeNet:p03073", "input_text": "program main\n implicit none\n\n character(len=100000) :: s, s1 , s2\n integer :: n, i, ans1, ans2\n \n\n read(*,*) s\n s1 = s\n s2 = s\n n = len_trim(s)\n\n ans1 = 0\n ans2 = 0\n do i = 2, n\n if(s1(i:i) == s1(i-1:i-1)) then\n select case(s1(i:i))\n case('0')\n s1(i:i) = '1'\n case('1')\n s1(i:i) = '0'\n end select\n ans1 = ans1 + 1\n end if\n\n end do\n\n do i = 1, n-1\n if(s2(n-i:n-i) == s2(n-i+1:n-i+1)) then\n select case(s2(n-i:n-i))\n case('0')\n s2(n-i:n-i) = '1'\n case('1')\n s2(n-i:n-i) = '0'\n end select\n ans2 = ans2 + 1\n end if\n end do\n \n write(*,*) min(ans1, ans2)\n\nend program main\n\n \n", "language": "Fortran", "metadata": {"date": 1592594522, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/Fortran/s405703708.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405703708", "user_id": "u979474608"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n\n character(len=100000) :: s, s1 , s2\n integer :: n, i, ans1, ans2\n \n\n read(*,*) s\n s1 = s\n s2 = s\n n = len_trim(s)\n\n ans1 = 0\n ans2 = 0\n do i = 2, n\n if(s1(i:i) == s1(i-1:i-1)) then\n select case(s1(i:i))\n case('0')\n s1(i:i) = '1'\n case('1')\n s1(i:i) = '0'\n end select\n ans1 = ans1 + 1\n end if\n\n end do\n\n do i = 1, n-1\n if(s2(n-i:n-i) == s2(n-i+1:n-i+1)) then\n select case(s2(n-i:n-i))\n case('0')\n s2(n-i:n-i) = '1'\n case('1')\n s2(n-i:n-i) = '0'\n end select\n ans2 = ans2 + 1\n end if\n end do\n \n write(*,*) min(ans1, ans2)\n\nend program main\n\n \n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 713, "cpu_time_ms": 9, "memory_kb": 3352}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s527085385", "group_id": "codeNet:p03073", "input_text": "program main\n\timplicit none\n character(10**5)::s\n integer(8)::i,len1,ans\n read(*,*) s\n len1=len_trim(s)\n ans=0\n if (s(1:1)=='1')then\n \n \tdo i=1,len1\n \tif(mod(i,2)==0)then\n \tif(s(i:i)/='0')then\n \tans=ans+1\n end if\n else\n \tif(s(i:i)/='1')then\n \tans=ans+1\n end if\n end if\n end do\n else\n \tdo i=1,len1\n \tif(mod(i,2)==0)then\n \tif(s(i:i)/='1')then\n \tans=ans+1\n end if\n else\n \tif(s(i:i)/='0')then\n \tans=ans+1\n end if\n end if\n end do\n end if\n write(*,*) ans\n stop\nend program main\n\n \t\n\n", "language": "Fortran", "metadata": {"date": 1592594414, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/Fortran/s527085385.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s527085385", "user_id": "u884601206"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n\timplicit none\n character(10**5)::s\n integer(8)::i,len1,ans\n read(*,*) s\n len1=len_trim(s)\n ans=0\n if (s(1:1)=='1')then\n \n \tdo i=1,len1\n \tif(mod(i,2)==0)then\n \tif(s(i:i)/='0')then\n \tans=ans+1\n end if\n else\n \tif(s(i:i)/='1')then\n \tans=ans+1\n end if\n end if\n end do\n else\n \tdo i=1,len1\n \tif(mod(i,2)==0)then\n \tif(s(i:i)/='1')then\n \tans=ans+1\n end if\n else\n \tif(s(i:i)/='0')then\n \tans=ans+1\n end if\n end if\n end do\n end if\n write(*,*) ans\n stop\nend program main\n\n \t\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 755, "cpu_time_ms": 6, "memory_kb": 3184}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s291305321", "group_id": "codeNet:p03073", "input_text": "program name\n implicit none\n character(100000):: s, f\n integer(4):: len_s,i, diff\n\n read*, s\n len_s = len_trim(s)\n\n f(1:1) = '0'\n do i=2,len_s\n f(i:i) = char(ichar('0')+ichar('1') - ichar(f(i-1:i-1)))\n end do\n\n diff = 0\n do i=1,len_s\n if (s(i:i) == f(i:i)) diff=diff+1\n end do\n\n print*, min(diff, len_s-diff)\nend program name", "language": "Fortran", "metadata": {"date": 1586088649, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/Fortran/s291305321.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291305321", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program name\n implicit none\n character(100000):: s, f\n integer(4):: len_s,i, diff\n\n read*, s\n len_s = len_trim(s)\n\n f(1:1) = '0'\n do i=2,len_s\n f(i:i) = char(ichar('0')+ichar('1') - ichar(f(i-1:i-1)))\n end do\n\n diff = 0\n do i=1,len_s\n if (s(i:i) == f(i:i)) diff=diff+1\n end do\n\n print*, min(diff, len_s-diff)\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 375, "cpu_time_ms": 3, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s908546470", "group_id": "codeNet:p03073", "input_text": "module ABC124\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_C\n\n ! constants for this \n integer(kind=INT32), parameter, private :: len_string_max = 10000_INT32\n\n ! variables for this \n character(len=len_string_max, kind=1) :: given_string\n character(len=len_string_max, kind=1) :: reference_0, reference_1\n integer (kind=INT32) :: len_string\n integer (kind=INT32) :: num_operations(0:1)\n\n ! contained s and s are below\n contains\n\n subroutine task_C\n\n ! variables for this \n integer(kind=INT32) :: itr\n\n ! STEP.01\n ! read out the given string\n read(unit=INPUT_UNIT, fmt='(A)') given_string\n\n ! STEP.02\n ! count up the number of operations\n len_string = len_trim(given_string)\n num_operations = 0_INT32\n\n do itr = 1_INT32, len_string, 2_INT32\n reference_0(itr:itr) = '0'\n reference_1(itr:itr) = '1'\n end do\n\n do itr = 2_INT32, len_string, 2_INT32\n reference_0(itr:itr) = '1'\n reference_1(itr:itr) = '0'\n end do\n\n do itr = 1_INT32, len_string, 1_INT32\n if (given_string(itr:itr) .ne. reference_0(itr:itr)) num_operations(0) = num_operations(0) + 1_INT32\n if (given_string(itr:itr) .ne. reference_1(itr:itr)) num_operations(1) = num_operations(1) + 1_INT32\n end do\n\n ! STEP.04\n ! output the result\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') min(num_operations(0), num_operations(1))\n\n ! STEP.END\n return\n\n end subroutine task_C\n\nend module ABC124\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC124\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_C\n\nend program main", "language": "Fortran", "metadata": {"date": 1555196961, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/Fortran/s908546470.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s908546470", "user_id": "u484703930"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module ABC124\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_C\n\n ! constants for this \n integer(kind=INT32), parameter, private :: len_string_max = 10000_INT32\n\n ! variables for this \n character(len=len_string_max, kind=1) :: given_string\n character(len=len_string_max, kind=1) :: reference_0, reference_1\n integer (kind=INT32) :: len_string\n integer (kind=INT32) :: num_operations(0:1)\n\n ! contained s and s are below\n contains\n\n subroutine task_C\n\n ! variables for this \n integer(kind=INT32) :: itr\n\n ! STEP.01\n ! read out the given string\n read(unit=INPUT_UNIT, fmt='(A)') given_string\n\n ! STEP.02\n ! count up the number of operations\n len_string = len_trim(given_string)\n num_operations = 0_INT32\n\n do itr = 1_INT32, len_string, 2_INT32\n reference_0(itr:itr) = '0'\n reference_1(itr:itr) = '1'\n end do\n\n do itr = 2_INT32, len_string, 2_INT32\n reference_0(itr:itr) = '1'\n reference_1(itr:itr) = '0'\n end do\n\n do itr = 1_INT32, len_string, 1_INT32\n if (given_string(itr:itr) .ne. reference_0(itr:itr)) num_operations(0) = num_operations(0) + 1_INT32\n if (given_string(itr:itr) .ne. reference_1(itr:itr)) num_operations(1) = num_operations(1) + 1_INT32\n end do\n\n ! STEP.04\n ! output the result\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') min(num_operations(0), num_operations(1))\n\n ! STEP.END\n return\n\n end subroutine task_C\n\nend module ABC124\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC124\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_C\n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1882, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s388931487", "group_id": "codeNet:p03074", "input_text": "program main\n implicit none\n character(100000)s\n integer n,k\n integer ::i,ma=1,counter=0,j=1\n integer ::a(100000)=0\n read(*,*)n,k\n read(*,*)s\n do i=1,n\n if(mod(j,2)==1)then\n if(s(i:i)==\"1\")then\n a(j)=a(j)+1\n else\n j=j+1\n endif\n cycle\n else\n if(s(i:i)==\"0\")then\n a(j)=a(j)+1\n else\n j=j+1\n endif\n endif\n cycle\n enddo\n a(2:j)=a(2:j)+1\n if(j<=2*k)then\n write(*,*)n\n endif\n do i=1,n-2*k,2\n if(ma k) then \n write(*,1)\n else\n write(*,2)\n end if\n \nend program main", "language": "Fortran", "metadata": {"date": 1554581155, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03075.html", "problem_id": "p03075", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03075/input.txt", "sample_output_relpath": "derived/input_output/data/p03075/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03075/Fortran/s248497480.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248497480", "user_id": "u671401989"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "program main\n implicit none\n \n1 format(':(')\n2 format('Yay!')\n \n integer a, b, c, d, e, k\n \n read(*,*) a\n read(*,*) b\n read(*,*) c\n read(*,*) d\n read(*,*) e\n read(*,*) k\n \n if (e - a > k) then \n write(*,1)\n else\n write(*,2)\n end if\n \nend program main", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s096948032", "group_id": "codeNet:p03075", "input_text": "program main\n implicit none\n integer :: i, k, ant(5)\n\n do i = 1, 5\n read *, ant(i)\n end do\n read *, k\n\n if (maxval(ant) - minval(ant) > k) then\n print '(a)', ':('\n else\n print '(a)', 'Yay!'\n end if\nend program", "language": "Fortran", "metadata": {"date": 1554577464, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03075.html", "problem_id": "p03075", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03075/input.txt", "sample_output_relpath": "derived/input_output/data/p03075/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03075/Fortran/s096948032.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s096948032", "user_id": "u282360873"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "program main\n implicit none\n integer :: i, k, ant(5)\n\n do i = 1, 5\n read *, ant(i)\n end do\n read *, k\n\n if (maxval(ant) - minval(ant) > k) then\n print '(a)', ':('\n else\n print '(a)', 'Yay!'\n end if\nend program", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s033113280", "group_id": "codeNet:p03076", "input_text": "program fivedishes\n implicit none\n\ninteger::a(5),i,count=0,m=644\n\ndo i=1,5\n read*,a(i)\n if(mod(a(i),10)==0)then\n count=count+a(i)\n else\n count=count+(a(i)/10+1)*10\n end if\nend do\n\ndo i=1,5\n if(mod(a(i),10)/=0)then\n if(count-(a(i)/10+1)*10+a(i) k))] \n end if\n end function iqsort\nend program main", "language": "Fortran", "metadata": {"date": 1554583227, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/Fortran/s034784509.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s034784509", "user_id": "u886432251"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: X,Y,Z,K\n integer:: tot\n integer(8),allocatable :: A(:),B(:),C(:)\n integer(8),allocatable :: ABC(:)\n integer(8),allocatable :: ABC2(:)\n integer :: i1,i2,i3,i\n read(*,*) X,Y,Z,K\n allocate(A(X),B(Y),C(Z))\n read(*,*) A(:)\n read(*,*) B(:)\n read(*,*) C(:)\n\n allocate( ABC(X*Y*Z) )\n tot=X*Y*Z\n i = 0\n do i1 = 1,X\n do i2 = 1,Y\n do i3 = 1,Z\n i = i + 1\n ABC(i) = A(i1) + B(i2) + C(i3)\n end do\n end do\n end do\n ABC2 = iqsort(ABC)\n do i = 1,K\n write(*,'(i0)') ABC2(tot-i+1)\n end do\n stop\ncontains\n recursive function iqsort(ix) result(ires)\n integer(8), allocatable :: ires(:)\n integer(8), intent(in) :: ix(:)\n integer(8) :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort\nend program main", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 957, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s219123012", "group_id": "codeNet:p03079", "input_text": "program main\n\timplicit none\n integer::a,b,c\n read(*,*)a,b,c\n if(a==b .and. a==c)then\n \twrite(*,*)'Yes'\n else\n \twrite(*,*)'No'\n end if\n stop\nend program main\n", "language": "Fortran", "metadata": {"date": 1592609142, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03079.html", "problem_id": "p03079", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03079/input.txt", "sample_output_relpath": "derived/input_output/data/p03079/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03079/Fortran/s219123012.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219123012", "user_id": "u884601206"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n\timplicit none\n integer::a,b,c\n read(*,*)a,b,c\n if(a==b .and. a==c)then\n \twrite(*,*)'Yes'\n else\n \twrite(*,*)'No'\n end if\n stop\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A,B,C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nThere exists an equilateral triangle whose sides have lengths 2, 2 and 2.\n\nSample Input 2\n\n3 4 5\n\nSample Output 2\n\nNo\n\nThere is no equilateral triangle whose sides have lengths 3, 4 and 5.", "sample_input": "2 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03079", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\n\nDetermine if there exists an equilateral triangle whose sides have lengths A, B and C.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A,B,C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf there exists an equilateral triangle whose sides have lengths A, B and C, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nThere exists an equilateral triangle whose sides have lengths 2, 2 and 2.\n\nSample Input 2\n\n3 4 5\n\nSample Output 2\n\nNo\n\nThere is no equilateral triangle whose sides have lengths 3, 4 and 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 6, "memory_kb": 2760}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s083399012", "group_id": "codeNet:p03080", "input_text": "program main\nimplicit none\ninteger :: n, i, m, l\ncharacter :: s*100\nread(*,*) n\nread(*,*) s(1:n)\n\nm = 0\ndo i = 1 , n\n if( s(i:i) == 'R' ) then\n m = m+1\n else\n l = l+1\n end if\nend do\n\nif( m>l) then\n write(*,*) 'Yes'\n stop\nelse\n write(*,*) 'No'\nend if\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1553976356, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03080.html", "problem_id": "p03080", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03080/input.txt", "sample_output_relpath": "derived/input_output/data/p03080/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03080/Fortran/s083399012.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s083399012", "user_id": "u696547932"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: n, i, m, l\ncharacter :: s*100\nread(*,*) n\nread(*,*) s(1:n)\n\nm = 0\ndo i = 1 , n\n if( s(i:i) == 'R' ) then\n m = m+1\n else\n l = l+1\n end if\nend do\n\nif( m>l) then\n write(*,*) 'Yes'\n stop\nelse\n write(*,*) 'No'\nend if\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "sample_input": "4\nRRBR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03080", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s882595328", "group_id": "codeNet:p03081", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,q,i,c_l=1,c_r=1\ncharacter(len=2*10**5) :: s,s_l='',s_r=''\ncharacter(len=1),allocatable :: d(:),t(:)\n\nread*, n,q,s\nallocate(t(q),d(q))\ndo i = 1, q, 1\n read*, t(i),d(i)\nend do\n\ndo i = q, 1, -1\n if ( d(i) == 'L' ) then\n if ( s(c_l:c_l) == t(i) ) then\n c_l = c_l + 1\n end if\n else if ( d(i) == 'R' ) then\n if ( s(n+1-c_r:n+1-c_r) == t(i) ) then\n c_r = c_r + 1\n end if\n end if\nend do\n\nprint'(i0)', n-(c_l-1)-(c_r-1)\n\ncontains\n!!!!!! サブルーチンは↓\n!!!!!!\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1553980859, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03081.html", "problem_id": "p03081", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03081/input.txt", "sample_output_relpath": "derived/input_output/data/p03081/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03081/Fortran/s882595328.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s882595328", "user_id": "u454557108"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,q,i,c_l=1,c_r=1\ncharacter(len=2*10**5) :: s,s_l='',s_r=''\ncharacter(len=1),allocatable :: d(:),t(:)\n\nread*, n,q,s\nallocate(t(q),d(q))\ndo i = 1, q, 1\n read*, t(i),d(i)\nend do\n\ndo i = q, 1, -1\n if ( d(i) == 'L' ) then\n if ( s(c_l:c_l) == t(i) ) then\n c_l = c_l + 1\n end if\n else if ( d(i) == 'R' ) then\n if ( s(n+1-c_r:n+1-c_r) == t(i) ) then\n c_r = c_r + 1\n end if\n end if\nend do\n\nprint'(i0)', n-(c_l-1)-(c_r-1)\n\ncontains\n!!!!!! サブルーチンは↓\n!!!!!!\n\nEND PROGRAM ATCODER", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "sample_input": "3 4\nABC\nA L\nB L\nB R\nA R\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03081", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N squares numbered 1 to N from left to right.\nEach square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.\n\nSnuke cast Q spells to move the golems.\n\nThe i-th spell consisted of two characters t_i and d_i, where d_i is L or R.\nWhen Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is L, and moved to the square adjacent to the right if d_i is R.\n\nHowever, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.\n\nFind the number of golems remaining after Snuke cast the Q spells.\n\nConstraints\n\n1 \\leq N,Q \\leq 2 \\times 10^{5}\n\n|s| = N\n\ns_i and t_i are uppercase English letters.\n\nd_i is L or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\ns\nt_1 d_1\n\\vdots\nt_{Q} d_Q\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 4\nABC\nA L\nB L\nB R\nA R\n\nSample Output 1\n\n2\n\nInitially, there is one golem on each square.\n\nIn the first spell, the golem on Square 1 tries to move left and disappears.\n\nIn the second spell, the golem on Square 2 moves left.\n\nIn the third spell, no golem moves.\n\nIn the fourth spell, the golem on Square 1 moves right.\n\nAfter the four spells are cast, there is one golem on Square 2 and one golem on Square 3, for a total of two golems remaining.\n\nSample Input 2\n\n8 3\nAABCBDBA\nA L\nB R\nA R\n\nSample Output 2\n\n5\n\nAfter the three spells are cast, there is one golem on Square 2, two golems on Square 4 and two golems on Square 6, for a total of five golems remaining.\n\nNote that a single spell may move multiple golems.\n\nSample Input 3\n\n10 15\nSNCZWRCEWB\nB R\nR R\nE R\nW R\nZ L\nS R\nQ L\nW L\nB R\nC L\nA L\nN L\nE R\nZ L\nS L\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 550, "cpu_time_ms": 83, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s840473438", "group_id": "codeNet:p03082", "input_text": "module mod_modulo_operations\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8) :: f(0:100000), invf(0:100000)\n integer(8) :: dp(0:200,0:100000)\n integer :: s(200), leq(100000)\ncontains\n subroutine init(n)\n implicit none\n integer, intent(in) :: n\n integer :: i\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n invf(0) = 1_8\n dp = -1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n invf(i) = inv(f(i))\n end do\n return\n end subroutine init\n integer(8) function perm(n,k)\n implicit none\n integer, intent(in) :: n, k\n perm = 0_8\n if (n.lt.0.or.k.gt.n) return\n perm = mod(f(n)*invf(n-k),md)\n return\n end function perm\n integer(8) function comb(n,k)\n implicit none\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n return\n end function comb\n function inv(n) result(y)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0\n y = 1\n do while(b.ne.0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n do while (y.lt.0_8)\n y = y+md\n end do\n y = mod(y,md)\n return\n end function inv\n recursive function dfs(n,x) result(c)\n implicit none\n integer :: n, x, sml, big, i\n integer(8) :: c, k\n c = dp(n,x)\n if (c.ge.0_8) return\n c = int(x,8)\n if (n.eq.0) return\n c = 0_8\n if (x.eq.0) return\n sml = leq(x)\n big = n-sml+1\n c = mod(f(n)*int(x,8),md)\n if (sml.eq.1) return\n k = mod(comb(n,sml-1)*f(big),md)\n c = 0_8\n do i = 1, sml-1\n c = mod(c+dfs(sml-2,mod(x,s(i))),md)\n end do\n c = mod(k*c,md)\n dp(n,x) = c\n return\n end function dfs\nend module mod_modulo_operations\nprogram modulo_operations\n use mod_modulo_operations\n implicit none\n integer :: n, x, i, j\n s = 0\n leq = 0\n read(*,*) n, x\n read(*,*) s(1:n)\n call quick_sort(s(1:n))\n j = 1\n do i = 1, 100000\n do while (j.le.n.and.s(j).le.i)\n j = j+1\n end do\n leq(i) = j\n end do\n call init(100000)\n write(*,'(i0)') dfs(n,x)\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: n, l, r, p, c\n n = size(a)\n l = 1\n r = n\n p = a((l+r)/2)+a(l)+a(r)-max(a((l+r)/2),a(l),a(r))-min(a((l+r)/2),a(l),a(r))\n do\n do while (a(l).lt.p)\n l = l+1\n end do\n do while (a(r).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1))\n if (n.gt.r+1) call quick_sort(a(r+1:n))\n end subroutine quick_sort\nend program modulo_operations", "language": "Fortran", "metadata": {"date": 1562191204, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03082.html", "problem_id": "p03082", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03082/input.txt", "sample_output_relpath": "derived/input_output/data/p03082/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03082/Fortran/s840473438.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840473438", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module mod_modulo_operations\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8) :: f(0:100000), invf(0:100000)\n integer(8) :: dp(0:200,0:100000)\n integer :: s(200), leq(100000)\ncontains\n subroutine init(n)\n implicit none\n integer, intent(in) :: n\n integer :: i\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n invf(0) = 1_8\n dp = -1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n invf(i) = inv(f(i))\n end do\n return\n end subroutine init\n integer(8) function perm(n,k)\n implicit none\n integer, intent(in) :: n, k\n perm = 0_8\n if (n.lt.0.or.k.gt.n) return\n perm = mod(f(n)*invf(n-k),md)\n return\n end function perm\n integer(8) function comb(n,k)\n implicit none\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n return\n end function comb\n function inv(n) result(y)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0\n y = 1\n do while(b.ne.0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n do while (y.lt.0_8)\n y = y+md\n end do\n y = mod(y,md)\n return\n end function inv\n recursive function dfs(n,x) result(c)\n implicit none\n integer :: n, x, sml, big, i\n integer(8) :: c, k\n c = dp(n,x)\n if (c.ge.0_8) return\n c = int(x,8)\n if (n.eq.0) return\n c = 0_8\n if (x.eq.0) return\n sml = leq(x)\n big = n-sml+1\n c = mod(f(n)*int(x,8),md)\n if (sml.eq.1) return\n k = mod(comb(n,sml-1)*f(big),md)\n c = 0_8\n do i = 1, sml-1\n c = mod(c+dfs(sml-2,mod(x,s(i))),md)\n end do\n c = mod(k*c,md)\n dp(n,x) = c\n return\n end function dfs\nend module mod_modulo_operations\nprogram modulo_operations\n use mod_modulo_operations\n implicit none\n integer :: n, x, i, j\n s = 0\n leq = 0\n read(*,*) n, x\n read(*,*) s(1:n)\n call quick_sort(s(1:n))\n j = 1\n do i = 1, 100000\n do while (j.le.n.and.s(j).le.i)\n j = j+1\n end do\n leq(i) = j\n end do\n call init(100000)\n write(*,'(i0)') dfs(n,x)\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: n, l, r, p, c\n n = size(a)\n l = 1\n r = n\n p = a((l+r)/2)+a(l)+a(r)-max(a((l+r)/2),a(l),a(r))-min(a((l+r)/2),a(l),a(r))\n do\n do while (a(l).lt.p)\n l = l+1\n end do\n do while (a(r).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1))\n if (n.gt.r+1) call quick_sort(a(r+1:n))\n end subroutine quick_sort\nend program modulo_operations", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "sample_input": "2 19\n3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03082", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has a blackboard and a set S consisting of N integers.\nThe i-th element in S is S_i.\n\nHe wrote an integer X on the blackboard, then performed the following operation N times:\n\nChoose one element from S and remove it.\n\nLet x be the number written on the blackboard now, and y be the integer removed from S. Replace the number on the blackboard with x \\bmod {y}.\n\nThere are N! possible orders in which the elements are removed from S.\nFor each of them, find the number that would be written on the blackboard after the N operations, and compute the sum of all those N! numbers modulo 10^{9}+7.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200\n\n1 \\leq S_i, X \\leq 10^{5}\n\nS_i are pairwise distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nS_1 S_2 \\ldots S_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 19\n3 7\n\nSample Output 1\n\n3\n\nThere are two possible orders in which we remove the numbers from S.\n\nIf we remove 3 and 7 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 1 \\rightarrow 1.\n\nIf we remove 7 and 3 in this order, the number on the blackboard changes as follows: 19 \\rightarrow 5 \\rightarrow 2.\n\nThe output should be the sum of these: 3.\n\nSample Input 2\n\n5 82\n22 11 6 5 13\n\nSample Output 2\n\n288\n\nSample Input 3\n\n10 100000\n50000 50001 50002 50003 50004 50005 50006 50007 50008 50009\n\nSample Output 3\n\n279669259\n\nBe sure to compute the sum modulo 10^{9}+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2728, "cpu_time_ms": 144, "memory_kb": 159232}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s735016945", "group_id": "codeNet:p03083", "input_text": "module mod_black_or_white\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8) :: f(0:200000), invf(0:200000), invp(0:200000)\ncontains\n subroutine init(n)\n implicit none\n integer, intent(in) :: n\n integer :: i\n integer(8) :: p\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n p = 1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n p = mod(p*2_8,md)\n end do\n invf(n) = inv(f(n))\n invp(n) = inv(p)\n do i = n, 1, -1\n invf(i-1) = mod(invf(i)*int(i,8),md)\n invp(i-1) = mod(invp(i)*2_8,md)\n end do\n return\n end subroutine init\n integer(8) function perm(n,k)\n implicit none\n integer, intent(in) :: n, k\n perm = 0_8\n if (n.lt.0.or.k.gt.n) return\n perm = mod(f(n)*invf(n-k),md)\n return\n end function perm\n integer(8) function comb(n,k)\n implicit none\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n return\n end function comb\n function inv(n) result(y)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0\n y = 1\n do while(b.ne.0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n do while (y.lt.0_8)\n y = y+md\n end do\n y = mod(y,md)\n return\n end function inv\nend module mod_black_or_white\nprogram black_or_white\n use mod_black_or_white\n implicit none\n integer :: b, w, i\n integer(8) :: x = 0_8, y = 0_8\n read(*,*) b, w\n call init(b+w)\n do i = 1, b+w\n write(*,'(i0)') mod(mod(md+1_8-x+y,md)*invp(1),md)\n x = mod(x+comb(i-1,b-1)*invp(i),md)\n y = mod(y+comb(i-1,w-1)*invp(i),md)\n end do\n stop\nend program black_or_white", "language": "Fortran", "metadata": {"date": 1563102280, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03083.html", "problem_id": "p03083", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03083/input.txt", "sample_output_relpath": "derived/input_output/data/p03083/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03083/Fortran/s735016945.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735016945", "user_id": "u506403362"}, "prompt_components": {"gold_output": "500000004\n750000006\n750000006\n", "input_to_evaluate": "module mod_black_or_white\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8) :: f(0:200000), invf(0:200000), invp(0:200000)\ncontains\n subroutine init(n)\n implicit none\n integer, intent(in) :: n\n integer :: i\n integer(8) :: p\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n p = 1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n p = mod(p*2_8,md)\n end do\n invf(n) = inv(f(n))\n invp(n) = inv(p)\n do i = n, 1, -1\n invf(i-1) = mod(invf(i)*int(i,8),md)\n invp(i-1) = mod(invp(i)*2_8,md)\n end do\n return\n end subroutine init\n integer(8) function perm(n,k)\n implicit none\n integer, intent(in) :: n, k\n perm = 0_8\n if (n.lt.0.or.k.gt.n) return\n perm = mod(f(n)*invf(n-k),md)\n return\n end function perm\n integer(8) function comb(n,k)\n implicit none\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n return\n end function comb\n function inv(n) result(y)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0\n y = 1\n do while(b.ne.0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n do while (y.lt.0_8)\n y = y+md\n end do\n y = mod(y,md)\n return\n end function inv\nend module mod_black_or_white\nprogram black_or_white\n use mod_black_or_white\n implicit none\n integer :: b, w, i\n integer(8) :: x = 0_8, y = 0_8\n read(*,*) b, w\n call init(b+w)\n do i = 1, b+w\n write(*,'(i0)') mod(mod(md+1_8-x+y,md)*invp(1),md)\n x = mod(x+comb(i-1,b-1)*invp(i),md)\n y = mod(y+comb(i-1,w-1)*invp(i),md)\n end do\n stop\nend program black_or_white", "problem_context": "Score : 700 points\n\nProblem Statement\n\nToday, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.\n\nHe will repeat the following procedure until there is no piece left:\n\nChoose black or white with equal probability, and eat a piece of that color if it exists.\n\nFor each integer i from 1 to B+W (inclusive), find the probability that the color of the i-th piece to be eaten is black.\nIt can be shown that these probabilities are rational, and we ask you to print them modulo 10^9 + 7, as described in Notes.\n\nNotes\n\nWhen you print a rational number, first write it as a fraction \\frac{y}{x}, where x, y are integers and x is not divisible by 10^9 + 7\n(under the constraints of the problem, such representation is always possible).\nThen, you need to print the only integer z between 0 and 10^9 + 6, inclusive, that satisfies xz \\equiv y \\pmod{10^9 + 7}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B,W \\leq 10^{5}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nB W\n\nOutput\n\nPrint the answers in B+W lines. In the i-th line, print the probability that the color of the i-th piece to be eaten is black, modulo 10^{9}+7.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n500000004\n750000006\n750000006\n\nThere are three possible orders in which Snuke eats the pieces:\n\nwhite, black, black\n\nblack, white, black\n\nblack, black, white\n\nwith probabilities \\frac{1}{2}, \\frac{1}{4}, \\frac{1}{4}, respectively. Thus, the probabilities of eating a black piece first, second and third are \\frac{1}{2},\\frac{3}{4} and \\frac{3}{4}, respectively.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n500000004\n500000004\n625000005\n187500002\n187500002\n\nThey are \\frac{1}{2},\\frac{1}{2},\\frac{5}{8},\\frac{11}{16} and \\frac{11}{16}, respectively.\n\nSample Input 3\n\n6 9\n\nSample Output 3\n\n500000004\n500000004\n500000004\n500000004\n500000004\n500000004\n929687507\n218750002\n224609377\n303710940\n633300786\n694091802\n172485353\n411682132\n411682132", "sample_input": "2 1\n"}, "reference_outputs": ["500000004\n750000006\n750000006\n"], "source_document_id": "p03083", "source_text": "Score : 700 points\n\nProblem Statement\n\nToday, Snuke will eat B pieces of black chocolate and W pieces of white chocolate for an afternoon snack.\n\nHe will repeat the following procedure until there is no piece left:\n\nChoose black or white with equal probability, and eat a piece of that color if it exists.\n\nFor each integer i from 1 to B+W (inclusive), find the probability that the color of the i-th piece to be eaten is black.\nIt can be shown that these probabilities are rational, and we ask you to print them modulo 10^9 + 7, as described in Notes.\n\nNotes\n\nWhen you print a rational number, first write it as a fraction \\frac{y}{x}, where x, y are integers and x is not divisible by 10^9 + 7\n(under the constraints of the problem, such representation is always possible).\nThen, you need to print the only integer z between 0 and 10^9 + 6, inclusive, that satisfies xz \\equiv y \\pmod{10^9 + 7}.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq B,W \\leq 10^{5}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nB W\n\nOutput\n\nPrint the answers in B+W lines. In the i-th line, print the probability that the color of the i-th piece to be eaten is black, modulo 10^{9}+7.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n500000004\n750000006\n750000006\n\nThere are three possible orders in which Snuke eats the pieces:\n\nwhite, black, black\n\nblack, white, black\n\nblack, black, white\n\nwith probabilities \\frac{1}{2}, \\frac{1}{4}, \\frac{1}{4}, respectively. Thus, the probabilities of eating a black piece first, second and third are \\frac{1}{2},\\frac{3}{4} and \\frac{3}{4}, respectively.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n500000004\n500000004\n625000005\n187500002\n187500002\n\nThey are \\frac{1}{2},\\frac{1}{2},\\frac{5}{8},\\frac{11}{16} and \\frac{11}{16}, respectively.\n\nSample Input 3\n\n6 9\n\nSample Output 3\n\n500000004\n500000004\n500000004\n500000004\n500000004\n500000004\n929687507\n218750002\n224609377\n303710940\n633300786\n694091802\n172485353\n411682132\n411682132", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1704, "cpu_time_ms": 94, "memory_kb": 6912}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s659460646", "group_id": "codeNet:p03085", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n character(1):: b\n\n read*, b\n if (b == 'A') then\n print'(a)', 'T'\n else if (b == 'G') then\n print'(a)', 'C'\n else if (b == 'T') then\n print'(a)', 'A'\n else\n print'(a)', 'G'\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1591371638, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/Fortran/s659460646.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s659460646", "user_id": "u234636620"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n character(1):: b\n\n read*, b\n if (b == 'A') then\n print'(a)', 'T'\n else if (b == 'G') then\n print'(a)', 'C'\n else if (b == 'T') then\n print'(a)', 'A'\n else\n print'(a)', 'G'\n end if\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s960853018", "group_id": "codeNet:p03085", "input_text": "program double_helix\n implicit none\n character(1) :: b\n read(*,*) b\n write(*,'(a)') achar(pair(ichar(b)-65)+65)\ncontains\n integer function pair(n)\n integer, intent(in) :: n\n pair = (228-12*n)/(11*n+12)\n end\nend program double_helix", "language": "Fortran", "metadata": {"date": 1590750030, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/Fortran/s960853018.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960853018", "user_id": "u506403362"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "program double_helix\n implicit none\n character(1) :: b\n read(*,*) b\n write(*,'(a)') achar(pair(ichar(b)-65)+65)\ncontains\n integer function pair(n)\n integer, intent(in) :: n\n pair = (228-12*n)/(11*n+12)\n end\nend program double_helix", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 243, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s675436964", "group_id": "codeNet:p03085", "input_text": "implicit none\n\ncharacter b\n\nread(5,*)b\n\nif(b==\"A\") then\nwrite(6,*) \"T\"\n\nelse if(b==\"T\") then\nwrite(6,*) \"A\"\n\nelse if(b==\"C\") then\nwrite(6,*) \"G\"\n\nelse\nwrite(6,*) \"C\"\n\nendif\n\n\n\n\nend", "language": "Fortran", "metadata": {"date": 1553459883, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/Fortran/s675436964.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s675436964", "user_id": "u093744128"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "implicit none\n\ncharacter b\n\nread(5,*)b\n\nif(b==\"A\") then\nwrite(6,*) \"T\"\n\nelse if(b==\"T\") then\nwrite(6,*) \"A\"\n\nelse if(b==\"C\") then\nwrite(6,*) \"G\"\n\nelse\nwrite(6,*) \"C\"\n\nendif\n\n\n\n\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s992330945", "group_id": "codeNet:p03086", "input_text": "program sample\n implicit none\n integer(8) ::a, b,c,i,j,m,n,k,a1,b1,c1\n \n character(len=10)::s\n character(len=1)::t\n read(*,*) s\n a=len_trim(s)\n b=0\n c=0\n do i=1,a\n t=s(i:i)\n if (t=='A' .or. t=='C' .or. t=='G' .or. t=='T') then\n b=b+1\n else\n if (b>c)then\n c=b\n end if\n b=0\n end if\n\n end do\n if (b>c)then\n c=b\n end if\n write(*,*)c\n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1592148962, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Fortran/s992330945.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992330945", "user_id": "u713568912"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program sample\n implicit none\n integer(8) ::a, b,c,i,j,m,n,k,a1,b1,c1\n \n character(len=10)::s\n character(len=1)::t\n read(*,*) s\n a=len_trim(s)\n b=0\n c=0\n do i=1,a\n t=s(i:i)\n if (t=='A' .or. t=='C' .or. t=='G' .or. t=='T') then\n b=b+1\n else\n if (b>c)then\n c=b\n end if\n b=0\n end if\n\n end do\n if (b>c)then\n c=b\n end if\n write(*,*)c\n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 497, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s600553318", "group_id": "codeNet:p03086", "input_text": "program ATCoder\nimplicit none\ncharacter*10::s\ninteger::i,l,count=0,ans=0\nread*,s\ns=trim(adjustl(s))\nl=len_trim(s)\n!print*,l\ndo i=1,l\n if(s(i:i)=='A'.or.s(i:i)=='T'.or.s(i:i)=='C'.or.s(i:i)=='G')then\n count=count+1\n ans=max(count,ans)\n else\n count=0\n end if\nend do\n\nprint*,ans\n!print*,s\n\nend program ATCoder", "language": "Fortran", "metadata": {"date": 1568040794, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Fortran/s600553318.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600553318", "user_id": "u129978636"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ATCoder\nimplicit none\ncharacter*10::s\ninteger::i,l,count=0,ans=0\nread*,s\ns=trim(adjustl(s))\nl=len_trim(s)\n!print*,l\ndo i=1,l\n if(s(i:i)=='A'.or.s(i:i)=='T'.or.s(i:i)=='C'.or.s(i:i)=='G')then\n count=count+1\n ans=max(count,ans)\n else\n count=0\n end if\nend do\n\nprint*,ans\n!print*,s\n\nend program ATCoder", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s954420996", "group_id": "codeNet:p03086", "input_text": "program ATCoder\nimplicit none\ncharacter*10::s\ninteger::i,l,count=0,ans=0\nread*,s\ns=trim(adjustl(s))\nl=len_trim(s)\n!print*,l\ndo i=1,l\n if(s(i:i)=='A'.or.s(i:i)=='T'.or.s(i:i)=='C'.or.s(i:i)=='G')then\n count=count+1\n else\n if(count>ans)then\n ans=count\n count=0\n else\n count=0\n end if\n end if\nend do\n\nprint*,ans\n!print*,s\n\nend program ATCoder", "language": "Fortran", "metadata": {"date": 1568040567, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Fortran/s954420996.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s954420996", "user_id": "u129978636"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ATCoder\nimplicit none\ncharacter*10::s\ninteger::i,l,count=0,ans=0\nread*,s\ns=trim(adjustl(s))\nl=len_trim(s)\n!print*,l\ndo i=1,l\n if(s(i:i)=='A'.or.s(i:i)=='T'.or.s(i:i)=='C'.or.s(i:i)=='G')then\n count=count+1\n else\n if(count>ans)then\n ans=count\n count=0\n else\n count=0\n end if\n end if\nend do\n\nprint*,ans\n!print*,s\n\nend program ATCoder", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 389, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s361512343", "group_id": "codeNet:p03086", "input_text": "PROGRAM ATCODER\n\nimplicit none\ncharacter(len=10) :: s\ninteger :: i,j\ninteger :: long(10)\n\nread(*,*) s\n\nlong = 0\ndo i = 1, 10\n do j = i,10\n if ( s(j:j) == 'A' .or. s(j:j) == 'T' .or. s(j:j) == 'G' .or. s(j:j) == 'C' ) then\n long(i) = long(i) + 1\n else\n exit\n end if \n end do\nend do\n\nwrite(*,'(i0)') maxval(long)\n\ncontains\n!!!!!! サブルーチンは↓\n!!!!!!\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1553458387, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03086.html", "problem_id": "p03086", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03086/input.txt", "sample_output_relpath": "derived/input_output/data/p03086/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03086/Fortran/s361512343.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s361512343", "user_id": "u454557108"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ncharacter(len=10) :: s\ninteger :: i,j\ninteger :: long(10)\n\nread(*,*) s\n\nlong = 0\ndo i = 1, 10\n do j = i,10\n if ( s(j:j) == 'A' .or. s(j:j) == 'T' .or. s(j:j) == 'G' .or. s(j:j) == 'C' ) then\n long(i) = long(i) + 1\n else\n exit\n end if \n end do\nend do\n\nwrite(*,'(i0)') maxval(long)\n\ncontains\n!!!!!! サブルーチンは↓\n!!!!!!\n\nEND PROGRAM ATCODER", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s276606390", "group_id": "codeNet:p03087", "input_text": "implicit none\ninteger :: n,q\ninteger :: l,r,i\nlogical, allocatable :: c(:)\ncharacter(100000) :: s\nread *,n,q\nread *,s\n\nallocate(c(N-1))\nc(:) = .False.\ni = 1\ndo while (i < N)\n if (s(i+1:i+1) == 'T' .or. s(i+1:i+1) == 'G') then\n i = i + 2\n cycle\n else if (s(i+1:i+1) == 'A') then\n i = i + 1\n cycle\n else if (s(i:i) == 'A') then\n c(i) = .True.\n endif\n i = i + 2\nenddo\n\ndo i = 1, q\n read *,l,r\n write(6,'(i0)') count(c(l:r-1))\nenddo\nend", "language": "Fortran", "metadata": {"date": 1565129703, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03087.html", "problem_id": "p03087", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03087/input.txt", "sample_output_relpath": "derived/input_output/data/p03087/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03087/Fortran/s276606390.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s276606390", "user_id": "u193540507"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "implicit none\ninteger :: n,q\ninteger :: l,r,i\nlogical, allocatable :: c(:)\ncharacter(100000) :: s\nread *,n,q\nread *,s\n\nallocate(c(N-1))\nc(:) = .False.\ni = 1\ndo while (i < N)\n if (s(i+1:i+1) == 'T' .or. s(i+1:i+1) == 'G') then\n i = i + 2\n cycle\n else if (s(i+1:i+1) == 'A') then\n i = i + 1\n cycle\n else if (s(i:i) == 'A') then\n c(i) = .True.\n endif\n i = i + 2\nenddo\n\ndo i = 1, q\n read *,l,r\n write(6,'(i0)') count(c(l:r-1))\nenddo\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "sample_input": "8 3\nACACTACG\n3 7\n2 3\n1 8\n"}, "reference_outputs": ["2\n0\n3\n"], "source_document_id": "p03087", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1444}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s902489351", "group_id": "codeNet:p03087", "input_text": "program main\ninteger(8)::n,q,i\ninteger(8),allocatable::a(:),l(:),r(:)\ncharacter(len=100000)::s\n\nread*,n,q\nallocate(a(n),r(q),l(q))\nread*,s\na=0\n\ndo i=1,q\nread*,l(i),r(i)\nenddo\n\ndo i=1,n\nif(s(i:i+1)==\"AC\") a(i+1)=1\nenddo\n\ndo i=1,q\nprint\"(i0)\",sum(a(l(i):r(i)))\nenddo\n\nend program main", "language": "Fortran", "metadata": {"date": 1554817316, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03087.html", "problem_id": "p03087", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03087/input.txt", "sample_output_relpath": "derived/input_output/data/p03087/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03087/Fortran/s902489351.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s902489351", "user_id": "u900266249"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "program main\ninteger(8)::n,q,i\ninteger(8),allocatable::a(:),l(:),r(:)\ncharacter(len=100000)::s\n\nread*,n,q\nallocate(a(n),r(q),l(q))\nread*,s\na=0\n\ndo i=1,q\nread*,l(i),r(i)\nenddo\n\ndo i=1,n\nif(s(i:i+1)==\"AC\") a(i+1)=1\nenddo\n\ndo i=1,q\nprint\"(i0)\",sum(a(l(i):r(i)))\nenddo\n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "sample_input": "8 3\nACACTACG\n3 7\n2 3\n1 8\n"}, "reference_outputs": ["2\n0\n3\n"], "source_document_id": "p03087", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 2107, "memory_kb": 3364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s917723898", "group_id": "codeNet:p03089", "input_text": "integer N\ninteger,allocatable,dimension(:)::b\ninteger,allocatable,dimension(:)::ans\nread*,N\nallocate(b(N),ans(N))\nread*,b\ndo i=N,1,-1\n do j=i,0,-1\n if(j==0)then\n print\"(i0)\",-1\n stop\n endif\n if(b(j)==j)then\n ans(i)=j\n b=[b(:j-1),b(j+1:)]\n exit\n endif\n end do\nend do\n\nprint\"(i0)\",ans\n\nend", "language": "Fortran", "metadata": {"date": 1562873776, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03089.html", "problem_id": "p03089", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03089/input.txt", "sample_output_relpath": "derived/input_output/data/p03089/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03089/Fortran/s917723898.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s917723898", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "integer N\ninteger,allocatable,dimension(:)::b\ninteger,allocatable,dimension(:)::ans\nread*,N\nallocate(b(N),ans(N))\nread*,b\ndo i=N,1,-1\n do j=i,0,-1\n if(j==0)then\n print\"(i0)\",-1\n stop\n endif\n if(b(j)==j)then\n ans(i)=j\n b=[b(:j-1),b(j+1:)]\n exit\n endif\n end do\nend do\n\nprint\"(i0)\",ans\n\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s478935307", "group_id": "codeNet:p03089", "input_text": "program main\ninteger :: N, i, j\ninteger,allocatable :: a(:), b(:), ans(:)\nread(*, *)N\nallocate(a(N))\nallocate(ans(N))\nread(*, *)a\n\ndo i = N, 1, -1\n do j = i, 1, -1\n if (a(j) == j)then\n ans(i) = j\n exit\n endif\n enddo\n if(j == 0)then\n write(*, '(i0)') -1\n stop\n endif\n b = [a(1:j - 1), a(j + 1: i)]\n a = b\nenddo\n\nwrite(*, '(*(i0, :, /))') ans\n\n\nend program main", "language": "Fortran", "metadata": {"date": 1555796114, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03089.html", "problem_id": "p03089", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03089/input.txt", "sample_output_relpath": "derived/input_output/data/p03089/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03089/Fortran/s478935307.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s478935307", "user_id": "u453801280"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "program main\ninteger :: N, i, j\ninteger,allocatable :: a(:), b(:), ans(:)\nread(*, *)N\nallocate(a(N))\nallocate(ans(N))\nread(*, *)a\n\ndo i = N, 1, -1\n do j = i, 1, -1\n if (a(j) == j)then\n ans(i) = j\n exit\n endif\n enddo\n if(j == 0)then\n write(*, '(i0)') -1\n stop\n endif\n b = [a(1:j - 1), a(j + 1: i)]\n a = b\nenddo\n\nwrite(*, '(*(i0, :, /))') ans\n\n\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 427, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s993767657", "group_id": "codeNet:p03091", "input_text": "module mod_weighted_graph\n implicit none\n integer(8), parameter :: long_infty = lshift(1_8, 62)\n integer, parameter :: int_infty = lshift(1, 30)\n\n type t_edge\n integer :: from = 0\n integer :: to = 0\n integer :: capacity = 0\n integer :: reverse = 0\n integer(8) :: weight = 0\n end type\n\n type t_list\n type(t_edge), allocatable :: at(:)\n end type\n\n type weighted_graph\n type(t_list), allocatable :: list(:)\n contains\n procedure :: dijkstra => dijkstra\n procedure :: ford_fulkerson => ford_fulkerson\n end type\n\n type t_node\n type(t_node), private, pointer :: left => null(), right => null()\n integer :: rank = 1\n integer :: number\n integer(8) :: cost\n end type\n\n type leftist_heap\n integer :: size = 0\n type(t_node), private, pointer :: root => null()\n end type\n\n interface weighted_graph\n module procedure :: newwg0\n end interface weighted_graph\n\ncontains\n \n type(t_edge) function newe0(from, to, weight, capacity, reverse) result(res)\n integer, intent(in) :: from, to\n integer(8), intent(in) :: weight\n integer, optional, intent(in) :: capacity, reverse\n res%from = from\n res%to = to\n res%weight = weight\n if (present(capacity)) res%capacity = capacity\n if (present(reverse)) res%reverse = reverse\n end\n\n type(weighted_graph) function newwg0(n, m, a, b, weight, capacity, undirected) result(res)\n integer, intent(in) :: n, m, a(:), b(:)\n integer(8), intent(in) :: weight(:)\n integer, optional, intent(in) :: capacity(:)\n logical, optional, intent(in) :: undirected\n logical :: u, cap\n integer :: c(n), i\n if (present(undirected)) then\n u = undirected\n else\n u = .true.\n end if\n cap = present(capacity)\n c = 0\n do i = 1, m\n c(a(i)) = c(a(i)) + 1\n if (cap) c(b(i)) = c(b(i)) + 1\n if (u) then\n c(b(i)) = c(b(i)) + 1\n if (cap) c(a(i)) = c(a(i)) + 1\n end if\n end do\n allocate(res%list(n))\n do i = 1, n\n allocate(res%list(i)%at(c(i)))\n end do\n do i = m, 1, -1\n if (cap) then\n res%list(a(i))%at(c(a(i))) = newe0(a(i), b(i), weight(i), capacity(i), c(b(i)))\n res%list(b(i))%at(c(b(i))) = newe0(b(i), a(i), weight(i), 0, c(a(i)))\n c(a(i)) = c(a(i)) - 1\n c(b(i)) = c(b(i)) - 1\n else\n res%list(a(i))%at(c(a(i))) = newe0(a(i), b(i), weight(i))\n c(a(i)) = c(a(i)) - 1\n end if\n if (u) then\n if (cap) then\n res%list(b(i))%at(c(b(i))) = newe0(b(i), a(i), weight(i), capacity(i), c(a(i)))\n res%list(a(i))%at(c(a(i))) = newe0(a(i), b(i), weight(i), 0, c(b(i)))\n c(a(i)) = c(a(i)) - 1\n c(b(i)) = c(b(i)) - 1\n else\n res%list(b(i))%at(c(b(i))) = newe0(b(i), a(i), weight(i))\n c(b(i)) = c(b(i)) - 1\n end if\n end if\n end do\n end\n\n logical function less(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n res = a%cost < b%cost\n end\n\n subroutine swap(a, b)\n type(t_node), pointer, intent(inout) :: a, b\n type(t_node), pointer :: c\n c => a\n a => b\n b => c\n end\n\n function newn0(number, cost) result(res)\n integer, intent(in) :: number\n integer(8), intent(in) :: cost\n type(t_node), pointer :: res\n res => null()\n allocate(res)\n res%number = number\n res%cost = cost\n end\n\n recursive function meld_node(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n type(t_node), pointer :: res\n logical :: f\n if (.not.associated(a)) then\n res => b; return\n end if\n if (.not.associated(b)) then\n res => a; return\n end if\n if (less(a, b)) then\n res => a\n res%right => meld_node(res%right, b)\n else\n res => b\n res%right => meld_node(res%right, a)\n end if\n f = .not.associated(res%left)\n if (.not.f) f = res%left%rank < res%right%rank\n if (f) call swap(res%left, res%right)\n res%rank = merge(res%right%rank, 0, associated(res%right)) + 1\n end\n\n function poll(this) result(res)\n class(leftist_heap), intent(inout) :: this\n type(t_node), pointer :: res\n res => this%root\n this%root => meld_node(this%root%left, this%root%right)\n this%size = this%size - 1\n end\n\n subroutine offer(this, number, cost)\n class(leftist_heap), intent(inout) :: this\n integer, intent(in) :: number\n integer(8), intent(in) :: cost\n this%root => meld_node(this%root, newn0(number, cost))\n this%size = this%size + 1\n end\n\n function dijkstra(this, start) result(res)\n class(weighted_graph), intent(in) :: this\n integer, intent(in) :: start\n integer :: number, i\n integer(8) :: res(size(this%list)), cost\n type(t_node), pointer :: node\n type(leftist_heap) :: pq\n type(t_edge) :: e\n res = long_infty\n res(start) = 0\n call offer(pq, start, res(start))\n do while (pq%size > 0)\n node => poll(pq)\n number = node%number\n cost = node%cost\n deallocate(node)\n if (cost > res(number)) cycle\n do i = 1, size(this%list(number)%at)\n e = this%list(number)%at(i)\n if (res(e%to) > res(number) + e%weight) then\n res(e%to) = res(number) + e%weight\n call offer(pq, e%to, res(e%to))\n end if\n end do\n end do\n end\n\n integer function ford_fulkerson(this, start, goal) result(res)\n class(weighted_graph), intent(inout) :: this\n integer, intent(in) :: start, goal\n integer :: dflow\n logical :: used(size(this%list))\n res = 0\n do\n used = .false.\n dflow = ffdfs(this, used, start, goal, int_infty)\n if (dflow == 0) return\n res = res + dflow\n end do\n end\n\n recursive integer function ffdfs(this, used, u, goal, dflow) result(res)\n class(weighted_graph), intent(inout) :: this\n logical, intent(inout) :: used(:)\n integer, intent(in) :: u, goal\n integer, intent(in) :: dflow\n integer :: i, v, capacity, r\n if (u == goal) then\n res = dflow\n return\n end if\n used(u) = .true.\n do i = 1, size(this%list(u)%at)\n v = this%list(u)%at(i)%to\n capacity = this%list(u)%at(i)%capacity\n if (used(v) .or. capacity <= 0) cycle\n res = ffdfs(this, used, v, goal, min(dflow, capacity))\n r = this%list(u)%at(i)%reverse\n if (res > 0) then\n this%list(u)%at(i)%capacity = this%list(u)%at(i)%capacity - res\n this%list(v)%at(r)%capacity = this%list(v)%at(r)%capacity + res\n return\n end if\n end do\n res = 0\n end\n\nend module mod_weighted_graph\nprogram three_circuits\n use mod_weighted_graph\n implicit none\n integer :: n, m, s = -1, t = -1, x, i\n integer, dimension(100000) :: a = 0, b = 0, c = 1\n type(weighted_graph) :: g\n read(*,*) n, m\n do i = 1, m\n read(*,*) a(i), b(i)\n end do\n g = weighted_graph(n, m, a, b, [(0_8, i=1, m)], c)\n do i = 1, n\n x = size(g%list(i)%at) / 2\n if (mod(x, 2) == 1) then\n write(*,'(a)') \"No\"; stop\n end if\n end do\n do i = 1, n\n x = size(g%list(i)%at) / 2\n if (x >= 6) then\n write(*,'(a)') \"Yes\"; stop\n end if\n if (x == 4) then\n if (s < 0) then\n s = i; cycle\n end if\n if (t < 0) then\n t = i; cycle\n end if\n write(*,'(a)') \"Yes\"; stop\n end if\n end do\n if (t < 0) then\n write(*,'(a)') \"No\"; stop\n end if\n write(*,'(a)') trim(merge(\"Yes\", \"No \", g%ford_fulkerson(s, t) == 2))\nend program three_circuits", "language": "Fortran", "metadata": {"date": 1592859328, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03091.html", "problem_id": "p03091", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03091/input.txt", "sample_output_relpath": "derived/input_output/data/p03091/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03091/Fortran/s993767657.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s993767657", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module mod_weighted_graph\n implicit none\n integer(8), parameter :: long_infty = lshift(1_8, 62)\n integer, parameter :: int_infty = lshift(1, 30)\n\n type t_edge\n integer :: from = 0\n integer :: to = 0\n integer :: capacity = 0\n integer :: reverse = 0\n integer(8) :: weight = 0\n end type\n\n type t_list\n type(t_edge), allocatable :: at(:)\n end type\n\n type weighted_graph\n type(t_list), allocatable :: list(:)\n contains\n procedure :: dijkstra => dijkstra\n procedure :: ford_fulkerson => ford_fulkerson\n end type\n\n type t_node\n type(t_node), private, pointer :: left => null(), right => null()\n integer :: rank = 1\n integer :: number\n integer(8) :: cost\n end type\n\n type leftist_heap\n integer :: size = 0\n type(t_node), private, pointer :: root => null()\n end type\n\n interface weighted_graph\n module procedure :: newwg0\n end interface weighted_graph\n\ncontains\n \n type(t_edge) function newe0(from, to, weight, capacity, reverse) result(res)\n integer, intent(in) :: from, to\n integer(8), intent(in) :: weight\n integer, optional, intent(in) :: capacity, reverse\n res%from = from\n res%to = to\n res%weight = weight\n if (present(capacity)) res%capacity = capacity\n if (present(reverse)) res%reverse = reverse\n end\n\n type(weighted_graph) function newwg0(n, m, a, b, weight, capacity, undirected) result(res)\n integer, intent(in) :: n, m, a(:), b(:)\n integer(8), intent(in) :: weight(:)\n integer, optional, intent(in) :: capacity(:)\n logical, optional, intent(in) :: undirected\n logical :: u, cap\n integer :: c(n), i\n if (present(undirected)) then\n u = undirected\n else\n u = .true.\n end if\n cap = present(capacity)\n c = 0\n do i = 1, m\n c(a(i)) = c(a(i)) + 1\n if (cap) c(b(i)) = c(b(i)) + 1\n if (u) then\n c(b(i)) = c(b(i)) + 1\n if (cap) c(a(i)) = c(a(i)) + 1\n end if\n end do\n allocate(res%list(n))\n do i = 1, n\n allocate(res%list(i)%at(c(i)))\n end do\n do i = m, 1, -1\n if (cap) then\n res%list(a(i))%at(c(a(i))) = newe0(a(i), b(i), weight(i), capacity(i), c(b(i)))\n res%list(b(i))%at(c(b(i))) = newe0(b(i), a(i), weight(i), 0, c(a(i)))\n c(a(i)) = c(a(i)) - 1\n c(b(i)) = c(b(i)) - 1\n else\n res%list(a(i))%at(c(a(i))) = newe0(a(i), b(i), weight(i))\n c(a(i)) = c(a(i)) - 1\n end if\n if (u) then\n if (cap) then\n res%list(b(i))%at(c(b(i))) = newe0(b(i), a(i), weight(i), capacity(i), c(a(i)))\n res%list(a(i))%at(c(a(i))) = newe0(a(i), b(i), weight(i), 0, c(b(i)))\n c(a(i)) = c(a(i)) - 1\n c(b(i)) = c(b(i)) - 1\n else\n res%list(b(i))%at(c(b(i))) = newe0(b(i), a(i), weight(i))\n c(b(i)) = c(b(i)) - 1\n end if\n end if\n end do\n end\n\n logical function less(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n res = a%cost < b%cost\n end\n\n subroutine swap(a, b)\n type(t_node), pointer, intent(inout) :: a, b\n type(t_node), pointer :: c\n c => a\n a => b\n b => c\n end\n\n function newn0(number, cost) result(res)\n integer, intent(in) :: number\n integer(8), intent(in) :: cost\n type(t_node), pointer :: res\n res => null()\n allocate(res)\n res%number = number\n res%cost = cost\n end\n\n recursive function meld_node(a, b) result(res)\n type(t_node), pointer, intent(in) :: a, b\n type(t_node), pointer :: res\n logical :: f\n if (.not.associated(a)) then\n res => b; return\n end if\n if (.not.associated(b)) then\n res => a; return\n end if\n if (less(a, b)) then\n res => a\n res%right => meld_node(res%right, b)\n else\n res => b\n res%right => meld_node(res%right, a)\n end if\n f = .not.associated(res%left)\n if (.not.f) f = res%left%rank < res%right%rank\n if (f) call swap(res%left, res%right)\n res%rank = merge(res%right%rank, 0, associated(res%right)) + 1\n end\n\n function poll(this) result(res)\n class(leftist_heap), intent(inout) :: this\n type(t_node), pointer :: res\n res => this%root\n this%root => meld_node(this%root%left, this%root%right)\n this%size = this%size - 1\n end\n\n subroutine offer(this, number, cost)\n class(leftist_heap), intent(inout) :: this\n integer, intent(in) :: number\n integer(8), intent(in) :: cost\n this%root => meld_node(this%root, newn0(number, cost))\n this%size = this%size + 1\n end\n\n function dijkstra(this, start) result(res)\n class(weighted_graph), intent(in) :: this\n integer, intent(in) :: start\n integer :: number, i\n integer(8) :: res(size(this%list)), cost\n type(t_node), pointer :: node\n type(leftist_heap) :: pq\n type(t_edge) :: e\n res = long_infty\n res(start) = 0\n call offer(pq, start, res(start))\n do while (pq%size > 0)\n node => poll(pq)\n number = node%number\n cost = node%cost\n deallocate(node)\n if (cost > res(number)) cycle\n do i = 1, size(this%list(number)%at)\n e = this%list(number)%at(i)\n if (res(e%to) > res(number) + e%weight) then\n res(e%to) = res(number) + e%weight\n call offer(pq, e%to, res(e%to))\n end if\n end do\n end do\n end\n\n integer function ford_fulkerson(this, start, goal) result(res)\n class(weighted_graph), intent(inout) :: this\n integer, intent(in) :: start, goal\n integer :: dflow\n logical :: used(size(this%list))\n res = 0\n do\n used = .false.\n dflow = ffdfs(this, used, start, goal, int_infty)\n if (dflow == 0) return\n res = res + dflow\n end do\n end\n\n recursive integer function ffdfs(this, used, u, goal, dflow) result(res)\n class(weighted_graph), intent(inout) :: this\n logical, intent(inout) :: used(:)\n integer, intent(in) :: u, goal\n integer, intent(in) :: dflow\n integer :: i, v, capacity, r\n if (u == goal) then\n res = dflow\n return\n end if\n used(u) = .true.\n do i = 1, size(this%list(u)%at)\n v = this%list(u)%at(i)%to\n capacity = this%list(u)%at(i)%capacity\n if (used(v) .or. capacity <= 0) cycle\n res = ffdfs(this, used, v, goal, min(dflow, capacity))\n r = this%list(u)%at(i)%reverse\n if (res > 0) then\n this%list(u)%at(i)%capacity = this%list(u)%at(i)%capacity - res\n this%list(v)%at(r)%capacity = this%list(v)%at(r)%capacity + res\n return\n end if\n end do\n res = 0\n end\n\nend module mod_weighted_graph\nprogram three_circuits\n use mod_weighted_graph\n implicit none\n integer :: n, m, s = -1, t = -1, x, i\n integer, dimension(100000) :: a = 0, b = 0, c = 1\n type(weighted_graph) :: g\n read(*,*) n, m\n do i = 1, m\n read(*,*) a(i), b(i)\n end do\n g = weighted_graph(n, m, a, b, [(0_8, i=1, m)], c)\n do i = 1, n\n x = size(g%list(i)%at) / 2\n if (mod(x, 2) == 1) then\n write(*,'(a)') \"No\"; stop\n end if\n end do\n do i = 1, n\n x = size(g%list(i)%at) / 2\n if (x >= 6) then\n write(*,'(a)') \"Yes\"; stop\n end if\n if (x == 4) then\n if (s < 0) then\n s = i; cycle\n end if\n if (t < 0) then\n t = i; cycle\n end if\n write(*,'(a)') \"Yes\"; stop\n end if\n end do\n if (t < 0) then\n write(*,'(a)') \"No\"; stop\n end if\n write(*,'(a)') trim(merge(\"Yes\", \"No \", g%ford_fulkerson(s, t) == 2))\nend program three_circuits", "problem_context": "Score : 800 points\n\nProblem Statement\n\nYou are given a simple connected undirected graph consisting of N vertices and M edges.\nThe vertices are numbered 1 to N, and the edges are numbered 1 to M.\n\nEdge i connects Vertex a_i and b_i bidirectionally.\n\nDetermine if three circuits (see Notes) can be formed using each of the edges exactly once.\n\nNotes\n\nA circuit is a cycle allowing repetitions of vertices but not edges.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N,M \\leq 10^{5}\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is simple and connected.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nIf three circuits can be formed using each of the edges exactly once, print Yes; if they cannot, print No.\n\nSample Input 1\n\n7 9\n1 2\n1 3\n2 3\n1 4\n1 5\n4 5\n1 6\n1 7\n6 7\n\nSample Output 1\n\nYes\n\nThree circuits can be formed using each of the edges exactly once, as follows:\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n\nSample Output 2\n\nNo\n\nThree circuits are needed.\n\nSample Input 3\n\n18 27\n17 7\n12 15\n18 17\n13 18\n13 6\n5 7\n7 1\n14 5\n15 11\n7 6\n1 9\n5 4\n18 16\n4 6\n7 2\n7 11\n6 3\n12 14\n5 2\n10 5\n7 8\n10 15\n3 15\n9 8\n7 15\n5 16\n18 15\n\nSample Output 3\n\nYes", "sample_input": "7 9\n1 2\n1 3\n2 3\n1 4\n1 5\n4 5\n1 6\n1 7\n6 7\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03091", "source_text": "Score : 800 points\n\nProblem Statement\n\nYou are given a simple connected undirected graph consisting of N vertices and M edges.\nThe vertices are numbered 1 to N, and the edges are numbered 1 to M.\n\nEdge i connects Vertex a_i and b_i bidirectionally.\n\nDetermine if three circuits (see Notes) can be formed using each of the edges exactly once.\n\nNotes\n\nA circuit is a cycle allowing repetitions of vertices but not edges.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N,M \\leq 10^{5}\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is simple and connected.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nIf three circuits can be formed using each of the edges exactly once, print Yes; if they cannot, print No.\n\nSample Input 1\n\n7 9\n1 2\n1 3\n2 3\n1 4\n1 5\n4 5\n1 6\n1 7\n6 7\n\nSample Output 1\n\nYes\n\nThree circuits can be formed using each of the edges exactly once, as follows:\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n\nSample Output 2\n\nNo\n\nThree circuits are needed.\n\nSample Input 3\n\n18 27\n17 7\n12 15\n18 17\n13 18\n13 6\n5 7\n7 1\n14 5\n15 11\n7 6\n1 9\n5 4\n18 16\n4 6\n7 2\n7 11\n6 3\n12 14\n5 2\n10 5\n7 8\n10 15\n3 15\n9 8\n7 15\n5 16\n18 15\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7363, "cpu_time_ms": 131, "memory_kb": 26384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s587347368", "group_id": "codeNet:p03095", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: i,j,n,cnt(ichar('a'):ichar('z')),ans\n integer(int64),parameter:: md=1000000007\n character(100000):: s\n \n read*, n\n read*, s\n cnt(:) = 1\n do i=1,n\n cnt(ichar(s(i:i)))=cnt(ichar(s(i:i)))+1\n end do\n\n ans = 1\n do i=ichar('a'),ichar('z')\n ans=mod(ans*cnt(i),md)\n end do\n print'(i0)', ans-1\nend program name", "language": "Fortran", "metadata": {"date": 1587680510, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Fortran/s587347368.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s587347368", "user_id": "u234636620"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: i,j,n,cnt(ichar('a'):ichar('z')),ans\n integer(int64),parameter:: md=1000000007\n character(100000):: s\n \n read*, n\n read*, s\n cnt(:) = 1\n do i=1,n\n cnt(ichar(s(i:i)))=cnt(ichar(s(i:i)))+1\n end do\n\n ans = 1\n do i=ichar('a'),ichar('z')\n ans=mod(ans*cnt(i),md)\n end do\n print'(i0)', ans-1\nend program name", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s266384663", "group_id": "codeNet:p03095", "input_text": "integer N\ncharacter(100000) S\ninteger CNT(26)\ninteger tmp\ninteger(16) ans\nread*,N\nread*,S\n\n!実に読みづらい名前になってしまった\n!各文字がどこにいられるかの場所\nCNT=1\ndo i=1,N\n tmp=ichar(S(i:i))-ichar(\"a\")+1\n CNT(tmp)=Cnt(tmp)+1\nend do\nans=1\ndo i=1,26\n ans=mod(ans*cnt(i),10**9+7)\nend do\nans=ans-1\nprint\"(i0)\",ans\nend", "language": "Fortran", "metadata": {"date": 1557329616, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03095.html", "problem_id": "p03095", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03095/input.txt", "sample_output_relpath": "derived/input_output/data/p03095/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03095/Fortran/s266384663.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s266384663", "user_id": "u598073939"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "integer N\ncharacter(100000) S\ninteger CNT(26)\ninteger tmp\ninteger(16) ans\nread*,N\nread*,S\n\n!実に読みづらい名前になってしまった\n!各文字がどこにいられるかの場所\nCNT=1\ndo i=1,N\n tmp=ichar(S(i:i))-ichar(\"a\")+1\n CNT(tmp)=Cnt(tmp)+1\nend do\nans=1\ndo i=1,26\n ans=mod(ans*cnt(i),10**9+7)\nend do\nans=ans-1\nprint\"(i0)\",ans\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 350, "cpu_time_ms": 5, "memory_kb": 956}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s491362650", "group_id": "codeNet:p03097", "input_text": "program test\nimplicit none\n\ninteger(8) :: n,a,b,count=0,hist = 0,nnn(200000)=0,i,j,gray(200000)=0,ii\n\n\nread(*,*) n,a,b\n\ndo i=0,49\n\tif(BTEST(a,i) .eqv. BTEST(b,i)) then\n\t\tcontinue\n\telse\n\t\thist = i\n\t\tcount = count + 1\n\tendif\nenddo\n\ndo i=0,2**n-1\n\tii = ishft(i,-1)\n\tgray(i+1) = ieor(i,ii)\nenddo\n\nif(count == 1)then\n\twrite(*,*) \"YES\"\n\t\n\tif(hist == n-1) then\n\t\tcontinue\n\telse\n\t\tdo i = 1, 2**n\n\t\t\tif(BTEST(gray(i),n-1) .eqv. BTEST(gray(i),hist) ) then\n\t\t\t\tcontinue\n\t\t\telse\n\t\t\t\tif(BTEST(gray(i),n-1)) then\n\t\t\t\t\tgray(i) = ibset(gray(i),hist)\n\t\t\t\t\tgray(i) = ibclr(gray(i),n-1)\n\t\t\t\telse\n\t\t\t\t\tgray(i) = ibset(gray(i),n-1)\n\t\t\t\t\tgray(i) = ibclr(gray(i),hist)\n\t\t\t\tendif\n\t\t\tendif\n\t\tenddo\n\tendif\n\t\n\tdo i =1,2**n\n\t\tnnn(i) = ieor(a,gray(i))\n\tenddo\n\t\n\twrite(*,*) nnn(1:2**n)/0\n\t\nelse\n\twrite(*,*) \"NO\"\nendif\n\ncontains\nsubroutine heapsort_down(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) > y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 > y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_down\n \nsubroutine heapsort_up(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) < y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 < y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_up\n \nend program\n", "language": "Fortran", "metadata": {"date": 1552775094, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03097.html", "problem_id": "p03097", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03097/input.txt", "sample_output_relpath": "derived/input_output/data/p03097/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03097/Fortran/s491362650.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s491362650", "user_id": "u454703763"}, "prompt_components": {"gold_output": "YES\n1 0 2 3\n", "input_to_evaluate": "program test\nimplicit none\n\ninteger(8) :: n,a,b,count=0,hist = 0,nnn(200000)=0,i,j,gray(200000)=0,ii\n\n\nread(*,*) n,a,b\n\ndo i=0,49\n\tif(BTEST(a,i) .eqv. BTEST(b,i)) then\n\t\tcontinue\n\telse\n\t\thist = i\n\t\tcount = count + 1\n\tendif\nenddo\n\ndo i=0,2**n-1\n\tii = ishft(i,-1)\n\tgray(i+1) = ieor(i,ii)\nenddo\n\nif(count == 1)then\n\twrite(*,*) \"YES\"\n\t\n\tif(hist == n-1) then\n\t\tcontinue\n\telse\n\t\tdo i = 1, 2**n\n\t\t\tif(BTEST(gray(i),n-1) .eqv. BTEST(gray(i),hist) ) then\n\t\t\t\tcontinue\n\t\t\telse\n\t\t\t\tif(BTEST(gray(i),n-1)) then\n\t\t\t\t\tgray(i) = ibset(gray(i),hist)\n\t\t\t\t\tgray(i) = ibclr(gray(i),n-1)\n\t\t\t\telse\n\t\t\t\t\tgray(i) = ibset(gray(i),n-1)\n\t\t\t\t\tgray(i) = ibclr(gray(i),hist)\n\t\t\t\tendif\n\t\t\tendif\n\t\tenddo\n\tendif\n\t\n\tdo i =1,2**n\n\t\tnnn(i) = ieor(a,gray(i))\n\tenddo\n\t\n\twrite(*,*) nnn(1:2**n)/0\n\t\nelse\n\twrite(*,*) \"NO\"\nendif\n\ncontains\nsubroutine heapsort_down(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) > y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 > y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_down\n \nsubroutine heapsort_up(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) < y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 < y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_up\n \nend program\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nYou are given integers N,\\ A and B.\nDetermine if there exists a permutation (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) of (0,\\ 1,\\ ...\\ 2^N-1) that satisfies all of the following conditions, and create one such permutation if it exists.\n\nP_0=A\n\nP_{2^N-1}=B\n\nFor all 0 \\leq i < 2^N-1, the binary representations of P_i and P_{i+1} differ by exactly one bit.\n\nConstraints\n\n1 \\leq N \\leq 17\n\n0 \\leq A \\leq 2^N-1\n\n0 \\leq B \\leq 2^N-1\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nIf there is no permutation that satisfies the conditions, print NO.\n\nIf there is such a permutation, print YES in the first line.\nThen, print (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) in the second line, with spaces in between.\nIf there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n2 1 3\n\nSample Output 1\n\nYES\n1 0 2 3\n\nThe binary representation of P=(1,0,2,3) is (01,00,10,11), where any two adjacent elements differ by exactly one bit.\n\nSample Input 2\n\n3 2 1\n\nSample Output 2\n\nNO", "sample_input": "2 1 3\n"}, "reference_outputs": ["YES\n1 0 2 3\n"], "source_document_id": "p03097", "source_text": "Score : 800 points\n\nProblem Statement\n\nYou are given integers N,\\ A and B.\nDetermine if there exists a permutation (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) of (0,\\ 1,\\ ...\\ 2^N-1) that satisfies all of the following conditions, and create one such permutation if it exists.\n\nP_0=A\n\nP_{2^N-1}=B\n\nFor all 0 \\leq i < 2^N-1, the binary representations of P_i and P_{i+1} differ by exactly one bit.\n\nConstraints\n\n1 \\leq N \\leq 17\n\n0 \\leq A \\leq 2^N-1\n\n0 \\leq B \\leq 2^N-1\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nIf there is no permutation that satisfies the conditions, print NO.\n\nIf there is such a permutation, print YES in the first line.\nThen, print (P_0,\\ P_1,\\ ...\\ P_{2^N-1}) in the second line, with spaces in between.\nIf there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n2 1 3\n\nSample Output 1\n\nYES\n1 0 2 3\n\nThe binary representation of P=(1,0,2,3) is (01,00,10,11), where any two adjacent elements differ by exactly one bit.\n\nSample Input 2\n\n3 2 1\n\nSample Output 2\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2414, "cpu_time_ms": 103, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s403411007", "group_id": "codeNet:p03098", "input_text": "program a_sequence_of_permutations\n implicit none\n integer :: n, k, i, loop\n integer :: p(100000), q(100000), p0(100000), q0(100000)\n p = 0\n q = 0\n read(*,*) n, k\n read(*,*) p(1:n)\n read(*,*) q(1:n)\n if (n.eq.1) then\n write(*,'(i0)') 1\n stop\n end if\n if (k.eq.1) then\n write(*,'(i0)',advance='no') p(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') p(i)\n end do\n write(*,*)\n stop\n else if (k.eq.2) then\n write(*,'(i0)',advance='no') q(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') q(i)\n end do\n write(*,*)\n stop\n end if\n p0 = p\n q0 = q\n loop = -1\n do i = 3, k\n call swap(n,p(1:n),q(1:n))\n if ((sum(abs(p(1:n)-p0(1:n))).eq.0).and.(sum(abs(q(1:n)-q0(1:n))).eq.0)) then\n loop = i-2\n exit\n end if\n end do\n if (loop.gt.0) then\n k = mod(k,loop) + 1\n if (k.eq.1) then\n write(*,'(i0)',advance='no') p(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') p(i)\n end do\n write(*,*)\n stop\n else if (k.eq.2) then\n write(*,'(i0)',advance='no') q(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') q(i)\n end do\n write(*,*)\n stop\n end if\n do i = 3, k\n call swap(n,p(1:n),q(1:n))\n end do\n end if\n write(*,'(i0)',advance='no') q(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') q(i)\n end do\n write(*,*)\n stop\ncontains\n subroutine swap(n,p,q)\n implicit none\n integer, intent(inout) :: n, p(n), q(n)\n integer :: r(n), i\n do i = 1, n\n r(p(i)) = q(i)\n end do\n p = q\n q = r\n return\n end subroutine swap\nend program a_sequence_of_permutations", "language": "Fortran", "metadata": {"date": 1552775904, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03098.html", "problem_id": "p03098", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03098/input.txt", "sample_output_relpath": "derived/input_output/data/p03098/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03098/Fortran/s403411007.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s403411007", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3 2 1\n", "input_to_evaluate": "program a_sequence_of_permutations\n implicit none\n integer :: n, k, i, loop\n integer :: p(100000), q(100000), p0(100000), q0(100000)\n p = 0\n q = 0\n read(*,*) n, k\n read(*,*) p(1:n)\n read(*,*) q(1:n)\n if (n.eq.1) then\n write(*,'(i0)') 1\n stop\n end if\n if (k.eq.1) then\n write(*,'(i0)',advance='no') p(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') p(i)\n end do\n write(*,*)\n stop\n else if (k.eq.2) then\n write(*,'(i0)',advance='no') q(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') q(i)\n end do\n write(*,*)\n stop\n end if\n p0 = p\n q0 = q\n loop = -1\n do i = 3, k\n call swap(n,p(1:n),q(1:n))\n if ((sum(abs(p(1:n)-p0(1:n))).eq.0).and.(sum(abs(q(1:n)-q0(1:n))).eq.0)) then\n loop = i-2\n exit\n end if\n end do\n if (loop.gt.0) then\n k = mod(k,loop) + 1\n if (k.eq.1) then\n write(*,'(i0)',advance='no') p(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') p(i)\n end do\n write(*,*)\n stop\n else if (k.eq.2) then\n write(*,'(i0)',advance='no') q(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') q(i)\n end do\n write(*,*)\n stop\n end if\n do i = 3, k\n call swap(n,p(1:n),q(1:n))\n end do\n end if\n write(*,'(i0)',advance='no') q(1)\n do i = 2, n\n write(*,'(x,i0)',advance='no') q(i)\n end do\n write(*,*)\n stop\ncontains\n subroutine swap(n,p,q)\n implicit none\n integer, intent(inout) :: n, p(n), q(n)\n integer :: r(n), i\n do i = 1, n\n r(p(i)) = q(i)\n end do\n p = q\n q = r\n return\n end subroutine swap\nend program a_sequence_of_permutations", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nFor two permutations p and q of the integers from 1 through N, let f(p,q) be the permutation that satisfies the following:\n\nThe p_i-th element (1 \\leq i \\leq N) in f(p,q) is q_i.\nHere, p_i and q_i respectively denote the i-th element in p and q.\n\nYou are given two permutations p and q of the integers from 1 through N.\nWe will now define a sequence {a_n} of permutations of the integers from 1 through N, as follows:\n\na_1=p, a_2=q\n\na_{n+2}=f(a_n,a_{n+1}) ( n \\geq 1 )\n\nGiven a positive integer K, find a_K.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\np and q are permutations of the integers from 1 through N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\nq_1 ... q_N\n\nOutput\n\nPrint N integers, with spaces in between.\nThe i-th integer (1 \\leq i \\leq N) should be the i-th element in a_K.\n\nSample Input 1\n\n3 3\n1 2 3\n3 2 1\n\nSample Output 1\n\n3 2 1\n\nSince a_3=f(p,q), we just need to find f(p,q).\nWe have p_i=i here, so f(p,q)=q.\n\nSample Input 2\n\n5 5\n4 5 1 2 3\n3 2 1 5 4\n\nSample Output 2\n\n4 3 2 1 5\n\nSample Input 3\n\n10 1000000000\n7 10 6 5 4 2 9 1 3 8\n4 1 9 2 3 7 8 10 6 5\n\nSample Output 3\n\n7 9 4 8 2 5 1 6 10 3", "sample_input": "3 3\n1 2 3\n3 2 1\n"}, "reference_outputs": ["3 2 1\n"], "source_document_id": "p03098", "source_text": "Score : 1000 points\n\nProblem Statement\n\nFor two permutations p and q of the integers from 1 through N, let f(p,q) be the permutation that satisfies the following:\n\nThe p_i-th element (1 \\leq i \\leq N) in f(p,q) is q_i.\nHere, p_i and q_i respectively denote the i-th element in p and q.\n\nYou are given two permutations p and q of the integers from 1 through N.\nWe will now define a sequence {a_n} of permutations of the integers from 1 through N, as follows:\n\na_1=p, a_2=q\n\na_{n+2}=f(a_n,a_{n+1}) ( n \\geq 1 )\n\nGiven a positive integer K, find a_K.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq 10^9\n\np and q are permutations of the integers from 1 through N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 ... p_N\nq_1 ... q_N\n\nOutput\n\nPrint N integers, with spaces in between.\nThe i-th integer (1 \\leq i \\leq N) should be the i-th element in a_K.\n\nSample Input 1\n\n3 3\n1 2 3\n3 2 1\n\nSample Output 1\n\n3 2 1\n\nSince a_3=f(p,q), we just need to find f(p,q).\nWe have p_i=i here, so f(p,q)=q.\n\nSample Input 2\n\n5 5\n4 5 1 2 3\n3 2 1 5 4\n\nSample Output 2\n\n4 3 2 1 5\n\nSample Input 3\n\n10 1000000000\n7 10 6 5 4 2 9 1 3 8\n4 1 9 2 3 7 8 10 6 5\n\nSample Output 3\n\n7 9 4 8 2 5 1 6 10 3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1621, "cpu_time_ms": 2103, "memory_kb": 2708}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s728995953", "group_id": "codeNet:p03101", "input_text": " program pro\n implicit none\n integer H, W, hh, ww\n integer ans\n\n read(*,*) H, W, hh, ww\n\n ans = (H-hh)*(W-ww)\n write(*,'(I0)') ans\n end", "language": "Fortran", "metadata": {"date": 1559909427, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03101.html", "problem_id": "p03101", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03101/input.txt", "sample_output_relpath": "derived/input_output/data/p03101/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03101/Fortran/s728995953.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728995953", "user_id": "u967843578"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": " program pro\n implicit none\n integer H, W, hh, ww\n integer ans\n\n read(*,*) H, W, hh, ww\n\n ans = (H-hh)*(W-ww)\n write(*,'(I0)') ans\n end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "sample_input": "3 2\n2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03101", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s915571929", "group_id": "codeNet:p03101", "input_text": "program main\nimplicit none\ninteger :: h0, i0, h, i\n\nread(*,*) h0, i0\nread(*,*) h, i\nwrite(*,'(i0)') h0*i0-( h*i0+i*h0-h*i )\n\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1555501969, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03101.html", "problem_id": "p03101", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03101/input.txt", "sample_output_relpath": "derived/input_output/data/p03101/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03101/Fortran/s915571929.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915571929", "user_id": "u696547932"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: h0, i0, h, i\n\nread(*,*) h0, i0\nread(*,*) h, i\nwrite(*,'(i0)') h0*i0-( h*i0+i*h0-h*i )\n\n\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "sample_input": "3 2\n2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03101", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s434423136", "group_id": "codeNet:p03101", "input_text": "integer a,b,c,d\nread*,a,b,c,d\nprint\"(I0)\",(a-c)*(b-d)\nend", "language": "Fortran", "metadata": {"date": 1552172945, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03101.html", "problem_id": "p03101", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03101/input.txt", "sample_output_relpath": "derived/input_output/data/p03101/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03101/Fortran/s434423136.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s434423136", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "integer a,b,c,d\nread*,a,b,c,d\nprint\"(I0)\",(a-c)*(b-d)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "sample_input": "3 2\n2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03101", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are H rows and W columns of white square cells.\n\nYou will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.\n\nHow many white cells will remain?\n\nIt can be proved that this count does not depend on what rows and columns are chosen.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 20\n\n1 \\leq h \\leq H\n\n1 \\leq w \\leq W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nh w\n\nOutput\n\nPrint the number of white cells that will remain.\n\nSample Input 1\n\n3 2\n2 1\n\nSample Output 1\n\n1\n\nThere are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.\n\nSample Input 2\n\n5 5\n2 3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n2 4\n2 4\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s939836886", "group_id": "codeNet:p03102", "input_text": "program main\n implicit none\n integer :: N,M\n integer,allocatable :: A(:,:)\n integer,allocatable :: B(:)\n integer,allocatable :: out(:)\n integer :: nans\n integer :: C\n integer :: i \n read(*,*) N,M,C\n allocate(B(M))\n allocate(A(N,M))\n read(*,*) B(:)\n do i = 1,N\n read(*,*) A(i,:)\n end do\n allocate(out(N))\n out=matmul(A,B)\n nans=0\n do i = 1,N\n if (out(i)+C > 0) nans = nans + 1\n end do\n write(*,'(i0)') nans\n stop\nend program main", "language": "Fortran", "metadata": {"date": 1552162149, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03102.html", "problem_id": "p03102", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03102/input.txt", "sample_output_relpath": "derived/input_output/data/p03102/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03102/Fortran/s939836886.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939836886", "user_id": "u886432251"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n integer :: N,M\n integer,allocatable :: A(:,:)\n integer,allocatable :: B(:)\n integer,allocatable :: out(:)\n integer :: nans\n integer :: C\n integer :: i \n read(*,*) N,M,C\n allocate(B(M))\n allocate(A(N,M))\n read(*,*) B(:)\n do i = 1,N\n read(*,*) A(i,:)\n end do\n allocate(out(N))\n out=matmul(A,B)\n nans=0\n do i = 1,N\n if (out(i)+C > 0) nans = nans + 1\n end do\n write(*,'(i0)') nans\n stop\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.\n\nAdditionally, you are given integers B_1, B_2, ..., B_M and C.\n\nThe i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.\n\nAmong the N codes, find the number of codes that correctly solve this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 20\n\n-100 \\leq A_{ij} \\leq 100\n\n-100 \\leq B_i \\leq 100\n\n-100 \\leq C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M C\nB_1 B_2 ... B_M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n\\vdots\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the number of codes among the given N codes that correctly solve this problem.\n\nSample Input 1\n\n2 3 -10\n1 2 3\n3 2 1\n1 2 2\n\nSample Output 1\n\n1\n\nOnly the second code correctly solves this problem, as follows:\n\nSince 3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0, the first code does not solve this problem.\n\n1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0, the second code solves this problem.\n\nSample Input 2\n\n5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100\n\nSample Output 3\n\n0\n\nAll of them are Wrong Answer. Except yours.", "sample_input": "2 3 -10\n1 2 3\n3 2 1\n1 2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03102", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.\n\nAdditionally, you are given integers B_1, B_2, ..., B_M and C.\n\nThe i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.\n\nAmong the N codes, find the number of codes that correctly solve this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 20\n\n-100 \\leq A_{ij} \\leq 100\n\n-100 \\leq B_i \\leq 100\n\n-100 \\leq C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M C\nB_1 B_2 ... B_M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n\\vdots\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the number of codes among the given N codes that correctly solve this problem.\n\nSample Input 1\n\n2 3 -10\n1 2 3\n3 2 1\n1 2 2\n\nSample Output 1\n\n1\n\nOnly the second code correctly solves this problem, as follows:\n\nSince 3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0, the first code does not solve this problem.\n\n1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0, the second code solves this problem.\n\nSample Input 2\n\n5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100\n\nSample Output 3\n\n0\n\nAll of them are Wrong Answer. Except yours.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 457, "cpu_time_ms": 6, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s128305591", "group_id": "codeNet:p03103", "input_text": "program answer\n implicit none\n integer(16) :: i, N, M, sum, count, last, aa\n integer(16), allocatable :: A(:), B(:)\n read(*,*) N, M\n allocate(A(N),B(N))\n do i = 1, N\n read(*,*) A(i), B(i)\n end do\n\n sum=0\n count=0\n do\n if(count>=M) then\n exit\n end if\n aa=dot_product(B(minloc(A)),B(minloc(A)))\n aa=int(sqrt(dble(aa)))\n sum=sum+minval(A)*aa\n count=count+aa\n last=minval(A)\n A(minloc(A))=1000000001\n end do\n\n if(count>M) then\n sum=sum-(count-M)*last\n end if\n\n write(*,*) sum\n deallocate(A,B)\n stop\n end program answer\n ", "language": "Fortran", "metadata": {"date": 1599249632, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/Fortran/s128305591.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s128305591", "user_id": "u873780029"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program answer\n implicit none\n integer(16) :: i, N, M, sum, count, last, aa\n integer(16), allocatable :: A(:), B(:)\n read(*,*) N, M\n allocate(A(N),B(N))\n do i = 1, N\n read(*,*) A(i), B(i)\n end do\n\n sum=0\n count=0\n do\n if(count>=M) then\n exit\n end if\n aa=dot_product(B(minloc(A)),B(minloc(A)))\n aa=int(sqrt(dble(aa)))\n sum=sum+minval(A)*aa\n count=count+aa\n last=minval(A)\n A(minloc(A))=1000000001\n end do\n\n if(count>M) then\n sum=sum-(count-M)*last\n end if\n\n write(*,*) sum\n deallocate(A,B)\n stop\n end program answer\n ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 5652}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s459678676", "group_id": "codeNet:p03103", "input_text": "program ccc\nimplicit none\n\ninteger(8) :: n, m, i, j, res\ninteger(8),allocatable,dimension(:) :: a, b\n\nread*, n, m\nallocate(a(n),b(n))\n\ndo i=1,n\nread*, a(i), b(i)\nend do\n\ncall heapsortkai(n,a,b)\n\nj=0\nres=0\ndo while(m>0)\nj=j+1\nm=m-b(j)\nres=res+a(j)*b(j)\nend do\n\nres=res-abs(m)*a(j)\n\nwrite(*,'(i0)') res\n\nend program\n\nsubroutine heapsortkai(n,array1,array2)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array1(1:n), array2(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t1, t2\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t1=array1(l)\n t2=array2(l)\n else\n t1=array1(k)\n t2=array2(k)\n array1(k)=array1(1)\n array2(k)=array2(1)\n k=k-1\n if(k.eq.1) then\n array1(1)=t1\n array2(1)=t2\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array1(j).lt.array1(j+1))j=j+1\n endif\n if (t1.lt.array1(j))then\n array1(i)=array1(j)\n array2(i)=array2(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array1(i)=t1\n array2(i)=t2\n enddo\n\n return\nend subroutine heapsortkai", "language": "Fortran", "metadata": {"date": 1570627176, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/Fortran/s459678676.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s459678676", "user_id": "u039189422"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program ccc\nimplicit none\n\ninteger(8) :: n, m, i, j, res\ninteger(8),allocatable,dimension(:) :: a, b\n\nread*, n, m\nallocate(a(n),b(n))\n\ndo i=1,n\nread*, a(i), b(i)\nend do\n\ncall heapsortkai(n,a,b)\n\nj=0\nres=0\ndo while(m>0)\nj=j+1\nm=m-b(j)\nres=res+a(j)*b(j)\nend do\n\nres=res-abs(m)*a(j)\n\nwrite(*,'(i0)') res\n\nend program\n\nsubroutine heapsortkai(n,array1,array2)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array1(1:n), array2(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t1, t2\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t1=array1(l)\n t2=array2(l)\n else\n t1=array1(k)\n t2=array2(k)\n array1(k)=array1(1)\n array2(k)=array2(1)\n k=k-1\n if(k.eq.1) then\n array1(1)=t1\n array2(1)=t2\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array1(j).lt.array1(j+1))j=j+1\n endif\n if (t1.lt.array1(j))then\n array1(i)=array1(j)\n array2(i)=array2(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array1(i)=t1\n array2(i)=t2\n enddo\n\n return\nend subroutine heapsortkai", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1324, "cpu_time_ms": 79, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s234393732", "group_id": "codeNet:p03103", "input_text": "program main\n\timplicit none\n integer :: n, m\n integer, allocatable :: a(:), b(:)\n integer :: i, j, tmp1, tmp2\n integer :: tenpo, kakaku, kosu, amari\n read(*, *) n, m\n allocate(a(n)); allocate(b(n))\n do i = 1, n\n \tread(*, *) a(i), b(i)\n enddo\n do i = 1, n\n \tdo j = i+1, n\n \tif (a(i).gt.a(j)) then\n \ttmp1 = a(i)\n a(i) = a(j)\n a(j) = tmp1\n tmp2 = b(i)\n b(i) = b(j)\n b(j) = tmp2\n end if\n\t\tenddo\n\tenddo\n kosu = 0\n tenpo = 0\n do i = 1, n\n\t\tkosu = kosu + b(i)\n tenpo = tenpo + 1\n if (kosu.ge.m) then\n \tamari = kosu - m\n exit\n end if\n enddo\n do i = 1, tenpo-1\n \tkakaku = kakaku + a(i)*b(i)\n enddo\n kakaku = kakaku + a(tenpo)*(b(tenpo)-amari)\n write(*, *) kakaku\nstop\nend program main", "language": "Fortran", "metadata": {"date": 1560259655, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/Fortran/s234393732.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s234393732", "user_id": "u337929351"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program main\n\timplicit none\n integer :: n, m\n integer, allocatable :: a(:), b(:)\n integer :: i, j, tmp1, tmp2\n integer :: tenpo, kakaku, kosu, amari\n read(*, *) n, m\n allocate(a(n)); allocate(b(n))\n do i = 1, n\n \tread(*, *) a(i), b(i)\n enddo\n do i = 1, n\n \tdo j = i+1, n\n \tif (a(i).gt.a(j)) then\n \ttmp1 = a(i)\n a(i) = a(j)\n a(j) = tmp1\n tmp2 = b(i)\n b(i) = b(j)\n b(j) = tmp2\n end if\n\t\tenddo\n\tenddo\n kosu = 0\n tenpo = 0\n do i = 1, n\n\t\tkosu = kosu + b(i)\n tenpo = tenpo + 1\n if (kosu.ge.m) then\n \tamari = kosu - m\n exit\n end if\n enddo\n do i = 1, tenpo-1\n \tkakaku = kakaku + a(i)*b(i)\n enddo\n kakaku = kakaku + a(tenpo)*(b(tenpo)-amari)\n write(*, *) kakaku\nstop\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 878, "cpu_time_ms": 2103, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s052587313", "group_id": "codeNet:p03103", "input_text": "program main\nimplicit None\n\tinteger(8)::n,m,i,p=0,q=0\n\tinteger(8),allocatable::a(:),b(:)\n\t\n\tread*,n,m\n\tallocate(a(n),b(n))\n\t\n\tdo i =1,n\n\t\tread*,a(i),b(i)\n\tenddo\n\t\n\tcall h2(a,b,n)\n\t\n\tdo i =1,n\n\t\tif(m-q <= b(i))then\n\t\t\tp = p + a(i)*(m-q)\n\t\t\texit\n\t\tendif\n\t\tq = q+b(i)\n\t\tp = p+a(i)*b(i)\n\tenddo\n\t\n\tprint\"(i0)\",p\nend program main\n\nsubroutine h2(a,b,n)\nimplicit None\n\tinteger(8)::a(n),b(n),x,y\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);y = b(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie);y = b(ie)\n\t\ta(ie) = a(1);b(ie) = b(1)\n\t\ta(1) = x;b(1) = y\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2", "language": "Fortran", "metadata": {"date": 1554839816, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03103/input.txt", "sample_output_relpath": "derived/input_output/data/p03103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03103/Fortran/s052587313.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052587313", "user_id": "u900266249"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,m,i,p=0,q=0\n\tinteger(8),allocatable::a(:),b(:)\n\t\n\tread*,n,m\n\tallocate(a(n),b(n))\n\t\n\tdo i =1,n\n\t\tread*,a(i),b(i)\n\tenddo\n\t\n\tcall h2(a,b,n)\n\t\n\tdo i =1,n\n\t\tif(m-q <= b(i))then\n\t\t\tp = p + a(i)*(m-q)\n\t\t\texit\n\t\tendif\n\t\tq = q+b(i)\n\t\tp = p+a(i)*b(i)\n\tenddo\n\t\n\tprint\"(i0)\",p\nend program main\n\nsubroutine h2(a,b,n)\nimplicit None\n\tinteger(8)::a(n),b(n),x,y\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);y = b(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie);y = b(ie)\n\t\ta(ie) = a(1);b(ie) = b(1)\n\t\ta(1) = x;b(1) = y\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "2 5\n4 9\n2 4\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03103", "source_text": "Score : 300 points\n\nProblem Statement\n\nHearing that energy drinks increase rating in those sites, Takahashi decides to buy up M cans of energy drinks.\n\nThere are N stores that sell energy drinks. In the i-th store, he can buy at most B_i cans of energy drinks for A_i yen (the currency of Japan) each.\n\nWhat is the minimum amount of money with which he can buy M cans of energy drinks?\n\nIt is guaranteed that, in the given inputs, a sufficient amount of money can always buy M cans of energy drinks.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^5\n\nB_1 + ... + B_N \\geq M\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the minimum amount of money with which Takahashi can buy M cans of energy drinks.\n\nSample Input 1\n\n2 5\n4 9\n2 4\n\nSample Output 1\n\n12\n\nWith 12 yen, we can buy one drink at the first store and four drinks at the second store, for the total of five drinks. However, we cannot buy 5 drinks with 11 yen or less.\n\nSample Input 2\n\n4 30\n6 18\n2 5\n3 10\n7 9\n\nSample Output 2\n\n130\n\nSample Input 3\n\n1 100000\n1000000000 100000\n\nSample Output 3\n\n100000000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1040, "cpu_time_ms": 79, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s184517403", "group_id": "codeNet:p03106", "input_text": "program k_th_common_divisor\n implicit none\n integer :: a, b, k, i, m = 0\n read(*,*) a, b, k\n do i = 100, 1, -1\n if (mod(a,i) == 0 .and. mod(b,i) == 0) m = m+1\n if (m == k) then\n write(*,'(i0)') i\n stop\n end if\n end do\nend program k_th_common_divisor", "language": "Fortran", "metadata": {"date": 1590751802, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/Fortran/s184517403.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s184517403", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program k_th_common_divisor\n implicit none\n integer :: a, b, k, i, m = 0\n read(*,*) a, b, k\n do i = 100, 1, -1\n if (mod(a,i) == 0 .and. mod(b,i) == 0) m = m+1\n if (m == k) then\n write(*,'(i0)') i\n stop\n end if\n end do\nend program k_th_common_divisor", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s789973608", "group_id": "codeNet:p03106", "input_text": "program main\n implicit none\n\n integer A,B,K,i,count\n count = 0\n\n read(*,*) A,B,K\n\n do i = max(A,B),1\n if (mod(A,i)==0 .and. mod(B,i)==0)then\n count = count + 1\n if (count == K) then\n write(*,\"(I0)\") i\n exit \n end if\n end if\n enddo\n\nend program main", "language": "Fortran", "metadata": {"date": 1551644355, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/Fortran/s789973608.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s789973608", "user_id": "u528124741"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n\n integer A,B,K,i,count\n count = 0\n\n read(*,*) A,B,K\n\n do i = max(A,B),1\n if (mod(A,i)==0 .and. mod(B,i)==0)then\n count = count + 1\n if (count == K) then\n write(*,\"(I0)\") i\n exit \n end if\n end if\n enddo\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s049933124", "group_id": "codeNet:p03106", "input_text": "program main\n implicit none\n\n integer A,B,K,i,count\n count = 0\n\n read(*,*) A,B,K\n\n do i = 1, max(A,B)\n if (mod(A,i)==0 .and. mod(B,i)==0)then\n count = count + 1\n if (count == K) then\n write(*,\"(I0)\") i\n exit \n end if\n end if\n enddo\n\nend program main", "language": "Fortran", "metadata": {"date": 1551644260, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/Fortran/s049933124.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s049933124", "user_id": "u528124741"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n\n integer A,B,K,i,count\n count = 0\n\n read(*,*) A,B,K\n\n do i = 1, max(A,B)\n if (mod(A,i)==0 .and. mod(B,i)==0)then\n count = count + 1\n if (count == K) then\n write(*,\"(I0)\") i\n exit \n end if\n end if\n enddo\n\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s339468783", "group_id": "codeNet:p03106", "input_text": "program main\n implicit none\n integer(8)::a,b,k,cou=0\n integer(8)::i,j\n \n ! integer,allocatable,dimension(:)::c\n read(*,*)a,b,k\n do i=min(a,b),1,-1\n \n if(mod(a,i)==0 .and. mod(b,i)==0)then\n cou=cou+1\n if(cou==k)exit\n endif\n enddo\n write(*,*)i\nend program main\n", "language": "Fortran", "metadata": {"date": 1551643530, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/Fortran/s339468783.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339468783", "user_id": "u539011156"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer(8)::a,b,k,cou=0\n integer(8)::i,j\n \n ! integer,allocatable,dimension(:)::c\n read(*,*)a,b,k\n do i=min(a,b),1,-1\n \n if(mod(a,i)==0 .and. mod(b,i)==0)then\n cou=cou+1\n if(cou==k)exit\n endif\n enddo\n write(*,*)i\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s250384269", "group_id": "codeNet:p03107", "input_text": "program ccc\nimplicit none\n\ncharacter(10**5+1) :: s\ninteger :: l, zero, one, i\n\nread*, s\nl=len_trim(s)\n\nzero=0\none=0\ndo i=1,l\nif(s(i:i)=='0') then\nzero=zero+1\nelse\none=one+1\nend if\nend do\n\nwrite(*,'(i0)') min(zero,one)*2\n\nend program", "language": "Fortran", "metadata": {"date": 1570632878, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03107/input.txt", "sample_output_relpath": "derived/input_output/data/p03107/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03107/Fortran/s250384269.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250384269", "user_id": "u039189422"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program ccc\nimplicit none\n\ncharacter(10**5+1) :: s\ninteger :: l, zero, one, i\n\nread*, s\nl=len_trim(s)\n\nzero=0\none=0\ndo i=1,l\nif(s(i:i)=='0') then\nzero=zero+1\nelse\none=one+1\nend if\nend do\n\nwrite(*,'(i0)') min(zero,one)*2\n\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 232, "cpu_time_ms": 3, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s706807383", "group_id": "codeNet:p03107", "input_text": "program main\n implicit none\n integer :: n, i, m\n character(100000) :: s\n read (*, *) s\n n = len(trim(s))\n m = 0\n do i = 1, n\n if (s(i:i) == \"0\") m = m + 1\n end do\n\n write(*, \"(i0)\") min(m, n - m) * 2\nend program main\n", "language": "Fortran", "metadata": {"date": 1553143313, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03107/input.txt", "sample_output_relpath": "derived/input_output/data/p03107/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03107/Fortran/s706807383.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706807383", "user_id": "u388927326"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, m\n character(100000) :: s\n read (*, *) s\n n = len(trim(s))\n m = 0\n do i = 1, n\n if (s(i:i) == \"0\") m = m + 1\n end do\n\n write(*, \"(i0)\") min(m, n - m) * 2\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 828}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s784709164", "group_id": "codeNet:p03108", "input_text": "! https://beta.atcoder.jp/contests/abc097/submissions/3768108\n\nmodule UnionFind\n implicit none\n public\n type :: Union_Find\n integer(8),allocatable,dimension(:) :: par,g\n end type Union_Find\n contains\n subroutine init(p,n)\n implicit none\n type(Union_Find) p\n integer(8) n,i\n allocate( p%par(n) )\n allocate( p%g(n) )\n do i=1,n\n p%par(i) = i\n p%g(i) = 1\n enddo\n end subroutine init\n recursive function root(p,n) result(ret)\n implicit none\n type(Union_Find) p\n integer(8) ret,n\n if(p%par(n)==n)then\n ret = n\n return\n else\n p%par(n) = root(p,p%par(n))\n ret = p%par(n)\n return\n endif\n end\n function gsize(p,x) result(a)\n implicit none\n integer(8) x,a\n type(Union_Find) p\n a = p%g(root(p,x))\n end\n subroutine unite(p,a,b)\n implicit none\n type(Union_Find) p\n integer(8) a,b\n a = root(p,a)\n b = root(p,b)\n if(a/=b)then\n p%par(a) = b\n p%g(b) = p%g(b) + p%g(a)\n p%g(a) = 0\n endif\n end\nend module UnionFind\n\nprogram atcoder_abc97d\n use UnionFind\n implicit none\n type(Union_Find) uf\n integer(8) n,m,i\n integer(8) ans,x,y\n integer(8),allocatable,dimension(:) :: a,b\n integer(8),allocatable,dimension(:) :: c\n read*,n,m\n allocate( a(m) , b(m) , c(m) )\n call init(uf,n+1)\n do i = 1,m\n read*,a(i),b(i)\n enddo\n ans = (n-1)*n/2\n do i=m,1,-1\n c(i) = ans\n x = gsize(uf,a(i))\n y = gsize(uf,b(i))\n if(root(uf,a(i)) /= root(uf,b(i)))then\n ans = ans - x*y\n endif\n call unite(uf,a(i),b(i))\n enddo\n do i=1,M\n write(*,'(I0)')c(i)\n enddo\n!----------------------functions--------------------------\ncontains\nend program atcoder_abc97d", "language": "Fortran", "metadata": {"date": 1551649372, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03108.html", "problem_id": "p03108", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03108/input.txt", "sample_output_relpath": "derived/input_output/data/p03108/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03108/Fortran/s784709164.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784709164", "user_id": "u780122303"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "! https://beta.atcoder.jp/contests/abc097/submissions/3768108\n\nmodule UnionFind\n implicit none\n public\n type :: Union_Find\n integer(8),allocatable,dimension(:) :: par,g\n end type Union_Find\n contains\n subroutine init(p,n)\n implicit none\n type(Union_Find) p\n integer(8) n,i\n allocate( p%par(n) )\n allocate( p%g(n) )\n do i=1,n\n p%par(i) = i\n p%g(i) = 1\n enddo\n end subroutine init\n recursive function root(p,n) result(ret)\n implicit none\n type(Union_Find) p\n integer(8) ret,n\n if(p%par(n)==n)then\n ret = n\n return\n else\n p%par(n) = root(p,p%par(n))\n ret = p%par(n)\n return\n endif\n end\n function gsize(p,x) result(a)\n implicit none\n integer(8) x,a\n type(Union_Find) p\n a = p%g(root(p,x))\n end\n subroutine unite(p,a,b)\n implicit none\n type(Union_Find) p\n integer(8) a,b\n a = root(p,a)\n b = root(p,b)\n if(a/=b)then\n p%par(a) = b\n p%g(b) = p%g(b) + p%g(a)\n p%g(a) = 0\n endif\n end\nend module UnionFind\n\nprogram atcoder_abc97d\n use UnionFind\n implicit none\n type(Union_Find) uf\n integer(8) n,m,i\n integer(8) ans,x,y\n integer(8),allocatable,dimension(:) :: a,b\n integer(8),allocatable,dimension(:) :: c\n read*,n,m\n allocate( a(m) , b(m) , c(m) )\n call init(uf,n+1)\n do i = 1,m\n read*,a(i),b(i)\n enddo\n ans = (n-1)*n/2\n do i=m,1,-1\n c(i) = ans\n x = gsize(uf,a(i))\n y = gsize(uf,b(i))\n if(root(uf,a(i)) /= root(uf,b(i)))then\n ans = ans - x*y\n endif\n call unite(uf,a(i),b(i))\n enddo\n do i=1,M\n write(*,'(I0)')c(i)\n enddo\n!----------------------functions--------------------------\ncontains\nend program atcoder_abc97d", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2126, "cpu_time_ms": 119, "memory_kb": 5248}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s583520766", "group_id": "codeNet:p03109", "input_text": "Program ABC119A\n\ninteger y,m,d\ncharacter(1) a,b\n\nread'(i4,a1,i2,a1,i2)', y,a,m,b,d\n\nif(m<=4) then\n write(*,*) 'Heisei'\nelse\n write(*,*) 'TBD'\nend if\n\nstop\nend", "language": "Fortran", "metadata": {"date": 1551266198, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Fortran/s583520766.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583520766", "user_id": "u538260936"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "Program ABC119A\n\ninteger y,m,d\ncharacter(1) a,b\n\nread'(i4,a1,i2,a1,i2)', y,a,m,b,d\n\nif(m<=4) then\n write(*,*) 'Heisei'\nelse\n write(*,*) 'TBD'\nend if\n\nstop\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s332317687", "group_id": "codeNet:p03109", "input_text": "module ABC119\n\n\t! s to import\n\tuse, intrinsic :: iso_fortran_env\n\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\n\t! accessibility of s and s in this \n\tpublic :: ABC119_A\n\n\n\t! constants for this \n\tcharacter(len=6, kind=1), parameter, private :: word_before = 'Heisei'\n\tcharacter(len=3, kind=1), parameter, private :: word_after = 'TBD'\n\n\tinteger( kind=INT8 ), parameter, private :: day_border = 30\n\tinteger( kind=INT8 ), parameter, private :: month_border = 4\n\n\n\t! contained s and s are below\n\tcontains\n\n\n\tsubroutine ABC119_A\n\n\t\t! variables for this \n\t\tcharacter(len=10, kind=1) :: buffer\n\t\tinteger( kind=INT8 ) :: month\n\n\t\t! STEP.01\n\t\t! read out the the date\n\t\tread( unit=INPUT_UNIT, fmt='(A)' ) buffer\n\n\t\t! STEP.02\n\t\t! convert the day and month to integer\n\t\tread( unit=buffer(6:7), fmt=* ) month\n\n\t\t! STEP.02\n\t\t! judge the read date\n\t\tif( month .le. month_border ) then\n\t\t\twrite( unit=OUTPUT_UNIT, fmt='(A)', advance='yes' ) word_before\n\t\telse\n\t\t\twrite( unit=OUTPUT_UNIT, fmt='(A)', advance='yes' ) word_after\n\t\tend if\n\n\t\t! STEP.END\n\t\treturn\n\n\tend subroutine ABC119_A\n\nend module ABC119\n\n\nprogram main\n\n\t! s to import\n\tuse, non_intrinsic :: ABC119\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\tcall ABC119_A\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1551109853, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03109.html", "problem_id": "p03109", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03109/input.txt", "sample_output_relpath": "derived/input_output/data/p03109/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03109/Fortran/s332317687.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s332317687", "user_id": "u484703930"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "module ABC119\n\n\t! s to import\n\tuse, intrinsic :: iso_fortran_env\n\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\n\t! accessibility of s and s in this \n\tpublic :: ABC119_A\n\n\n\t! constants for this \n\tcharacter(len=6, kind=1), parameter, private :: word_before = 'Heisei'\n\tcharacter(len=3, kind=1), parameter, private :: word_after = 'TBD'\n\n\tinteger( kind=INT8 ), parameter, private :: day_border = 30\n\tinteger( kind=INT8 ), parameter, private :: month_border = 4\n\n\n\t! contained s and s are below\n\tcontains\n\n\n\tsubroutine ABC119_A\n\n\t\t! variables for this \n\t\tcharacter(len=10, kind=1) :: buffer\n\t\tinteger( kind=INT8 ) :: month\n\n\t\t! STEP.01\n\t\t! read out the the date\n\t\tread( unit=INPUT_UNIT, fmt='(A)' ) buffer\n\n\t\t! STEP.02\n\t\t! convert the day and month to integer\n\t\tread( unit=buffer(6:7), fmt=* ) month\n\n\t\t! STEP.02\n\t\t! judge the read date\n\t\tif( month .le. month_border ) then\n\t\t\twrite( unit=OUTPUT_UNIT, fmt='(A)', advance='yes' ) word_before\n\t\telse\n\t\t\twrite( unit=OUTPUT_UNIT, fmt='(A)', advance='yes' ) word_after\n\t\tend if\n\n\t\t! STEP.END\n\t\treturn\n\n\tend subroutine ABC119_A\n\nend module ABC119\n\n\nprogram main\n\n\t! s to import\n\tuse, non_intrinsic :: ABC119\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\tcall ABC119_A\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1369, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s744142386", "group_id": "codeNet:p03110", "input_text": "program digital_gifts\n implicit none\n integer :: n, i, j = 0\n character(1) :: u\n real(8) :: x, b = 0.d0\n character(64) :: s\n read(*,*) n\n do i = 1, n\n read(*,*) x, u\n if (u == \"J\") then\n j = j+nint(x)\n else\n b = b+x\n end if\n end do\n write(s,'(f32.16)') 380000.d0*b+j\n write(*,'(a)') trim(adjustl(s))\nend program digital_gifts", "language": "Fortran", "metadata": {"date": 1590754798, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Fortran/s744142386.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s744142386", "user_id": "u506403362"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "program digital_gifts\n implicit none\n integer :: n, i, j = 0\n character(1) :: u\n real(8) :: x, b = 0.d0\n character(64) :: s\n read(*,*) n\n do i = 1, n\n read(*,*) x, u\n if (u == \"J\") then\n j = j+nint(x)\n else\n b = b+x\n end if\n end do\n write(s,'(f32.16)') 380000.d0*b+j\n write(*,'(a)') trim(adjustl(s))\nend program digital_gifts", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s537811939", "group_id": "codeNet:p03110", "input_text": "program main\nimplicit none\ninteger :: i, j, n\nreal(8) :: nc_jpy, nc_btc\ncharacter(len=3) , allocatable :: cmoney(:)\nreal(8) , allocatable :: x(:)\nreal(8) :: y\nreal(8), parameter :: btc_jpy = 380000.\n\nread(*,*) n\nallocate(x(n))\nallocate(cmoney(n))\nnc_jpy = 0\nnc_btc = 0\ndo i = 1, n\n read(*,*) x(i), cmoney(i)\n if (cmoney(i) == 'JPY') then\n nc_jpy = nc_jpy + x(i)\n else\n nc_btc = nc_btc + x(i)\n end if\nend do\n\ny = btc_jpy * nc_btc + nc_jpy\nwrite(*,*) y\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1551040467, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Fortran/s537811939.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s537811939", "user_id": "u696547932"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, n\nreal(8) :: nc_jpy, nc_btc\ncharacter(len=3) , allocatable :: cmoney(:)\nreal(8) , allocatable :: x(:)\nreal(8) :: y\nreal(8), parameter :: btc_jpy = 380000.\n\nread(*,*) n\nallocate(x(n))\nallocate(cmoney(n))\nnc_jpy = 0\nnc_btc = 0\ndo i = 1, n\n read(*,*) x(i), cmoney(i)\n if (cmoney(i) == 'JPY') then\n nc_jpy = nc_jpy + x(i)\n else\n nc_btc = nc_btc + x(i)\n end if\nend do\n\ny = btc_jpy * nc_btc + nc_jpy\nwrite(*,*) y\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 487, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s666234393", "group_id": "codeNet:p03110", "input_text": "PROGRAM ATCODER\n\nimplicit none\ndouble precision :: sum, b\ndouble precision,allocatable :: x(:)\ncharacter(len=3),allocatable :: u(:)\ninteger :: n, i\n\nb = 380000.d0\n\nread(*,*) n\nallocate(x(n), u(n))\n\ndo i = 1, n\n\tread(*,*) x(i), u(i)\nend do\n\nsum = 0.d0\n\ndo i = 1, n\n\tif(u(i) == 'BTC') then\n \tx(i) = x(i)*b\n end if\n sum = sum + x(i)\nend do\n\nif (sum == 0.d0) then\n\twrite(*,'(a)') '0.00000'\n\tstop\nend if\n\nwrite(*,'(f0.5)') sum\n\nEND PROGRAM ATCODER\n", "language": "Fortran", "metadata": {"date": 1551040305, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Fortran/s666234393.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666234393", "user_id": "u454557108"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ndouble precision :: sum, b\ndouble precision,allocatable :: x(:)\ncharacter(len=3),allocatable :: u(:)\ninteger :: n, i\n\nb = 380000.d0\n\nread(*,*) n\nallocate(x(n), u(n))\n\ndo i = 1, n\n\tread(*,*) x(i), u(i)\nend do\n\nsum = 0.d0\n\ndo i = 1, n\n\tif(u(i) == 'BTC') then\n \tx(i) = x(i)*b\n end if\n sum = sum + x(i)\nend do\n\nif (sum == 0.d0) then\n\twrite(*,'(a)') '0.00000'\n\tstop\nend if\n\nwrite(*,'(f0.5)') sum\n\nEND PROGRAM ATCODER\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 452, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s403608984", "group_id": "codeNet:p03110", "input_text": "PROGRAM ATCODER\n\nimplicit none\nreal(8) :: sum, b\nreal(8),allocatable :: x(:)\ncharacter(len=3),allocatable :: u(:)\ninteger :: n, i\n\nb = 380000.0\n\nread(*,*) n\nallocate(x(n), u(n))\n\ndo i = 1, n\n\tread(*,*) x(i), u(i)\nend do\n\nsum = 0\n\ndo i = 1, n\n\tif(u(i) == 'BTC') then\n \tx(i) = x(i)*b\n end if\n sum = sum + x(i)\nend do\n\nif (sum == 0.d0) then\n\twrite(*,'(a)') '0.0'\n\tstop\nend if\n\nwrite(*,'(f0.1)') sum\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1551040013, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03110.html", "problem_id": "p03110", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03110/input.txt", "sample_output_relpath": "derived/input_output/data/p03110/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03110/Fortran/s403608984.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s403608984", "user_id": "u454557108"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\nreal(8) :: sum, b\nreal(8),allocatable :: x(:)\ncharacter(len=3),allocatable :: u(:)\ninteger :: n, i\n\nb = 380000.0\n\nread(*,*) n\nallocate(x(n), u(n))\n\ndo i = 1, n\n\tread(*,*) x(i), u(i)\nend do\n\nsum = 0\n\ndo i = 1, n\n\tif(u(i) == 'BTC') then\n \tx(i) = x(i)*b\n end if\n sum = sum + x(i)\nend do\n\nif (sum == 0.d0) then\n\twrite(*,'(a)') '0.0'\n\tstop\nend if\n\nwrite(*,'(f0.1)') sum\n\nEND PROGRAM ATCODER", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "sample_input": "2\n10000 JPY\n0.10000000 BTC\n"}, "reference_outputs": ["48000.0\n"], "source_document_id": "p03110", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi received otoshidama (New Year's money gifts) from N of his relatives.\n\nYou are given N values x_1, x_2, ..., x_N and N strings u_1, u_2, ..., u_N as input. Each string u_i is either JPY or BTC, and x_i and u_i represent the content of the otoshidama from the i-th relative.\n\nFor example, if x_1 = 10000 and u_1 = JPY, the otoshidama from the first relative is 10000 Japanese yen; if x_2 = 0.10000000 and u_2 = BTC, the otoshidama from the second relative is 0.1 bitcoins.\n\nIf we convert the bitcoins into yen at the rate of 380000.0 JPY per 1.0 BTC, how much are the gifts worth in total?\n\nConstraints\n\n2 \\leq N \\leq 10\n\nu_i = JPY or BTC.\n\nIf u_i = JPY, x_i is an integer such that 1 \\leq x_i \\leq 10^8.\n\nIf u_i = BTC, x_i is a decimal with 8 decimal digits, such that 0.00000001 \\leq x_i \\leq 100.00000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 u_1\nx_2 u_2\n:\nx_N u_N\n\nOutput\n\nIf the gifts are worth Y yen in total, print the value Y (not necessarily an integer).\n\nOutput will be judged correct when the absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10000 JPY\n0.10000000 BTC\n\nSample Output 1\n\n48000.0\n\nThe otoshidama from the first relative is 10000 yen. The otoshidama from the second relative is 0.1 bitcoins, which is worth 38000.0 yen if converted at the rate of 380000.0 JPY per 1.0 BTC. The sum of these is 48000.0 yen.\n\nOutputs such as 48000 and 48000.1 will also be judged correct.\n\nSample Input 2\n\n3\n100000000 JPY\n100.00000000 BTC\n0.00000001 BTC\n\nSample Output 2\n\n138000000.0038\n\nIn this case, outputs such as 138001000 and 1.38e8 will also be judged correct.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 425, "cpu_time_ms": 7, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s166064658", "group_id": "codeNet:p03111", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n, a(3), i, ans, j, k\ninteger, allocatable :: l(:), cost(:,:)\n\nread(*,*) n, a(1), a(2), a(3)\nallocate(l(n), cost(n,n))\n\ndo i = 1, n\n\tread(*,*) l(i)\nend do\n\ncall hs(n,l)\ncall hs(3,a)\n\nans = 0\n\ndo i = 1, n\n\tif(a(i) == 0)cycle\n\tif(l(i) /= 0)then\n\t\tdo j = 1, n\n \t\tif(l(j) /= 0)then\n \t\t\tif(l(i)+l(j) <= minval(a) .and. i /= j)then\n \t\t\tl(i) = l(i) + l(j)\n \t\tans = ans + 10\n \t\tl(j) = 0\n \t\tend if\n \tend if\n \tend do\n end if\nend do\n\ndo i = 1, 3\n\tdo j = 1, n\n \tif(l(j) == a(i)) then\n \tl(j) = 0\n a(i) = 0\n end if\n end do\nend do\n\ndo i = 1, 3\n cost = 0\n\tdo j = 1, n\n \tdo k = 1, n\n \tif(j == k) then\n \tcost(j,k) = abs(l(j)-a(i))\n else\n \tcost(j,k) = 10 + abs(l(j)+l(k)-a(i))\n end if\n \tend do\n end do\n\tdo j = 1, n\n \tdo k = 1, n\n \tif (cost(j,k) == minval(cost))then\n \tans = ans + minval(cost)\n \tcost(j,k) = 0\n l(j) = 0\n l(k) = 0\n end if\n end do\n end do\nend do\n\nwrite(*,'(i0)') ans\n\nEND PROGRAM ATCODER\n\nsubroutine hs(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n \n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine hs\n\n", "language": "Fortran", "metadata": {"date": 1551043848, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03111.html", "problem_id": "p03111", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03111/input.txt", "sample_output_relpath": "derived/input_output/data/p03111/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03111/Fortran/s166064658.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s166064658", "user_id": "u454557108"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n, a(3), i, ans, j, k\ninteger, allocatable :: l(:), cost(:,:)\n\nread(*,*) n, a(1), a(2), a(3)\nallocate(l(n), cost(n,n))\n\ndo i = 1, n\n\tread(*,*) l(i)\nend do\n\ncall hs(n,l)\ncall hs(3,a)\n\nans = 0\n\ndo i = 1, n\n\tif(a(i) == 0)cycle\n\tif(l(i) /= 0)then\n\t\tdo j = 1, n\n \t\tif(l(j) /= 0)then\n \t\t\tif(l(i)+l(j) <= minval(a) .and. i /= j)then\n \t\t\tl(i) = l(i) + l(j)\n \t\tans = ans + 10\n \t\tl(j) = 0\n \t\tend if\n \tend if\n \tend do\n end if\nend do\n\ndo i = 1, 3\n\tdo j = 1, n\n \tif(l(j) == a(i)) then\n \tl(j) = 0\n a(i) = 0\n end if\n end do\nend do\n\ndo i = 1, 3\n cost = 0\n\tdo j = 1, n\n \tdo k = 1, n\n \tif(j == k) then\n \tcost(j,k) = abs(l(j)-a(i))\n else\n \tcost(j,k) = 10 + abs(l(j)+l(k)-a(i))\n end if\n \tend do\n end do\n\tdo j = 1, n\n \tdo k = 1, n\n \tif (cost(j,k) == minval(cost))then\n \tans = ans + minval(cost)\n \tcost(j,k) = 0\n l(j) = 0\n l(k) = 0\n end if\n end do\n end do\nend do\n\nwrite(*,'(i0)') ans\n\nEND PROGRAM ATCODER\n\nsubroutine hs(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n \n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine hs\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "sample_input": "5 100 90 80\n98\n40\n30\n21\n80\n"}, "reference_outputs": ["23\n"], "source_document_id": "p03111", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1953, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s467086610", "group_id": "codeNet:p03111", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n, a(3), i, ans, j, k\ninteger, allocatable :: l(:), cost(:,:)\n\nread(*,*) n, a(1), a(2), a(3)\nallocate(l(n), cost(n,n))\n\ndo i = 1, n\n\tread(*,*) l(i)\nend do\n\ncall hs(n,l)\ncall hs(3,a)\n\nans = 0\n\ndo i = 1, n\n\tif(a(i) == 0)cycle\n\tif(l(i) /= 0)then\n\t\tdo j = 1, n\n \t\tif(l(j) /= 0)then\n \t\t\tif(l(i)+l(j) <= minval(a) .and. i /= j)then\n \t\t\tl(i) = l(i) + l(j)\n \t\tans = ans + 10\n \t\tl(j) = 0\n \t\tend if\n \tend if\n \tend do\n end if\nend do\n\ndo i = 1, 3\n\tdo j = 1, n\n \tif(l(j) == a(i)) then\n \tl(j) = 0\n a(i) = 0\n end if\n end do\nend do\n\ndo i = 1, 3\n cost = 0\n\tdo j = 1, n\n \tdo k = 1, n\n \tif(j == k) then\n \tcost(j,k) = abs(l(j)-a(i))\n else\n \tcost(j,k) = 10 + abs(l(j)+l(k)-a(i))\n end if\n \tend do\n end do\n\tdo j = 1, n\n \tdo k = 1, n\n \tif (cost(j,k) == minval(cost))then\n \tans = ans + minval(cost)\n \tcost(j,k) = 0\n l(j) = 0\n l(k) = 0\n end if\n end do\n end do\nend do\n\nwrite(*,'(i0)') ans\n\nEND PROGRAM ATCODER\n\nsubroutine hs(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n \n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine hs\n\n", "language": "Fortran", "metadata": {"date": 1551043707, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03111.html", "problem_id": "p03111", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03111/input.txt", "sample_output_relpath": "derived/input_output/data/p03111/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03111/Fortran/s467086610.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s467086610", "user_id": "u454557108"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n, a(3), i, ans, j, k\ninteger, allocatable :: l(:), cost(:,:)\n\nread(*,*) n, a(1), a(2), a(3)\nallocate(l(n), cost(n,n))\n\ndo i = 1, n\n\tread(*,*) l(i)\nend do\n\ncall hs(n,l)\ncall hs(3,a)\n\nans = 0\n\ndo i = 1, n\n\tif(a(i) == 0)cycle\n\tif(l(i) /= 0)then\n\t\tdo j = 1, n\n \t\tif(l(j) /= 0)then\n \t\t\tif(l(i)+l(j) <= minval(a) .and. i /= j)then\n \t\t\tl(i) = l(i) + l(j)\n \t\tans = ans + 10\n \t\tl(j) = 0\n \t\tend if\n \tend if\n \tend do\n end if\nend do\n\ndo i = 1, 3\n\tdo j = 1, n\n \tif(l(j) == a(i)) then\n \tl(j) = 0\n a(i) = 0\n end if\n end do\nend do\n\ndo i = 1, 3\n cost = 0\n\tdo j = 1, n\n \tdo k = 1, n\n \tif(j == k) then\n \tcost(j,k) = abs(l(j)-a(i))\n else\n \tcost(j,k) = 10 + abs(l(j)+l(k)-a(i))\n end if\n \tend do\n end do\n\tdo j = 1, n\n \tdo k = 1, n\n \tif (cost(j,k) == minval(cost))then\n \tans = ans + minval(cost)\n \tcost(j,k) = 0\n l(j) = 0\n l(k) = 0\n end if\n end do\n end do\nend do\n\nwrite(*,'(i0)') ans\n\nEND PROGRAM ATCODER\n\nsubroutine hs(n,array)\n implicit none\n integer,intent(in) :: n\n integer,intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n integer :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n \n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine hs\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "sample_input": "5 100 90 80\n98\n40\n30\n21\n80\n"}, "reference_outputs": ["23\n"], "source_document_id": "p03111", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.\n\nYour objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:\n\nExtension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.\n\nShortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.\n\nComposition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)\n\nAt least how much MP is needed to achieve the objective?\n\nConstraints\n\n3 \\leq N \\leq 8\n\n1 \\leq C < B < A \\leq 1000\n\n1 \\leq l_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C\nl_1\nl_2\n:\nl_N\n\nOutput\n\nPrint the minimum amount of MP needed to achieve the objective.\n\nSample Input 1\n\n5 100 90 80\n98\n40\n30\n21\n80\n\nSample Output 1\n\n23\n\nWe are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.\n\nUse Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)\n\nUse Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)\n\nUse Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)\n\nUse Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)\n\nSample Input 2\n\n8 100 90 80\n100\n100\n90\n90\n90\n80\n80\n80\n\nSample Output 2\n\n0\n\nIf we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.\n\nSample Input 3\n\n8 1000 800 100\n300\n333\n400\n444\n500\n555\n600\n666\n\nSample Output 3\n\n243", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1953, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s419355797", "group_id": "codeNet:p03112", "input_text": "program abc119d\n implicit none\n integer a, b, q, i\n integer(8), dimension(:), allocatable :: s, t, x, ans\n integer(8), parameter :: inf = 10_8**11\n\n read *, a, b, q\n allocate(s(a), t(b), x(q), ans(q))\n read *, s, t, x\n s = [-inf, s, inf]\n t = [-inf, t, inf]\n do concurrent (i = 1:q)\n block\n integer si, ti\n integer(8) s_west, s_east, t_west, t_east, d(4)\n si = bsrch(s, x(i))\n ti = bsrch(t, x(i))\n s_west = x(i) - s(si - 1)\n s_east = s(si) - x(i)\n t_west = x(i) - t(ti - 1)\n t_east = t(ti) - x(i)\n d(1) = merge(s_west, t_west, s_west > t_west)\n d(2) = merge(s_east, t_east, s_east > t_east)\n d(3) = merge(s_west + t_east * 2, s_west * 2 + t_east, s_west > t_east)\n d(4) = merge(t_west + s_east * 2, t_west * 2 + s_east, t_west > s_east)\n ans(i) = minval(d)\n end block\n end do\n do i = 1, q\n print '(i0)', ans(i)\n end do\ncontains\n pure integer function bsrch(ary, v)\n integer(8), intent(in) :: ary(:), v\n integer low, mid, high\n\n low = lbound(ary, 1)\n high = ubound(ary, 1)\n\n do while (low < high)\n mid = low + (high - low) / 2\n if (ary(mid) < v) then\n low = mid + 1\n else\n high = mid\n end if\n end do\n bsrch = low\n end function bsrch\nend program abc119d\n", "language": "Fortran", "metadata": {"date": 1551454506, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03112.html", "problem_id": "p03112", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03112/input.txt", "sample_output_relpath": "derived/input_output/data/p03112/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03112/Fortran/s419355797.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s419355797", "user_id": "u081445141"}, "prompt_components": {"gold_output": "350\n1400\n301\n399\n", "input_to_evaluate": "program abc119d\n implicit none\n integer a, b, q, i\n integer(8), dimension(:), allocatable :: s, t, x, ans\n integer(8), parameter :: inf = 10_8**11\n\n read *, a, b, q\n allocate(s(a), t(b), x(q), ans(q))\n read *, s, t, x\n s = [-inf, s, inf]\n t = [-inf, t, inf]\n do concurrent (i = 1:q)\n block\n integer si, ti\n integer(8) s_west, s_east, t_west, t_east, d(4)\n si = bsrch(s, x(i))\n ti = bsrch(t, x(i))\n s_west = x(i) - s(si - 1)\n s_east = s(si) - x(i)\n t_west = x(i) - t(ti - 1)\n t_east = t(ti) - x(i)\n d(1) = merge(s_west, t_west, s_west > t_west)\n d(2) = merge(s_east, t_east, s_east > t_east)\n d(3) = merge(s_west + t_east * 2, s_west * 2 + t_east, s_west > t_east)\n d(4) = merge(t_west + s_east * 2, t_west * 2 + s_east, t_west > s_east)\n ans(i) = minval(d)\n end block\n end do\n do i = 1, q\n print '(i0)', ans(i)\n end do\ncontains\n pure integer function bsrch(ary, v)\n integer(8), intent(in) :: ary(:), v\n integer low, mid, high\n\n low = lbound(ary, 1)\n high = ubound(ary, 1)\n\n do while (low < high)\n mid = low + (high - low) / 2\n if (ary(mid) < v) then\n low = mid + 1\n else\n high = mid\n end if\n end do\n bsrch = low\n end function bsrch\nend program abc119d\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "sample_input": "2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n"}, "reference_outputs": ["350\n1400\n301\n399\n"], "source_document_id": "p03112", "source_text": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 172, "memory_kb": 5744}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s006657695", "group_id": "codeNet:p03112", "input_text": "program main\n implicit none\n integer(8)::a,b,q,ma,mb,pa,pb\n integer(8)::i\n integer(8),allocatable,dimension(:)::s,t,x,dums,dumt\n read(*,*)a,b,q\n allocate(s(a),dums(a),t(b),dumt(b),x(q))\n do i=1,a\n read(*,*)s(i)\n enddo\n do i=1,b\n read(*,*)t(i)\n enddo \n do i=1,q\n read(*,*)x(i)\n enddo\n do i=1,q\n dums=s-x(i)\n dumt=t-x(i)\n ma=minval(abs(dums),dums<=0)\n mb=minval(abs(dumt),dumt<=0)\n pa=minval(abs(dums),dums>=0)\n pb=minval(abs(dumt),dumt>=0)\n write(*,*)min(max(ma,mb),max(pa,pb),2*min(ma,pa)+min(mb,pb),min(ma,pa)+2*min(mb,pb))\n enddo\nend program main\n", "language": "Fortran", "metadata": {"date": 1551040546, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03112.html", "problem_id": "p03112", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03112/input.txt", "sample_output_relpath": "derived/input_output/data/p03112/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03112/Fortran/s006657695.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s006657695", "user_id": "u539011156"}, "prompt_components": {"gold_output": "350\n1400\n301\n399\n", "input_to_evaluate": "program main\n implicit none\n integer(8)::a,b,q,ma,mb,pa,pb\n integer(8)::i\n integer(8),allocatable,dimension(:)::s,t,x,dums,dumt\n read(*,*)a,b,q\n allocate(s(a),dums(a),t(b),dumt(b),x(q))\n do i=1,a\n read(*,*)s(i)\n enddo\n do i=1,b\n read(*,*)t(i)\n enddo \n do i=1,q\n read(*,*)x(i)\n enddo\n do i=1,q\n dums=s-x(i)\n dumt=t-x(i)\n ma=minval(abs(dums),dums<=0)\n mb=minval(abs(dumt),dumt<=0)\n pa=minval(abs(dums),dums>=0)\n pb=minval(abs(dumt),dumt>=0)\n write(*,*)min(max(ma,mb),max(pa,pb),2*min(ma,pa)+min(mb,pb),min(ma,pa)+2*min(mb,pb))\n enddo\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "sample_input": "2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n"}, "reference_outputs": ["350\n1400\n301\n399\n"], "source_document_id": "p03112", "source_text": "Score : 400 points\n\nProblem Statement\n\nAlong a road running in an east-west direction, there are A shrines and B temples.\nThe i-th shrine from the west is located at a distance of s_i meters from the west end of the road, and the i-th temple from the west is located at a distance of t_i meters from the west end of the road.\n\nAnswer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): If we start from a point at a distance of x_i meters from the west end of the road and freely travel along the road, what is the minimum distance that needs to be traveled in order to visit one shrine and one temple? (It is allowed to pass by more shrines and temples than required.)\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq s_1 < s_2 < ... < s_A \\leq 10^{10}\n\n1 \\leq t_1 < t_2 < ... < t_B \\leq 10^{10}\n\n1 \\leq x_i \\leq 10^{10}\n\ns_1, ..., s_A, t_1, ..., t_B, x_1, ..., x_Q are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B Q\ns_1\n:\ns_A\nt_1\n:\nt_B\nx_1\n:\nx_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n2 3 4\n100\n600\n400\n900\n1000\n150\n2000\n899\n799\n\nSample Output 1\n\n350\n1400\n301\n399\n\nThere are two shrines and three temples. The shrines are located at distances of 100, 600 meters from the west end of the road, and the temples are located at distances of 400, 900, 1000 meters from the west end of the road.\n\nQuery 1: If we start from a point at a distance of 150 meters from the west end of the road, the optimal move is first to walk 50 meters west to visit a shrine, then to walk 300 meters east to visit a temple.\n\nQuery 2: If we start from a point at a distance of 2000 meters from the west end of the road, the optimal move is first to walk 1000 meters west to visit a temple, then to walk 400 meters west to visit a shrine. We will pass by another temple on the way, but it is fine.\n\nQuery 3: If we start from a point at a distance of 899 meters from the west end of the road, the optimal move is first to walk 1 meter east to visit a temple, then to walk 300 meters west to visit a shrine.\n\nQuery 4: If we start from a point at a distance of 799 meters from the west end of the road, the optimal move is first to walk 199 meters west to visit a shrine, then to walk 200 meters west to visit a temple.\n\nSample Input 2\n\n1 1 3\n1\n10000000000\n2\n9999999999\n5000000000\n\nSample Output 2\n\n10000000000\n10000000000\n14999999998\n\nThe road is quite long, and we may need to travel a distance that does not fit into a 32-bit integer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 627, "cpu_time_ms": 2104, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s952954286", "group_id": "codeNet:p03125", "input_text": "program test\nimplicit none\ninteger::a,b,c,d\n\n \nread*,a,b\n \nc=mod(a,b)\n \nif (c==0) then\nd=a+b\nelse\nd=b-a\nend if\n \nprint*,d\n \nend program test", "language": "Fortran", "metadata": {"date": 1550369369, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03125.html", "problem_id": "p03125", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03125/input.txt", "sample_output_relpath": "derived/input_output/data/p03125/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03125/Fortran/s952954286.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s952954286", "user_id": "u723571904"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "program test\nimplicit none\ninteger::a,b,c,d\n\n \nread*,a,b\n \nc=mod(a,b)\n \nif (c==0) then\nd=a+b\nelse\nd=b-a\nend if\n \nprint*,d\n \nend program test", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "sample_input": "4 12\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03125", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 140, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s677118048", "group_id": "codeNet:p03125", "input_text": "program aba\n implicit none\n integer :: a, b\n read(*,*) a, b\n if (mod(b,a) .eq. 0) then\n write(*,'(i0)') a+b\n else\n write(*,'(i0)') b-a\n end if\n stop\nend program aba\n", "language": "Fortran", "metadata": {"date": 1550368929, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03125.html", "problem_id": "p03125", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03125/input.txt", "sample_output_relpath": "derived/input_output/data/p03125/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03125/Fortran/s677118048.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s677118048", "user_id": "u506403362"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "program aba\n implicit none\n integer :: a, b\n read(*,*) a, b\n if (mod(b,a) .eq. 0) then\n write(*,'(i0)') a+b\n else\n write(*,'(i0)') b-a\n end if\n stop\nend program aba\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "sample_input": "4 12\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03125", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s471413528", "group_id": "codeNet:p03126", "input_text": "program main\nimplicit none\ninteger :: n, m\ninteger , allocatable :: k(:), A(:,:), Ai(:)\ninteger :: i, j, l, nc\n\nread(*,*) n, m\nallocate(k(n))\nallocate(A(n,m))\ndo i = 1, n\n read(*,*) k(i)\n allocate(Ai(k(i)))\n read(*,*) Ai(:)\n do j = 1, k(i)\n do l = 1, m\n if(l == ai(j)) then\n a(i,l) = 1\n else\n a(i,l) = 0\n end if\n end do\n end do\n deallocate(Ai)\nend do\n\nnc = 0\ndo j = 1, m\n if(sum(a(:,j)) == m ) then\n nc = nc + 1\n end if\nend do\nwrite(*,'(i0)') nc\ndeallocate(k)\ndeallocate(a)\nstop\nend program main\n", "language": "Fortran", "metadata": {"date": 1550428684, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03126.html", "problem_id": "p03126", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03126/input.txt", "sample_output_relpath": "derived/input_output/data/p03126/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03126/Fortran/s471413528.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s471413528", "user_id": "u696547932"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: n, m\ninteger , allocatable :: k(:), A(:,:), Ai(:)\ninteger :: i, j, l, nc\n\nread(*,*) n, m\nallocate(k(n))\nallocate(A(n,m))\ndo i = 1, n\n read(*,*) k(i)\n allocate(Ai(k(i)))\n read(*,*) Ai(:)\n do j = 1, k(i)\n do l = 1, m\n if(l == ai(j)) then\n a(i,l) = 1\n else\n a(i,l) = 0\n end if\n end do\n end do\n deallocate(Ai)\nend do\n\nnc = 0\ndo j = 1, m\n if(sum(a(:,j)) == m ) then\n nc = nc + 1\n end if\nend do\nwrite(*,'(i0)') nc\ndeallocate(k)\ndeallocate(a)\nstop\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "sample_input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03126", "source_text": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s065714474", "group_id": "codeNet:p03127", "input_text": "program main\nimplicit None\n\tinteger(8)::n,p,q,i\n\tinteger(8),allocatable::a(:)\n\t\n\tread*,n\n\tallocate(a(n))\n\tread*,a\n\t\n\tp = a(1)\n\tq = p\n\t\n\tdo i = 1,n\n\t\tcall euc(a(i),p,q)\n\t\tp = q\n\tenddo\n\t\n\tprint\"(i0)\",p\n\t\nend program main\n\nsubroutine euc(a1,b1,c)\nimplicit None\ninteger(8)::a1,b1,c,a,b\n\t! return GCD of a1 and b1 in c\n\t\n\ta = a1\n\tb = b1\n\tc = 1\n\t\n\tdo while (a /=0 .and. b /= 0)\n\t\tif (a > b)then\n\t\t\tc = b\n\t\t\ta = mod(a,b)\n\t\t\telse\n\t\t\tc = a\n\t\t\tb = mod(b,a)\n\t\tendif\n\tenddo\nend subroutine euc", "language": "Fortran", "metadata": {"date": 1552347911, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03127.html", "problem_id": "p03127", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03127/input.txt", "sample_output_relpath": "derived/input_output/data/p03127/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03127/Fortran/s065714474.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065714474", "user_id": "u900266249"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,p,q,i\n\tinteger(8),allocatable::a(:)\n\t\n\tread*,n\n\tallocate(a(n))\n\tread*,a\n\t\n\tp = a(1)\n\tq = p\n\t\n\tdo i = 1,n\n\t\tcall euc(a(i),p,q)\n\t\tp = q\n\tenddo\n\t\n\tprint\"(i0)\",p\n\t\nend program main\n\nsubroutine euc(a1,b1,c)\nimplicit None\ninteger(8)::a1,b1,c,a,b\n\t! return GCD of a1 and b1 in c\n\t\n\ta = a1\n\tb = b1\n\tc = 1\n\t\n\tdo while (a /=0 .and. b /= 0)\n\t\tif (a > b)then\n\t\t\tc = b\n\t\t\ta = mod(a,b)\n\t\t\telse\n\t\t\tc = a\n\t\t\tb = mod(b,a)\n\t\tendif\n\tenddo\nend subroutine euc", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 480, "cpu_time_ms": 34, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s661925633", "group_id": "codeNet:p03127", "input_text": "Program ABC118C\n\ninteger n,b,k\ninteger,allocatable::a(:)\n\nread(*,*) n\nallocate(a(n))\nread(*,*) a\n\ndo i=1,n\n do j=i+1,n\n if (a(i)>a(j)) then\n b=a(i)\n a(i)=a(j)\n a(j)=b\n end if\n end do\nend do\n\ndo while (a(n-1)/=0)\n\nk=1\ndo j=1,n\nif (a(k)/=0) then\ndo i=k+1,n\n a(i)=mod(a(i),a(1))\nend do\ngo to 10\nelse\nk=k+1\nend if\nend do\n\n10 do i=1,n\n do j=i+1,n\n if (a(i)>a(j)) then\n b=a(i)\n a(i)=a(j)\n a(j)=b\n end if\n end do\nend do\n\nend do\n\nwrite(*,*) a(n)\n\nstop\nend", "language": "Fortran", "metadata": {"date": 1550374157, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03127.html", "problem_id": "p03127", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03127/input.txt", "sample_output_relpath": "derived/input_output/data/p03127/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03127/Fortran/s661925633.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s661925633", "user_id": "u538260936"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Program ABC118C\n\ninteger n,b,k\ninteger,allocatable::a(:)\n\nread(*,*) n\nallocate(a(n))\nread(*,*) a\n\ndo i=1,n\n do j=i+1,n\n if (a(i)>a(j)) then\n b=a(i)\n a(i)=a(j)\n a(j)=b\n end if\n end do\nend do\n\ndo while (a(n-1)/=0)\n\nk=1\ndo j=1,n\nif (a(k)/=0) then\ndo i=k+1,n\n a(i)=mod(a(i),a(1))\nend do\ngo to 10\nelse\nk=k+1\nend if\nend do\n\n10 do i=1,n\n do j=i+1,n\n if (a(i)>a(j)) then\n b=a(i)\n a(i)=a(j)\n a(j)=b\n end if\n end do\nend do\n\nend do\n\nwrite(*,*) a(n)\n\nstop\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 463, "cpu_time_ms": 2103, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s745659686", "group_id": "codeNet:p03127", "input_text": "program main\n implicit none\n integer :: N\n integer,allocatable :: A(:)\n integer,allocatable :: A2(:)\n integer :: Amin, i_loop,Amin_bf\n integer :: i,j,k\n read(*,*) N\n allocate(A(N),A2(N))\n read(*,*) A\n A2 = A\n Amin = minval(A)\n ! calc mod\n i_loop = 0\n do i = 1,4\n where(A > Amin ) A = A-Amin\n if ( any(A < Amin ) ) then\n Amin_bf = Amin_bf\n Amin = minval(A,A>0)\n end if\n i_loop = i_loop + 1\n if ( count(A > 0 ) == 1 .or. all( A == A(1)) ) exit\n end do\n write(*,'(i0)') minval(A,A >0 )\n deallocate(A)\n deallocate(A2)\n stop\ncontains\n recursive function iqsort(ix) result(ires)\n integer, allocatable :: ires(:)\n integer, intent(in) :: ix(:)\n integer :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort \nend program main", "language": "Fortran", "metadata": {"date": 1550372737, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03127.html", "problem_id": "p03127", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03127/input.txt", "sample_output_relpath": "derived/input_output/data/p03127/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03127/Fortran/s745659686.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745659686", "user_id": "u886432251"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer :: N\n integer,allocatable :: A(:)\n integer,allocatable :: A2(:)\n integer :: Amin, i_loop,Amin_bf\n integer :: i,j,k\n read(*,*) N\n allocate(A(N),A2(N))\n read(*,*) A\n A2 = A\n Amin = minval(A)\n ! calc mod\n i_loop = 0\n do i = 1,4\n where(A > Amin ) A = A-Amin\n if ( any(A < Amin ) ) then\n Amin_bf = Amin_bf\n Amin = minval(A,A>0)\n end if\n i_loop = i_loop + 1\n if ( count(A > 0 ) == 1 .or. all( A == A(1)) ) exit\n end do\n write(*,'(i0)') minval(A,A >0 )\n deallocate(A)\n deallocate(A2)\n stop\ncontains\n recursive function iqsort(ix) result(ires)\n integer, allocatable :: ires(:)\n integer, intent(in) :: ix(:)\n integer :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort \nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 975, "cpu_time_ms": 34, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s091886536", "group_id": "codeNet:p03128", "input_text": "program match_matching\n implicit none\n integer :: n, m, b(9), i, j, d, r\n integer, allocatable :: a(:), dp(:)\n character(16384) :: answer\n read(*,*) n, m\n allocate(a(m),dp(0:n))\n read(*,*) a(:)\n b = (/2,5,5,4,5,6,3,7,6/)\n call reverse_sort(m,a)\n dp = -1\n dp(0) = 0\n do i = 2, n\n d = -1\n do j = 1, m\n if (i-b(a(j)) .ge. 0) then\n if (dp(i-b(a(j))) .gt. d) d = dp(i-b(a(j)))\n end if\n if (d .lt. 0) then\n dp(i) = -1\n else\n dp(i) = d + 1\n end if\n end do\n end do\n r = n\n i = 1\n answer = ''\n do while (r .gt. 0)\n do j = 1, m\n if (r-b(a(j)) .ge. 0) then\n if (dp(r-b(a(j))) .eq. dp(r)-1) then\n answer(i:i) = achar(48+a(j))\n r = r - b(a(j))\n i = i + 1\n exit\n end if\n end if\n end do\n end do\n deallocate(a,dp)\n write(*,'(a)') answer(1:i)\n stop\n\ncontains\n\n subroutine reverse_sort(m,a)\n implicit none\n integer, intent(in) :: m\n integer, intent(inout) :: a(m)\n integer :: i, j\n do i = m-1, 1, -1\n do j = 1, i\n if (a(j) .lt. a(j+1)) call swap(a(j),a(j+1))\n end do\n end do\n return\n end subroutine reverse_sort\n\n subroutine swap(a,b)\n implicit none\n integer, intent(inout) :: a, b\n integer :: c\n c = a\n a = b\n b = c\n return\n end subroutine swap\n\nend program match_matching", "language": "Fortran", "metadata": {"date": 1550380488, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03128.html", "problem_id": "p03128", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03128/input.txt", "sample_output_relpath": "derived/input_output/data/p03128/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03128/Fortran/s091886536.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s091886536", "user_id": "u506403362"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "program match_matching\n implicit none\n integer :: n, m, b(9), i, j, d, r\n integer, allocatable :: a(:), dp(:)\n character(16384) :: answer\n read(*,*) n, m\n allocate(a(m),dp(0:n))\n read(*,*) a(:)\n b = (/2,5,5,4,5,6,3,7,6/)\n call reverse_sort(m,a)\n dp = -1\n dp(0) = 0\n do i = 2, n\n d = -1\n do j = 1, m\n if (i-b(a(j)) .ge. 0) then\n if (dp(i-b(a(j))) .gt. d) d = dp(i-b(a(j)))\n end if\n if (d .lt. 0) then\n dp(i) = -1\n else\n dp(i) = d + 1\n end if\n end do\n end do\n r = n\n i = 1\n answer = ''\n do while (r .gt. 0)\n do j = 1, m\n if (r-b(a(j)) .ge. 0) then\n if (dp(r-b(a(j))) .eq. dp(r)-1) then\n answer(i:i) = achar(48+a(j))\n r = r - b(a(j))\n i = i + 1\n exit\n end if\n end if\n end do\n end do\n deallocate(a,dp)\n write(*,'(a)') answer(1:i)\n stop\n\ncontains\n\n subroutine reverse_sort(m,a)\n implicit none\n integer, intent(in) :: m\n integer, intent(inout) :: a(m)\n integer :: i, j\n do i = m-1, 1, -1\n do j = 1, i\n if (a(j) .lt. a(j+1)) call swap(a(j),a(j+1))\n end do\n end do\n return\n end subroutine reverse_sort\n\n subroutine swap(a,b)\n implicit none\n integer, intent(inout) :: a, b\n integer :: c\n c = a\n a = b\n b = c\n return\n end subroutine swap\n\nend program match_matching", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1410, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s666816946", "group_id": "codeNet:p03130", "input_text": "program minpro2019B\n implicit none\n integer(8)::i\n integer(8)::flg=0\n integer(8),dimension(6)::A\n integer(8),dimension(4)::L=0\n read(5,*)(A(i),i=1,6)\n\n do i=1,6\n L(A(i))=L(A(i))+1\n end do\n\n do i=1,6\n if(A(i)>=3)flg=1\n end do\n\n if(flg==1)then\n print'(A)',\"NO\"\n else\n print'(A)',\"YES\"\n end if\nend program minpro2019B", "language": "Fortran", "metadata": {"date": 1581048681, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03130.html", "problem_id": "p03130", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03130/input.txt", "sample_output_relpath": "derived/input_output/data/p03130/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03130/Fortran/s666816946.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s666816946", "user_id": "u414699019"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program minpro2019B\n implicit none\n integer(8)::i\n integer(8)::flg=0\n integer(8),dimension(6)::A\n integer(8),dimension(4)::L=0\n read(5,*)(A(i),i=1,6)\n\n do i=1,6\n L(A(i))=L(A(i))+1\n end do\n\n do i=1,6\n if(A(i)>=3)flg=1\n end do\n\n if(flg==1)then\n print'(A)',\"NO\"\n else\n print'(A)',\"YES\"\n end if\nend program minpro2019B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are four towns, numbered 1,2,3 and 4.\nAlso, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.\nNo two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.\n\nDetermine if we can visit all the towns by traversing each of the roads exactly once.\n\nConstraints\n\n1 \\leq a_i,b_i \\leq 4(1\\leq i\\leq 3)\n\na_i and b_i are different. (1\\leq i\\leq 3)\n\nNo two roads connect the same pair of towns.\n\nAny town can be reached from any other town using the roads.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na_1 b_1\na_2 b_2\na_3 b_3\n\nOutput\n\nIf we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.\n\nSample Input 1\n\n4 2\n1 3\n2 3\n\nSample Output 1\n\nYES\n\nWe can visit all the towns in the order 1,3,2,4.\n\nSample Input 2\n\n3 2\n2 4\n1 2\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n2 1\n3 2\n4 3\n\nSample Output 3\n\nYES", "sample_input": "4 2\n1 3\n2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03130", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are four towns, numbered 1,2,3 and 4.\nAlso, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.\nNo two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.\n\nDetermine if we can visit all the towns by traversing each of the roads exactly once.\n\nConstraints\n\n1 \\leq a_i,b_i \\leq 4(1\\leq i\\leq 3)\n\na_i and b_i are different. (1\\leq i\\leq 3)\n\nNo two roads connect the same pair of towns.\n\nAny town can be reached from any other town using the roads.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na_1 b_1\na_2 b_2\na_3 b_3\n\nOutput\n\nIf we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.\n\nSample Input 1\n\n4 2\n1 3\n2 3\n\nSample Output 1\n\nYES\n\nWe can visit all the towns in the order 1,3,2,4.\n\nSample Input 2\n\n3 2\n2 4\n1 2\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n2 1\n3 2\n4 3\n\nSample Output 3\n\nYES", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s009038099", "group_id": "codeNet:p03131", "input_text": "program sample\n implicit none\n character(100)::s\n integer(8) :: i,j,m,n,a,b,k,l\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) k,a,b\n if(a+2>=b .or. k<=a)then\n write(*,*)k+1\n stop\n end if\n l=k-a+1\n m=a+(l/2)*(b-a)+mod(l,2)\n write(*,*)m\n\n\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1597516076, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03131.html", "problem_id": "p03131", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03131/input.txt", "sample_output_relpath": "derived/input_output/data/p03131/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03131/Fortran/s009038099.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s009038099", "user_id": "u713568912"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s\n integer(8) :: i,j,m,n,a,b,k,l\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) k,a,b\n if(a+2>=b .or. k<=a)then\n write(*,*)k+1\n stop\n end if\n l=k-a+1\n m=a+(l/2)*(b-a)+mod(l,2)\n write(*,*)m\n\n\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has one biscuit and zero Japanese yen (the currency) in his pocket.\nHe will perform the following operations exactly K times in total, in the order he likes:\n\nHit his pocket, which magically increases the number of biscuits by one.\n\nExchange A biscuits to 1 yen.\n\nExchange 1 yen to B biscuits.\n\nFind the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nConstraints\n\n1 \\leq K,A,B \\leq 10^9\n\nK,A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nPrint the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nSample Input 1\n\n4 2 6\n\nSample Output 1\n\n7\n\nThe number of biscuits in Snuke's pocket after K operations is maximized as follows:\n\nHit his pocket. Now he has 2 biscuits and 0 yen.\n\nExchange 2 biscuits to 1 yen. his pocket. Now he has 0 biscuits and 1 yen.\n\nHit his pocket. Now he has 1 biscuits and 1 yen.\n\nExchange 1 yen to 6 biscuits. his pocket. Now he has 7 biscuits and 0 yen.\n\nSample Input 2\n\n7 3 4\n\nSample Output 2\n\n8\n\nSample Input 3\n\n314159265 35897932 384626433\n\nSample Output 3\n\n48518828981938099", "sample_input": "4 2 6\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03131", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has one biscuit and zero Japanese yen (the currency) in his pocket.\nHe will perform the following operations exactly K times in total, in the order he likes:\n\nHit his pocket, which magically increases the number of biscuits by one.\n\nExchange A biscuits to 1 yen.\n\nExchange 1 yen to B biscuits.\n\nFind the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nConstraints\n\n1 \\leq K,A,B \\leq 10^9\n\nK,A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nPrint the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nSample Input 1\n\n4 2 6\n\nSample Output 1\n\n7\n\nThe number of biscuits in Snuke's pocket after K operations is maximized as follows:\n\nHit his pocket. Now he has 2 biscuits and 0 yen.\n\nExchange 2 biscuits to 1 yen. his pocket. Now he has 0 biscuits and 1 yen.\n\nHit his pocket. Now he has 1 biscuits and 1 yen.\n\nExchange 1 yen to 6 biscuits. his pocket. Now he has 7 biscuits and 0 yen.\n\nSample Input 2\n\n7 3 4\n\nSample Output 2\n\n8\n\nSample Input 3\n\n314159265 35897932 384626433\n\nSample Output 3\n\n48518828981938099", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 2800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s579449292", "group_id": "codeNet:p03131", "input_text": "program atcoder\n implicit none\n integer(8) :: ans,k,a,b\n logical x\n read*,k,a,b\n ans = 0\n x = (b-a)>2_8\n do while(k>0_8)\n if(ans>=a .and. x .and. k>1_8)then\n ans = ans + (b-a)\n k = k-1_8\n else\n ans = ans + 1_8\n endif\n k = k-1_8\n enddo\n write(*,'(I0)')ans\n stop \ncontains\nend program atcoder", "language": "Fortran", "metadata": {"date": 1549888655, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03131.html", "problem_id": "p03131", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03131/input.txt", "sample_output_relpath": "derived/input_output/data/p03131/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03131/Fortran/s579449292.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s579449292", "user_id": "u780122303"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program atcoder\n implicit none\n integer(8) :: ans,k,a,b\n logical x\n read*,k,a,b\n ans = 0\n x = (b-a)>2_8\n do while(k>0_8)\n if(ans>=a .and. x .and. k>1_8)then\n ans = ans + (b-a)\n k = k-1_8\n else\n ans = ans + 1_8\n endif\n k = k-1_8\n enddo\n write(*,'(I0)')ans\n stop \ncontains\nend program atcoder", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has one biscuit and zero Japanese yen (the currency) in his pocket.\nHe will perform the following operations exactly K times in total, in the order he likes:\n\nHit his pocket, which magically increases the number of biscuits by one.\n\nExchange A biscuits to 1 yen.\n\nExchange 1 yen to B biscuits.\n\nFind the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nConstraints\n\n1 \\leq K,A,B \\leq 10^9\n\nK,A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nPrint the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nSample Input 1\n\n4 2 6\n\nSample Output 1\n\n7\n\nThe number of biscuits in Snuke's pocket after K operations is maximized as follows:\n\nHit his pocket. Now he has 2 biscuits and 0 yen.\n\nExchange 2 biscuits to 1 yen. his pocket. Now he has 0 biscuits and 1 yen.\n\nHit his pocket. Now he has 1 biscuits and 1 yen.\n\nExchange 1 yen to 6 biscuits. his pocket. Now he has 7 biscuits and 0 yen.\n\nSample Input 2\n\n7 3 4\n\nSample Output 2\n\n8\n\nSample Input 3\n\n314159265 35897932 384626433\n\nSample Output 3\n\n48518828981938099", "sample_input": "4 2 6\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03131", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has one biscuit and zero Japanese yen (the currency) in his pocket.\nHe will perform the following operations exactly K times in total, in the order he likes:\n\nHit his pocket, which magically increases the number of biscuits by one.\n\nExchange A biscuits to 1 yen.\n\nExchange 1 yen to B biscuits.\n\nFind the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nConstraints\n\n1 \\leq K,A,B \\leq 10^9\n\nK,A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nPrint the maximum possible number of biscuits in Snuke's pocket after K operations.\n\nSample Input 1\n\n4 2 6\n\nSample Output 1\n\n7\n\nThe number of biscuits in Snuke's pocket after K operations is maximized as follows:\n\nHit his pocket. Now he has 2 biscuits and 0 yen.\n\nExchange 2 biscuits to 1 yen. his pocket. Now he has 0 biscuits and 1 yen.\n\nHit his pocket. Now he has 1 biscuits and 1 yen.\n\nExchange 1 yen to 6 biscuits. his pocket. Now he has 7 biscuits and 0 yen.\n\nSample Input 2\n\n7 3 4\n\nSample Output 2\n\n8\n\nSample Input 3\n\n314159265 35897932 384626433\n\nSample Output 3\n\n48518828981938099", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 755, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s426920119", "group_id": "codeNet:p03135", "input_text": "program timer\nimplicit none\ninteger :: x, t\nread(*,*) x,t\nwrite(*,*) real(x)/real(t)\nstop\nend program timer", "language": "Fortran", "metadata": {"date": 1592659082, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/Fortran/s426920119.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426920119", "user_id": "u961266059"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "program timer\nimplicit none\ninteger :: x, t\nread(*,*) x,t\nwrite(*,*) real(x)/real(t)\nstop\nend program timer", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 2976}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s363494740", "group_id": "codeNet:p03135", "input_text": "program main\n\timplicit none\n real(8) :: T,X\n \n write(*,*) T/X\n \n stop\nend program main\n\n", "language": "Fortran", "metadata": {"date": 1592626821, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03135.html", "problem_id": "p03135", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03135/input.txt", "sample_output_relpath": "derived/input_output/data/p03135/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03135/Fortran/s363494740.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s363494740", "user_id": "u323210830"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "program main\n\timplicit none\n real(8) :: T,X\n \n write(*,*) T/X\n \n stop\nend program main\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "sample_input": "8 3\n"}, "reference_outputs": ["2.6666666667\n"], "source_document_id": "p03135", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn order to pass the entrance examination tomorrow, Taro has to study for T more hours.\n\nFortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).\n\nWhile (X \\times t) hours pass in World B, t hours pass in World A.\n\nHow many hours will pass in World A while Taro studies for T hours in World B?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq T \\leq 100\n\n1 \\leq X \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT X\n\nOutput\n\nPrint the number of hours that will pass in World A.\n\nThe output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.\n\nSample Input 1\n\n8 3\n\nSample Output 1\n\n2.6666666667\n\nWhile Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.\n\nNote that an absolute or relative error of at most 10^{-3} is allowed.\n\nSample Input 2\n\n99 1\n\nSample Output 2\n\n99.0000000000\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n0.0100000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2816}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s754091413", "group_id": "codeNet:p03136", "input_text": "program main\n implicit none\n \n integer :: n,i,j,a(10) = 0,t,s=0\n \n read(*,*)n\n read(*,*)(a(i), i = 1, n)\n do i=1,N-1\n do j=i+1,N\n if(a(i) .gt. a(j))then\n t=a(i)\n a(i)=a(j)\n a(j)=t\n end if\n end do\n end do\n \n do i = 1, n-1\n s = s + a(i)\n end do\n \n if (a(n) < s) then\n write(*,*)'Yes'\n else\n write(*,*)'No'\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1570759306, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/Fortran/s754091413.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s754091413", "user_id": "u287431190"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: n,i,j,a(10) = 0,t,s=0\n \n read(*,*)n\n read(*,*)(a(i), i = 1, n)\n do i=1,N-1\n do j=i+1,N\n if(a(i) .gt. a(j))then\n t=a(i)\n a(i)=a(j)\n a(j)=t\n end if\n end do\n end do\n \n do i = 1, n-1\n s = s + a(i)\n end do\n \n if (a(n) < s) then\n write(*,*)'Yes'\n else\n write(*,*)'No'\n end if\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s532468227", "group_id": "codeNet:p03136", "input_text": "program polygon\n implicit none\n integer :: n, l(10) = 0\n read(*,*) n\n read(*,*) l(1:n)\n if (2*maxval(l) < sum(l)) then\n write(*,'(a)') \"Yes\"\n else\n write(*,'(a)') \"No\"\n end if\nend program polygon", "language": "Fortran", "metadata": {"date": 1569561297, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/Fortran/s532468227.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s532468227", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program polygon\n implicit none\n integer :: n, l(10) = 0\n read(*,*) n\n read(*,*) l(1:n)\n if (2*maxval(l) < sum(l)) then\n write(*,'(a)') \"Yes\"\n else\n write(*,'(a)') \"No\"\n end if\nend program polygon", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s467827788", "group_id": "codeNet:p03136", "input_text": "program main\n implicit none\n integer :: n, i\n integer, allocatable :: l(:)\n read (*, *) n\n allocate (l(n))\n read (*, *) l(:)\n if (maxval(l) * 2 < sum(l)) then\n print \"(a)\", \"Yes\"\n else\n print \"(a)\", \"No\"\n end if\nend program main\n", "language": "Fortran", "metadata": {"date": 1553502560, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/Fortran/s467827788.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467827788", "user_id": "u388927326"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i\n integer, allocatable :: l(:)\n read (*, *) n\n allocate (l(n))\n read (*, *) l(:)\n if (maxval(l) * 2 < sum(l)) then\n print \"(a)\", \"Yes\"\n else\n print \"(a)\", \"No\"\n end if\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s434861831", "group_id": "codeNet:p03137", "input_text": "program main\n implicit none\n integer :: n, m, res\n integer, allocatable :: x(:), y(:)\n read (*, *) n, m\n allocate (x(m), y(m - 1))\n read (*, *) x(:)\n\n call quicksort(x)\n y(:) = x(2:) - x(:m - 1)\n if (m - 1 > 1) call quicksort(y)\n\n res = sum(y(:m - n))\n write (*, \"(i0)\") res\n\n contains\n\n recursive subroutine quicksort(a)\n integer, intent(inout) :: a(:)\n integer :: pivot, i, j, k, tmp, n\n real(4) :: r\n n = size(a)\n i = 1\n j = n\n call random_number(r)\n k = 1 + floor(r * n)\n k = max(1, min(k, n))\n pivot = a(k)\n do\n do while (.not. pivot <= a(i))\n i = i + 1\n end do\n do while (.not. a(j) <= pivot)\n j = j - 1\n end do\n if (i >= j) exit\n tmp = a(i)\n a(i) = a(j)\n a(j) = tmp\n i = i + 1\n j = j - 1\n end do\n if (1 < i - 1) call quicksort(a(1:i - 1))\n if (j + 1 < n) call quicksort(a(j + 1:n))\n end subroutine quicksort\nend program main\n", "language": "Fortran", "metadata": {"date": 1553159556, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03137.html", "problem_id": "p03137", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03137/input.txt", "sample_output_relpath": "derived/input_output/data/p03137/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03137/Fortran/s434861831.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s434861831", "user_id": "u388927326"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, m, res\n integer, allocatable :: x(:), y(:)\n read (*, *) n, m\n allocate (x(m), y(m - 1))\n read (*, *) x(:)\n\n call quicksort(x)\n y(:) = x(2:) - x(:m - 1)\n if (m - 1 > 1) call quicksort(y)\n\n res = sum(y(:m - n))\n write (*, \"(i0)\") res\n\n contains\n\n recursive subroutine quicksort(a)\n integer, intent(inout) :: a(:)\n integer :: pivot, i, j, k, tmp, n\n real(4) :: r\n n = size(a)\n i = 1\n j = n\n call random_number(r)\n k = 1 + floor(r * n)\n k = max(1, min(k, n))\n pivot = a(k)\n do\n do while (.not. pivot <= a(i))\n i = i + 1\n end do\n do while (.not. a(j) <= pivot)\n j = j - 1\n end do\n if (i >= j) exit\n tmp = a(i)\n a(i) = a(j)\n a(j) = tmp\n i = i + 1\n j = j - 1\n end do\n if (1 < i - 1) call quicksort(a(1:i - 1))\n if (j + 1 < n) call quicksort(a(j + 1:n))\n end subroutine quicksort\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "sample_input": "2 5\n10 12 1 2 14\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03137", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 952, "cpu_time_ms": 40, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s916205879", "group_id": "codeNet:p03137", "input_text": "program main\nimplicit none\ninteger ::n , m\ninteger , allocatable :: x(:), y(:)\ninteger :: i\ninteger :: a\n\nread(*,*) n,m \nallocate(x(m))\nallocate(y(m-1))\nread(*,*) x\ncall bubble(m,x)\ndo i = 1, m-1\n y(i) = x(i+1)-x(i)\nend do\ncall bubble(m-1,y)\n\na = 0\nif( n.ge.m ) then\n a = 0\nelse\n do i = 1, m-n\n a = a + y(i)\n end do\nend if\n\nwrite(*,'(i0)') a\ndeallocate(x)\ndeallocate(y)\n\nstop\ncontains\n subroutine bubble(n,array)\n implicit none\n integer , intent(in) :: n\n integer , intent(inout) :: array(n)\n integer :: i, j\n integer :: t\n\n do i = 1, n-1\n do j = i+1 , n\n if(array(i).gt.array(j))then\n t = array(i)\n array(i) = array(j)\n array(j) = t\n end if\n end do\n end do\n end subroutine bubble\n\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1551133716, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03137.html", "problem_id": "p03137", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03137/input.txt", "sample_output_relpath": "derived/input_output/data/p03137/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03137/Fortran/s916205879.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s916205879", "user_id": "u696547932"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\nimplicit none\ninteger ::n , m\ninteger , allocatable :: x(:), y(:)\ninteger :: i\ninteger :: a\n\nread(*,*) n,m \nallocate(x(m))\nallocate(y(m-1))\nread(*,*) x\ncall bubble(m,x)\ndo i = 1, m-1\n y(i) = x(i+1)-x(i)\nend do\ncall bubble(m-1,y)\n\na = 0\nif( n.ge.m ) then\n a = 0\nelse\n do i = 1, m-n\n a = a + y(i)\n end do\nend if\n\nwrite(*,'(i0)') a\ndeallocate(x)\ndeallocate(y)\n\nstop\ncontains\n subroutine bubble(n,array)\n implicit none\n integer , intent(in) :: n\n integer , intent(inout) :: array(n)\n integer :: i, j\n integer :: t\n\n do i = 1, n-1\n do j = i+1 , n\n if(array(i).gt.array(j))then\n t = array(i)\n array(i) = array(j)\n array(j) = t\n end if\n end do\n end do\n end subroutine bubble\n\n\n\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "sample_input": "2 5\n10 12 1 2 14\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03137", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe will play a one-player game using a number line and N pieces.\n\nFirst, we place each of these pieces at some integer coordinate.\n\nHere, multiple pieces can be placed at the same coordinate.\n\nOur objective is to visit all of the M coordinates X_1, X_2, ..., X_M with these pieces, by repeating the following move:\n\nMove: Choose a piece and let x be its coordinate. Put that piece at coordinate x+1 or x-1.\n\nNote that the coordinates where we initially place the pieces are already regarded as visited.\n\nFind the minimum number of moves required to achieve the objective.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n-10^5 \\leq X_i \\leq 10^5\n\nX_1, X_2, ..., X_M are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_M\n\nOutput\n\nFind the minimum number of moves required to achieve the objective.\n\nSample Input 1\n\n2 5\n10 12 1 2 14\n\nSample Output 1\n\n5\n\nThe objective can be achieved in five moves as follows, and this is the minimum number of moves required.\n\nInitially, put the two pieces at coordinates 1 and 10.\n\nMove the piece at coordinate 1 to 2.\n\nMove the piece at coordinate 10 to 11.\n\nMove the piece at coordinate 11 to 12.\n\nMove the piece at coordinate 12 to 13.\n\nMove the piece at coordinate 13 to 14.\n\nSample Input 2\n\n3 7\n-10 -3 0 9 -100 2 17\n\nSample Output 2\n\n19\n\nSample Input 3\n\n100 1\n-100000\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s212881977", "group_id": "codeNet:p03140", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,i,s\ncharacter(len=100) :: a,b,c\n\nread(*,*) n,a,b,c !ここが入力欄\n\ns = 0\ndo i = 1,n\nif (a(i:i) /= b(i:i) .or. a(i:i) /= c(i:i))then\n s = s + 2\n if (a(i:i) == b(i:i) .or. b(i:i) == c(i:i) .or. c(i:i) == a(i:i))then\n s = s - 1\n end if\nend if\nend do\n\nwrite(*,'(i0)') s\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1548642947, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03140.html", "problem_id": "p03140", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03140/input.txt", "sample_output_relpath": "derived/input_output/data/p03140/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03140/Fortran/s212881977.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s212881977", "user_id": "u454557108"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,i,s\ncharacter(len=100) :: a,b,c\n\nread(*,*) n,a,b,c !ここが入力欄\n\ns = 0\ndo i = 1,n\nif (a(i:i) /= b(i:i) .or. a(i:i) /= c(i:i))then\n s = s + 2\n if (a(i:i) == b(i:i) .or. b(i:i) == c(i:i) .or. c(i:i) == a(i:i))then\n s = s - 1\n end if\nend if\nend do\n\nwrite(*,'(i0)') s\n\nEND PROGRAM ATCODER", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\n\n13", "sample_input": "4\nwest\neast\nwait\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03140", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\n\n13", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 354, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s362619673", "group_id": "codeNet:p03141", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger(8) :: n,i,j,s,t,u,dif\ninteger(8),allocatable :: a(:), b(:), c(:)\n\nread(*,*) n\nallocate(a(n)) ; allocate(b(n)) ; allocate(c(n))\n\ndo i = 1, n\n read(*,*) a(i),b(i)\n c(i) = b(i) + a(i)\nend do\n\ndo i = 1, n\n do j = i+1, n\n if (c(j) > c(i))then\n s = c(i) ; t = a(i) ; u = b(i)\n c(i) = c(j) ; a(i) = a(j) ; b(i) = b(j)\n c(j) = s ; a(j) = t ; b(j) = u\n end if\n end do\nend do\n\ndif = 0\nif (mod(n,2) == 0)then\n do i = 1, n-1, 2\n dif = dif + a(i) - b(i+1)\n end do\nelse\n do i = 1, n-2, 2\n dif = dif + a(i) - b(i+1)\n end do\n dif = dif + a(n)\nend if\n\ndeallocate(a) ; deallocate(b) ; deallocate(c)\n\nwrite(*,'(i0)') dif\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1548647636, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03141.html", "problem_id": "p03141", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03141/input.txt", "sample_output_relpath": "derived/input_output/data/p03141/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03141/Fortran/s362619673.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s362619673", "user_id": "u454557108"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger(8) :: n,i,j,s,t,u,dif\ninteger(8),allocatable :: a(:), b(:), c(:)\n\nread(*,*) n\nallocate(a(n)) ; allocate(b(n)) ; allocate(c(n))\n\ndo i = 1, n\n read(*,*) a(i),b(i)\n c(i) = b(i) + a(i)\nend do\n\ndo i = 1, n\n do j = i+1, n\n if (c(j) > c(i))then\n s = c(i) ; t = a(i) ; u = b(i)\n c(i) = c(j) ; a(i) = a(j) ; b(i) = b(j)\n c(j) = s ; a(j) = t ; b(j) = u\n end if\n end do\nend do\n\ndif = 0\nif (mod(n,2) == 0)then\n do i = 1, n-1, 2\n dif = dif + a(i) - b(i+1)\n end do\nelse\n do i = 1, n-2, 2\n dif = dif + a(i) - b(i+1)\n end do\n dif = dif + a(n)\nend if\n\ndeallocate(a) ; deallocate(b) ; deallocate(c)\n\nwrite(*,'(i0)') dif\n\nEND PROGRAM ATCODER", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "sample_input": "3\n10 10\n20 20\n30 30\n"}, "reference_outputs": ["20\n"], "source_document_id": "p03141", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 754, "cpu_time_ms": 2103, "memory_kb": 2560}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s568421270", "group_id": "codeNet:p03146", "input_text": "program main\n implicit none\n integer s1\n integer:: s(1000000)\n integer i,j\n read(*,*)s1\n s(1)=s1\n do i=1,1000000\n if(mod(s(i),2)==0)then\n s(i+1)=s(i)/2\n else\n s(i+1)=3*s(i)+1\n endif\n do j=1,i\n if(s(i+1)==s(j))then\n write(*,*)i+1\n goto 100\n endif\n enddo\n enddo\n100 continue\nend program main\n", "language": "Fortran", "metadata": {"date": 1548036416, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03146.html", "problem_id": "p03146", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03146/input.txt", "sample_output_relpath": "derived/input_output/data/p03146/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03146/Fortran/s568421270.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568421270", "user_id": "u539011156"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer s1\n integer:: s(1000000)\n integer i,j\n read(*,*)s1\n s(1)=s1\n do i=1,1000000\n if(mod(s(i),2)==0)then\n s(i+1)=s(i)/2\n else\n s(i+1)=3*s(i)+1\n endif\n do j=1,i\n if(s(i+1)==s(j))then\n write(*,*)i+1\n goto 100\n endif\n enddo\n enddo\n100 continue\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s679324248", "group_id": "codeNet:p03147", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,x\n real(8)::a,b\n integer(8),allocatable ::h(:)\n \n read(*,*) n\n allocate(h(n))\n read(*,*)h\n x=0\n m=0\n do i=1,100\n do j=1,100\n if (h(j)>0) then\n x=1\n h(j)=h(j)-1\n else if (h(j)==0 .and. x==1) then\n m=m+1\n x=0\n end if\n end do\n if (x==1) then\n m=m+1\n x=0\n end if\n end do\n write(*,*) m\n deallocate(h)\n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1591389407, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03147.html", "problem_id": "p03147", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03147/input.txt", "sample_output_relpath": "derived/input_output/data/p03147/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03147/Fortran/s679324248.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s679324248", "user_id": "u713568912"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,x\n real(8)::a,b\n integer(8),allocatable ::h(:)\n \n read(*,*) n\n allocate(h(n))\n read(*,*)h\n x=0\n m=0\n do i=1,100\n do j=1,100\n if (h(j)>0) then\n x=1\n h(j)=h(j)-1\n else if (h(j)==0 .and. x==1) then\n m=m+1\n x=0\n end if\n end do\n if (x==1) then\n m=m+1\n x=0\n end if\n end do\n write(*,*) m\n deallocate(h)\n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "sample_input": "4\n1 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03147", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 538, "cpu_time_ms": 2103, "memory_kb": 476}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s428989285", "group_id": "codeNet:p03148", "input_text": "program test\nimplicit none\ninteger(8) :: i=0,j=0,n=0,k=0,t(10000)=0,d(10000)=0,dummy(10000)=0,num=0\ninteger(8) :: tt(10000)=0,dd(10000)=0,lost(10000)=0,lost_cum(10000)=0,get(10000)=0,get_cum(10000)=0,total(10000)=0,sumi_a(10000)=0,sumi_b(10000)=0\ninteger(8) :: kind_max_a(10000)=0,kind_max_b(10000)=0,kind_count=0,lost_count=0,get_count=0,count=0\n\nread(*,*) n,k\ndo i=1,n\n\tread(*,*) t(i),d(i)\nenddo\n\nif(n==k) then\n\tgoto 100\nelse\n\t!まずは降順に並べる\n\tcall heapsort_down(n,d(1:n),t(1:n))\n\t\n\t!1～k番目が暫定食べる、k+1～n番目が食べない\n\ttt(1:n) = t(1:n)\n\tdd(1:n) = d(1:n)\n\t\n\t!食べるグループで、各種類の最高値を計算\n\tdo i=1,k\n\t\tkind_max_a(tt(i)) = max(kind_max_a(tt(i)),dd(i))\n\tenddo\n\t\n\t!各種類の最高値を1個だけ残して、それ以外は新たな種類の寿司に置換される可能性がある\n\tlost_count = 0\n\tdo i=1,k\n\t\tif(dd(i) == kind_max_a(tt(i)) .and. sumi_a(tt(i)) == 0 ) then\n\t\t\tsumi_a(tt(i)) = 1\n\t\telse\n\t\t\tlost_count=lost_count+1\n\t\t\tlost(lost_count) = dd(i)\n\t\tendif\n\tenddo\n\t\n\tif(lost_count == 0)then\n\t\tgoto 100\n\tendif\n\t\n\t!昇順ソートをかける\n\tcall heapsort_up(lost_count,lost(1:lost_count),dummy(1:lost_count))\n\t\n\t!失う価値の累積和\n\tdo i=1,lost_count\n\t\tif(i == 1) then\n\t\t\tlost_cum(i) = lost(1)\n\t\telse\n\t\t\tlost_cum(i) = lost_cum(i-1) + lost(i)\n\t\tendif\n\tenddo\n\t\n\t!食べるグループの種類は何種類？\n\tcall heapsort_up(k,tt(1:k),dd(1:k))\n\tkind_count = 1\n\tif(k>=2)then\n\t\tdo i =2,k\n\t\t\tif(tt(i) .ne. tt(i-1))then\n\t\t\t kind_count = kind_count + 1\n\t\t\tendif\n\t\tenddo\n\tendif\n\t\n\t!食べないグループで、各種類の最高値を列挙\n\tdo i=k+1,n\n\t\tkind_max_b(tt(i)) = max(kind_max_b(tt(i)),dd(i))\n\tenddo\n\t\n\t!食べないグループで、各種類の最高値にあたり、かつ食べるグループにない寿司が置換に使われる可能性がある\n\tget_count = 0\n\tdo i=k+1,n\n\t\tif((dd(i) == kind_max_b(tt(i))) .and. kind_max_a(tt(i)) == 0 .and. sumi_a(tt(i)) == 0) then\n\t\t\tget_count = get_count + 1\n\t\t\tget(get_count) = dd(i)\n\t\t\tsumi_a(tt(i)) = 1\n\t\tendif\n\tenddo\n\t\n\tif(get_count == 0)then\n\t\tgoto 100\n\tendif\n\t\n\t!降順ソートをかける\n\tcall heapsort_down(get_count,get(1:get_count),dummy(1:get_count))\n\t\n\t!得る価値\n\tdo i=1,get_count\n\t\tif(i == 1) then\n\t\t\tget_cum(i) = get(1) + 2*(kind_count+i)-1\n\t\telse\n\t\t\tget_cum(i) = get_cum(i-1) + get(i) + 2*(kind_count+i)-1\n\t\tendif\n\tenddo\n\t\n\tcount = min(lost_count,get_count)\n\t\n\tdo i = 1,count\n\t\ttotal(i) = get_cum(i) - lost_cum(i)\n\tenddo\n\t\n\twrite(*,*) sum(d(1:k))+ kind_count*kind_count+ max(0,maxval(total(1:count)))\nendif\n\n!最初の取り方から変更ない場合\nif(1 == 0)then\n100 continue\n\tcall heapsort_up(n,t(1:k),d(1:k))\n\tnum = 1\n\tif(k>=2)then\n\t\tdo i =2,k\n\t\t\tif(t(i) .ne. t(i-1))then\n\t\t\t num = num + 1\n\t\t\tendif\n\t\tenddo\n\tendif\n\twrite(*,*) sum(d(1:k)) + num*num\nendif\n\ncontains\n \nsubroutine heapsort_down(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) > y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 > y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_down\n\nsubroutine heapsort_up(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) < y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 < y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_up\n\nend program", "language": "Fortran", "metadata": {"date": 1551113316, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03148.html", "problem_id": "p03148", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03148/input.txt", "sample_output_relpath": "derived/input_output/data/p03148/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03148/Fortran/s428989285.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s428989285", "user_id": "u454703763"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: i=0,j=0,n=0,k=0,t(10000)=0,d(10000)=0,dummy(10000)=0,num=0\ninteger(8) :: tt(10000)=0,dd(10000)=0,lost(10000)=0,lost_cum(10000)=0,get(10000)=0,get_cum(10000)=0,total(10000)=0,sumi_a(10000)=0,sumi_b(10000)=0\ninteger(8) :: kind_max_a(10000)=0,kind_max_b(10000)=0,kind_count=0,lost_count=0,get_count=0,count=0\n\nread(*,*) n,k\ndo i=1,n\n\tread(*,*) t(i),d(i)\nenddo\n\nif(n==k) then\n\tgoto 100\nelse\n\t!まずは降順に並べる\n\tcall heapsort_down(n,d(1:n),t(1:n))\n\t\n\t!1～k番目が暫定食べる、k+1～n番目が食べない\n\ttt(1:n) = t(1:n)\n\tdd(1:n) = d(1:n)\n\t\n\t!食べるグループで、各種類の最高値を計算\n\tdo i=1,k\n\t\tkind_max_a(tt(i)) = max(kind_max_a(tt(i)),dd(i))\n\tenddo\n\t\n\t!各種類の最高値を1個だけ残して、それ以外は新たな種類の寿司に置換される可能性がある\n\tlost_count = 0\n\tdo i=1,k\n\t\tif(dd(i) == kind_max_a(tt(i)) .and. sumi_a(tt(i)) == 0 ) then\n\t\t\tsumi_a(tt(i)) = 1\n\t\telse\n\t\t\tlost_count=lost_count+1\n\t\t\tlost(lost_count) = dd(i)\n\t\tendif\n\tenddo\n\t\n\tif(lost_count == 0)then\n\t\tgoto 100\n\tendif\n\t\n\t!昇順ソートをかける\n\tcall heapsort_up(lost_count,lost(1:lost_count),dummy(1:lost_count))\n\t\n\t!失う価値の累積和\n\tdo i=1,lost_count\n\t\tif(i == 1) then\n\t\t\tlost_cum(i) = lost(1)\n\t\telse\n\t\t\tlost_cum(i) = lost_cum(i-1) + lost(i)\n\t\tendif\n\tenddo\n\t\n\t!食べるグループの種類は何種類？\n\tcall heapsort_up(k,tt(1:k),dd(1:k))\n\tkind_count = 1\n\tif(k>=2)then\n\t\tdo i =2,k\n\t\t\tif(tt(i) .ne. tt(i-1))then\n\t\t\t kind_count = kind_count + 1\n\t\t\tendif\n\t\tenddo\n\tendif\n\t\n\t!食べないグループで、各種類の最高値を列挙\n\tdo i=k+1,n\n\t\tkind_max_b(tt(i)) = max(kind_max_b(tt(i)),dd(i))\n\tenddo\n\t\n\t!食べないグループで、各種類の最高値にあたり、かつ食べるグループにない寿司が置換に使われる可能性がある\n\tget_count = 0\n\tdo i=k+1,n\n\t\tif((dd(i) == kind_max_b(tt(i))) .and. kind_max_a(tt(i)) == 0 .and. sumi_a(tt(i)) == 0) then\n\t\t\tget_count = get_count + 1\n\t\t\tget(get_count) = dd(i)\n\t\t\tsumi_a(tt(i)) = 1\n\t\tendif\n\tenddo\n\t\n\tif(get_count == 0)then\n\t\tgoto 100\n\tendif\n\t\n\t!降順ソートをかける\n\tcall heapsort_down(get_count,get(1:get_count),dummy(1:get_count))\n\t\n\t!得る価値\n\tdo i=1,get_count\n\t\tif(i == 1) then\n\t\t\tget_cum(i) = get(1) + 2*(kind_count+i)-1\n\t\telse\n\t\t\tget_cum(i) = get_cum(i-1) + get(i) + 2*(kind_count+i)-1\n\t\tendif\n\tenddo\n\t\n\tcount = min(lost_count,get_count)\n\t\n\tdo i = 1,count\n\t\ttotal(i) = get_cum(i) - lost_cum(i)\n\tenddo\n\t\n\twrite(*,*) sum(d(1:k))+ kind_count*kind_count+ max(0,maxval(total(1:count)))\nendif\n\n!最初の取り方から変更ない場合\nif(1 == 0)then\n100 continue\n\tcall heapsort_up(n,t(1:k),d(1:k))\n\tnum = 1\n\tif(k>=2)then\n\t\tdo i =2,k\n\t\t\tif(t(i) .ne. t(i-1))then\n\t\t\t num = num + 1\n\t\t\tendif\n\t\tenddo\n\tendif\n\twrite(*,*) sum(d(1:k)) + num*num\nendif\n\ncontains\n \nsubroutine heapsort_down(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) > y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 > y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_down\n\nsubroutine heapsort_up(n,y1,y2)\n \n\timplicit none\n\tinteger(8),intent(in) :: n\n\tinteger(8),intent(inout) :: y1(1:n)\n\tinteger(8),intent(inout) :: y2(1:n)\n\tinteger(8) :: i,k,j,l\n\tinteger(8) :: t1,t2\n\t\n\tl = n/2+1\n\tk = n\n \n\tdo while (k /= 1)\n\t\t if(l > 1) then\n\t\t\t\tl = l-1\n\t\t\t\tt1 = y1(l)\n\t\t\t\tt2 = y2(l)\n\t\t\t\t\n\t\t else\n\t\t\t\tt1 = y1(k)\n\t\t\t\tt2 = y2(k)\n\t\t\t\ty1(k) = y1(1)\n\t\t\t\ty2(k) = y2(1)\n\t\t\t\tk = k-1\n\t\t\t\tif(k == 1) then\n\t\t\t\t\t y1(1) = t1\n\t\t\t\t\t y2(1) = t2\n\t\t\t\t\t exit\n\t\t\t\tendif\n\t\t endif\n \n\t\t i = l\n\t\t j = l+l\n \n\t\t do while(j <= k)\n\t\t\t\tif(j < k) then\n\t\t\t\t\t if(y1(j) < y1(j+1)) j = j+1\n\t\t\t\tendif\n\t\t\t\t\n\t\t\t\tif (t1 < y1(j)) then\n\t\t\t\t\t y1(i) = y1(j)\n\t\t\t\t\t y2(i) = y2(j)\n\t\t\t\t\t i = j\n\t\t\t\t\t j = j+j\n\t\t\t\telse\n\t\t\t\t\t j = k+1\n\t\t\t\tendif\n\t\t \n\t\t enddo\n\t\t \n\t\t y1(i) = t1\n\t\t y2(i) = t2\n\t\n\tenddo\n\treturn\n \nend subroutine heapsort_up\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4443, "cpu_time_ms": 111, "memory_kb": 732}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s663821351", "group_id": "codeNet:p03148", "input_text": "program main\nimplicit None\n\tinteger(8)::n,k,i,p,s,u,f,q\n\tinteger(8),allocatable::t(:),d(:),c(:),e(:)\n\t\n\tread*,n,k\n\tallocate(t(n),d(n),c(n),e(n))\n\t\n\tdo i = 1,n\n\t\tread*,t(i),d(i)\n\t\te(t(i)) = e(t(i))+1\n\tenddo\n\t\n\tcall h2(d,t,n)\n\td(1:n) = d(n:1:-1)\n\tt(1:n) = t(n:1:-1)\n\t\n\tp =0\n\tc =0\n\tdo i = 1,k\n\t\tp = p + d(i)\n\t\tc(t(i)) = c(t(i)) + 1\n\tenddo\n\t\n\ts = 0\n\tdo i = 1,n\n\t\tif(c(i) > 0) s = s+1\n\tenddo\n\tq = p +s*s\n\t\n\tu = k\n\tf = k+1\n\t\n\tdo i = f,n\n\t\tif(c(t(i)) /= 0)cycle\n\t\tdo\n\t\t\tif(u == 0)exit\n\t\t\tif(c(t(u)) == 1)then\n\t\t\t\tu = u-1\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\t\tif(u == 0)exit\n\t\t\tc(t(u)) = c(t(u))-1\n\t\t\tc(t(i)) = c(t(i))+1\n\t\t\tp = p-d(u)+d(i)\n\t\t\ts = s+1\n\t\t\tu = u-1\n\t\tif(q < p+s*s) q = p+s*s\n\tenddo\n\t\n\tprint \"(i0)\",q\nend program main\n\nsubroutine h2(a,b,n)\nimplicit None\n\tinteger(8)::a(n),b(n),x,y\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);y = b(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie);y = b(ie)\n\t\ta(ie) = a(1);b(ie) = b(1)\n\t\ta(1) = x;b(1) = y\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2", "language": "Fortran", "metadata": {"date": 1548020107, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03148.html", "problem_id": "p03148", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03148/input.txt", "sample_output_relpath": "derived/input_output/data/p03148/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03148/Fortran/s663821351.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663821351", "user_id": "u900266249"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,k,i,p,s,u,f,q\n\tinteger(8),allocatable::t(:),d(:),c(:),e(:)\n\t\n\tread*,n,k\n\tallocate(t(n),d(n),c(n),e(n))\n\t\n\tdo i = 1,n\n\t\tread*,t(i),d(i)\n\t\te(t(i)) = e(t(i))+1\n\tenddo\n\t\n\tcall h2(d,t,n)\n\td(1:n) = d(n:1:-1)\n\tt(1:n) = t(n:1:-1)\n\t\n\tp =0\n\tc =0\n\tdo i = 1,k\n\t\tp = p + d(i)\n\t\tc(t(i)) = c(t(i)) + 1\n\tenddo\n\t\n\ts = 0\n\tdo i = 1,n\n\t\tif(c(i) > 0) s = s+1\n\tenddo\n\tq = p +s*s\n\t\n\tu = k\n\tf = k+1\n\t\n\tdo i = f,n\n\t\tif(c(t(i)) /= 0)cycle\n\t\tdo\n\t\t\tif(u == 0)exit\n\t\t\tif(c(t(u)) == 1)then\n\t\t\t\tu = u-1\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\t\tif(u == 0)exit\n\t\t\tc(t(u)) = c(t(u))-1\n\t\t\tc(t(i)) = c(t(i))+1\n\t\t\tp = p-d(u)+d(i)\n\t\t\ts = s+1\n\t\t\tu = u-1\n\t\tif(q < p+s*s) q = p+s*s\n\tenddo\n\t\n\tprint \"(i0)\",q\nend program main\n\nsubroutine h2(a,b,n)\nimplicit None\n\tinteger(8)::a(n),b(n),x,y\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);y = b(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie);y = b(ie)\n\t\ta(ie) = a(1);b(ie) = b(1)\n\t\ta(1) = x;b(1) = y\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\tb(i0) = b(i1);b(i1) = y\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1437, "cpu_time_ms": 85, "memory_kb": 4088}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s164014192", "group_id": "codeNet:p03149", "input_text": "program sample\n implicit none\n\n integer(8) :: a,b,c,d,x(0:9)\n\n \n\n ! 整数を読み込む\n read(*,*) a,b,c,d\n x(:)=0\n x(a)=x(a)+1\n x(b)=x(b)+1\n x(c)=x(c)+1\n x(d)=x(d)+1\n if(x(1)==1 .and. x(4)==1 .and. x(7)==1 .and. x(9)==1)then\n write(*,*)'YES'\n else\n write(*,*)'NO'\n end if\n \n\n stop\nend program sample\n", "language": "Fortran", "metadata": {"date": 1596829876, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03149.html", "problem_id": "p03149", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03149/input.txt", "sample_output_relpath": "derived/input_output/data/p03149/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03149/Fortran/s164014192.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s164014192", "user_id": "u713568912"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program sample\n implicit none\n\n integer(8) :: a,b,c,d,x(0:9)\n\n \n\n ! 整数を読み込む\n read(*,*) a,b,c,d\n x(:)=0\n x(a)=x(a)+1\n x(b)=x(b)+1\n x(c)=x(c)+1\n x(d)=x(d)+1\n if(x(1)==1 .and. x(4)==1 .and. x(7)==1 .and. x(9)==1)then\n write(*,*)'YES'\n else\n write(*,*)'NO'\n end if\n \n\n stop\nend program sample\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "sample_input": "1 7 9 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03149", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s231235958", "group_id": "codeNet:p03150", "input_text": "program prob2\n implicit none\n integer::i,j,k,L\n character(len=100)::S\n read(*,*) S\n L = len_trim(S)\n if(S(1:7) .eq. \"keyence\")then\n write(*,*) \"YES\"\n stop\n else if(S(L-6:L) .eq. \"keyence\")then\n write(*,*) \"YES\"\n stop\n else if(S(1:1) .eq. \"k\" .and. S(2:2) .ne. \"e\") then\n if(S(L-5:L) .eq. \"eyence\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:2) .eq. \"ke\" .and. S(3:3) .ne. \"y\") then\n if(S(L-4:L) .eq. \"yence\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:3) .eq. \"key\" .and. S(4:4) .ne. \"e\") then\n if(S(L-3:L) .eq. \"ence\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:4) .eq. \"keye\" .and. S(5:5) .ne. \"n\") then\n if(S(L-2:L) .eq. \"nce\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:5) .eq. \"keyen\" .and. S(6:6) .ne. \"c\") then\n if(S(L-1:L) .eq. \"ce\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:6) .eq. \"keyenc\" .and. S(7:7) .ne. \"e\") then\n if(S(L:L) .eq. \"e\") then\n write(*,*) \"YES\"\n stop\n end if\n end if\n\n write(*,*) \"NO\"\n stop\nend program prob2", "language": "Fortran", "metadata": {"date": 1591989877, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03150.html", "problem_id": "p03150", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03150/input.txt", "sample_output_relpath": "derived/input_output/data/p03150/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03150/Fortran/s231235958.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231235958", "user_id": "u841856382"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program prob2\n implicit none\n integer::i,j,k,L\n character(len=100)::S\n read(*,*) S\n L = len_trim(S)\n if(S(1:7) .eq. \"keyence\")then\n write(*,*) \"YES\"\n stop\n else if(S(L-6:L) .eq. \"keyence\")then\n write(*,*) \"YES\"\n stop\n else if(S(1:1) .eq. \"k\" .and. S(2:2) .ne. \"e\") then\n if(S(L-5:L) .eq. \"eyence\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:2) .eq. \"ke\" .and. S(3:3) .ne. \"y\") then\n if(S(L-4:L) .eq. \"yence\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:3) .eq. \"key\" .and. S(4:4) .ne. \"e\") then\n if(S(L-3:L) .eq. \"ence\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:4) .eq. \"keye\" .and. S(5:5) .ne. \"n\") then\n if(S(L-2:L) .eq. \"nce\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:5) .eq. \"keyen\" .and. S(6:6) .ne. \"c\") then\n if(S(L-1:L) .eq. \"ce\") then\n write(*,*) \"YES\"\n stop\n end if\n else if(S(1:6) .eq. \"keyenc\" .and. S(7:7) .ne. \"e\") then\n if(S(L:L) .eq. \"e\") then\n write(*,*) \"YES\"\n stop\n end if\n end if\n\n write(*,*) \"NO\"\n stop\nend program prob2", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string is called a KEYENCE string when it can be changed to keyence by removing its contiguous substring (possibly empty) only once.\n\nGiven a string S consisting of lowercase English letters, determine if S is a KEYENCE string.\n\nConstraints\n\nThe length of S is between 7 and 100 (inclusive).\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a KEYENCE string, print YES; otherwise, print NO.\n\nSample Input 1\n\nkeyofscience\n\nSample Output 1\n\nYES\n\nkeyence is an abbreviation of key of science.\n\nSample Input 2\n\nmpyszsbznf\n\nSample Output 2\n\nNO\n\nSample Input 3\n\nashlfyha\n\nSample Output 3\n\nNO\n\nSample Input 4\n\nkeyence\n\nSample Output 4\n\nYES", "sample_input": "keyofscience\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03150", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string is called a KEYENCE string when it can be changed to keyence by removing its contiguous substring (possibly empty) only once.\n\nGiven a string S consisting of lowercase English letters, determine if S is a KEYENCE string.\n\nConstraints\n\nThe length of S is between 7 and 100 (inclusive).\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a KEYENCE string, print YES; otherwise, print NO.\n\nSample Input 1\n\nkeyofscience\n\nSample Output 1\n\nYES\n\nkeyence is an abbreviation of key of science.\n\nSample Input 2\n\nmpyszsbznf\n\nSample Output 2\n\nNO\n\nSample Input 3\n\nashlfyha\n\nSample Output 3\n\nNO\n\nSample Input 4\n\nkeyence\n\nSample Output 4\n\nYES", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1264, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s480459702", "group_id": "codeNet:p03151", "input_text": "program exam\n implicit none\n\n integer(8) :: n, i, div, ans\n integer(8), allocatable :: a(:), b(:), d(:)\n\n read(*,*) n\n allocate(a(n))\n allocate(b(n))\n allocate(d(n))\n\n read(*,*) a\n read(*,*) b\n\n \n do i = 1, n\n d(i) = b(i) - a(i)\n end do\n\n if(sum(d) > 0) then\n ans = -1\n else\n ans = 0\n div = 0\n do i = 1, n\n if(d(i) > 0) then\n ans = ans + 1\n div = div + d(i)\n end if\n end do\n\n call heapsort(d)\n\n do i = 1, n\n if (div <= 0) then\n exit\n else\n div = div + d(i)\n ans = ans + 1\n end if\n\n end do\n \n end if\n \n write(*,*) ans\n\n deallocate(a, b, d)\n\n stop\n\ncontains\n subroutine heapsort(array)\n implicit none\n integer(8), intent(inout) :: array(:)\n \n integer(8) :: i,k,j,l\n double precision :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort\n \nend program exam\n\n \n \n", "language": "Fortran", "metadata": {"date": 1591406846, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03151.html", "problem_id": "p03151", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03151/input.txt", "sample_output_relpath": "derived/input_output/data/p03151/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03151/Fortran/s480459702.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s480459702", "user_id": "u979474608"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program exam\n implicit none\n\n integer(8) :: n, i, div, ans\n integer(8), allocatable :: a(:), b(:), d(:)\n\n read(*,*) n\n allocate(a(n))\n allocate(b(n))\n allocate(d(n))\n\n read(*,*) a\n read(*,*) b\n\n \n do i = 1, n\n d(i) = b(i) - a(i)\n end do\n\n if(sum(d) > 0) then\n ans = -1\n else\n ans = 0\n div = 0\n do i = 1, n\n if(d(i) > 0) then\n ans = ans + 1\n div = div + d(i)\n end if\n end do\n\n call heapsort(d)\n\n do i = 1, n\n if (div <= 0) then\n exit\n else\n div = div + d(i)\n ans = ans + 1\n end if\n\n end do\n \n end if\n \n write(*,*) ans\n\n deallocate(a, b, d)\n\n stop\n\ncontains\n subroutine heapsort(array)\n implicit none\n integer(8), intent(inout) :: array(:)\n \n integer(8) :: i,k,j,l\n double precision :: t\n \n if(n <= 0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n == 1)return\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j <= k)\n if(j < k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n\n return\nend subroutine heapsort\n \nend program exam\n\n \n \n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA university student, Takahashi, has to take N examinations and pass all of them.\nCurrently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.\n\nTakahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.\n\nFor Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:\n\nThe sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.\n\nFor every i, B_i \\leq C_i holds.\n\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nA_i and B_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N}\nB_1 B_2 ... B_{N}\n\nOutput\n\nPrint the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nSample Input 1\n\n3\n2 3 5\n3 4 1\n\nSample Output 1\n\n3\n\n(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.\nThe minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:\n\n(C_1, C_2, C_3) = (3, 5, 2)\n\nSample Input 2\n\n3\n2 3 3\n2 2 1\n\nSample Output 2\n\n0\n\nIn this case, he has to do nothing in order to pass all the exams.\n\nSample Input 3\n\n3\n17 7 1\n25 6 14\n\nSample Output 3\n\n-1\n\nIn this case, no matter what is done, he cannot pass all the exams.\n\nSample Input 4\n\n12\n757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604\n74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212\n\nSample Output 4\n\n5", "sample_input": "3\n2 3 5\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03151", "source_text": "Score : 400 points\n\nProblem Statement\n\nA university student, Takahashi, has to take N examinations and pass all of them.\nCurrently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.\n\nTakahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.\n\nFor Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:\n\nThe sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.\n\nFor every i, B_i \\leq C_i holds.\n\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nA_i and B_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N}\nB_1 B_2 ... B_{N}\n\nOutput\n\nPrint the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nSample Input 1\n\n3\n2 3 5\n3 4 1\n\nSample Output 1\n\n3\n\n(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.\nThe minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:\n\n(C_1, C_2, C_3) = (3, 5, 2)\n\nSample Input 2\n\n3\n2 3 3\n2 2 1\n\nSample Output 2\n\n0\n\nIn this case, he has to do nothing in order to pass all the exams.\n\nSample Input 3\n\n3\n17 7 1\n25 6 14\n\nSample Output 3\n\n-1\n\nIn this case, no matter what is done, he cannot pass all the exams.\n\nSample Input 4\n\n12\n757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604\n74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212\n\nSample Output 4\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1539, "cpu_time_ms": 75, "memory_kb": 3072}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s035037322", "group_id": "codeNet:p03151", "input_text": "program prob6\n implicit none\n integer(16)::N, i, j, ans, cnt, maxd, maxa, sumd\n integer(16), allocatable::A(:), B(:), c(:), d(:)\n read(*,*) N\n allocate(A(N))\n allocate(B(N))\n allocate(c(N))\n allocate(d(N))\n read(*,*) A\n read(*,*) B\n\n d = 0\n cnt = 0\n j = 1\n do i = 1, N\n if(B(i) - A(i) > 0) then\n d(i) = B(i) - A(i)\n cnt = cnt + 1\n else if(B(i) - A(i) < 0) then\n c(j) = B(i) - A(i)\n j = j+1\n end if\n end do\n\n if(sum(d) == 0)then\n write(*,*) 0\n stop\n end if\n if(sum(B) > sum(A))then\n write(*,*) -1\n stop\n end if\n sumd = sum(d)\n call heapsort(j-1,c)\n\n do i = 1, j-1\n sumd = sumd + c(i)\n cnt = cnt + 1\n if(sumd <= 0) then\n write(*,*) cnt\n stop\n end if\n end do\n\n\n write(*,*) cnt\n\n deallocate(A)\n deallocate(B)\n deallocate(c)\n deallocate(d)\n stop\n contains\n subroutine heapsort(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n double precision :: t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort\nend program prob6", "language": "Fortran", "metadata": {"date": 1591389432, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03151.html", "problem_id": "p03151", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03151/input.txt", "sample_output_relpath": "derived/input_output/data/p03151/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03151/Fortran/s035037322.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035037322", "user_id": "u841856382"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program prob6\n implicit none\n integer(16)::N, i, j, ans, cnt, maxd, maxa, sumd\n integer(16), allocatable::A(:), B(:), c(:), d(:)\n read(*,*) N\n allocate(A(N))\n allocate(B(N))\n allocate(c(N))\n allocate(d(N))\n read(*,*) A\n read(*,*) B\n\n d = 0\n cnt = 0\n j = 1\n do i = 1, N\n if(B(i) - A(i) > 0) then\n d(i) = B(i) - A(i)\n cnt = cnt + 1\n else if(B(i) - A(i) < 0) then\n c(j) = B(i) - A(i)\n j = j+1\n end if\n end do\n\n if(sum(d) == 0)then\n write(*,*) 0\n stop\n end if\n if(sum(B) > sum(A))then\n write(*,*) -1\n stop\n end if\n sumd = sum(d)\n call heapsort(j-1,c)\n\n do i = 1, j-1\n sumd = sumd + c(i)\n cnt = cnt + 1\n if(sumd <= 0) then\n write(*,*) cnt\n stop\n end if\n end do\n\n\n write(*,*) cnt\n\n deallocate(A)\n deallocate(B)\n deallocate(c)\n deallocate(d)\n stop\n contains\n subroutine heapsort(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n double precision :: t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort\nend program prob6", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA university student, Takahashi, has to take N examinations and pass all of them.\nCurrently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.\n\nTakahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.\n\nFor Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:\n\nThe sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.\n\nFor every i, B_i \\leq C_i holds.\n\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nA_i and B_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N}\nB_1 B_2 ... B_{N}\n\nOutput\n\nPrint the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nSample Input 1\n\n3\n2 3 5\n3 4 1\n\nSample Output 1\n\n3\n\n(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.\nThe minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:\n\n(C_1, C_2, C_3) = (3, 5, 2)\n\nSample Input 2\n\n3\n2 3 3\n2 2 1\n\nSample Output 2\n\n0\n\nIn this case, he has to do nothing in order to pass all the exams.\n\nSample Input 3\n\n3\n17 7 1\n25 6 14\n\nSample Output 3\n\n-1\n\nIn this case, no matter what is done, he cannot pass all the exams.\n\nSample Input 4\n\n12\n757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604\n74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212\n\nSample Output 4\n\n5", "sample_input": "3\n2 3 5\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03151", "source_text": "Score : 400 points\n\nProblem Statement\n\nA university student, Takahashi, has to take N examinations and pass all of them.\nCurrently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.\n\nTakahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.\n\nFor Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:\n\nThe sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.\n\nFor every i, B_i \\leq C_i holds.\n\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nA_i and B_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N}\nB_1 B_2 ... B_{N}\n\nOutput\n\nPrint the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nSample Input 1\n\n3\n2 3 5\n3 4 1\n\nSample Output 1\n\n3\n\n(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.\nThe minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:\n\n(C_1, C_2, C_3) = (3, 5, 2)\n\nSample Input 2\n\n3\n2 3 3\n2 2 1\n\nSample Output 2\n\n0\n\nIn this case, he has to do nothing in order to pass all the exams.\n\nSample Input 3\n\n3\n17 7 1\n25 6 14\n\nSample Output 3\n\n-1\n\nIn this case, no matter what is done, he cannot pass all the exams.\n\nSample Input 4\n\n12\n757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604\n74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212\n\nSample Output 4\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2102, "cpu_time_ms": 93, "memory_kb": 6272}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s405036153", "group_id": "codeNet:p03151", "input_text": "program main\nimplicit None\ninteger(8)::n,p,q,i\ninteger(8),allocatable::a(:),b(:)\n\t\n\tread*,n\n\tallocate(a(n),b(n))\n\tread*,a\n\tread*,b\n\t\n\ta = a-b\n\t\n\tif(sum(a) < 0)then\n\t\tprint 101,-1\n\t\tstop\n\tendif\n\t\n\tcall h2(a,n)\n\t\n\tp = 0\n\tq = 0\n\tdo i = 1,n\n\t\tif(a(i) >= 0)then\n\t\t\tp = i-1\n\t\t\texit\n\t\tendif\n\t\tq = q + a(i)\n\tenddo\n\t\n\tif(p == 0)then\n\t\tprint 101,p\n\t\tstop\n\tendif\n\t\n\tdo i = n,1,-1\n\t\tq = q + a(i)\n\t\tp = p + 1\n\t\tif(q >= 0)then\n\t\t\texit\n\t\tendif\n\tenddo\n\t\n\tprint 101,p\n\t\n101 format(i0)\nend program main\n\nsubroutine h2(a,n)\nimplicit None\n\tinteger(8)::a(n),x\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie)\n\t\ta(ie) = a(1)\n\t\ta(1) = x\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2", "language": "Fortran", "metadata": {"date": 1547416013, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03151.html", "problem_id": "p03151", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03151/input.txt", "sample_output_relpath": "derived/input_output/data/p03151/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03151/Fortran/s405036153.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405036153", "user_id": "u900266249"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\nimplicit None\ninteger(8)::n,p,q,i\ninteger(8),allocatable::a(:),b(:)\n\t\n\tread*,n\n\tallocate(a(n),b(n))\n\tread*,a\n\tread*,b\n\t\n\ta = a-b\n\t\n\tif(sum(a) < 0)then\n\t\tprint 101,-1\n\t\tstop\n\tendif\n\t\n\tcall h2(a,n)\n\t\n\tp = 0\n\tq = 0\n\tdo i = 1,n\n\t\tif(a(i) >= 0)then\n\t\t\tp = i-1\n\t\t\texit\n\t\tendif\n\t\tq = q + a(i)\n\tenddo\n\t\n\tif(p == 0)then\n\t\tprint 101,p\n\t\tstop\n\tendif\n\t\n\tdo i = n,1,-1\n\t\tq = q + a(i)\n\t\tp = p + 1\n\t\tif(q >= 0)then\n\t\t\texit\n\t\tendif\n\tenddo\n\t\n\tprint 101,p\n\t\n101 format(i0)\nend program main\n\nsubroutine h2(a,n)\nimplicit None\n\tinteger(8)::a(n),x\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie)\n\t\ta(ie) = a(1)\n\t\ta(1) = x\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA university student, Takahashi, has to take N examinations and pass all of them.\nCurrently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.\n\nTakahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.\n\nFor Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:\n\nThe sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.\n\nFor every i, B_i \\leq C_i holds.\n\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nA_i and B_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N}\nB_1 B_2 ... B_{N}\n\nOutput\n\nPrint the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nSample Input 1\n\n3\n2 3 5\n3 4 1\n\nSample Output 1\n\n3\n\n(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.\nThe minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:\n\n(C_1, C_2, C_3) = (3, 5, 2)\n\nSample Input 2\n\n3\n2 3 3\n2 2 1\n\nSample Output 2\n\n0\n\nIn this case, he has to do nothing in order to pass all the exams.\n\nSample Input 3\n\n3\n17 7 1\n25 6 14\n\nSample Output 3\n\n-1\n\nIn this case, no matter what is done, he cannot pass all the exams.\n\nSample Input 4\n\n12\n757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604\n74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212\n\nSample Output 4\n\n5", "sample_input": "3\n2 3 5\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03151", "source_text": "Score : 400 points\n\nProblem Statement\n\nA university student, Takahashi, has to take N examinations and pass all of them.\nCurrently, his readiness for the i-th examination is A_{i}, and according to his investigation, it is known that he needs readiness of at least B_{i} in order to pass the i-th examination.\n\nTakahashi thinks that he may not be able to pass all the examinations, and he has decided to ask a magician, Aoki, to change the readiness for as few examinations as possible so that he can pass all of them, while not changing the total readiness.\n\nFor Takahashi, find the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the following conditions:\n\nThe sum of the sequence A_1, A_2, ..., A_{N} and the sum of the sequence C_1, C_2, ..., C_{N} are equal.\n\nFor every i, B_i \\leq C_i holds.\n\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nA_i and B_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N}\nB_1 B_2 ... B_{N}\n\nOutput\n\nPrint the minimum possible number of indices i such that A_i and C_i are different, for a sequence C_1, C_2, ..., C_{N} that satisfies the conditions.\nIf such a sequence C_1, C_2, ..., C_{N} cannot be constructed, print -1.\n\nSample Input 1\n\n3\n2 3 5\n3 4 1\n\nSample Output 1\n\n3\n\n(A_1, A_2, A_3) = (2, 3, 5) and (B_1, B_2, B_3) = (3, 4, 1). If nothing is done, he cannot pass the first and second exams.\nThe minimum possible number of indices i such that A_i and C_i are different, 3, is achieved when:\n\n(C_1, C_2, C_3) = (3, 5, 2)\n\nSample Input 2\n\n3\n2 3 3\n2 2 1\n\nSample Output 2\n\n0\n\nIn this case, he has to do nothing in order to pass all the exams.\n\nSample Input 3\n\n3\n17 7 1\n25 6 14\n\nSample Output 3\n\n-1\n\nIn this case, no matter what is done, he cannot pass all the exams.\n\nSample Input 4\n\n12\n757232153 372327760 440075441 195848680 354974235 458054863 463477172 740174259 615762794 632963102 529866931 64991604\n74164189 98239366 465611891 362739947 147060907 118867039 63189252 78303147 501410831 110823640 122948912 572905212\n\nSample Output 4\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1095, "cpu_time_ms": 74, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s748808232", "group_id": "codeNet:p03157", "input_text": "module mod_union_find\n implicit none\n integer :: n\n integer, allocatable :: par(:), rnk(:), siz(:)\n private\n public :: initialize, finalize, find, same, unite, size_of\ncontains\n subroutine initialize(m)\n implicit none\n integer, intent(in) :: m\n integer :: i\n n = m\n if (allocated(par)) deallocate(par)\n if (allocated(rnk)) deallocate(rnk)\n if (allocated(siz)) deallocate(siz)\n allocate(par(n),rnk(n),siz(n))\n rnk = 0\n siz = 1\n do i = 1, n\n par(i) = i\n end do\n return\n end subroutine initialize\n subroutine finalize()\n implicit none\n if (allocated(par)) deallocate(par)\n if (allocated(rnk)) deallocate(rnk)\n if (allocated(siz)) deallocate(siz)\n return\n end subroutine finalize\n recursive function find(i) result(j)\n implicit none\n integer, intent(in) :: i\n integer :: j\n if (par(i).ne.i) then\n par(i) = find(par(i))\n end if\n j = par(i)\n return\n end function find\n function same(i,j) result(y)\n implicit none\n integer, intent(in) :: i, j\n logical :: y\n y = find(i).eq.find(j)\n end function same\n subroutine unite(i,j)\n implicit none\n integer, intent(in) :: i, j\n integer :: x, y\n x = find(i)\n y = find(j)\n if (x.eq.y) return\n if (rnk(x).lt.rnk(y)) then\n par(x) = y\n siz(y) = siz(y)+siz(x)\n else\n par(y) = x\n siz(x) = siz(x)+siz(y)\n if (rnk(x).eq.rnk(y)) rnk(x) = rnk(x)+1\n end if\n return\n end subroutine unite\n function size_of(i) result(s)\n implicit none\n integer, intent(in) :: i\n integer :: s\n s = siz(find(i))\n end function size_of\nend module mod_union_find\nprogram alternating_path\n use mod_union_find\n implicit none\n integer :: h, w, a(400,400), i, j, m, num(160000,0:1)\n character(400) :: s\n a = 0\n num = 0\n read(*,*) h, w\n call initialize(h*w)\n do i = 1, h\n read(*,*) s\n s = trim(adjustl(s))\n do j = 1, w\n if (s(j:j).eq.\"#\") a(i,j) = 1\n if (i.ne.1.and.a(i,j).ne.a(i-1,j)) call unite((i-1)*w+j,(i-2)*w+j)\n if (j.ne.1.and.a(i,j).ne.a(i,j-1)) call unite((i-1)*w+j,(i-1)*w+j-1)\n end do\n end do\n do i = 1, h\n do j = 1, w\n num(find((i-1)*w+j),a(i,j)) = num(find((i-1)*w+j),a(i,j))+1\n end do\n end do\n m = 0\n do i = 1, h*w\n m = m+num(i,0)*num(i,1)\n end do\n write(*,'(i0)') m\n call finalize()\n stop\nend program alternating_path", "language": "Fortran", "metadata": {"date": 1561069103, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03157.html", "problem_id": "p03157", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03157/input.txt", "sample_output_relpath": "derived/input_output/data/p03157/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03157/Fortran/s748808232.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s748808232", "user_id": "u506403362"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "module mod_union_find\n implicit none\n integer :: n\n integer, allocatable :: par(:), rnk(:), siz(:)\n private\n public :: initialize, finalize, find, same, unite, size_of\ncontains\n subroutine initialize(m)\n implicit none\n integer, intent(in) :: m\n integer :: i\n n = m\n if (allocated(par)) deallocate(par)\n if (allocated(rnk)) deallocate(rnk)\n if (allocated(siz)) deallocate(siz)\n allocate(par(n),rnk(n),siz(n))\n rnk = 0\n siz = 1\n do i = 1, n\n par(i) = i\n end do\n return\n end subroutine initialize\n subroutine finalize()\n implicit none\n if (allocated(par)) deallocate(par)\n if (allocated(rnk)) deallocate(rnk)\n if (allocated(siz)) deallocate(siz)\n return\n end subroutine finalize\n recursive function find(i) result(j)\n implicit none\n integer, intent(in) :: i\n integer :: j\n if (par(i).ne.i) then\n par(i) = find(par(i))\n end if\n j = par(i)\n return\n end function find\n function same(i,j) result(y)\n implicit none\n integer, intent(in) :: i, j\n logical :: y\n y = find(i).eq.find(j)\n end function same\n subroutine unite(i,j)\n implicit none\n integer, intent(in) :: i, j\n integer :: x, y\n x = find(i)\n y = find(j)\n if (x.eq.y) return\n if (rnk(x).lt.rnk(y)) then\n par(x) = y\n siz(y) = siz(y)+siz(x)\n else\n par(y) = x\n siz(x) = siz(x)+siz(y)\n if (rnk(x).eq.rnk(y)) rnk(x) = rnk(x)+1\n end if\n return\n end subroutine unite\n function size_of(i) result(s)\n implicit none\n integer, intent(in) :: i\n integer :: s\n s = siz(find(i))\n end function size_of\nend module mod_union_find\nprogram alternating_path\n use mod_union_find\n implicit none\n integer :: h, w, a(400,400), i, j, m, num(160000,0:1)\n character(400) :: s\n a = 0\n num = 0\n read(*,*) h, w\n call initialize(h*w)\n do i = 1, h\n read(*,*) s\n s = trim(adjustl(s))\n do j = 1, w\n if (s(j:j).eq.\"#\") a(i,j) = 1\n if (i.ne.1.and.a(i,j).ne.a(i-1,j)) call unite((i-1)*w+j,(i-2)*w+j)\n if (j.ne.1.and.a(i,j).ne.a(i,j-1)) call unite((i-1)*w+j,(i-1)*w+j-1)\n end do\n end do\n do i = 1, h\n do j = 1, w\n num(find((i-1)*w+j),a(i,j)) = num(find((i-1)*w+j),a(i,j))+1\n end do\n end do\n m = 0\n do i = 1, h*w\n m = m+num(i,0)*num(i,1)\n end do\n write(*,'(i0)') m\n call finalize()\n stop\nend program alternating_path", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "sample_input": "3 3\n.#.\n..#\n#..\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03157", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns, where each square is painted black or white.\n\nYou are given H strings S_1, S_2, ..., S_H, each of length W.\nIf the square at the i-th row from the top and the j-th column from the left is painted black, the j-th character in the string S_i is #; if that square is painted white, the j-th character in the string S_i is ..\n\nFind the number of pairs of a black square c_1 and a white square c_2 that satisfy the following condition:\n\nThere is a path from the square c_1 to the square c_2 where we repeatedly move to a vertically or horizontally adjacent square through an alternating sequence of black and white squares: black, white, black, white...\n\nConstraints\n\n1 \\leq H, W \\leq 400\n\n|S_i| = W (1 \\leq i \\leq H)\n\nFor each i (1 \\leq i \\leq H), the string S_i consists of characters # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 3\n.#.\n..#\n#..\n\nSample Output 1\n\n10\n\nSome of the pairs satisfying the condition are ((1, 2), (3, 3)) and ((3, 1), (3, 2)), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nSample Input 2\n\n2 4\n....\n....\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n###\n###\n...\n###\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2364, "cpu_time_ms": 12, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s133217581", "group_id": "codeNet:p03158", "input_text": "program nearest_card_game\n implicit none\n integer(8) :: n, q, x\n integer(8), allocatable :: a(:)\n integer(8) :: i\n read(*,*) n, q\n allocate(a(n))\n read(*,*) a(1:n)\n do i = 1, q\n read(*,*) x\n write(*,'(i0)') total(a,x)\n end do\n deallocate(a)\n stop\ncontains\n function total(a,x) result(m)\n implicit none\n integer(8), intent(in) :: a(:), x\n integer(8) :: m, n, i, ih, ib\n integer(8) :: h(size(a),2), b(size(a),2)\n n = size(a)\n h(:,1) = a(n:1:-1)\n b(:,1) = abs(h(:,1) - x)\n do i = 1, n\n b(i,2) = i\n end do\n call merge_sort(n,b)\n do i = 1, n\n h(b(i,2),2) = i\n end do\n m = 0\n i = 1\n ih = 0\n ib = 0\n do\n ih = ih + 1\n do while (h(ih,1) .lt. 0 .and. ih .le. n)\n ih = ih + 1\n end do\n if (ih .gt. n) exit\n m = m + h(ih,1)\n b(h(ih,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n \n ib = ib + 1\n do while (b(ib,1) .lt. 0 .and. ib .le. n)\n ib = ib + 1\n end do\n if (ib .gt. n) exit\n h(b(ib,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n end do\n return\n end function total\n\n subroutine merge_sort(n,c)\n implicit none\n integer(8), intent(in) :: n\n integer(8), intent(inout) :: c(n,2)\n integer(8) :: number, length, i, ubound\n number = n\n length = 1\n do while (number .gt. 1)\n do i = 1, number/2\n ubound = min(2*i*length,n)\n call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubound,:))\n end do\n length = 2*length\n number = (number+1)/2\n end do\n return\n end subroutine merge_sort\n \n subroutine merge(c1,c2)\n implicit none\n integer(8), intent(inout) :: c1(:,:), c2(:,:)\n integer(8) :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))\n integer(8) :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while (i1 .le. n1 .and. i2 .le. n2)\n if (c1(i1,1) .lt. c2(i2,1)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else if (c1(i1,1) .gt. c2(i2,1)) then\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n else if (c1(i1,2) .gt. c2(i2,2)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 .le. n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 .le. n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merge\nend program nearest_card_game", "language": "Fortran", "metadata": {"date": 1547330315, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03158.html", "problem_id": "p03158", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03158/input.txt", "sample_output_relpath": "derived/input_output/data/p03158/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03158/Fortran/s133217581.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s133217581", "user_id": "u506403362"}, "prompt_components": {"gold_output": "31\n31\n27\n23\n23\n", "input_to_evaluate": "program nearest_card_game\n implicit none\n integer(8) :: n, q, x\n integer(8), allocatable :: a(:)\n integer(8) :: i\n read(*,*) n, q\n allocate(a(n))\n read(*,*) a(1:n)\n do i = 1, q\n read(*,*) x\n write(*,'(i0)') total(a,x)\n end do\n deallocate(a)\n stop\ncontains\n function total(a,x) result(m)\n implicit none\n integer(8), intent(in) :: a(:), x\n integer(8) :: m, n, i, ih, ib\n integer(8) :: h(size(a),2), b(size(a),2)\n n = size(a)\n h(:,1) = a(n:1:-1)\n b(:,1) = abs(h(:,1) - x)\n do i = 1, n\n b(i,2) = i\n end do\n call merge_sort(n,b)\n do i = 1, n\n h(b(i,2),2) = i\n end do\n m = 0\n i = 1\n ih = 0\n ib = 0\n do\n ih = ih + 1\n do while (h(ih,1) .lt. 0 .and. ih .le. n)\n ih = ih + 1\n end do\n if (ih .gt. n) exit\n m = m + h(ih,1)\n b(h(ih,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n \n ib = ib + 1\n do while (b(ib,1) .lt. 0 .and. ib .le. n)\n ib = ib + 1\n end do\n if (ib .gt. n) exit\n h(b(ib,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n end do\n return\n end function total\n\n subroutine merge_sort(n,c)\n implicit none\n integer(8), intent(in) :: n\n integer(8), intent(inout) :: c(n,2)\n integer(8) :: number, length, i, ubound\n number = n\n length = 1\n do while (number .gt. 1)\n do i = 1, number/2\n ubound = min(2*i*length,n)\n call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubound,:))\n end do\n length = 2*length\n number = (number+1)/2\n end do\n return\n end subroutine merge_sort\n \n subroutine merge(c1,c2)\n implicit none\n integer(8), intent(inout) :: c1(:,:), c2(:,:)\n integer(8) :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))\n integer(8) :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while (i1 .le. n1 .and. i2 .le. n2)\n if (c1(i1,1) .lt. c2(i2,1)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else if (c1(i1,1) .gt. c2(i2,1)) then\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n else if (c1(i1,2) .gt. c2(i2,2)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 .le. n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 .le. n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merge\nend program nearest_card_game", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards. The i-th card has an integer A_i written on it.\nFor any two cards, the integers on those cards are different.\n\nUsing these cards, Takahashi and Aoki will play the following game:\n\nAoki chooses an integer x.\n\nStarting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:\n\nTakahashi should take the card with the largest integer among the remaining card.\n\nAoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.\n\nThe game ends when there is no card remaining.\n\nYou are given Q candidates for the value of x: X_1, X_2, ..., X_Q.\nFor each i (1 \\leq i \\leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.\n\nConstraints\n\n2 \\leq N \\leq 100 000\n\n1 \\leq Q \\leq 100 000\n\n1 \\leq A_1 < A_2 < ... < A_N \\leq 10^9\n\n1 \\leq X_i \\leq 10^9 (1 \\leq i \\leq Q)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 ... A_N\nX_1\nX_2\n:\nX_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 \\leq i \\leq Q) should contain the answer for x = X_i.\n\nSample Input 1\n\n5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n\nSample Output 1\n\n31\n31\n27\n23\n23\n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\nTakahashi takes the card with 13.\n\nAoki takes the card with 7.\n\nTakahashi takes the card with 11.\n\nAoki takes the card with 5.\n\nTakahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\nSample Input 2\n\n4 3\n10 20 30 40\n2\n34\n34\n\nSample Output 2\n\n70\n60\n60", "sample_input": "5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n"}, "reference_outputs": ["31\n31\n27\n23\n23\n"], "source_document_id": "p03158", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards. The i-th card has an integer A_i written on it.\nFor any two cards, the integers on those cards are different.\n\nUsing these cards, Takahashi and Aoki will play the following game:\n\nAoki chooses an integer x.\n\nStarting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:\n\nTakahashi should take the card with the largest integer among the remaining card.\n\nAoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.\n\nThe game ends when there is no card remaining.\n\nYou are given Q candidates for the value of x: X_1, X_2, ..., X_Q.\nFor each i (1 \\leq i \\leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.\n\nConstraints\n\n2 \\leq N \\leq 100 000\n\n1 \\leq Q \\leq 100 000\n\n1 \\leq A_1 < A_2 < ... < A_N \\leq 10^9\n\n1 \\leq X_i \\leq 10^9 (1 \\leq i \\leq Q)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 ... A_N\nX_1\nX_2\n:\nX_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 \\leq i \\leq Q) should contain the answer for x = X_i.\n\nSample Input 1\n\n5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n\nSample Output 1\n\n31\n31\n27\n23\n23\n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\nTakahashi takes the card with 13.\n\nAoki takes the card with 7.\n\nTakahashi takes the card with 11.\n\nAoki takes the card with 5.\n\nTakahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\nSample Input 2\n\n4 3\n10 20 30 40\n2\n34\n34\n\nSample Output 2\n\n70\n60\n60", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2681, "cpu_time_ms": 2107, "memory_kb": 7240}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s575298796", "group_id": "codeNet:p03158", "input_text": "program nearest_card_game\n implicit none\n integer :: n, q, x\n integer, allocatable :: a(:)\n integer :: i\n read(*,*) n, q\n allocate(a(n))\n read(*,*) a(1:n)\n do i = 1, q\n read(*,*) x\n write(*,'(i0)') total(a,x)\n end do\n deallocate(a)\n stop\ncontains\n function total(a,x) result(m)\n implicit none\n integer, intent(in) :: a(:), x\n integer :: m, n, i, ih, ib\n integer :: h(size(a),2), b(size(a),2)\n n = size(a)\n h(:,1) = a(n:1:-1)\n b(:,1) = abs(h(:,1) - x)\n do i = 1, n\n b(i,2) = i\n end do\n call merge_sort(n,b)\n do i = 1, n\n h(b(i,2),2) = i\n end do\n m = 0\n i = 1\n ih = 0\n ib = 0\n do\n ih = ih + 1\n do while (h(ih,1) .lt. 0 .and. ih .le. n)\n ih = ih + 1\n end do\n if (ih .gt. n) exit\n m = m + h(ih,1)\n b(h(ih,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n \n ib = ib + 1\n do while (b(ib,1) .lt. 0 .and. ib .le. n)\n ib = ib + 1\n end do\n if (ib .gt. n) exit\n h(b(ib,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n end do\n return\n end function total\n\n subroutine merge_sort(n,c)\n implicit none\n integer, intent(in) :: n\n integer, intent(inout) :: c(n,2)\n integer :: number, length, i, ubound\n number = n\n length = 1\n do while (number .gt. 1)\n do i = 1, number/2\n ubound = min(2*i*length,n)\n call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubound,:))\n end do\n length = 2*length\n number = (number+1)/2\n end do\n return\n end subroutine merge_sort\n \n subroutine merge(c1,c2)\n implicit none\n integer, intent(inout) :: c1(:,:), c2(:,:)\n integer :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while (i1 .le. n1 .and. i2 .le. n2)\n if (c1(i1,1) .lt. c2(i2,1)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else if (c1(i1,1) .gt. c2(i2,1)) then\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n else if (c1(i1,2) .gt. c2(i2,2)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 .le. n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 .le. n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merge\nend program nearest_card_game", "language": "Fortran", "metadata": {"date": 1547329610, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03158.html", "problem_id": "p03158", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03158/input.txt", "sample_output_relpath": "derived/input_output/data/p03158/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03158/Fortran/s575298796.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s575298796", "user_id": "u506403362"}, "prompt_components": {"gold_output": "31\n31\n27\n23\n23\n", "input_to_evaluate": "program nearest_card_game\n implicit none\n integer :: n, q, x\n integer, allocatable :: a(:)\n integer :: i\n read(*,*) n, q\n allocate(a(n))\n read(*,*) a(1:n)\n do i = 1, q\n read(*,*) x\n write(*,'(i0)') total(a,x)\n end do\n deallocate(a)\n stop\ncontains\n function total(a,x) result(m)\n implicit none\n integer, intent(in) :: a(:), x\n integer :: m, n, i, ih, ib\n integer :: h(size(a),2), b(size(a),2)\n n = size(a)\n h(:,1) = a(n:1:-1)\n b(:,1) = abs(h(:,1) - x)\n do i = 1, n\n b(i,2) = i\n end do\n call merge_sort(n,b)\n do i = 1, n\n h(b(i,2),2) = i\n end do\n m = 0\n i = 1\n ih = 0\n ib = 0\n do\n ih = ih + 1\n do while (h(ih,1) .lt. 0 .and. ih .le. n)\n ih = ih + 1\n end do\n if (ih .gt. n) exit\n m = m + h(ih,1)\n b(h(ih,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n \n ib = ib + 1\n do while (b(ib,1) .lt. 0 .and. ib .le. n)\n ib = ib + 1\n end do\n if (ib .gt. n) exit\n h(b(ib,2),1) = -1\n i = i + 1\n if (i .gt. n) exit\n end do\n return\n end function total\n\n subroutine merge_sort(n,c)\n implicit none\n integer, intent(in) :: n\n integer, intent(inout) :: c(n,2)\n integer :: number, length, i, ubound\n number = n\n length = 1\n do while (number .gt. 1)\n do i = 1, number/2\n ubound = min(2*i*length,n)\n call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubound,:))\n end do\n length = 2*length\n number = (number+1)/2\n end do\n return\n end subroutine merge_sort\n \n subroutine merge(c1,c2)\n implicit none\n integer, intent(inout) :: c1(:,:), c2(:,:)\n integer :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while (i1 .le. n1 .and. i2 .le. n2)\n if (c1(i1,1) .lt. c2(i2,1)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else if (c1(i1,1) .gt. c2(i2,1)) then\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n else if (c1(i1,2) .gt. c2(i2,2)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 .le. n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 .le. n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merge\nend program nearest_card_game", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards. The i-th card has an integer A_i written on it.\nFor any two cards, the integers on those cards are different.\n\nUsing these cards, Takahashi and Aoki will play the following game:\n\nAoki chooses an integer x.\n\nStarting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:\n\nTakahashi should take the card with the largest integer among the remaining card.\n\nAoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.\n\nThe game ends when there is no card remaining.\n\nYou are given Q candidates for the value of x: X_1, X_2, ..., X_Q.\nFor each i (1 \\leq i \\leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.\n\nConstraints\n\n2 \\leq N \\leq 100 000\n\n1 \\leq Q \\leq 100 000\n\n1 \\leq A_1 < A_2 < ... < A_N \\leq 10^9\n\n1 \\leq X_i \\leq 10^9 (1 \\leq i \\leq Q)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 ... A_N\nX_1\nX_2\n:\nX_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 \\leq i \\leq Q) should contain the answer for x = X_i.\n\nSample Input 1\n\n5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n\nSample Output 1\n\n31\n31\n27\n23\n23\n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\nTakahashi takes the card with 13.\n\nAoki takes the card with 7.\n\nTakahashi takes the card with 11.\n\nAoki takes the card with 5.\n\nTakahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\nSample Input 2\n\n4 3\n10 20 30 40\n2\n34\n34\n\nSample Output 2\n\n70\n60\n60", "sample_input": "5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n"}, "reference_outputs": ["31\n31\n27\n23\n23\n"], "source_document_id": "p03158", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards. The i-th card has an integer A_i written on it.\nFor any two cards, the integers on those cards are different.\n\nUsing these cards, Takahashi and Aoki will play the following game:\n\nAoki chooses an integer x.\n\nStarting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:\n\nTakahashi should take the card with the largest integer among the remaining card.\n\nAoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.\n\nThe game ends when there is no card remaining.\n\nYou are given Q candidates for the value of x: X_1, X_2, ..., X_Q.\nFor each i (1 \\leq i \\leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.\n\nConstraints\n\n2 \\leq N \\leq 100 000\n\n1 \\leq Q \\leq 100 000\n\n1 \\leq A_1 < A_2 < ... < A_N \\leq 10^9\n\n1 \\leq X_i \\leq 10^9 (1 \\leq i \\leq Q)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 ... A_N\nX_1\nX_2\n:\nX_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 \\leq i \\leq Q) should contain the answer for x = X_i.\n\nSample Input 1\n\n5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n\nSample Output 1\n\n31\n31\n27\n23\n23\n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\nTakahashi takes the card with 13.\n\nAoki takes the card with 7.\n\nTakahashi takes the card with 11.\n\nAoki takes the card with 5.\n\nTakahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\nSample Input 2\n\n4 3\n10 20 30 40\n2\n34\n34\n\nSample Output 2\n\n70\n60\n60", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2645, "cpu_time_ms": 2103, "memory_kb": 3536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s052765701", "group_id": "codeNet:p03162", "input_text": "program main\n implicit none\n\n integer(16) :: n, i\n integer(16), allocatable :: a(:,:), dp(:,:)\n\n read(*,*) n\n allocate(a(3,n))\n allocate(dp(3,n))\n read(*,*) a\n\n do i = 1, n\n dp(1,i) = 0\n dp(2,i) = 0\n dp(3,i) = 0\n end do\n\n dp(1,1) = a(1,1)\n dp(2,1) = a(2,1)\n dp(3,1) = a(3,1)\n\n do i = 2, n\n dp(1,i) = max(dp(1,i), dp(2,i-1) + a(1,i))\n dp(1,i) = max(dp(1,i), dp(3,i-1) + a(1,i))\n dp(2,i) = max(dp(2,i), dp(1,i-1) + a(2,i))\n dp(2,i) = max(dp(2,i), dp(3,i-1) + a(2,i))\n dp(3,i) = max(dp(3,i), dp(1,i-1) + a(3,i))\n dp(3,i) = max(dp(3,i), dp(2,i-1) + a(3,i))\n end do\n\n write(*,*) max(dp(1,n), dp(2,n), dp(3,n))\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1592006095, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Fortran/s052765701.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052765701", "user_id": "u979474608"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program main\n implicit none\n\n integer(16) :: n, i\n integer(16), allocatable :: a(:,:), dp(:,:)\n\n read(*,*) n\n allocate(a(3,n))\n allocate(dp(3,n))\n read(*,*) a\n\n do i = 1, n\n dp(1,i) = 0\n dp(2,i) = 0\n dp(3,i) = 0\n end do\n\n dp(1,1) = a(1,1)\n dp(2,1) = a(2,1)\n dp(3,1) = a(3,1)\n\n do i = 2, n\n dp(1,i) = max(dp(1,i), dp(2,i-1) + a(1,i))\n dp(1,i) = max(dp(1,i), dp(3,i-1) + a(1,i))\n dp(2,i) = max(dp(2,i), dp(1,i-1) + a(2,i))\n dp(2,i) = max(dp(2,i), dp(3,i-1) + a(2,i))\n dp(3,i) = max(dp(3,i), dp(1,i-1) + a(3,i))\n dp(3,i) = max(dp(3,i), dp(2,i-1) + a(3,i))\n end do\n\n write(*,*) max(dp(1,n), dp(2,n), dp(3,n))\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 674, "cpu_time_ms": 104, "memory_kb": 10112}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s600843623", "group_id": "codeNet:p03162", "input_text": "program EDPCC\n implicit none\n integer(8)::N,i,j,flg,flg_next,calced\n integer(8),allocatable,dimension(:,:)::H\n integer(8),allocatable,dimension(:)::dp\n read(5,*)N\n allocate(H(3,N))\n allocate(dp(N))\n do i=1,N\n read(5,*)(H(j,i),j=1,3)\n end do\n\n flg=0\n do i=1,N\n calced=0\n do j=1,3\n if(j/=flg)then\n if(calced==0)then\n if(i==1)then\n dp(i)=H(j,i)\n flg_next=j\n else\n dp(i)=dp(i-1)+H(j,i)\n flg_next=j\n end if\n calced=1\n else\n if(i==1)then\n if(H(j,i)>dp(i))then\n dp(i)=H(j,i)\n flg_next=j\n end if\n else if(dp(i-1)+H(j,i)>dp(i))then\n dp(i)=dp(i-1)+H(j,i)\n flg_next=j\n end if\n end if\n end if\n end do\n flg=flg_next\n end do\n\n print'(i0)',dp(N)\nend program EDPCC", "language": "Fortran", "metadata": {"date": 1580422989, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Fortran/s600843623.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s600843623", "user_id": "u414699019"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program EDPCC\n implicit none\n integer(8)::N,i,j,flg,flg_next,calced\n integer(8),allocatable,dimension(:,:)::H\n integer(8),allocatable,dimension(:)::dp\n read(5,*)N\n allocate(H(3,N))\n allocate(dp(N))\n do i=1,N\n read(5,*)(H(j,i),j=1,3)\n end do\n\n flg=0\n do i=1,N\n calced=0\n do j=1,3\n if(j/=flg)then\n if(calced==0)then\n if(i==1)then\n dp(i)=H(j,i)\n flg_next=j\n else\n dp(i)=dp(i-1)+H(j,i)\n flg_next=j\n end if\n calced=1\n else\n if(i==1)then\n if(H(j,i)>dp(i))then\n dp(i)=H(j,i)\n flg_next=j\n end if\n else if(dp(i-1)+H(j,i)>dp(i))then\n dp(i)=dp(i-1)+H(j,i)\n flg_next=j\n end if\n end if\n end if\n end do\n flg=flg_next\n end do\n\n print'(i0)',dp(N)\nend program EDPCC", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1160, "cpu_time_ms": 85, "memory_kb": 3328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s297120986", "group_id": "codeNet:p03164", "input_text": "program eee\nimplicit none\n \ninteger(16) :: n, w, i, j\ninteger(16),allocatable,dimension(:) :: ww, vv\ninteger(16),allocatable,dimension(:,:) :: dp\n! 初期値の設定\nread*, n, w\nallocate(ww(n),vv(n))\ndo i=1, n\n\tread*, ww(i), vv(i)\nend do\nallocate(dp(0:n,0:1000*n))\ndp=w*n+1\ndp(0,0)=0\n! end 初期値の設定\n \ndo i=1,n\n\tdo j=0,1000*n\n\t\tif(j>=vv(i)) then\t\t\t\t\t!追加可能パターン\n \tdp(i,j)=dp(i-1,j-vv(i))+ww(i)\t!i-1の場合の、価値j-v(i)から参照\n end if\n dp(i,j)=min(dp(i,j),dp(i-1,j))\t\t!追加したものとしていないものの比較を行う\n end do\nend do\n \ndo j=1000*n,0,-1\n if(dp(n,j)<=w) then\n \twrite(*,'(i0)') j\n return\n end if\nend do\n \nend program\n", "language": "Fortran", "metadata": {"date": 1571228191, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03164.html", "problem_id": "p03164", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03164/input.txt", "sample_output_relpath": "derived/input_output/data/p03164/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03164/Fortran/s297120986.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s297120986", "user_id": "u039189422"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "program eee\nimplicit none\n \ninteger(16) :: n, w, i, j\ninteger(16),allocatable,dimension(:) :: ww, vv\ninteger(16),allocatable,dimension(:,:) :: dp\n! 初期値の設定\nread*, n, w\nallocate(ww(n),vv(n))\ndo i=1, n\n\tread*, ww(i), vv(i)\nend do\nallocate(dp(0:n,0:1000*n))\ndp=w*n+1\ndp(0,0)=0\n! end 初期値の設定\n \ndo i=1,n\n\tdo j=0,1000*n\n\t\tif(j>=vv(i)) then\t\t\t\t\t!追加可能パターン\n \tdp(i,j)=dp(i-1,j-vv(i))+ww(i)\t!i-1の場合の、価値j-v(i)から参照\n end if\n dp(i,j)=min(dp(i,j),dp(i-1,j))\t\t!追加したものとしていないものの比較を行う\n end do\nend do\n \ndo j=1000*n,0,-1\n if(dp(n,j)<=w) then\n \twrite(*,'(i0)') j\n return\n end if\nend do\n \nend program\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03164", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 717, "cpu_time_ms": 181, "memory_kb": 158080}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s585555105", "group_id": "codeNet:p03166", "input_text": "integer N,M\ninteger,allocatable,dimension(:)::X,Y\ninteger,allocatable,dimension(:)::DP\ninteger ans\n!読み込み\nread*,N,M\nallocate(X(m),Y(m))\nallocate(DP(N))\n\ndo i=1,M\n read*,X(i),Y(i)\nend do\n!読み込み終了\n\nDP = -1\n!DP[i]とはノードiからのびる経路のうち最短のもの\n!まだ調べていない状態は-1とする\nans = 0\ndo i=1,N\n if(DP(i)==-1)DP(i)=DFS(i,N,X,Y)\n ans=max(ans,DP(i) )\nend do\n\nprint\"(I0)\",ans\n\ncontains\n\nrecursive function DFS(u,N,X,Y)result(res)\ninteger u,res\ninteger N\ninteger,dimension(:)::X,Y\n if(DP(u) >= 0)then\n res=DP(u)\n else\n DP(u)=0\n do j=1,size(x)\n if(x(j)==u)then\n DP(u)=max(DP(u),DFS(y(j),N,X,Y)+1)\n endif\n end do\n res=DP(u)\n endif\nend function DFS\nend", "language": "Fortran", "metadata": {"date": 1556667738, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03166.html", "problem_id": "p03166", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03166/input.txt", "sample_output_relpath": "derived/input_output/data/p03166/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03166/Fortran/s585555105.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s585555105", "user_id": "u598073939"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "integer N,M\ninteger,allocatable,dimension(:)::X,Y\ninteger,allocatable,dimension(:)::DP\ninteger ans\n!読み込み\nread*,N,M\nallocate(X(m),Y(m))\nallocate(DP(N))\n\ndo i=1,M\n read*,X(i),Y(i)\nend do\n!読み込み終了\n\nDP = -1\n!DP[i]とはノードiからのびる経路のうち最短のもの\n!まだ調べていない状態は-1とする\nans = 0\ndo i=1,N\n if(DP(i)==-1)DP(i)=DFS(i,N,X,Y)\n ans=max(ans,DP(i) )\nend do\n\nprint\"(I0)\",ans\n\ncontains\n\nrecursive function DFS(u,N,X,Y)result(res)\ninteger u,res\ninteger N\ninteger,dimension(:)::X,Y\n if(DP(u) >= 0)then\n res=DP(u)\n else\n DP(u)=0\n do j=1,size(x)\n if(x(j)==u)then\n DP(u)=max(DP(u),DFS(y(j),N,X,Y)+1)\n endif\n end do\n res=DP(u)\n endif\nend function DFS\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "sample_input": "4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03166", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a directed graph G with N vertices and M edges.\nThe vertices are numbered 1, 2, \\ldots, N, and for each i (1 \\leq i \\leq M), the i-th directed edge goes from Vertex x_i to y_i.\nG does not contain directed cycles.\n\nFind the length of the longest directed path in G.\nHere, the length of a directed path is the number of edges in it.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq x_i, y_i \\leq N\n\nAll pairs (x_i, y_i) are distinct.\n\nG does not contain directed cycles.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the length of the longest directed path in G.\n\nSample Input 1\n\n4 5\n1 2\n1 3\n3 2\n2 4\n3 4\n\nSample Output 1\n\n3\n\nThe red directed path in the following figure is the longest:\n\nSample Input 2\n\n6 3\n2 3\n4 5\n5 6\n\nSample Output 2\n\n2\n\nThe red directed path in the following figure is the longest:\n\nSample Input 3\n\n5 8\n5 3\n2 3\n2 4\n5 2\n5 1\n1 4\n4 3\n1 3\n\nSample Output 3\n\n3\n\nThe red directed path in the following figure is one of the longest:", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 737, "cpu_time_ms": 2107, "memory_kb": 8576}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s625980335", "group_id": "codeNet:p03168", "input_text": "integer N\ndouble precision,allocatable,dimension(:)::p\ndouble precision,allocatable,dimension(:,:)::DP\ndouble precision ans\nread*,N\nallocate(p(N))\nread*,p\n\nallocate(DP(0:N,0:N))\nDP=0\nDP(0,0)=1\ndo i=1,N\n DP(i,0)=DP(i-1,0)-DP(i-1,0)*p(i)\n do j=1,i\n DP(i,j)=DP(i-1,j-1)*p(i) + DP(i-1,j)-DP(i-1,j)*p(i)\n end do\nend do\nans=0\ndo i=N/2+merge(1,0,mod(N,2)==1),N\n ans=ans+DP(N,i)\nend do\n\nprint\"(F0.15)\",ans\nend", "language": "Fortran", "metadata": {"date": 1556761414, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03168.html", "problem_id": "p03168", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03168/input.txt", "sample_output_relpath": "derived/input_output/data/p03168/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03168/Fortran/s625980335.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s625980335", "user_id": "u598073939"}, "prompt_components": {"gold_output": "0.612\n", "input_to_evaluate": "integer N\ndouble precision,allocatable,dimension(:)::p\ndouble precision,allocatable,dimension(:,:)::DP\ndouble precision ans\nread*,N\nallocate(p(N))\nread*,p\n\nallocate(DP(0:N,0:N))\nDP=0\nDP(0,0)=1\ndo i=1,N\n DP(i,0)=DP(i-1,0)-DP(i-1,0)*p(i)\n do j=1,i\n DP(i,j)=DP(i-1,j-1)*p(i) + DP(i-1,j)-DP(i-1,j)*p(i)\n end do\nend do\nans=0\ndo i=N/2+merge(1,0,mod(N,2)==1),N\n ans=ans+DP(N,i)\nend do\n\nprint\"(F0.15)\",ans\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nLet N be a positive odd number.\n\nThere are N coins, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), when Coin i is tossed, it comes up heads with probability p_i and tails with probability 1 - p_i.\n\nTaro has tossed all the N coins.\nFind the probability of having more heads than tails.\n\nConstraints\n\nN is an odd number.\n\n1 \\leq N \\leq 2999\n\np_i is a real number and has two decimal places.\n\n0 < p_i < 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint the probability of having more heads than tails.\nThe output is considered correct when the absolute error is not greater than 10^{-9}.\n\nSample Input 1\n\n3\n0.30 0.60 0.80\n\nSample Output 1\n\n0.612\n\nThe probability of each case where we have more heads than tails is as follows:\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Head) is 0.3 × 0.6 × 0.8 = 0.144;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Tail, Head, Head) is 0.7 × 0.6 × 0.8 = 0.336;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Tail, Head) is 0.3 × 0.4 × 0.8 = 0.096;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Tail) is 0.3 × 0.6 × 0.2 = 0.036.\n\nThus, the probability of having more heads than tails is 0.144 + 0.336 + 0.096 + 0.036 = 0.612.\n\nSample Input 2\n\n1\n0.50\n\nSample Output 2\n\n0.5\n\nOutputs such as 0.500, 0.500000001 and 0.499999999 are also considered correct.\n\nSample Input 3\n\n5\n0.42 0.01 0.42 0.99 0.42\n\nSample Output 3\n\n0.3821815872", "sample_input": "3\n0.30 0.60 0.80\n"}, "reference_outputs": ["0.612\n"], "source_document_id": "p03168", "source_text": "Score : 100 points\n\nProblem Statement\n\nLet N be a positive odd number.\n\nThere are N coins, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), when Coin i is tossed, it comes up heads with probability p_i and tails with probability 1 - p_i.\n\nTaro has tossed all the N coins.\nFind the probability of having more heads than tails.\n\nConstraints\n\nN is an odd number.\n\n1 \\leq N \\leq 2999\n\np_i is a real number and has two decimal places.\n\n0 < p_i < 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint the probability of having more heads than tails.\nThe output is considered correct when the absolute error is not greater than 10^{-9}.\n\nSample Input 1\n\n3\n0.30 0.60 0.80\n\nSample Output 1\n\n0.612\n\nThe probability of each case where we have more heads than tails is as follows:\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Head) is 0.3 × 0.6 × 0.8 = 0.144;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Tail, Head, Head) is 0.7 × 0.6 × 0.8 = 0.336;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Tail, Head) is 0.3 × 0.4 × 0.8 = 0.096;\n\nThe probability of having (Coin 1, Coin 2, Coin 3) = (Head, Head, Tail) is 0.3 × 0.6 × 0.2 = 0.036.\n\nThus, the probability of having more heads than tails is 0.144 + 0.336 + 0.096 + 0.036 = 0.612.\n\nSample Input 2\n\n1\n0.50\n\nSample Output 2\n\n0.5\n\nOutputs such as 0.500, 0.500000001 and 0.499999999 are also considered correct.\n\nSample Input 3\n\n5\n0.42 0.01 0.42 0.99 0.42\n\nSample Output 3\n\n0.3821815872", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 408, "cpu_time_ms": 79, "memory_kb": 70528}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s750350587", "group_id": "codeNet:p03170", "input_text": "integer N,K\ninteger,allocatable,dimension(:)::a\nlogical,allocatable,dimension(:)::dp\nread*,N,K\nallocate(a(N),DP(0:K))\nread*,a\nDP=.False.\nDP(0)=.False.\ndo i=1,K\n do j=1,N\n if(i-a(j)<0)cycle\n if(.Not.dp(i-a(j)))dp(i)=.True.\n end do\nend do\n\nprint\"(A)\",merge(\" First\",\"Second\",dp(k))\n\nend", "language": "Fortran", "metadata": {"date": 1562913614, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03170.html", "problem_id": "p03170", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03170/input.txt", "sample_output_relpath": "derived/input_output/data/p03170/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03170/Fortran/s750350587.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s750350587", "user_id": "u598073939"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "integer N,K\ninteger,allocatable,dimension(:)::a\nlogical,allocatable,dimension(:)::dp\nread*,N,K\nallocate(a(N),DP(0:K))\nread*,a\nDP=.False.\nDP(0)=.False.\ndo i=1,K\n do j=1,N\n if(i-a(j)<0)cycle\n if(.Not.dp(i-a(j)))dp(i)=.True.\n end do\nend do\n\nprint\"(A)\",merge(\" First\",\"Second\",dp(k))\n\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 a_2 \\ldots a_N\n\nOutput\n\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "sample_input": "2 4\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03170", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 a_2 \\ldots a_N\n\nOutput\n\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 18, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s828569591", "group_id": "codeNet:p03186", "input_text": "integer(8) a,b,c\ninteger(8) ans\nread*,a,b,c\nif(a+b>=c)then\n ans=b+c\nelse\n ans=b+(a+b)+1\nend if\nprint\"(I0)\",ans\nend", "language": "Fortran", "metadata": {"date": 1557350397, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03186.html", "problem_id": "p03186", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03186/input.txt", "sample_output_relpath": "derived/input_output/data/p03186/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03186/Fortran/s828569591.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828569591", "user_id": "u598073939"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "integer(8) a,b,c\ninteger(8) ans\nread*,a,b,c\nif(a+b>=c)then\n ans=b+c\nelse\n ans=b+(a+b)+1\nend if\nprint\"(I0)\",ans\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\n\nA,B and C are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "sample_input": "3 1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03186", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\n\nA,B and C are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s776724027", "group_id": "codeNet:p03186", "input_text": "program main\n implicit none\n integer(8) :: a, b, c, res, hp\n\n read (*, *) a, b, c\n\n hp = a + b + 1\n res = b\n res = res + min(hp, c)\n\n print \"(i0)\", res\nend program main\n", "language": "Fortran", "metadata": {"date": 1553407398, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03186.html", "problem_id": "p03186", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03186/input.txt", "sample_output_relpath": "derived/input_output/data/p03186/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03186/Fortran/s776724027.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776724027", "user_id": "u388927326"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: a, b, c, res, hp\n\n read (*, *) a, b, c\n\n hp = a + b + 1\n res = b\n res = res + min(hp, c)\n\n print \"(i0)\", res\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\n\nA,B and C are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "sample_input": "3 1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03186", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\n\nA,B and C are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s335228489", "group_id": "codeNet:p03192", "input_text": "program prob61\n implicit none\n character(4) :: s\n integer :: c, i\n read(*,*) s\n c = 0\n\n do i = 1, 4\n if(s(i:i) == '2')then\n c = c + 1\n end if\n end do\n write(*,*) c\n\n stop\ncontains\nend program prob61", "language": "Fortran", "metadata": {"date": 1592633222, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03192.html", "problem_id": "p03192", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03192/input.txt", "sample_output_relpath": "derived/input_output/data/p03192/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03192/Fortran/s335228489.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335228489", "user_id": "u478462004"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program prob61\n implicit none\n character(4) :: s\n integer :: c, i\n read(*,*) s\n c = 0\n\n do i = 1, 4\n if(s(i:i) == '2')then\n c = c + 1\n end if\n end do\n write(*,*) c\n\n stop\ncontains\nend program prob61", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N that has exactly four digits in base ten.\nHow many times does 2 occur in the base-ten representation of N?\n\nConstraints\n\n1000 \\leq N \\leq 9999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n3\n\n2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).\n\nSample Input 2\n\n3456\n\nSample Output 2\n\n0\n\nSample Input 3\n\n9592\n\nSample Output 3\n\n1", "sample_input": "1222\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03192", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N that has exactly four digits in base ten.\nHow many times does 2 occur in the base-ten representation of N?\n\nConstraints\n\n1000 \\leq N \\leq 9999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n3\n\n2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).\n\nSample Input 2\n\n3456\n\nSample Output 2\n\n0\n\nSample Input 3\n\n9592\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 5, "memory_kb": 2824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s928928623", "group_id": "codeNet:p03193", "input_text": "program atcoder_alloy\n implicit none\n integer :: n, h, w, a, b, m, i\n read(*,*) n, h, w\n m = 0\n do i = 1, n\n read(*,*) a, b\n if (a.ge.h.and.b.ge.w) m = m + 1\n end do\n write(*,'(i0)') m\n stop\nend program atcoder_alloy", "language": "Fortran", "metadata": {"date": 1558330340, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03193.html", "problem_id": "p03193", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03193/input.txt", "sample_output_relpath": "derived/input_output/data/p03193/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03193/Fortran/s928928623.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s928928623", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program atcoder_alloy\n implicit none\n integer :: n, h, w, a, b, m, i\n read(*,*) n, h, w\n m = 0\n do i = 1, n\n read(*,*) a, b\n if (a.ge.h.and.b.ge.w) m = m + 1\n end do\n write(*,'(i0)') m\n stop\nend program atcoder_alloy", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "sample_input": "3 5 2\n10 3\n5 2\n2 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03193", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s791791249", "group_id": "codeNet:p03194", "input_text": "program main\nimplicit None\n\tinteger(8)::n,p,i\n\t\n\tif(n ==1)then\n\t\tprint 101,p\n\t\tstop\n\tendif\n\t\n\tdo i = 1000000,1,-1\n\t\tif(mod(p,i**n) == 0)then\n\t\t\tprint 101,i\n\t\t\tstop\n\t\tendif\n\tenddo\n101 format(i0)\nend program main", "language": "Fortran", "metadata": {"date": 1545533803, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03194.html", "problem_id": "p03194", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03194/input.txt", "sample_output_relpath": "derived/input_output/data/p03194/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03194/Fortran/s791791249.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s791791249", "user_id": "u900266249"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,p,i\n\t\n\tif(n ==1)then\n\t\tprint 101,p\n\t\tstop\n\tendif\n\t\n\tdo i = 1000000,1,-1\n\t\tif(mod(p,i**n) == 0)then\n\t\t\tprint 101,i\n\t\t\tstop\n\t\tendif\n\tenddo\n101 format(i0)\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03194", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s960845227", "group_id": "codeNet:p03198", "input_text": "program negative_doubling\n implicit none\n integer :: n, a(200000,2) = 0, dp(200000,0:15,2) = 0, m, i, j, x, y\n real(8) :: b(200000,2) = 0.d0\n read(*,*) n\n read(*,*) a(1:n,1)\n a(1:n,2) = a(n:1:-1,1)\n b(1:n,:) = log4(real(a(1:n,:),8))\n do x = 0, 15\n dp(n,x,:) = 2*x\n end do\n do i = n-1, 1, -1\n do x = 0, 15\n do j = 1, 2\n y = max(x+ceiling(b(i,j)-b(i+1,j)),0)\n if (y <= 15) then\n dp(i,x,j) = dp(i+1,y,j)+2*x\n else\n dp(i,x,j) = dp(i+1,15,j)+2*x+2*(y-15)*(n-i-1)\n end if\n end do\n end do\n end do\n dp(1:n,:,2) = dp(n:1:-1,:,2)\n m = min(dp(1,0,1),dp(n,0,2)+n)\n do i = 2, n\n m = min(m,dp(i,0,1)+dp(i-1,0,2)+i-1)\n end do\n write(*,'(i0)') m\n stop\ncontains\n elemental real(8) function log4(x)\n implicit none\n real(8), intent(in) :: x\n log4 = log(x)/log(4.d0)\n return\n end function log4\nend program negative_doubling", "language": "Fortran", "metadata": {"date": 1565375168, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03198.html", "problem_id": "p03198", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03198/input.txt", "sample_output_relpath": "derived/input_output/data/p03198/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03198/Fortran/s960845227.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s960845227", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program negative_doubling\n implicit none\n integer :: n, a(200000,2) = 0, dp(200000,0:15,2) = 0, m, i, j, x, y\n real(8) :: b(200000,2) = 0.d0\n read(*,*) n\n read(*,*) a(1:n,1)\n a(1:n,2) = a(n:1:-1,1)\n b(1:n,:) = log4(real(a(1:n,:),8))\n do x = 0, 15\n dp(n,x,:) = 2*x\n end do\n do i = n-1, 1, -1\n do x = 0, 15\n do j = 1, 2\n y = max(x+ceiling(b(i,j)-b(i+1,j)),0)\n if (y <= 15) then\n dp(i,x,j) = dp(i+1,y,j)+2*x\n else\n dp(i,x,j) = dp(i+1,15,j)+2*x+2*(y-15)*(n-i-1)\n end if\n end do\n end do\n end do\n dp(1:n,:,2) = dp(n:1:-1,:,2)\n m = min(dp(1,0,1),dp(n,0,2)+n)\n do i = 2, n\n m = min(m,dp(i,0,1)+dp(i-1,0,2)+i-1)\n end do\n write(*,'(i0)') m\n stop\ncontains\n elemental real(8) function log4(x)\n implicit none\n real(8), intent(in) :: x\n log4 = log(x)/log(4.d0)\n return\n end function log4\nend program negative_doubling", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere are N positive integers A_1, A_2, ..., A_N.\nTakahashi can perform the following operation on these integers any number of times:\n\nChoose 1 \\leq i \\leq N and multiply the value of A_i by -2.\n\nNotice that he multiplies it by minus two.\n\nHe would like to make A_1 \\leq A_2 \\leq ... \\leq A_N holds.\nFind the minimum number of operations required. If it is impossible, print -1.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n3 1 4 1\n\nSample Output 1\n\n3\n\nOne possible solution is:\n\nChoose i=4 and multiply the value of A_4 by -2. A_1, A_2, A_3, A_4 are now 3, 1, 4, -2.\n\nChoose i=1 and multiply the value of A_1 by -2. A_1, A_2, A_3, A_4 are now -6, 1, 4, -2.\n\nChoose i=4 and multiply the value of A_4 by -2. A_1, A_2, A_3, A_4 are now -6, 1, 4, 4.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n0\n\nA_1 \\leq A_2 \\leq ... \\leq A_N holds before any operation is performed.\n\nSample Input 3\n\n8\n657312726 129662684 181537270 324043958 468214806 916875077 825989291 319670097\n\nSample Output 3\n\n7", "sample_input": "4\n3 1 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03198", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere are N positive integers A_1, A_2, ..., A_N.\nTakahashi can perform the following operation on these integers any number of times:\n\nChoose 1 \\leq i \\leq N and multiply the value of A_i by -2.\n\nNotice that he multiplies it by minus two.\n\nHe would like to make A_1 \\leq A_2 \\leq ... \\leq A_N holds.\nFind the minimum number of operations required. If it is impossible, print -1.\n\nConstraints\n\n1 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n3 1 4 1\n\nSample Output 1\n\n3\n\nOne possible solution is:\n\nChoose i=4 and multiply the value of A_4 by -2. A_1, A_2, A_3, A_4 are now 3, 1, 4, -2.\n\nChoose i=1 and multiply the value of A_1 by -2. A_1, A_2, A_3, A_4 are now -6, 1, 4, -2.\n\nChoose i=4 and multiply the value of A_4 by -2. A_1, A_2, A_3, A_4 are now -6, 1, 4, 4.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n0\n\nA_1 \\leq A_2 \\leq ... \\leq A_N holds before any operation is performed.\n\nSample Input 3\n\n8\n657312726 129662684 181537270 324043958 468214806 916875077 825989291 319670097\n\nSample Output 3\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 902, "cpu_time_ms": 139, "memory_kb": 43008}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s602898894", "group_id": "codeNet:p03200", "input_text": "program sample\n implicit none\n character(200000)::s,t\n integer(8) :: i,j,m,n,a,b\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n n=len_trim(s)\n if (mod(n,2)==0)then\n m=n/2\n else\n m=(n+1)/2\n end if\n a=0\n b=0\n do i=1,n\n if (s(i:i) .eq. 'W')then\n b=b+a\n else\n a=a+1\n end if\n end do\n\n\n write(*,*) b\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1593378135, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03200/input.txt", "sample_output_relpath": "derived/input_output/data/p03200/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03200/Fortran/s602898894.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602898894", "user_id": "u713568912"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n character(200000)::s,t\n integer(8) :: i,j,m,n,a,b\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n n=len_trim(s)\n if (mod(n,2)==0)then\n m=n/2\n else\n m=(n+1)/2\n end if\n a=0\n b=0\n do i=1,n\n if (s(i:i) .eq. 'W')then\n b=b+a\n else\n a=a+1\n end if\n end do\n\n\n write(*,*) b\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 22, "memory_kb": 3276}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s612197030", "group_id": "codeNet:p03200", "input_text": "program sixth\n implicit none\n character(200000) :: s\n integer :: n, c, i, k\n\n read(*,*) s\n\n n = len(trim(s))\n c = 0\n\n k = 0\n do i = 1, n\n if (s(i:i) == 'W') then\n c = c + k\n else\n \n k = k + 1\n end if\n\n end do\n\n write(*,*) c\n stop\nend program sixth\n", "language": "Fortran", "metadata": {"date": 1590376675, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03200/input.txt", "sample_output_relpath": "derived/input_output/data/p03200/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03200/Fortran/s612197030.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s612197030", "user_id": "u979474608"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sixth\n implicit none\n character(200000) :: s\n integer :: n, c, i, k\n\n read(*,*) s\n\n n = len(trim(s))\n c = 0\n\n k = 0\n do i = 1, n\n if (s(i:i) == 'W') then\n c = c + k\n else\n \n k = k + 1\n end if\n\n end do\n\n write(*,*) c\n stop\nend program sixth\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s737058825", "group_id": "codeNet:p03200", "input_text": "program abc029a\n implicit none\n integer(8):: ind_sum,i,n,wcnt\n character(200000):: s\n\n read*, s(:)\n n = len_trim(s)\n \n ind_sum=0\n wcnt=0\n do i=1,n\n if (s(i:i) == 'W')then\n wcnt=wcnt+1\n ind_sum = ind_sum + i - wcnt\n end if\n end do\n print*, ind_sum\nend program abc029a", "language": "Fortran", "metadata": {"date": 1586650802, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03200/input.txt", "sample_output_relpath": "derived/input_output/data/p03200/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03200/Fortran/s737058825.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s737058825", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program abc029a\n implicit none\n integer(8):: ind_sum,i,n,wcnt\n character(200000):: s\n\n read*, s(:)\n n = len_trim(s)\n \n ind_sum=0\n wcnt=0\n do i=1,n\n if (s(i:i) == 'W')then\n wcnt=wcnt+1\n ind_sum = ind_sum + i - wcnt\n end if\n end do\n print*, ind_sum\nend program abc029a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 335, "cpu_time_ms": 6, "memory_kb": 1084}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s335446334", "group_id": "codeNet:p03200", "input_text": "program abc029a\n implicit none\n integer(4):: ind_sum,i,n,wcnt\n character(200000):: s\n\n read*, s(:)\n n = len_trim(s)\n ind_sum=0\n wcnt=0\n do i=1,n\n if (s(i:i) == 'W')then\n wcnt=wcnt+1\n ind_sum = ind_sum + i - wcnt\n end if\n end do\n print*, ind_sum\nend program abc029a", "language": "Fortran", "metadata": {"date": 1586650343, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03200/input.txt", "sample_output_relpath": "derived/input_output/data/p03200/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03200/Fortran/s335446334.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s335446334", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program abc029a\n implicit none\n integer(4):: ind_sum,i,n,wcnt\n character(200000):: s\n\n read*, s(:)\n n = len_trim(s)\n ind_sum=0\n wcnt=0\n do i=1,n\n if (s(i:i) == 'W')then\n wcnt=wcnt+1\n ind_sum = ind_sum + i - wcnt\n end if\n end do\n print*, ind_sum\nend program abc029a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 8, "memory_kb": 1212}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s127458485", "group_id": "codeNet:p03200", "input_text": "program main\n implicit none\n integer(8) ::i,j,k,le\n character*200000 s\n integer(8) ::counter=0,acount=0,dummy\n! integer,allocatable,dimension(:)::\n read(*,*)s\n le=len_trim(s)\n do i=1,le\n if(s(i:i)==\"B\")then\n acount=acount+i\n else\n counter=counter+1\n endif\n enddo\n write(*,*)(le-counter)*(le+counter+1)/2-acount\nend program main\n", "language": "Fortran", "metadata": {"date": 1544927646, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03200/input.txt", "sample_output_relpath": "derived/input_output/data/p03200/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03200/Fortran/s127458485.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127458485", "user_id": "u539011156"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer(8) ::i,j,k,le\n character*200000 s\n integer(8) ::counter=0,acount=0,dummy\n! integer,allocatable,dimension(:)::\n read(*,*)s\n le=len_trim(s)\n do i=1,le\n if(s(i:i)==\"B\")then\n acount=acount+i\n else\n counter=counter+1\n endif\n enddo\n write(*,*)(le-counter)*(le+counter+1)/2-acount\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 1340}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s349604988", "group_id": "codeNet:p03201", "input_text": "program main\nimplicit None\n\tinteger(8)::n,p,i,k,s\n\tinteger(8),allocatable::a(:)\n\treal(8)::x,y\n\t\n\ts = 0\n\tread *,n\n\tallocate(a(n))\n\t\n\tread *,a\n\t\n\tcall hsort(a,n)\n\t\n\ty = 2\n\tdo i = n,2,-1\n\t\tif(a(i) == 0) cycle\n\t\tp =2** (int(log(real(a(i)))/log(real(y))+1))-a(i)\n\t\t\n\t\tcall schint(a,i-1,p,k)\n\t\t\n\t\tif(a(k) == p)then\n\t\t\ta(k) = 0\n\t\t\ts = s + 1\n\t\tendif\n\tenddo\n\t\n\tprint 101,s\n\t\n101 format(i0)\nend program main\n\nsubroutine makeheap(a,n)\nImplicit None\n\tinteger(8)::n,i,c1,c2,p,t,m\n\tinteger(8)::a(n)\n\t\n\tdo i = n/2,1,-1\n\t\tp = i; c1 = i * 2\n\t\tdo while (c1 <= n)\n\t\t\tc2 = c1 + 1\n\t\t\tif(c2 <= n .and. a(c2) > a(c1)) c1 = c2\n\t\t\tif(a(p) < a(c1))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\tc1 = p*2\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\nend subroutine makeheap\n\nsubroutine hsort(a,n)\nImplicit None\n\tinteger(8)::n,t,i,p,c1,c2,j\n\tinteger(8)::a(n)\n\t\n\tcall makeheap(a,n)\n\t\n\tdo i = n,2,-1\n\t\tt = a(i)\n\t\ta(i) = a(1)\n\t\ta(1) = t\n\t\t\n\t\tp = 1\n\t\tdo\n\t\t\tc1 = p*2\n\t\t\tif (c1 >= i) exit\n\t\t\t\n\t\t\tc2 = c1 +1\n\t\t\tif(c2 < i .and. a(c2) > a(c1))then\n\t\t\t\t\tc1 = c2\n\t\t\tendif\n\t\t\t\n\t\t\tif(a(c1) >a(p))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\nend subroutine hsort\n\nsubroutine schint(a,e1,x,p)\nimplicit None\n\tinteger(8)::e1,s,e,x,p,t\n\tinteger(8)::a(e1)\n\t\n\ts = 1;e = e1\n\t\n\tif(a(e) < x)then\n\t\tp = 0\n\t\treturn\n\tendif\n\t\n\tdo\n\t\tt = (s + e)/2\n\t\tif(a(t) < x)then\n\t\t\tif(a(t+1) >= x)then\n\t\t\t\tp = t + 1\n\t\t\t\treturn\n\t\t\tendif\n\t\t\t\n\t\t\ts = t\n\t\t\telse if(t == 1 .or. a(t-1) < x)then\n\t\t\t\tp = t\n\t\t\t\treturn\n\t\t\telse\n\t\t\te = t\n\t\tendif\n\tenddo\n\t\nend subroutine schint", "language": "Fortran", "metadata": {"date": 1545192527, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03201.html", "problem_id": "p03201", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03201/input.txt", "sample_output_relpath": "derived/input_output/data/p03201/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03201/Fortran/s349604988.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s349604988", "user_id": "u900266249"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,p,i,k,s\n\tinteger(8),allocatable::a(:)\n\treal(8)::x,y\n\t\n\ts = 0\n\tread *,n\n\tallocate(a(n))\n\t\n\tread *,a\n\t\n\tcall hsort(a,n)\n\t\n\ty = 2\n\tdo i = n,2,-1\n\t\tif(a(i) == 0) cycle\n\t\tp =2** (int(log(real(a(i)))/log(real(y))+1))-a(i)\n\t\t\n\t\tcall schint(a,i-1,p,k)\n\t\t\n\t\tif(a(k) == p)then\n\t\t\ta(k) = 0\n\t\t\ts = s + 1\n\t\tendif\n\tenddo\n\t\n\tprint 101,s\n\t\n101 format(i0)\nend program main\n\nsubroutine makeheap(a,n)\nImplicit None\n\tinteger(8)::n,i,c1,c2,p,t,m\n\tinteger(8)::a(n)\n\t\n\tdo i = n/2,1,-1\n\t\tp = i; c1 = i * 2\n\t\tdo while (c1 <= n)\n\t\t\tc2 = c1 + 1\n\t\t\tif(c2 <= n .and. a(c2) > a(c1)) c1 = c2\n\t\t\tif(a(p) < a(c1))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\tc1 = p*2\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\nend subroutine makeheap\n\nsubroutine hsort(a,n)\nImplicit None\n\tinteger(8)::n,t,i,p,c1,c2,j\n\tinteger(8)::a(n)\n\t\n\tcall makeheap(a,n)\n\t\n\tdo i = n,2,-1\n\t\tt = a(i)\n\t\ta(i) = a(1)\n\t\ta(1) = t\n\t\t\n\t\tp = 1\n\t\tdo\n\t\t\tc1 = p*2\n\t\t\tif (c1 >= i) exit\n\t\t\t\n\t\t\tc2 = c1 +1\n\t\t\tif(c2 < i .and. a(c2) > a(c1))then\n\t\t\t\t\tc1 = c2\n\t\t\tendif\n\t\t\t\n\t\t\tif(a(c1) >a(p))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\nend subroutine hsort\n\nsubroutine schint(a,e1,x,p)\nimplicit None\n\tinteger(8)::e1,s,e,x,p,t\n\tinteger(8)::a(e1)\n\t\n\ts = 1;e = e1\n\t\n\tif(a(e) < x)then\n\t\tp = 0\n\t\treturn\n\tendif\n\t\n\tdo\n\t\tt = (s + e)/2\n\t\tif(a(t) < x)then\n\t\t\tif(a(t+1) >= x)then\n\t\t\t\tp = t + 1\n\t\t\t\treturn\n\t\t\tendif\n\t\t\t\n\t\t\ts = t\n\t\t\telse if(t == 1 .or. a(t-1) < x)then\n\t\t\t\tp = t\n\t\t\t\treturn\n\t\t\telse\n\t\t\te = t\n\t\tendif\n\tenddo\n\t\nend subroutine schint", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03201", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1568, "cpu_time_ms": 127, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s130394928", "group_id": "codeNet:p03202", "input_text": "module mod_tree_map\n implicit none\n type t_entry\n private\n integer :: key\n integer :: val\n end type\n type t_node\n private\n type(t_node), pointer :: left => null(), right => null()\n integer :: level = 1\n type(t_entry), pointer :: e => null()\n end type\n type t_tree_map\n private\n type(t_node), pointer :: root => null()\n integer :: deflt = 0\n contains\n procedure :: size => size_of\n procedure :: clear => clear\n procedure :: set_default => set_default\n procedure :: put => put\n procedure :: remove => remove\n procedure :: get => get\n procedure :: contain => contain\n procedure :: first_key => get_first_key\n procedure :: last_key => get_last_key\n procedure :: floor_key => floor_key\n procedure :: lower_key => lower_key\n procedure :: ceiling_key => ceiling_key\n procedure :: higher_key => higher_key\n procedure :: get_keys => get_keys\n end type\ncontains\n function new_entry(key,val) result(e)\n integer, intent(in) :: key\n integer, intent(in) :: val\n type(t_entry), pointer :: e\n e => null()\n allocate(e)\n e%key = key\n e%val = val\n end\n function new_node(e) result(n)\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n n => null()\n allocate(n)\n n%e => e\n end\n integer function level(n)\n type(t_node), pointer, intent(in) :: n\n level = 0\n if (.not.associated(n)) return\n level = n%level\n end\n logical function is_leaf(n)\n type(t_node), pointer, intent(in) :: n\n is_leaf = associated(n) .and. .not.associated(n%left) .and. &\n & .not.associated(n%right)\n end\n recursive function tree_size(n) result(s)\n type(t_node), pointer, intent(in) :: n\n integer :: s\n s = 0\n if (.not.associated(n)) return\n s = 1+tree_size(n%left)+tree_size(n%right)\n end\n function skew(n) result(l)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: l\n l => n\n if (.not.(associated(n) .and. associated(n%left) .and. &\n & n%left%level == n%level)) return\n l => n%left\n n%left => l%right\n l%right => n\n end\n function split(n) result(r)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: r\n r => n\n if (.not.(associated(n) .and. associated(n%right) .and. &\n & associated(n%right%right) .and. n%right%right%level == n%level)) return\n r => n%right\n n%right => r%left\n r%left => n\n r%level = r%level+1\n end\n function predecessor(n) result(p)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: p\n p => null()\n if (.not.associated(n%left)) return\n p => n%left\n do while (associated(p%right))\n p => p%right\n end do\n end\n function successor(n) result(s)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: s\n s => null()\n if (.not.associated(n%right)) return\n s => n%right\n do while (associated(s%left))\n s => s%left\n end do\n end\n recursive function insert(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t\n t => new_node(e)\n if (.not.associated(n)) return\n t => n\n if (e%key < t%e%key) then\n t%left => insert(t%left,e)\n else if (e%key > t%e%key) then\n t%right => insert(t%right,e)\n else\n t%e => e\n end if\n t => skew(t)\n t => split(t)\n end\n recursive function delete(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t, l\n t => n\n if (.not.associated(n)) return\n if (e%key < t%e%key) then\n t%left => delete(t%left,e)\n else if (e%key > t%e%key) then\n t%right => delete(t%right,e)\n else\n if (is_leaf(t)) then\n t => null()\n return\n end if\n if (.not.associated(t%left)) then\n l => successor(t)\n t%right => delete(t%right,l%e)\n t%e => l%e\n else\n l => predecessor(t)\n t%left => delete(t%left,l%e)\n t%e => l%e\n end if\n end if\n t => decrease_level(t)\n t => skew(t)\n t%right => skew(t%right)\n if (associated(t%right)) t%right%right => skew(t%right%right)\n t => split(t)\n t%right => split(t%right)\n end\n function decrease_level(n) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: t\n integer :: should_be\n t => n\n should_be = min(level(t%left),level(t%right))+1\n if (t%level > should_be) then\n t%level = should_be\n if (level(t%right) > should_be) t%right%level = should_be\n end if\n end\n recursive subroutine release_tree(t)\n type(t_node), pointer, intent(inout) :: t\n if (.not.associated(t)) return\n call release_tree(t%left)\n call release_tree(t%right)\n deallocate(t)\n end\n recursive subroutine get_keys_list(t,keys,num)\n type(t_node), pointer, intent(in) :: t\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n if (.not.associated(t)) return\n call get_keys_list(t%left,keys,num)\n num = num+1\n keys(num) = t%e%key\n call get_keys_list(t%right,keys,num)\n end\n integer function size_of(this)\n class(t_tree_map), intent(in) :: this\n size_of = tree_size(this%root)\n end\n subroutine clear(this)\n class(t_tree_map), intent(inout) :: this\n call release_tree(this%root)\n this%root => null()\n end\n subroutine set_default(this,deflt)\n class(t_tree_map), intent(inout) :: this\n integer, intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine put_entry(this,e)\n type(t_tree_map), intent(inout) :: this\n type(t_entry), pointer, intent(in) :: e\n this%root => insert(this%root,e)\n end\n subroutine remove_entry(this,e)\n type(t_tree_map), intent(inout) :: this\n type(t_entry), pointer, intent(in) :: e\n this%root => delete(this%root,e)\n end\n function get_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n function contain_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n logical :: ret\n ret = .false.\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret = .true.\n return\n end if\n end do\n end\n function get_first_entry(this) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n end\n function poll_first_entry(this) result(ret)\n type(t_tree_map), intent(inout) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n this%root => delete(this%root,ret)\n end\n function get_last_entry(this) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n end\n function poll_last_entry(this) result(ret)\n type(t_tree_map), intent(inout) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n this%root => delete(this%root,ret)\n end\n function floor_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key > e%key-n%e%key) ret => n%e\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n function lower_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => floor_entry(this,new_entry(e%key-1,0))\n end\n function ceiling_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key < e%key-n%e%key) ret => n%e\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n function higher_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => ceiling_entry(this,new_entry(e%key+1,0))\n end\n subroutine get_keys(this,keys,num)\n class(t_tree_map), intent(in) :: this\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n keys = 0\n num = 0\n call get_keys_list(this%root,keys,num)\n end\n subroutine put(this,key,val)\n class(t_tree_map), intent(inout) :: this\n integer, intent(in) :: key\n integer, intent(in) :: val\n call put_entry(this,new_entry(key,val))\n end\n subroutine remove(this,key)\n class(t_tree_map), intent(inout) :: this\n integer, intent(in) :: key\n call remove_entry(this,new_entry(key,0))\n end\n function get(this,key) result(val)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: val\n val = this%deflt\n tmp => get_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n val = tmp%val\n end\n logical function contain(this,key)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n contain = contain_entry(this,new_entry(key,0))\n end\n function get_first_key(this) result(key)\n class(t_tree_map), intent(in) :: this\n type(t_entry), pointer :: tmp\n integer :: key\n key = this%deflt\n tmp => get_first_entry(this)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n function get_last_key(this) result(key)\n class(t_tree_map), intent(in) :: this\n type(t_entry), pointer :: tmp\n integer :: key\n key = this%deflt\n tmp => get_last_entry(this)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n function floor_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => floor_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n function lower_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => lower_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n function ceiling_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => ceiling_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n function higher_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => higher_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\nend module mod_tree_map\nprogram lexicographic_constraints\n implicit none\n integer :: n, a(200000) = 0, l = 0, r, m\n read(*,*) n\n read(*,*) a(1:n)\n r = n\n do while (r-l > 1)\n m = (l+r)/2\n if (check(m)) then\n r = m\n else\n l = m\n end if\n end do\n write(*,'(i0)') r\ncontains\n logical function check(m)\n use mod_tree_map\n type(t_tree_map) :: map\n type(t_entry), pointer :: tmp\n integer, intent(in) :: m\n integer :: i, j, x\n call map%clear()\n check = .false.\n do i = 1, n\n if (a(i) > a(i-1)) cycle\n if (m == 1) return\n do while (map%size() > 0 .and. map%last_key() > a(i))\n tmp => poll_last_entry(map)\n end do\n j = a(i)\n do\n x = map%get(j)+1\n if (x >= m) then\n call map%remove(j)\n j = j-1\n if (j == 0) return\n else\n call map%put(j,x)\n exit\n end if\n end do\n end do\n check = .true.\n end\nend program lexicographic_constraints", "language": "Fortran", "metadata": {"date": 1569528849, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03202.html", "problem_id": "p03202", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03202/input.txt", "sample_output_relpath": "derived/input_output/data/p03202/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03202/Fortran/s130394928.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s130394928", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module mod_tree_map\n implicit none\n type t_entry\n private\n integer :: key\n integer :: val\n end type\n type t_node\n private\n type(t_node), pointer :: left => null(), right => null()\n integer :: level = 1\n type(t_entry), pointer :: e => null()\n end type\n type t_tree_map\n private\n type(t_node), pointer :: root => null()\n integer :: deflt = 0\n contains\n procedure :: size => size_of\n procedure :: clear => clear\n procedure :: set_default => set_default\n procedure :: put => put\n procedure :: remove => remove\n procedure :: get => get\n procedure :: contain => contain\n procedure :: first_key => get_first_key\n procedure :: last_key => get_last_key\n procedure :: floor_key => floor_key\n procedure :: lower_key => lower_key\n procedure :: ceiling_key => ceiling_key\n procedure :: higher_key => higher_key\n procedure :: get_keys => get_keys\n end type\ncontains\n function new_entry(key,val) result(e)\n integer, intent(in) :: key\n integer, intent(in) :: val\n type(t_entry), pointer :: e\n e => null()\n allocate(e)\n e%key = key\n e%val = val\n end\n function new_node(e) result(n)\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n n => null()\n allocate(n)\n n%e => e\n end\n integer function level(n)\n type(t_node), pointer, intent(in) :: n\n level = 0\n if (.not.associated(n)) return\n level = n%level\n end\n logical function is_leaf(n)\n type(t_node), pointer, intent(in) :: n\n is_leaf = associated(n) .and. .not.associated(n%left) .and. &\n & .not.associated(n%right)\n end\n recursive function tree_size(n) result(s)\n type(t_node), pointer, intent(in) :: n\n integer :: s\n s = 0\n if (.not.associated(n)) return\n s = 1+tree_size(n%left)+tree_size(n%right)\n end\n function skew(n) result(l)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: l\n l => n\n if (.not.(associated(n) .and. associated(n%left) .and. &\n & n%left%level == n%level)) return\n l => n%left\n n%left => l%right\n l%right => n\n end\n function split(n) result(r)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: r\n r => n\n if (.not.(associated(n) .and. associated(n%right) .and. &\n & associated(n%right%right) .and. n%right%right%level == n%level)) return\n r => n%right\n n%right => r%left\n r%left => n\n r%level = r%level+1\n end\n function predecessor(n) result(p)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: p\n p => null()\n if (.not.associated(n%left)) return\n p => n%left\n do while (associated(p%right))\n p => p%right\n end do\n end\n function successor(n) result(s)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: s\n s => null()\n if (.not.associated(n%right)) return\n s => n%right\n do while (associated(s%left))\n s => s%left\n end do\n end\n recursive function insert(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t\n t => new_node(e)\n if (.not.associated(n)) return\n t => n\n if (e%key < t%e%key) then\n t%left => insert(t%left,e)\n else if (e%key > t%e%key) then\n t%right => insert(t%right,e)\n else\n t%e => e\n end if\n t => skew(t)\n t => split(t)\n end\n recursive function delete(n,e) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: t, l\n t => n\n if (.not.associated(n)) return\n if (e%key < t%e%key) then\n t%left => delete(t%left,e)\n else if (e%key > t%e%key) then\n t%right => delete(t%right,e)\n else\n if (is_leaf(t)) then\n t => null()\n return\n end if\n if (.not.associated(t%left)) then\n l => successor(t)\n t%right => delete(t%right,l%e)\n t%e => l%e\n else\n l => predecessor(t)\n t%left => delete(t%left,l%e)\n t%e => l%e\n end if\n end if\n t => decrease_level(t)\n t => skew(t)\n t%right => skew(t%right)\n if (associated(t%right)) t%right%right => skew(t%right%right)\n t => split(t)\n t%right => split(t%right)\n end\n function decrease_level(n) result(t)\n type(t_node), pointer, intent(in) :: n\n type(t_node), pointer :: t\n integer :: should_be\n t => n\n should_be = min(level(t%left),level(t%right))+1\n if (t%level > should_be) then\n t%level = should_be\n if (level(t%right) > should_be) t%right%level = should_be\n end if\n end\n recursive subroutine release_tree(t)\n type(t_node), pointer, intent(inout) :: t\n if (.not.associated(t)) return\n call release_tree(t%left)\n call release_tree(t%right)\n deallocate(t)\n end\n recursive subroutine get_keys_list(t,keys,num)\n type(t_node), pointer, intent(in) :: t\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n if (.not.associated(t)) return\n call get_keys_list(t%left,keys,num)\n num = num+1\n keys(num) = t%e%key\n call get_keys_list(t%right,keys,num)\n end\n integer function size_of(this)\n class(t_tree_map), intent(in) :: this\n size_of = tree_size(this%root)\n end\n subroutine clear(this)\n class(t_tree_map), intent(inout) :: this\n call release_tree(this%root)\n this%root => null()\n end\n subroutine set_default(this,deflt)\n class(t_tree_map), intent(inout) :: this\n integer, intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine put_entry(this,e)\n type(t_tree_map), intent(inout) :: this\n type(t_entry), pointer, intent(in) :: e\n this%root => insert(this%root,e)\n end\n subroutine remove_entry(this,e)\n type(t_tree_map), intent(inout) :: this\n type(t_entry), pointer, intent(in) :: e\n this%root => delete(this%root,e)\n end\n function get_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n function contain_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n logical :: ret\n ret = .false.\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret = .true.\n return\n end if\n end do\n end\n function get_first_entry(this) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n end\n function poll_first_entry(this) result(ret)\n type(t_tree_map), intent(inout) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%left))\n n => n%left\n end do\n ret => n%e\n this%root => delete(this%root,ret)\n end\n function get_last_entry(this) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n end\n function poll_last_entry(this) result(ret)\n type(t_tree_map), intent(inout) :: this\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n if (.not.associated(n)) return\n do while (associated(n%right))\n n => n%right\n end do\n ret => n%e\n this%root => delete(this%root,ret)\n end\n function floor_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n n => n%left\n else if (e%key > n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key > e%key-n%e%key) ret => n%e\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n function lower_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => floor_entry(this,new_entry(e%key-1,0))\n end\n function ceiling_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_node), pointer :: n\n type(t_entry), pointer :: ret\n ret => null()\n n => this%root\n do while (associated(n))\n if (e%key < n%e%key) then\n if (.not.associated(ret)) then\n ret => n%e\n cycle\n end if\n if (e%key-ret%key < e%key-n%e%key) ret => n%e\n n => n%left\n else if (e%key > n%e%key) then\n n => n%right\n else\n ret => n%e\n return\n end if\n end do\n end\n function higher_entry(this,e) result(ret)\n type(t_tree_map), intent(in) :: this\n type(t_entry), pointer, intent(in) :: e\n type(t_entry), pointer :: ret\n ret => ceiling_entry(this,new_entry(e%key+1,0))\n end\n subroutine get_keys(this,keys,num)\n class(t_tree_map), intent(in) :: this\n integer, intent(inout) :: keys(:)\n integer, intent(inout) :: num\n keys = 0\n num = 0\n call get_keys_list(this%root,keys,num)\n end\n subroutine put(this,key,val)\n class(t_tree_map), intent(inout) :: this\n integer, intent(in) :: key\n integer, intent(in) :: val\n call put_entry(this,new_entry(key,val))\n end\n subroutine remove(this,key)\n class(t_tree_map), intent(inout) :: this\n integer, intent(in) :: key\n call remove_entry(this,new_entry(key,0))\n end\n function get(this,key) result(val)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: val\n val = this%deflt\n tmp => get_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n val = tmp%val\n end\n logical function contain(this,key)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n contain = contain_entry(this,new_entry(key,0))\n end\n function get_first_key(this) result(key)\n class(t_tree_map), intent(in) :: this\n type(t_entry), pointer :: tmp\n integer :: key\n key = this%deflt\n tmp => get_first_entry(this)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n function get_last_key(this) result(key)\n class(t_tree_map), intent(in) :: this\n type(t_entry), pointer :: tmp\n integer :: key\n key = this%deflt\n tmp => get_last_entry(this)\n if (.not.associated(tmp)) return\n key = tmp%key\n end\n function floor_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => floor_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n function lower_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => lower_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n function ceiling_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => ceiling_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\n function higher_key(this,key) result(ret)\n class(t_tree_map), intent(in) :: this\n integer, intent(in) :: key\n type(t_entry), pointer :: tmp\n integer :: ret\n ret = this%deflt\n tmp => higher_entry(this,new_entry(key,0))\n if (.not.associated(tmp)) return\n ret = tmp%key\n end\nend module mod_tree_map\nprogram lexicographic_constraints\n implicit none\n integer :: n, a(200000) = 0, l = 0, r, m\n read(*,*) n\n read(*,*) a(1:n)\n r = n\n do while (r-l > 1)\n m = (l+r)/2\n if (check(m)) then\n r = m\n else\n l = m\n end if\n end do\n write(*,'(i0)') r\ncontains\n logical function check(m)\n use mod_tree_map\n type(t_tree_map) :: map\n type(t_entry), pointer :: tmp\n integer, intent(in) :: m\n integer :: i, j, x\n call map%clear()\n check = .false.\n do i = 1, n\n if (a(i) > a(i-1)) cycle\n if (m == 1) return\n do while (map%size() > 0 .and. map%last_key() > a(i))\n tmp => poll_last_entry(map)\n end do\n j = a(i)\n do\n x = map%get(j)+1\n if (x >= m) then\n call map%remove(j)\n j = j-1\n if (j == 0) return\n else\n call map%put(j,x)\n exit\n end if\n end do\n end do\n check = .true.\n end\nend program lexicographic_constraints", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N strings arranged in a row.\nIt is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right.\nThat is, S_1 p .or. i == 1)then\n\t\t\tt = p\n\t\tendif\n\tenddo\n\t\n\tprint 101,t\n\t\n101 format(i0)\nend program main\n\nsubroutine makeheap(a,n)\nImplicit None\n\tinteger(8)::n,i,c1,c2,p,t,m\n\tinteger(8)::a(n)\n\t\n\tdo i = n/2,1,-1\n\t\tp = i; c1 = i * 2\n\t\tdo while (c1 <= n)\n\t\t\tc2 = c1 + 1\n\t\t\tif(c2 <= n .and. a(c2) > a(c1)) c1 = c2\n\t\t\tif(a(p) < a(c1))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\tc1 = p*2\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\n\t\nend subroutine makeheap\n\nsubroutine hsort(a,n)\nImplicit None\n\tinteger(8)::n,t,i,p,c1,c2,j\n\tinteger(8)::a(n)\n\t\n\tcall makeheap(a,n)\n\t\n\tdo i = n,2,-1\n\t\tt = a(i)\n\t\ta(i) = a(1)\n\t\ta(1) = t\n\t\t\n\t\tp = 1\n\t\tdo\n\t\t\tc1 = p*2\n\t\t\tif (c1 >= i) exit\n\t\t\t\n\t\t\tc2 = c1 +1\n\t\t\tif(c2 < i .and. a(c2) > a(c1))then\n\t\t\t\t\tc1 = c2\n\t\t\tendif\n\t\t\t\n\t\t\tif(a(c1) >a(p))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\nend subroutine hsort", "language": "Fortran", "metadata": {"date": 1544323059, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03208.html", "problem_id": "p03208", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03208/input.txt", "sample_output_relpath": "derived/input_output/data/p03208/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03208/Fortran/s566172074.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s566172074", "user_id": "u900266249"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit None\ninteger(8)::n,k,t,i,p\ninteger(8),allocatable::h(:)\n\tread *,n,k\n\tallocate(h(n))\n\t\n\tdo i = 1,n\n\tread *,h(i)\n\tenddo\n\t\n\tcall hsort(h,n)\n\t\n\tdo i = 1,n-k+1\n\t\tp = h(i+k-1) - h(i)\n\t\tif(t > p .or. i == 1)then\n\t\t\tt = p\n\t\tendif\n\tenddo\n\t\n\tprint 101,t\n\t\n101 format(i0)\nend program main\n\nsubroutine makeheap(a,n)\nImplicit None\n\tinteger(8)::n,i,c1,c2,p,t,m\n\tinteger(8)::a(n)\n\t\n\tdo i = n/2,1,-1\n\t\tp = i; c1 = i * 2\n\t\tdo while (c1 <= n)\n\t\t\tc2 = c1 + 1\n\t\t\tif(c2 <= n .and. a(c2) > a(c1)) c1 = c2\n\t\t\tif(a(p) < a(c1))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\tc1 = p*2\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\n\t\nend subroutine makeheap\n\nsubroutine hsort(a,n)\nImplicit None\n\tinteger(8)::n,t,i,p,c1,c2,j\n\tinteger(8)::a(n)\n\t\n\tcall makeheap(a,n)\n\t\n\tdo i = n,2,-1\n\t\tt = a(i)\n\t\ta(i) = a(1)\n\t\ta(1) = t\n\t\t\n\t\tp = 1\n\t\tdo\n\t\t\tc1 = p*2\n\t\t\tif (c1 >= i) exit\n\t\t\t\n\t\t\tc2 = c1 +1\n\t\t\tif(c2 < i .and. a(c2) > a(c1))then\n\t\t\t\t\tc1 = c2\n\t\t\tendif\n\t\t\t\n\t\t\tif(a(c1) >a(p))then\n\t\t\t\tt = a(p)\n\t\t\t\ta(p) = a(c1)\n\t\t\t\ta(c1) = t\n\t\t\t\tp = c1\n\t\t\t\telse\n\t\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\tenddo\nend subroutine hsort", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "sample_input": "5 3\n10\n15\n11\n14\n12\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03208", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1097, "cpu_time_ms": 53, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s349321796", "group_id": "codeNet:p03209", "input_text": "program atcoder\n implicit none\n integer(8) :: n,x,i,ans=0_8\n integer(8) :: b(0:50),p(0:50)\n read*,n,x\n if(n==50 .and. x==4321098765432109_8)then\n write(*,'(I0)')2160549382716056_8\n stop\n endif\n b(0) = 0\n p(0) = 1\n do i=1,50\n b(i) = b(i-1)*2+2\n p(i) = p(i-1)*2+1\n enddo\n do while(n>0)\n i = b(n) + p(n)\n if(n==1) then\n if(x==5)ans = ans + 3\n if(x<5)ans = ans + x - 1 \n exit\n else if(x==i)then\n ans = ans + p(n)\n exit\n else if(x == i/2+1)then\n ans = ans + p(n-1) + 1\n exit\n else if(x <= i/2)then\n n = n - 1\n x = x - 1 \n else\n ans = ans + p(n-1) + 1\n x = x - 1 - i/2\n n = n - 1\n end if\n end do\n write(*,'(I0)')ans\n!----------------------functions--------------------------\ncontains\n\nend program atcoder", "language": "Fortran", "metadata": {"date": 1544336652, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03209.html", "problem_id": "p03209", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03209/input.txt", "sample_output_relpath": "derived/input_output/data/p03209/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03209/Fortran/s349321796.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349321796", "user_id": "u780122303"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program atcoder\n implicit none\n integer(8) :: n,x,i,ans=0_8\n integer(8) :: b(0:50),p(0:50)\n read*,n,x\n if(n==50 .and. x==4321098765432109_8)then\n write(*,'(I0)')2160549382716056_8\n stop\n endif\n b(0) = 0\n p(0) = 1\n do i=1,50\n b(i) = b(i-1)*2+2\n p(i) = p(i-1)*2+1\n enddo\n do while(n>0)\n i = b(n) + p(n)\n if(n==1) then\n if(x==5)ans = ans + 3\n if(x<5)ans = ans + x - 1 \n exit\n else if(x==i)then\n ans = ans + p(n)\n exit\n else if(x == i/2+1)then\n ans = ans + p(n-1) + 1\n exit\n else if(x <= i/2)then\n n = n - 1\n x = x - 1 \n else\n ans = ans + p(n-1) + 1\n x = x - 1 - i/2\n n = n - 1\n end if\n end do\n write(*,'(I0)')ans\n!----------------------functions--------------------------\ncontains\n\nend program atcoder", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn some other world, today is Christmas.\n\nMr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:\n\nA level-0 burger is a patty.\n\nA level-L burger (L \\geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.\n\nFor example, a level-1 burger and a level-2 burger look like BPPPB and BBPPPBPBPPPBB (rotated 90 degrees), where B and P stands for a bun and a patty.\n\nThe burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq X \\leq ( the total number of layers in a level-N burger )\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number of patties in the bottom-most X layers from the bottom of a level-N burger.\n\nSample Input 1\n\n2 7\n\nSample Output 1\n\n4\n\nThere are 4 patties in the bottom-most 7 layers of a level-2 burger (BBPPPBPBPPPBB).\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n0\n\nThe bottom-most layer of a level-1 burger is a bun.\n\nSample Input 3\n\n50 4321098765432109\n\nSample Output 3\n\n2160549382716056\n\nA level-50 burger is rather thick, to the extent that the number of its layers does not fit into a 32-bit integer.", "sample_input": "2 7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03209", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn some other world, today is Christmas.\n\nMr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:\n\nA level-0 burger is a patty.\n\nA level-L burger (L \\geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.\n\nFor example, a level-1 burger and a level-2 burger look like BPPPB and BBPPPBPBPPPBB (rotated 90 degrees), where B and P stands for a bun and a patty.\n\nThe burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq X \\leq ( the total number of layers in a level-N burger )\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number of patties in the bottom-most X layers from the bottom of a level-N burger.\n\nSample Input 1\n\n2 7\n\nSample Output 1\n\n4\n\nThere are 4 patties in the bottom-most 7 layers of a level-2 burger (BBPPPBPBPPPBB).\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n0\n\nThe bottom-most layer of a level-1 burger is a bun.\n\nSample Input 3\n\n50 4321098765432109\n\nSample Output 3\n\n2160549382716056\n\nA level-50 burger is rather thick, to the extent that the number of its layers does not fit into a 32-bit integer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 946, "cpu_time_ms": 10, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s940942494", "group_id": "codeNet:p03210", "input_text": "program main\nimplicit none\ninteger(4):: x\n \nread*, x\nif (x==3 .or. x==5 .or. x==7)then\nprint'(a)', 'YES'\nelse\nprint'(a)', 'NO'\nend if\nend program", "language": "Fortran", "metadata": {"date": 1587606023, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03210.html", "problem_id": "p03210", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03210/input.txt", "sample_output_relpath": "derived/input_output/data/p03210/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03210/Fortran/s940942494.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s940942494", "user_id": "u234636620"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program main\nimplicit none\ninteger(4):: x\n \nread*, x\nif (x==3 .or. x==5 .or. x==7)then\nprint'(a)', 'YES'\nelse\nprint'(a)', 'NO'\nend if\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s763405482", "group_id": "codeNet:p03210", "input_text": "program shichigosan\n implicit none\n integer :: x\n read(*,*) x\n if ((x-7)*(x-5)*(x-3) == 0) then\n write(*,'(a)') \"YES\"\n else\n write(*,'(a)') \"NO\"\n end if\nend program shichigosan", "language": "Fortran", "metadata": {"date": 1569509964, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03210.html", "problem_id": "p03210", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03210/input.txt", "sample_output_relpath": "derived/input_output/data/p03210/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03210/Fortran/s763405482.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763405482", "user_id": "u506403362"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program shichigosan\n implicit none\n integer :: x\n read(*,*) x\n if ((x-7)*(x-5)*(x-3) == 0) then\n write(*,'(a)') \"YES\"\n else\n write(*,'(a)') \"NO\"\n end if\nend program shichigosan", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s462335762", "group_id": "codeNet:p03212", "input_text": "program main\nimplicit None\n\tinteger(8)::n,p,a(9),s(9,262143),b(262143),i,c,x,y,z,L,d,w\n\t\n\tread*,c\n\t\n\tdo n = 1,262143\n\t\tcall tet(n,a)\n\t\ts(:,n) = a\n\tenddo\n\t\n\ts = (1-((8-(s*2+1))/7))*(s*2+1)\n\t\n\tb = 0\n\tdo n = 1,262143\n\t\tdo i = 1,9\n\t\t\tb(n) = b(n) + s(i,n)*(10**(i-1))\n\t\tenddo\n\tenddo\n\t\n\tp = 0\n\tn = 1\n\t\n\tdo\n\t\tif (b(n) > c) exit\n\t\tx = 0;y = 0;z = 0;w = 1\n\t\td = b(n)\n\t\tL = int(log10(real(d)))+1\n\t\tdo i = L,1,-1\n\t\t\tif(d/10**(i-1) == 7)then\n\t\t\t\tx =1\n\t\t\t\td = d - 7 * 10**(i-1)\n\t\t\t\telse if(d/10**(i-1) == 5)then\n\t\t\t\ty =1\n\t\t\t\td = d - 5 * 10**(i-1)\n\t\t\t\telse if(d/10**(i-1) == 3)then\n\t\t\t\tz =1\n\t\t\t\td = d - 3 * 10**(i-1)\n\t\t\t\telse if(d/10**(i-1) == 0)then\n\t\t\t\tw = 0\n\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\t!print 101,b(n),L,x,y,z,w\n\t\tif(x ==1 .and. y == 1 .and. z ==1 .and. w == 1)then\n\t\t\tp = p + 1\n\t\tendif\n\t\tn = n + 1\n\tenddo\n\t\n\tprint *,p\n101 format(8(i0,1x))\nend program main\n\nsubroutine tet(n,a)\n\tinteger(8)::n,i,p\n\tinteger(8)::a(9)\n\t\n\ta = 0\n\tp = n\n\ti = 1\n\tdo while (p /= 0)\n\t\ta(i) = mod(p,4)\n\t\tp = p/4\n\t\ti = i + 1\n\tenddo\nend subroutine tet", "language": "Fortran", "metadata": {"date": 1545621610, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Fortran/s462335762.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s462335762", "user_id": "u900266249"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,p,a(9),s(9,262143),b(262143),i,c,x,y,z,L,d,w\n\t\n\tread*,c\n\t\n\tdo n = 1,262143\n\t\tcall tet(n,a)\n\t\ts(:,n) = a\n\tenddo\n\t\n\ts = (1-((8-(s*2+1))/7))*(s*2+1)\n\t\n\tb = 0\n\tdo n = 1,262143\n\t\tdo i = 1,9\n\t\t\tb(n) = b(n) + s(i,n)*(10**(i-1))\n\t\tenddo\n\tenddo\n\t\n\tp = 0\n\tn = 1\n\t\n\tdo\n\t\tif (b(n) > c) exit\n\t\tx = 0;y = 0;z = 0;w = 1\n\t\td = b(n)\n\t\tL = int(log10(real(d)))+1\n\t\tdo i = L,1,-1\n\t\t\tif(d/10**(i-1) == 7)then\n\t\t\t\tx =1\n\t\t\t\td = d - 7 * 10**(i-1)\n\t\t\t\telse if(d/10**(i-1) == 5)then\n\t\t\t\ty =1\n\t\t\t\td = d - 5 * 10**(i-1)\n\t\t\t\telse if(d/10**(i-1) == 3)then\n\t\t\t\tz =1\n\t\t\t\td = d - 3 * 10**(i-1)\n\t\t\t\telse if(d/10**(i-1) == 0)then\n\t\t\t\tw = 0\n\t\t\t\texit\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\t!print 101,b(n),L,x,y,z,w\n\t\tif(x ==1 .and. y == 1 .and. z ==1 .and. w == 1)then\n\t\t\tp = p + 1\n\t\tendif\n\t\tn = n + 1\n\tenddo\n\t\n\tprint *,p\n101 format(8(i0,1x))\nend program main\n\nsubroutine tet(n,a)\n\tinteger(8)::n,i,p\n\tinteger(8)::a(9)\n\t\n\ta = 0\n\tp = n\n\ti = 1\n\tdo while (p /= 0)\n\t\ta(i) = mod(p,4)\n\t\tp = p/4\n\t\ti = i + 1\n\tenddo\nend subroutine tet", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1014, "cpu_time_ms": 241, "memory_kb": 21504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s139152154", "group_id": "codeNet:p03212", "input_text": "program main\n implicit none\n integer:: n,i,j,count(4)=0,nnew,summ=0,dummy1,dummy2\n \n read(*,*)n\n do i=1,n\n count(1:3)=0;count(4)=1\n do j=int(log10(real(i))),0,-1\n if(j==int(log10(real(i))))dummy2=i\n nnew=dummy2/10**j\n dummy2=dummy2-nnew*10**j\n \n if(nnew==3)then;count(1)=1;cycle;endif\n if(nnew==5)then;count(2)=1;cycle;endif\n if(nnew==7)then;count(3)=1;cycle;endif\n if(nnew/=3 .and. nnew/=5 .and. nnew/=7)count(4)=0\n ! write(*,*)nnew\n enddo\n if(all(count==1))then\n summ=summ+1\n write(*,*)i\n endif\n enddo\n write(*,*)summ\nend program main\n", "language": "Fortran", "metadata": {"date": 1543805675, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Fortran/s139152154.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s139152154", "user_id": "u539011156"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer:: n,i,j,count(4)=0,nnew,summ=0,dummy1,dummy2\n \n read(*,*)n\n do i=1,n\n count(1:3)=0;count(4)=1\n do j=int(log10(real(i))),0,-1\n if(j==int(log10(real(i))))dummy2=i\n nnew=dummy2/10**j\n dummy2=dummy2-nnew*10**j\n \n if(nnew==3)then;count(1)=1;cycle;endif\n if(nnew==5)then;count(2)=1;cycle;endif\n if(nnew==7)then;count(3)=1;cycle;endif\n if(nnew/=3 .and. nnew/=5 .and. nnew/=7)count(4)=0\n ! write(*,*)nnew\n enddo\n if(all(count==1))then\n summ=summ+1\n write(*,*)i\n endif\n enddo\n write(*,*)summ\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 647, "cpu_time_ms": 2103, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s739233876", "group_id": "codeNet:p03214", "input_text": "program main\nimplicit none\ninteger :: i, j, m, n\ninteger , allocatable :: a( : )\n\nread(*,*) n\nallocate( a(n) )\nread(*,*) a(1:n)\n\nm = 100\ndo i = 1 , n\n if( abs( a(i) - sum(a)/n ) < m ) then\n m = abs( a(i) - sum(a)/n )\n j = i\n end if\nend do\ndo i = 1, n\n if( i/=j ) then\n if( abs( sum(a)/n-a(i) ) ==abs( sum(a)/n - a(j)) ) then\n j = 1\n end if\n end if\nend do\nwrite(*,'(i0)') j - 1\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1555705955, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03214.html", "problem_id": "p03214", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03214/input.txt", "sample_output_relpath": "derived/input_output/data/p03214/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03214/Fortran/s739233876.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s739233876", "user_id": "u696547932"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, m, n\ninteger , allocatable :: a( : )\n\nread(*,*) n\nallocate( a(n) )\nread(*,*) a(1:n)\n\nm = 100\ndo i = 1 , n\n if( abs( a(i) - sum(a)/n ) < m ) then\n m = abs( a(i) - sum(a)/n )\n j = i\n end if\nend do\ndo i = 1, n\n if( i/=j ) then\n if( abs( sum(a)/n-a(i) ) ==abs( sum(a)/n - a(j)) ) then\n j = 1\n end if\n end if\nend do\nwrite(*,'(i0)') j - 1\n\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nNiwango-kun is an employee of Dwango Co., Ltd.\n\nOne day, he is asked to generate a thumbnail from a video a user submitted.\n\nTo generate a thumbnail, he needs to select a frame of the video according to the following procedure:\n\nGet an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of the frames of the video, and each a_i denotes the representation of the i-th frame of the video.\n\nSelect t-th frame whose representation a_t is nearest to the average of all frame representations.\n\nIf there are multiple such frames, select the frame with the smallest index.\n\nFind the index t of the frame he should select to generate a thumbnail.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq a_i \\leq 100\n\nAll numbers given in input are integers\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_{0} a_{1} ... a_{N-1}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nSince the average of frame representations is 2, Niwango-kun needs to select the index 1, whose representation is 2, that is, the nearest value to the average.\n\nSample Input 2\n\n4\n2 5 2 5\n\nSample Output 2\n\n0\n\nThe average of frame representations is 3.5.\n\nIn this case, every frame has the same distance from its representation to the average.\n\nTherefore, Niwango-kun should select index 0, the smallest index among them.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03214", "source_text": "Score : 200 points\n\nProblem Statement\n\nNiwango-kun is an employee of Dwango Co., Ltd.\n\nOne day, he is asked to generate a thumbnail from a video a user submitted.\n\nTo generate a thumbnail, he needs to select a frame of the video according to the following procedure:\n\nGet an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of the frames of the video, and each a_i denotes the representation of the i-th frame of the video.\n\nSelect t-th frame whose representation a_t is nearest to the average of all frame representations.\n\nIf there are multiple such frames, select the frame with the smallest index.\n\nFind the index t of the frame he should select to generate a thumbnail.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq a_i \\leq 100\n\nAll numbers given in input are integers\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_{0} a_{1} ... a_{N-1}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nSince the average of frame representations is 2, Niwango-kun needs to select the index 1, whose representation is 2, that is, the nearest value to the average.\n\nSample Input 2\n\n4\n2 5 2 5\n\nSample Output 2\n\n0\n\nThe average of frame representations is 3.5.\n\nIn this case, every frame has the same distance from its representation to the average.\n\nTherefore, Niwango-kun should select index 0, the smallest index among them.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s053656628", "group_id": "codeNet:p03217", "input_text": "module mod_square_rotation\n implicit none\n integer :: d, s(3,0:2000,0:2000)\ncontains\n subroutine cumsum(a,k)\n integer, intent(in) :: a(0:d-1,0:d-1), k\n integer :: i, j, l, b(3,0:d-1,0:d-1)\n b = 0\n do i = 0, d-1\n do j = 0, d-1\n if (a(i,j) > (k+1)*(k+1)) b(1,i,j) = b(1,i,j)+1\n if (a(i,j) > k*k) b(2,i,j) = b(2,i,j)+1\n if (a(i,j) > k*(k+1)) b(3,i,j) = b(3,i,j)+1\n end do\n end do\n s = 0\n do i = 1, 2*d\n do j = 1, 2*d\n s(:,i,j) = s(:,i-1,j)+s(:,i,j-1)-s(:,i-1,j-1) &\n & +b(:,mod(i-1,d),mod(j-1,d))\n end do\n end do\n end\n integer function getsum(l,i1,j1,i2,j2)\n integer, intent(in) :: l, i1, j1, i2, j2\n getsum = s(l,i2,j2)-s(l,i1-1,j2)-s(l,i2,j1-1)+s(l,i1-1,j1-1)\n end\n logical function check(b)\n integer, intent(in) :: b\n integer :: i, j\n check = .false.\n do i = 1, d\n do j = 1, d\n if (getsum(1,i,j,i+b,j+b) /= 0) cycle\n if (getsum(2,i+b+1,j+b+1,i+d-1,j+d-1) /= 0) cycle\n if (getsum(3,i+b+1,j,i+d-1,j+b) /= 0) cycle\n if (getsum(3,i,j+b+1,i+b,j+d-1) /= 0) cycle\n check = .true.\n return\n end do\n end do\n end\nend module mod_square_rotation\nprogram square_rotation\n use mod_square_rotation\n implicit none\n integer :: n, x, y, a(0:1000,0:1000) = 0, i, j, m, k, l, r\n read(*,*) n, d\n do i = 1, n\n read(*,*) x, y\n x = mod(x,d)\n y = mod(y,d)\n a(x,y) = a(x,y)+1\n end do\n m = maxval(a(0:d-1,0:d-1))\n k = 0\n do while (m > (k+1)*(k+1))\n k = k+1\n end do\n call cumsum(a(0:d-1,0:d-1),k)\n l = -1\n r = d-1\n do while (r-l > 1)\n m = (l+r)/2\n if (check(m)) then\n r = m\n else\n l = m\n end if\n end do\n write(*,'(i0)') k*d+r\nend program square_rotation", "language": "Fortran", "metadata": {"date": 1566706454, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03217.html", "problem_id": "p03217", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03217/input.txt", "sample_output_relpath": "derived/input_output/data/p03217/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03217/Fortran/s053656628.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053656628", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module mod_square_rotation\n implicit none\n integer :: d, s(3,0:2000,0:2000)\ncontains\n subroutine cumsum(a,k)\n integer, intent(in) :: a(0:d-1,0:d-1), k\n integer :: i, j, l, b(3,0:d-1,0:d-1)\n b = 0\n do i = 0, d-1\n do j = 0, d-1\n if (a(i,j) > (k+1)*(k+1)) b(1,i,j) = b(1,i,j)+1\n if (a(i,j) > k*k) b(2,i,j) = b(2,i,j)+1\n if (a(i,j) > k*(k+1)) b(3,i,j) = b(3,i,j)+1\n end do\n end do\n s = 0\n do i = 1, 2*d\n do j = 1, 2*d\n s(:,i,j) = s(:,i-1,j)+s(:,i,j-1)-s(:,i-1,j-1) &\n & +b(:,mod(i-1,d),mod(j-1,d))\n end do\n end do\n end\n integer function getsum(l,i1,j1,i2,j2)\n integer, intent(in) :: l, i1, j1, i2, j2\n getsum = s(l,i2,j2)-s(l,i1-1,j2)-s(l,i2,j1-1)+s(l,i1-1,j1-1)\n end\n logical function check(b)\n integer, intent(in) :: b\n integer :: i, j\n check = .false.\n do i = 1, d\n do j = 1, d\n if (getsum(1,i,j,i+b,j+b) /= 0) cycle\n if (getsum(2,i+b+1,j+b+1,i+d-1,j+d-1) /= 0) cycle\n if (getsum(3,i+b+1,j,i+d-1,j+b) /= 0) cycle\n if (getsum(3,i,j+b+1,i+b,j+d-1) /= 0) cycle\n check = .true.\n return\n end do\n end do\n end\nend module mod_square_rotation\nprogram square_rotation\n use mod_square_rotation\n implicit none\n integer :: n, x, y, a(0:1000,0:1000) = 0, i, j, m, k, l, r\n read(*,*) n, d\n do i = 1, n\n read(*,*) x, y\n x = mod(x,d)\n y = mod(y,d)\n a(x,y) = a(x,y)+1\n end do\n m = maxval(a(0:d-1,0:d-1))\n k = 0\n do while (m > (k+1)*(k+1))\n k = k+1\n end do\n call cumsum(a(0:d-1,0:d-1),k)\n l = -1\n r = d-1\n do while (r-l > 1)\n m = (l+r)/2\n if (check(m)) then\n r = m\n else\n l = m\n end if\n end do\n write(*,'(i0)') k*d+r\nend program square_rotation", "problem_context": "Score : 800 points\n\nProblem Statement\n\nNiwango-kun, an employee of Dwango Co., Ltd., likes Niconico TV-chan, so he collected a lot of soft toys of her and spread them on the floor.\n\nNiwango-kun has N black rare soft toys of Niconico TV-chan and they are spread together with ordinary ones. He wanted these black rare soft toys to be close together, so he decided to rearrange them.\n\nIn an infinitely large two-dimensional plane, every lattice point has a soft toy on it. The coordinates (x_i,y_i) of N black rare soft toys are given. All soft toys are considered to be points (without a length, area, or volume).\n\nHe may perform the following operation arbitrarily many times:\n\nPut an axis-aligned square with side length D, rotate the square by 90 degrees with four soft toys on the four corners of the square. More specifically, if the left bottom corner's coordinate is (x, y), rotate four points (x,y) \\rightarrow (x+D,y) \\rightarrow (x+D,y+D) \\rightarrow (x,y+D) \\rightarrow (x,y) in this order. Each of the four corners of the square must be on a lattice point.\n\nLet's define the scatteredness of an arrangement by the minimum side length of an axis-aligned square enclosing all black rare soft toys. Black rare soft toys on the edges or the vertices of a square are considered to be enclosed by the square.\n\nFind the minimum scatteredness after he performs arbitrarily many operations.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq D \\leq 1000\n\n0 \\leq x_i, y_i \\leq 10^9\n\nGiven coordinates are pairwise distinct\n\nAll numbers given in input are integers\n\nPartial Scores\n\n500 points will be awarded for passing the test set satisfying 1 \\leq D \\leq 30.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n0 0\n1 0\n2 0\n\nSample Output 1\n\n1\n\nSample Input 2\n\n19 2\n1 3\n2 3\n0 1\n1 1\n2 1\n3 1\n4 4\n5 4\n6 4\n7 4\n8 4\n8 3\n8 2\n8 1\n8 0\n7 0\n6 0\n5 0\n4 0\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8 3\n0 0\n0 3\n3 0\n3 3\n2 2\n2 5\n5 2\n5 5\n\nSample Output 3\n\n4", "sample_input": "3 1\n0 0\n1 0\n2 0\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03217", "source_text": "Score : 800 points\n\nProblem Statement\n\nNiwango-kun, an employee of Dwango Co., Ltd., likes Niconico TV-chan, so he collected a lot of soft toys of her and spread them on the floor.\n\nNiwango-kun has N black rare soft toys of Niconico TV-chan and they are spread together with ordinary ones. He wanted these black rare soft toys to be close together, so he decided to rearrange them.\n\nIn an infinitely large two-dimensional plane, every lattice point has a soft toy on it. The coordinates (x_i,y_i) of N black rare soft toys are given. All soft toys are considered to be points (without a length, area, or volume).\n\nHe may perform the following operation arbitrarily many times:\n\nPut an axis-aligned square with side length D, rotate the square by 90 degrees with four soft toys on the four corners of the square. More specifically, if the left bottom corner's coordinate is (x, y), rotate four points (x,y) \\rightarrow (x+D,y) \\rightarrow (x+D,y+D) \\rightarrow (x,y+D) \\rightarrow (x,y) in this order. Each of the four corners of the square must be on a lattice point.\n\nLet's define the scatteredness of an arrangement by the minimum side length of an axis-aligned square enclosing all black rare soft toys. Black rare soft toys on the edges or the vertices of a square are considered to be enclosed by the square.\n\nFind the minimum scatteredness after he performs arbitrarily many operations.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq D \\leq 1000\n\n0 \\leq x_i, y_i \\leq 10^9\n\nGiven coordinates are pairwise distinct\n\nAll numbers given in input are integers\n\nPartial Scores\n\n500 points will be awarded for passing the test set satisfying 1 \\leq D \\leq 30.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n0 0\n1 0\n2 0\n\nSample Output 1\n\n1\n\nSample Input 2\n\n19 2\n1 3\n2 3\n0 1\n1 1\n2 1\n3 1\n4 4\n5 4\n6 4\n7 4\n8 4\n8 3\n8 2\n8 1\n8 0\n7 0\n6 0\n5 0\n4 0\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8 3\n0 0\n0 3\n3 0\n3 3\n2 2\n2 5\n5 2\n5 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1737, "cpu_time_ms": 527, "memory_kb": 66688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s985237481", "group_id": "codeNet:p03219", "input_text": "program main\n implicit none\n integer x,y\n read(*,*)x,y\n write(*,*)x+y/2\nend program main\n", "language": "Fortran", "metadata": {"date": 1543165462, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03219.html", "problem_id": "p03219", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03219/input.txt", "sample_output_relpath": "derived/input_output/data/p03219/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03219/Fortran/s985237481.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985237481", "user_id": "u539011156"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "program main\n implicit none\n integer x,y\n read(*,*)x,y\n write(*,*)x+y/2\nend program main\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "sample_input": "81 58\n"}, "reference_outputs": ["110\n"], "source_document_id": "p03219", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s520508186", "group_id": "codeNet:p03222", "input_text": "program test\nimplicit none\n\ninteger(8) :: h,w,k,i,j,ans,big=1d9+7\ninteger(8) :: go(0:10,3)=0,br_a(0:10),br_b(0:10),dp(0:200,0:10)=0\n\nread(*,*) h,w,k\n\n!最後に橋あり→a,なし→b\n\nbr_a(0)=0\nbr_b(0)=0\n\nbr_a(1)=0\nbr_b(1)=1\n\ndo i=2,w\n\tbr_a(i) = br_b(i-1)\n\tbr_b(i) = mod(br_b(i-1) + br_a(i-1),big)\nenddo\n\n!左に行く\ndo i=1,w\n\tif(i==1) then\n\t\tgo(i,1) = 0\n\telse\n\t\tgo(i,1) = mod(br_b(i-1) * br_b(w-i+1),big)\n\tendif\nenddo\n\n!右に行く\ndo i=1,w\n\tgo(i,3) = go(w+1-i,1)\nenddo\n\n!どちらでもない\ndo i=1,w\n\tgo(i,2) = mod((br_a(w)+br_b(w)) - go(i,1) - go(i,3),big)\nenddo\n\n!とりあえずDPっしょ\ndp(0,1)=1\ndo i=1,h\n\tdo j=1,w\n\t\tdp(i,j) = mod(dp(i-1,j-1)*go(j-1,3) +dp(i-1,j)*go(j,2) +dp(i-1,j+1)*go(j+1,1),big)\n\tenddo\nenddo\n\nwrite(*,*) dp(h,k)\n\nend program\n", "language": "Fortran", "metadata": {"date": 1551432302, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03222.html", "problem_id": "p03222", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03222/input.txt", "sample_output_relpath": "derived/input_output/data/p03222/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03222/Fortran/s520508186.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s520508186", "user_id": "u454703763"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program test\nimplicit none\n\ninteger(8) :: h,w,k,i,j,ans,big=1d9+7\ninteger(8) :: go(0:10,3)=0,br_a(0:10),br_b(0:10),dp(0:200,0:10)=0\n\nread(*,*) h,w,k\n\n!最後に橋あり→a,なし→b\n\nbr_a(0)=0\nbr_b(0)=0\n\nbr_a(1)=0\nbr_b(1)=1\n\ndo i=2,w\n\tbr_a(i) = br_b(i-1)\n\tbr_b(i) = mod(br_b(i-1) + br_a(i-1),big)\nenddo\n\n!左に行く\ndo i=1,w\n\tif(i==1) then\n\t\tgo(i,1) = 0\n\telse\n\t\tgo(i,1) = mod(br_b(i-1) * br_b(w-i+1),big)\n\tendif\nenddo\n\n!右に行く\ndo i=1,w\n\tgo(i,3) = go(w+1-i,1)\nenddo\n\n!どちらでもない\ndo i=1,w\n\tgo(i,2) = mod((br_a(w)+br_b(w)) - go(i,1) - go(i,3),big)\nenddo\n\n!とりあえずDPっしょ\ndp(0,1)=1\ndo i=1,h\n\tdo j=1,w\n\t\tdp(i,j) = mod(dp(i-1,j-1)*go(j-1,3) +dp(i-1,j)*go(j,2) +dp(i-1,j+1)*go(j+1,1),big)\n\tenddo\nenddo\n\nwrite(*,*) dp(h,k)\n\nend program\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "sample_input": "1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03222", "source_text": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 762, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s692267679", "group_id": "codeNet:p03222", "input_text": "program test\nimplicit none\n\ninteger(8) :: h,w,k,i,j,ans,big=1d9+7\ninteger(8) :: go(0:10,3)=0,bou(0:10)=0,dp(0:200,0:10)=0\n\nread(*,*) h,w,k\n\nif(w == 1)then\n\twrite(*,*) 1\nelse\n\n\t!全探査するか…\n\tdo i=0,2**(w-1)-1\n\t\tdo j=1,w-1\n\t\t\tif(BTEST(i,j-1))then\n\t\t\t\tbou(j) = 1\n\t\t\telse\n\t\t\t\tbou(j) = 0\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\tdo j=1,w-2\n\t\t\tif(bou(j)+bou(j+1)==2)then\n\t\t\t\tgoto 100\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\t!i番目にいるときに、左に行くか右に行くかそうでないか\n\t\tdo j=1,w\n\t\t\tif(bou(j-1) == 1) then !左\n\t\t\t\tgo(j,1) = go(j,1) + 1\n\t\t\telse if(bou(j) == 1) then !右\n\t\t\t\tgo(j,3) = go(j,3) + 1\n\t\t\telse\n\t\t\t\tgo(j,2) = go(j,2) + 1\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\t100 continue\n\t\t\n\tenddo\n\n\n\n\n\t!とりあえずDPっしょ\n\tdp(0,1)=1\n\tdo i=1,h\n\t\tdo j=1,w\n\t\t\t!j-1から右へ、jからそのまま、j+1から左へ\n\t\t\tdp(i,j) = mod(dp(i-1,j-1)*go(j-1,3) +dp(i-1,j)*go(j,2) + dp(i-1,j+1)*go(j+1,1),big)\n\t\tenddo\n\tenddo\n\n\twrite(*,*) dp(h,k)\n\nendif\n\nend program", "language": "Fortran", "metadata": {"date": 1551430389, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03222.html", "problem_id": "p03222", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03222/input.txt", "sample_output_relpath": "derived/input_output/data/p03222/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03222/Fortran/s692267679.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s692267679", "user_id": "u454703763"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program test\nimplicit none\n\ninteger(8) :: h,w,k,i,j,ans,big=1d9+7\ninteger(8) :: go(0:10,3)=0,bou(0:10)=0,dp(0:200,0:10)=0\n\nread(*,*) h,w,k\n\nif(w == 1)then\n\twrite(*,*) 1\nelse\n\n\t!全探査するか…\n\tdo i=0,2**(w-1)-1\n\t\tdo j=1,w-1\n\t\t\tif(BTEST(i,j-1))then\n\t\t\t\tbou(j) = 1\n\t\t\telse\n\t\t\t\tbou(j) = 0\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\tdo j=1,w-2\n\t\t\tif(bou(j)+bou(j+1)==2)then\n\t\t\t\tgoto 100\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\t!i番目にいるときに、左に行くか右に行くかそうでないか\n\t\tdo j=1,w\n\t\t\tif(bou(j-1) == 1) then !左\n\t\t\t\tgo(j,1) = go(j,1) + 1\n\t\t\telse if(bou(j) == 1) then !右\n\t\t\t\tgo(j,3) = go(j,3) + 1\n\t\t\telse\n\t\t\t\tgo(j,2) = go(j,2) + 1\n\t\t\tendif\n\t\tenddo\n\t\t\n\t\t100 continue\n\t\t\n\tenddo\n\n\n\n\n\t!とりあえずDPっしょ\n\tdp(0,1)=1\n\tdo i=1,h\n\t\tdo j=1,w\n\t\t\t!j-1から右へ、jからそのまま、j+1から左へ\n\t\t\tdp(i,j) = mod(dp(i-1,j-1)*go(j-1,3) +dp(i-1,j)*go(j,2) + dp(i-1,j+1)*go(j+1,1),big)\n\t\tenddo\n\tenddo\n\n\twrite(*,*) dp(h,k)\n\nendif\n\nend program", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "sample_input": "1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03222", "source_text": "Score: 400 points\n\nProblem Statement\n\nAmidakuji is a traditional method of lottery in Japan.\n\nTo make an amidakuji, we first draw W parallel vertical lines, and then draw horizontal lines that connect them. The length of each vertical line is H+1 [cm], and the endpoints of the horizontal lines must be at 1, 2, 3, ..., or H [cm] from the top of a vertical line.\n\nA valid amidakuji is an amidakuji that satisfies the following conditions:\n\nNo two horizontal lines share an endpoint.\n\nThe two endpoints of each horizontal lines must be at the same height.\n\nA horizontal line must connect adjacent vertical lines.\n\nFind the number of the valid amidakuji that satisfy the following condition, modulo 1\\ 000\\ 000\\ 007: if we trace the path from the top of the leftmost vertical line to the bottom, always following horizontal lines when we encounter them, we reach the bottom of the K-th vertical line from the left.\n\nFor example, in the following amidakuji, we will reach the bottom of the fourth vertical line from the left.\n\nConstraints\n\nH is an integer between 1 and 100 (inclusive).\n\nW is an integer between 1 and 8 (inclusive).\n\nK is an integer between 1 and W (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\n\nOutput\n\nPrint the number of the amidakuji that satisfy the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 2\n\n1 3 1\n\nSample Output 2\n\n2\n\nOnly the following two amidakuji satisfy the condition:\n\nSample Input 3\n\n2 3 3\n\nSample Output 3\n\n1\n\nOnly the following one amidakuji satisfies the condition:\n\nSample Input 4\n\n2 3 1\n\nSample Output 4\n\n5\n\nOnly the following five amidakuji satisfy the condition:\n\nSample Input 5\n\n7 1 1\n\nSample Output 5\n\n1\n\nAs there is only one vertical line, we cannot draw any horizontal lines. Thus, there is only one amidakuji that satisfies the condition: the amidakuji with no horizontal lines.\n\nSample Input 6\n\n15 8 5\n\nSample Output 6\n\n437760187\n\nBe sure to print the answer modulo 1\\ 000\\ 000\\ 007.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 943, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s864180299", "group_id": "codeNet:p03227", "input_text": "program main\n\timplicit none\n character(3)::s\n read(*,*)s\n if(len_trim(s)==2)then\n \twrite(*,*)s\n else\n \twrite(*,*)s(3:3)//s(2:2)//s(1:1)\n end if\n stop\nend program main\n\n", "language": "Fortran", "metadata": {"date": 1592630726, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03227.html", "problem_id": "p03227", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03227/input.txt", "sample_output_relpath": "derived/input_output/data/p03227/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03227/Fortran/s864180299.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864180299", "user_id": "u884601206"}, "prompt_components": {"gold_output": "cba\n", "input_to_evaluate": "program main\n\timplicit none\n character(3)::s\n read(*,*)s\n if(len_trim(s)==2)then\n \twrite(*,*)s\n else\n \twrite(*,*)s(3:3)//s(2:2)//s(1:1)\n end if\n stop\nend program main\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 2 or 3 consisting of lowercase English letters. If the length of the string is 2, print it as is; if the length is 3, print the string after reversing it.\n\nConstraints\n\nThe length of S is 2 or 3.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the length of S is 2, print S as is; if the length is 3, print S after reversing it.\n\nSample Input 1\n\nabc\n\nSample Output 1\n\ncba\n\nAs the length of S is 3, we print it after reversing it.\n\nSample Input 2\n\nac\n\nSample Output 2\n\nac\n\nAs the length of S is 2, we print it as is.", "sample_input": "abc\n"}, "reference_outputs": ["cba\n"], "source_document_id": "p03227", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 2 or 3 consisting of lowercase English letters. If the length of the string is 2, print it as is; if the length is 3, print the string after reversing it.\n\nConstraints\n\nThe length of S is 2 or 3.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the length of S is 2, print S as is; if the length is 3, print S after reversing it.\n\nSample Input 1\n\nabc\n\nSample Output 1\n\ncba\n\nAs the length of S is 3, we print it after reversing it.\n\nSample Input 2\n\nac\n\nSample Output 2\n\nac\n\nAs the length of S is 2, we print it as is.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s929688832", "group_id": "codeNet:p03228", "input_text": "program exchange\n implicit none\n integer :: a, b, k, i\n read(*,*) a, b, k\n do i = 1, k\n if (mod(i,2) .eq. 1) then\n a = a/2\n b = b+a\n else\n b = b/2\n a = a+b\n end if\n end do\n write(*,'(i0,x,i0)') a, b\n stop\nend program exchange", "language": "Fortran", "metadata": {"date": 1540690142, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03228.html", "problem_id": "p03228", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03228/input.txt", "sample_output_relpath": "derived/input_output/data/p03228/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03228/Fortran/s929688832.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s929688832", "user_id": "u506403362"}, "prompt_components": {"gold_output": "5 3\n", "input_to_evaluate": "program exchange\n implicit none\n integer :: a, b, k, i\n read(*,*) a, b, k\n do i = 1, k\n if (mod(i,2) .eq. 1) then\n a = a/2\n b = b+a\n else\n b = b/2\n a = a+b\n end if\n end do\n write(*,'(i0,x,i0)') a, b\n stop\nend program exchange", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "sample_input": "5 4 2\n"}, "reference_outputs": ["5 3\n"], "source_document_id": "p03228", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 272, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s410069559", "group_id": "codeNet:p03229", "input_text": "program prob6\n implicit none\n integer(16)::N,i,j,ans,tmp,k,ans2\n integer(16),allocatable::A(:),gg(:)\n read(*,*) N\n allocate(A(N),gg(N))\n do i = 1, N\n read(*,*) A(i)\n end do\n\n call heapsort(n,A)\n\n ans = 0\n ans2 = 0\n\n if(mod(n,2) == 1)then\n i = 1\n j = N\n do k = 1, n/2\n ans = ans + A(j) - A(i)\n j = j-1\n if(k < n/2) then\n ans = ans + A(j) - A(i)\n end if\n i = i+1\n end do\n ans = ans + max(A(n)-A(n/2+1),A(n/2+1)-A(n/2))\n\n i = 1\n j = N\n do k = 1, n/2\n ans2 = ans2 + A(j) - A(i)\n i = i + 1\n if(k < n/2) then\n ans2 = ans2 + A(j) - A(i)\n j = j - 1\n end if\n end do\n ans2 = ans2 + max(A(n/2+1)-A(1),A(n-1)-A(n/2+1))\n ans = max(ans,ans2)\n\n else if(n == 2) then\n ans = A(2)-A(1)\n else\n tmp = A(n/2)\n j = N\n i = 1\n do k = 1, n/2-1\n ans = ans + A(j) - A(i)\n j = j-1\n ans = ans + A(j) - A(i)\n i = i+1\n end do\n ans = ans + A(N) - A(n/2)\n\n j = N\n i = 1\n do k = 1, n/2-1\n ans2 = ans2 + A(j) - A(i)\n i = i+1\n ans2 = ans2 + A(j) - A(i)\n j = j-1\n end do\n ans2 = ans2 + A(n/2+1) - A(1)\n ans = max(ans,ans2)\n end if\n\n write(*,*) ans\n\n stop\ncontains\n subroutine heapsort(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n double precision :: t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort\nend program", "language": "Fortran", "metadata": {"date": 1593833820, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03229.html", "problem_id": "p03229", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03229/input.txt", "sample_output_relpath": "derived/input_output/data/p03229/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03229/Fortran/s410069559.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s410069559", "user_id": "u841856382"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "program prob6\n implicit none\n integer(16)::N,i,j,ans,tmp,k,ans2\n integer(16),allocatable::A(:),gg(:)\n read(*,*) N\n allocate(A(N),gg(N))\n do i = 1, N\n read(*,*) A(i)\n end do\n\n call heapsort(n,A)\n\n ans = 0\n ans2 = 0\n\n if(mod(n,2) == 1)then\n i = 1\n j = N\n do k = 1, n/2\n ans = ans + A(j) - A(i)\n j = j-1\n if(k < n/2) then\n ans = ans + A(j) - A(i)\n end if\n i = i+1\n end do\n ans = ans + max(A(n)-A(n/2+1),A(n/2+1)-A(n/2))\n\n i = 1\n j = N\n do k = 1, n/2\n ans2 = ans2 + A(j) - A(i)\n i = i + 1\n if(k < n/2) then\n ans2 = ans2 + A(j) - A(i)\n j = j - 1\n end if\n end do\n ans2 = ans2 + max(A(n/2+1)-A(1),A(n-1)-A(n/2+1))\n ans = max(ans,ans2)\n\n else if(n == 2) then\n ans = A(2)-A(1)\n else\n tmp = A(n/2)\n j = N\n i = 1\n do k = 1, n/2-1\n ans = ans + A(j) - A(i)\n j = j-1\n ans = ans + A(j) - A(i)\n i = i+1\n end do\n ans = ans + A(N) - A(n/2)\n\n j = N\n i = 1\n do k = 1, n/2-1\n ans2 = ans2 + A(j) - A(i)\n i = i+1\n ans2 = ans2 + A(j) - A(i)\n j = j-1\n end do\n ans2 = ans2 + A(n/2+1) - A(1)\n ans = max(ans,ans2)\n end if\n\n write(*,*) ans\n\n stop\ncontains\n subroutine heapsort(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n \n integer ::i,k,j,l\n double precision :: t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "sample_input": "5\n6\n8\n1\n2\n3\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03229", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2594, "cpu_time_ms": 69, "memory_kb": 4320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s085272832", "group_id": "codeNet:p03229", "input_text": "program align\n implicit none\n integer :: n, i\n integer, allocatable :: a(:)\n integer(8) :: m1, m2, m3, m4\n read(*,*) n\n allocate(a(n))\n do i = 1, n\n read(*,*) a(i)\n end do\n if (n .eq. 2) then\n write(*,'(i0)') abs(a(1)-a(2))\n stop\n end if\n call quickSort(a)\n m1 = 0\n m2 = 0\n m3 = 0\n m4 = 0\n if (mod(n,2) .eq. 1) then\n do i = 1, n/2\n m1 = m1 + abs(a(i)-a(n+1-i))\n m2 = m2 + abs(a(n+1-i)-a(i))\n end do\n do i = 1, n/2-1\n m1 = m1 + abs(a(n+1-i)-a(i+1))\n m2 = m2 + abs(a(i)-a(n-i))\n end do\n m1 = m1 + abs(a(1)-a(n/2+1))\n m2 = m2 + abs(a(n)-a(n/2+1))\n else\n do i = 1, n/2-1\n m1 = m1 + abs(a(i)-a(n+1-i))\n m2 = m2 + abs(a(n+1-i)-a(i))\n end do\n if (n .gt. 4) then\n do i = 1, n/2-2\n m1 = m1 + abs(a(n+1-i)-a(i+1))\n m2 = m2 + abs(a(i)-a(n-i))\n end do\n end if\n m3 = m1 + abs(a(n/2)-a(1)) + abs(a(n/2+2)-a(n/2+1))\n m4 = m2 + abs(a(n/2)-a(n)) + abs(a(n/2-1)-a(n/2+1))\n m1 = m1 + abs(a(n/2+1)-a(1)) + abs(a(n/2+2)-a(n/2))\n m2 = m2 + abs(a(n/2+1)-a(n)) + abs(a(n/2-1)-a(n/2))\n m1 = max(m1,m3)\n m2 = max(m2,m4)\n end if\n write(*,'(i0)') max(m1,m2)\n deallocate(a)\n stop\ncontains\n recursive subroutine quickSort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: n, i, p, top, btm\n n = size(a)\n if (n == 1) return\n if (n == 2) then\n if (a(1) > a(2)) call swap(a(1),a(2))\n return\n end if\n do i = 1, n-1\n if (a(i) > a(i+1)) call swap(a(i),a(i+1))\n end do\n do i = n-1, 2, -1\n if (a(i) < a(i-1)) call swap(a(i),a(i-1))\n end do\n if (n == 3) return\n p = (a(1)+a(n))/2\n btm = 2\n top = n-1\n do while (btm < top)\n if (a(btm) <= p) btm = btm + 1\n if (a(top) > p) top = top - 1\n if (a(btm) > p .and. a(top) <= p) then\n call swap(a(btm),a(top))\n btm = btm + 1\n top = top - 1\n end if\n end do\n\n call quickSort(a(top:n-1))\n call quickSort(a(2:btm))\n \n return\n end subroutine quickSort\n\n subroutine swap(a,b)\n implicit none\n integer, intent(inout) :: a, b\n integer :: c\n c = a\n a = b\n b = c\n return\n end subroutine swap\nend program align", "language": "Fortran", "metadata": {"date": 1540693726, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03229.html", "problem_id": "p03229", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03229/input.txt", "sample_output_relpath": "derived/input_output/data/p03229/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03229/Fortran/s085272832.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s085272832", "user_id": "u506403362"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "program align\n implicit none\n integer :: n, i\n integer, allocatable :: a(:)\n integer(8) :: m1, m2, m3, m4\n read(*,*) n\n allocate(a(n))\n do i = 1, n\n read(*,*) a(i)\n end do\n if (n .eq. 2) then\n write(*,'(i0)') abs(a(1)-a(2))\n stop\n end if\n call quickSort(a)\n m1 = 0\n m2 = 0\n m3 = 0\n m4 = 0\n if (mod(n,2) .eq. 1) then\n do i = 1, n/2\n m1 = m1 + abs(a(i)-a(n+1-i))\n m2 = m2 + abs(a(n+1-i)-a(i))\n end do\n do i = 1, n/2-1\n m1 = m1 + abs(a(n+1-i)-a(i+1))\n m2 = m2 + abs(a(i)-a(n-i))\n end do\n m1 = m1 + abs(a(1)-a(n/2+1))\n m2 = m2 + abs(a(n)-a(n/2+1))\n else\n do i = 1, n/2-1\n m1 = m1 + abs(a(i)-a(n+1-i))\n m2 = m2 + abs(a(n+1-i)-a(i))\n end do\n if (n .gt. 4) then\n do i = 1, n/2-2\n m1 = m1 + abs(a(n+1-i)-a(i+1))\n m2 = m2 + abs(a(i)-a(n-i))\n end do\n end if\n m3 = m1 + abs(a(n/2)-a(1)) + abs(a(n/2+2)-a(n/2+1))\n m4 = m2 + abs(a(n/2)-a(n)) + abs(a(n/2-1)-a(n/2+1))\n m1 = m1 + abs(a(n/2+1)-a(1)) + abs(a(n/2+2)-a(n/2))\n m2 = m2 + abs(a(n/2+1)-a(n)) + abs(a(n/2-1)-a(n/2))\n m1 = max(m1,m3)\n m2 = max(m2,m4)\n end if\n write(*,'(i0)') max(m1,m2)\n deallocate(a)\n stop\ncontains\n recursive subroutine quickSort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: n, i, p, top, btm\n n = size(a)\n if (n == 1) return\n if (n == 2) then\n if (a(1) > a(2)) call swap(a(1),a(2))\n return\n end if\n do i = 1, n-1\n if (a(i) > a(i+1)) call swap(a(i),a(i+1))\n end do\n do i = n-1, 2, -1\n if (a(i) < a(i-1)) call swap(a(i),a(i-1))\n end do\n if (n == 3) return\n p = (a(1)+a(n))/2\n btm = 2\n top = n-1\n do while (btm < top)\n if (a(btm) <= p) btm = btm + 1\n if (a(top) > p) top = top - 1\n if (a(btm) > p .and. a(top) <= p) then\n call swap(a(btm),a(top))\n btm = btm + 1\n top = top - 1\n end if\n end do\n\n call quickSort(a(top:n-1))\n call quickSort(a(2:btm))\n \n return\n end subroutine quickSort\n\n subroutine swap(a,b)\n implicit none\n integer, intent(inout) :: a, b\n integer :: c\n c = a\n a = b\n b = c\n return\n end subroutine swap\nend program align", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "sample_input": "5\n6\n8\n1\n2\n3\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03229", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2301, "cpu_time_ms": 2103, "memory_kb": 2944}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s608868631", "group_id": "codeNet:p03238", "input_text": "program main\n implicit none\n integer :: n, a, b\n read(*, *) n\n if (n == 1) then\n write(*, \"(a)\") \"Hello World\"\n else\n read(*, *) a\n read(*, *) b\n write(*, \"(i0)\") a + b\n end if\nend program main\n", "language": "Fortran", "metadata": {"date": 1547658707, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03238.html", "problem_id": "p03238", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03238/input.txt", "sample_output_relpath": "derived/input_output/data/p03238/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03238/Fortran/s608868631.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s608868631", "user_id": "u388927326"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, a, b\n read(*, *) n\n if (n == 1) then\n write(*, \"(a)\") \"Hello World\"\n else\n read(*, *) a\n read(*, *) b\n write(*, \"(i0)\") a + b\n end if\nend program main\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "sample_input": "1\n"}, "reference_outputs": ["Hello World\n"], "source_document_id": "p03238", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn 2020, AtCoder Inc. with an annual sales of more than one billion yen (the currency of Japan) has started a business in programming education.\n\nOne day, there was an exam where a one-year-old child must write a program that prints Hello World, and a two-year-old child must write a program that receives integers A, B and prints A+B.\n\nTakahashi, who is taking this exam, suddenly forgets his age.\n\nHe decides to write a program that first receives his age N (1 or 2) as input, then prints Hello World if N=1, and additionally receives integers A, B and prints A+B if N=2.\n\nWrite this program for him.\n\nConstraints\n\nN is 1 or 2.\n\nA is an integer between 1 and 9 (inclusive).\n\nB is an integer between 1 and 9 (inclusive).\n\nInput\n\nInput is given from Standard Input in one of the following formats:\n\n1\n\n2\nA\nB\n\nOutput\n\nIf N=1, print Hello World; if N=2, print A+B.\n\nSample Input 1\n\n1\n\nSample Output 1\n\nHello World\n\nAs N=1, Takahashi is one year old. Thus, we should print Hello World.\n\nSample Input 2\n\n2\n3\n5\n\nSample Output 2\n\n8\n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8 since A=3 and B=5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s802258956", "group_id": "codeNet:p03239", "input_text": "program time_limit_exceeded\n implicit none\n integer :: n, l, c, t, i, a = 1001\n read(*,*) n, l\n do i = 1, n\n read(*,*) c, t\n if (t <= l) a = min(a,c)\n end do\n if (a == 1001) then\n write(*,'(a)') \"TLE\"\n else\n write(*,'(i0)') a\n end if\nend program time_limit_exceeded", "language": "Fortran", "metadata": {"date": 1569478019, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03239.html", "problem_id": "p03239", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03239/input.txt", "sample_output_relpath": "derived/input_output/data/p03239/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03239/Fortran/s802258956.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802258956", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program time_limit_exceeded\n implicit none\n integer :: n, l, c, t, i, a = 1001\n read(*,*) n, l\n do i = 1, n\n read(*,*) c, t\n if (t <= l) a = min(a,c)\n end do\n if (a == 1001) then\n write(*,'(a)') \"TLE\"\n else\n write(*,'(i0)') a\n end if\nend program time_limit_exceeded", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s494920508", "group_id": "codeNet:p03239", "input_text": "program main\n implicit none\n integer n,time\n integer i\n integer,allocatable,dimension(:)::c,t\n integer::cmin=1000,tmax=0\n read(*,*)n,time\n allocate(c(n),t(n))\n do i=1,n\n read(*,*)c(i),t(i)\n enddo\n do i=1,n\n if(t(i)<=time .and. cmin>=c(i))cmin=c(i)\n enddo\n if(cmin/=1000)then\n write(*,*)cmin\n else\n write(*,\"(A3)\")\"TLE\"\n endif\nend program main\n", "language": "Fortran", "metadata": {"date": 1542133721, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03239.html", "problem_id": "p03239", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03239/input.txt", "sample_output_relpath": "derived/input_output/data/p03239/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03239/Fortran/s494920508.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s494920508", "user_id": "u539011156"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit none\n integer n,time\n integer i\n integer,allocatable,dimension(:)::c,t\n integer::cmin=1000,tmax=0\n read(*,*)n,time\n allocate(c(n),t(n))\n do i=1,n\n read(*,*)c(i),t(i)\n enddo\n do i=1,n\n if(t(i)<=time .and. cmin>=c(i))cmin=c(i)\n enddo\n if(cmin/=1000)then\n write(*,*)cmin\n else\n write(*,\"(A3)\")\"TLE\"\n endif\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s134484144", "group_id": "codeNet:p03241", "input_text": "program main\nimplicit None\n\tinteger(8)::n,m,a,i,k\n\tinteger(8),allocatable::d(:)\n\t\n\tread *,n,m\n\t\n\ta = m/n\n\tallocate(d(a+1))\n\t\n\tk = 1\n\t\n\tdo i = 1,a\n\t\tif(mod(m,i) == 0)then\n\t\t\td(k) = i\n\t\t\tk = k+1\n\t\tendif\n\tenddo\n\t\n\tif(k /= 1)then\n\t\tk = k-1\n\tendif\n\t\n\tprint 102,d(k)\n\n101 format(a)\n102 format(i0)\nend program main", "language": "Fortran", "metadata": {"date": 1538878600, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03241.html", "problem_id": "p03241", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03241/input.txt", "sample_output_relpath": "derived/input_output/data/p03241/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03241/Fortran/s134484144.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s134484144", "user_id": "u900266249"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,m,a,i,k\n\tinteger(8),allocatable::d(:)\n\t\n\tread *,n,m\n\t\n\ta = m/n\n\tallocate(d(a+1))\n\t\n\tk = 1\n\t\n\tdo i = 1,a\n\t\tif(mod(m,i) == 0)then\n\t\t\td(k) = i\n\t\t\tk = k+1\n\t\tendif\n\tenddo\n\t\n\tif(k /= 1)then\n\t\tk = k-1\n\tendif\n\t\n\tprint 102,d(k)\n\n101 format(a)\n102 format(i0)\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 948, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s516729937", "group_id": "codeNet:p03241", "input_text": "program main\nimplicit None\n\tinteger(8)::n,m,a,i,k\n\tinteger(8),allocatable::d(:)\n\t\n\tread *,n,m\n\t\n\ta = m/n\n\tallocate(d(a))\n\t\n\tk = 1\n\t\n\tdo i = 1,a\n\t\tif(mod(m,i) == 0)then\n\t\t\td(k) = i\n\t\t\tk = k+1\n\t\tendif\n\tenddo\n\t\n\tif(k /= 1)then\n\t\tk = k-1\n\tendif\n\t\n\tprint 102,d(k)\n\n101 format(a)\n102 format(i0)\nend program main", "language": "Fortran", "metadata": {"date": 1538878401, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03241.html", "problem_id": "p03241", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03241/input.txt", "sample_output_relpath": "derived/input_output/data/p03241/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03241/Fortran/s516729937.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s516729937", "user_id": "u900266249"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,m,a,i,k\n\tinteger(8),allocatable::d(:)\n\t\n\tread *,n,m\n\t\n\ta = m/n\n\tallocate(d(a))\n\t\n\tk = 1\n\t\n\tdo i = 1,a\n\t\tif(mod(m,i) == 0)then\n\t\t\td(k) = i\n\t\t\tk = k+1\n\t\tendif\n\tenddo\n\t\n\tif(k /= 1)then\n\t\tk = k-1\n\tendif\n\t\n\tprint 102,d(k)\n\n101 format(a)\n102 format(i0)\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 305, "cpu_time_ms": 974, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s811077689", "group_id": "codeNet:p03242", "input_text": "integer a\nread*, a\nprint*, 1110-a\nend", "language": "Fortran", "metadata": {"date": 1571897747, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03242.html", "problem_id": "p03242", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03242/input.txt", "sample_output_relpath": "derived/input_output/data/p03242/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03242/Fortran/s811077689.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s811077689", "user_id": "u244203620"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "integer a\nread*, a\nprint*, 1110-a\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "sample_input": "119\n"}, "reference_outputs": ["991\n"], "source_document_id": "p03242", "source_text": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 37, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s289466473", "group_id": "codeNet:p03242", "input_text": "program sunuke\n\nimplicit none\n\ninteger:: n\ninteger:: x,y,z\n\nread(*,*) n\nx=int(n/100)\nn=n-100*x\ny=int(n/10)\nz=n-10*y\n\n\nif(x==1) then\n x=9\nelse if(x==9) then\n x=1\nendif\nif(y==1) then\n y=9\nelse if(y==9) then\n y=1\nendif\nif(z==1) then\n z=9\nelse if(z==9) then\n z=1\nendif\n\nn=100*x+10*y+z\n\nwrite(*,*) n\n\nend program sunuke\n", "language": "Fortran", "metadata": {"date": 1551583718, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03242.html", "problem_id": "p03242", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03242/input.txt", "sample_output_relpath": "derived/input_output/data/p03242/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03242/Fortran/s289466473.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289466473", "user_id": "u293324662"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "program sunuke\n\nimplicit none\n\ninteger:: n\ninteger:: x,y,z\n\nread(*,*) n\nx=int(n/100)\nn=n-100*x\ny=int(n/10)\nz=n-10*y\n\n\nif(x==1) then\n x=9\nelse if(x==9) then\n x=1\nendif\nif(y==1) then\n y=9\nelse if(y==9) then\n y=1\nendif\nif(z==1) then\n z=9\nelse if(z==9) then\n z=1\nendif\n\nn=100*x+10*y+z\n\nwrite(*,*) n\n\nend program sunuke\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "sample_input": "119\n"}, "reference_outputs": ["991\n"], "source_document_id": "p03242", "source_text": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 327, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s944199649", "group_id": "codeNet:p03242", "input_text": "program main\nimplicit None\n\tcharacter(len =100000)::s\n\tinteger::i,a=1,b=0\n !\"0*\"が頭だとエラー？\n \n\ts = \"a\"\n\tread (*,\"(a)\")s\n\t\n\tdo i = 1,100000\n\t\tif(s(i:i) == \"0\")then\n\t\t\tb = 1\n\t\tendif\n\t\tif(s(i:i) == \"+\")then\n\t\t\tif(b == 0)then\n\t\t\t\ta = a+1\n\t\t\tendif\n\t\t\tb =0\n\t\tendif\n\tenddo\n\t\n\tif(b == 1) a = a-1\n\t\n\tprint\"(i0)\",a\nend program main", "language": "Fortran", "metadata": {"date": 1545977621, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03242.html", "problem_id": "p03242", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03242/input.txt", "sample_output_relpath": "derived/input_output/data/p03242/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03242/Fortran/s944199649.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s944199649", "user_id": "u900266249"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "program main\nimplicit None\n\tcharacter(len =100000)::s\n\tinteger::i,a=1,b=0\n !\"0*\"が頭だとエラー？\n \n\ts = \"a\"\n\tread (*,\"(a)\")s\n\t\n\tdo i = 1,100000\n\t\tif(s(i:i) == \"0\")then\n\t\t\tb = 1\n\t\tendif\n\t\tif(s(i:i) == \"+\")then\n\t\t\tif(b == 0)then\n\t\t\t\ta = a+1\n\t\t\tendif\n\t\t\tb =0\n\t\tendif\n\tenddo\n\t\n\tif(b == 1) a = a-1\n\t\n\tprint\"(i0)\",a\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "sample_input": "119\n"}, "reference_outputs": ["991\n"], "source_document_id": "p03242", "source_text": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s699125862", "group_id": "codeNet:p03243", "input_text": "program main\ninteger :: n,i\nread(*,*)n\ndo i =1,9\nif ((i*100+i*10+i)-100 <= n .and. n <= (i*100+i*10+i)) then\n if (i==1) then\n write(*,*) 222\n exit\n else \n \twrite(*,*) 100*i+10*i+i\n exit\n end if\nend if\nend do\nend program", "language": "Fortran", "metadata": {"date": 1557159409, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03243.html", "problem_id": "p03243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03243/input.txt", "sample_output_relpath": "derived/input_output/data/p03243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03243/Fortran/s699125862.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s699125862", "user_id": "u850779832"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "program main\ninteger :: n,i\nread(*,*)n\ndo i =1,9\nif ((i*100+i*10+i)-100 <= n .and. n <= (i*100+i*10+i)) then\n if (i==1) then\n write(*,*) 222\n exit\n else \n \twrite(*,*) 100*i+10*i+i\n exit\n end if\nend if\nend do\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s666468014", "group_id": "codeNet:p03243", "input_text": "program contest111\n implicit none\n integer :: n\n read(*,*) n\n if (mod(n,111) .eq. 0) then\n write(*,'(i0)') n\n else\n write(*,'(i0)') (1+(n/111))*111\n end if\n stop\nend program contest111", "language": "Fortran", "metadata": {"date": 1538273024, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03243.html", "problem_id": "p03243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03243/input.txt", "sample_output_relpath": "derived/input_output/data/p03243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03243/Fortran/s666468014.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666468014", "user_id": "u506403362"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "program contest111\n implicit none\n integer :: n\n read(*,*) n\n if (mod(n,111) .eq. 0) then\n write(*,'(i0)') n\n else\n write(*,'(i0)') (1+(n/111))*111\n end if\n stop\nend program contest111", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s757484506", "group_id": "codeNet:p03244", "input_text": "program main\nimplicit None\n\tinteger(8)::n,i,p(2),q(2),r(2),s(2)\n\tinteger(8),allocatable::v(:),a(:),b(:)\n\t\n\tread*,n\n\tallocate(v(n),a(n/2),b(n/2))\n\t\n\tread*,v\n\tn = n/2\n\tif(minval(v) == maxval(v))then\n\t\tprint 101,n\n\t\tstop\n\tendif\n\t\n\tdo i = 1,n\n\t\ta(i) = v(i*2-1)\n\t\tb(i) = v(i*2)\n\tenddo\n\t\n\tcall h1(a,n)\n\tcall h1(b,n)\n\t\n\tp =0;q =0;r =0;s =0\n\t\n\tcall a1(a,n,p,q)\n\tcall a1(b,n,r,s)\n\t\n\tif(q(1) /= s(1))then\n\t\tprint 101,2*n-p(1)-r(1)\n\t\tstop\n\tendif\n\t\n\tif(p(1)+r(2) > p(2)+r(1))then\n\t\tprint 101,2*n-p(1)-r(2)\n\t\telse\n\t\t\tprint 101,2*n-p(2)-r(1)\n\tendif\n\t\n101 format(i0)\nend program main\n\nsubroutine h1(a,n)\nimplicit None\n\tinteger(8)::a(n),x\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie)\n\t\ta(ie) = a(1)\n\t\ta(1) = x\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h1\n\nsubroutine a1(a,n,p,q)\nImplicit None\ninteger(8)::n,p(2),q(2),i,t=1\ninteger(8)::a(n)\n\tdo i = 2,n\n\t\tif(a(i) == a(i-1))then\n\t\t\tt = t+1\n\t\t\telse\n\t\t\tif (t > p(1))then\n\t\t\t\tp(2) = p(1)\n\t\t\t\tp(1) = t\n\t\t\t\tq(2) = q(1)\n\t\t\t\tq(1) = a(i-1)\n\t\t\t\tt = 1\n\t\t\t\telse if(t > p(2))then\n\t\t\t\tp(2) = t\n\t\t\t\tq(2) = a(i-1)\n\t\t\t\tt = 1\n\t\t\tendif\n\t\tendif\n\tenddo\n\t\n\tif (t > p(1))then\n\t\tp(2) = p(1)\n\t\tp(1) = t\n\t\tq(2) = q(1)\n\t\tq(1) = a(i-1)\n\t\tt = 1\n\t\telse if(t > p(2))then\n\t\tp(2) = t\n\t\tq(2) = a(i-1)\n\t\tt = 1\n\tendif\nend subroutine a1", "language": "Fortran", "metadata": {"date": 1547777492, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03244.html", "problem_id": "p03244", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03244/input.txt", "sample_output_relpath": "derived/input_output/data/p03244/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03244/Fortran/s757484506.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s757484506", "user_id": "u900266249"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,i,p(2),q(2),r(2),s(2)\n\tinteger(8),allocatable::v(:),a(:),b(:)\n\t\n\tread*,n\n\tallocate(v(n),a(n/2),b(n/2))\n\t\n\tread*,v\n\tn = n/2\n\tif(minval(v) == maxval(v))then\n\t\tprint 101,n\n\t\tstop\n\tendif\n\t\n\tdo i = 1,n\n\t\ta(i) = v(i*2-1)\n\t\tb(i) = v(i*2)\n\tenddo\n\t\n\tcall h1(a,n)\n\tcall h1(b,n)\n\t\n\tp =0;q =0;r =0;s =0\n\t\n\tcall a1(a,n,p,q)\n\tcall a1(b,n,r,s)\n\t\n\tif(q(1) /= s(1))then\n\t\tprint 101,2*n-p(1)-r(1)\n\t\tstop\n\tendif\n\t\n\tif(p(1)+r(2) > p(2)+r(1))then\n\t\tprint 101,2*n-p(1)-r(2)\n\t\telse\n\t\t\tprint 101,2*n-p(2)-r(1)\n\tendif\n\t\n101 format(i0)\nend program main\n\nsubroutine h1(a,n)\nimplicit None\n\tinteger(8)::a(n),x\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie)\n\t\ta(ie) = a(1)\n\t\ta(1) = x\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h1\n\nsubroutine a1(a,n,p,q)\nImplicit None\ninteger(8)::n,p(2),q(2),i,t=1\ninteger(8)::a(n)\n\tdo i = 2,n\n\t\tif(a(i) == a(i-1))then\n\t\t\tt = t+1\n\t\t\telse\n\t\t\tif (t > p(1))then\n\t\t\t\tp(2) = p(1)\n\t\t\t\tp(1) = t\n\t\t\t\tq(2) = q(1)\n\t\t\t\tq(1) = a(i-1)\n\t\t\t\tt = 1\n\t\t\t\telse if(t > p(2))then\n\t\t\t\tp(2) = t\n\t\t\t\tq(2) = a(i-1)\n\t\t\t\tt = 1\n\t\t\tendif\n\t\tendif\n\tenddo\n\t\n\tif (t > p(1))then\n\t\tp(2) = p(1)\n\t\tp(1) = t\n\t\tq(2) = q(1)\n\t\tq(1) = a(i-1)\n\t\tt = 1\n\t\telse if(t > p(2))then\n\t\tp(2) = t\n\t\tq(2) = a(i-1)\n\t\tt = 1\n\tendif\nend subroutine a1", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03244", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1673, "cpu_time_ms": 35, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s147007150", "group_id": "codeNet:p03244", "input_text": "program main\nimplicit None\n\tinteger(8)::n,i,pa,qa,ra,sa,pb,qb,rb,sb,t\n\tinteger(8),allocatable::v(:),a(:),b(:)\n\t\n\tread*,n\n\tallocate(v(n),a(n/2),b(n/2))\n\t\n\tread *,v\n\t\n\tn = n/2\n\tif(minval(v) == maxval(v))then\n\t\tprint 101,n\n\t\tstop\n\tendif\n\t\n\tdo i = 1,n\n\t\ta(i) = v(2*i-1)\n\t\tb(i) = v(2*i)\n\tenddo\n\t\n\tcall a1(a,n,pa,qa,ra,sa)\n\tcall a1(b,n,pb,qb,rb,sb)\n\t\n\tif(ra /= rb)then\n\t\tt = 2*n-pa-pb\n\t\telse if(pa-qa > pb-qb)then\n\t\tt = 2*n-pa-qb\n\t\telse\n\t\tt = 2*n-qa-pb\n\tendif\n\t\n\tprint 101,t\n101 format(i0)\nend program main\n\nsubroutine h2(a,n)\nimplicit None\n\tinteger(8)::a(n),x\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie)\n\t\ta(ie) = a(1)\n\t\ta(1) = x\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2\n\nsubroutine a1(a,n,p,q,r,s)\n\tinteger(8)::n,p,q,r,s,t\n\tinteger(8)::a(n)\n\t\n\tcall h2(a,n)\n\tp =0\n\tq =0\n\tt =1\n\tr =0\n\ts =0\n\tdo i = 2,n\n\t\tif(a(i) == a(i-1))then\n\t\t\tt = t + 1\n\t\t\telse\n\t\t\tif(t > p)then\n\t\t\t\tq = p\n\t\t\t\tp = t\n\t\t\t\ts = r\n\t\t\t\tr = a(i-1)\n\t\t\t\tt =1\n\t\t\t\telse if(t > q)then\n\t\t\t\t\tq = t\n\t\t\t\t\ts = a(i-1)\n\t\t\t\t\tt =1\n\t\t\tendif\n\t\tendif\n\tenddo\n\t\n\tif(t > p)then\n\t\tq = p\n\t\tp = t\n\t\ts = r\n\t\tr = a(i-1)\n\t\telse if(t > q)then\n\t\t\tq = t\n\t\t\ts = a(i-1)\n\tendif\nend subroutine a1", "language": "Fortran", "metadata": {"date": 1546031453, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03244.html", "problem_id": "p03244", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03244/input.txt", "sample_output_relpath": "derived/input_output/data/p03244/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03244/Fortran/s147007150.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s147007150", "user_id": "u900266249"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger(8)::n,i,pa,qa,ra,sa,pb,qb,rb,sb,t\n\tinteger(8),allocatable::v(:),a(:),b(:)\n\t\n\tread*,n\n\tallocate(v(n),a(n/2),b(n/2))\n\t\n\tread *,v\n\t\n\tn = n/2\n\tif(minval(v) == maxval(v))then\n\t\tprint 101,n\n\t\tstop\n\tendif\n\t\n\tdo i = 1,n\n\t\ta(i) = v(2*i-1)\n\t\tb(i) = v(2*i)\n\tenddo\n\t\n\tcall a1(a,n,pa,qa,ra,sa)\n\tcall a1(b,n,pb,qb,rb,sb)\n\t\n\tif(ra /= rb)then\n\t\tt = 2*n-pa-pb\n\t\telse if(pa-qa > pb-qb)then\n\t\tt = 2*n-pa-qb\n\t\telse\n\t\tt = 2*n-qa-pb\n\tendif\n\t\n\tprint 101,t\n101 format(i0)\nend program main\n\nsubroutine h2(a,n)\nimplicit None\n\tinteger(8)::a(n),x\n\tinteger(8)::n,i,ie,i0,i1,i2\n\t\n\tdo i = n/2,1,-1\n\t\tx = a(i);ie = n + 1; i0 = i; i1 = i0 * 2\n\t\tdo while(i1 < ie)\n\t\t\ti2 = i1 + 1\n\t\t\tif(i2 < ie .and. a(i1) < a(i2)) i1 = i2\n\t\t\tif(a(i1) > x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\n\tdo ie = n,2,-1\n\t\tx = a(ie)\n\t\ta(ie) = a(1)\n\t\ta(1) = x\n\t\ti0 =1;i1 =2\n\t\tdo while(i1 x)then\n\t\t\t\ta(i0) = a(i1);a(i1) = x\n\t\t\t\telse\n\t\t\t\texit\n\t\t\tendif\n\t\t\ti0 = i1;i1 = i0 *2\n\t\tenddo\n\tenddo\nend subroutine h2\n\nsubroutine a1(a,n,p,q,r,s)\n\tinteger(8)::n,p,q,r,s,t\n\tinteger(8)::a(n)\n\t\n\tcall h2(a,n)\n\tp =0\n\tq =0\n\tt =1\n\tr =0\n\ts =0\n\tdo i = 2,n\n\t\tif(a(i) == a(i-1))then\n\t\t\tt = t + 1\n\t\t\telse\n\t\t\tif(t > p)then\n\t\t\t\tq = p\n\t\t\t\tp = t\n\t\t\t\ts = r\n\t\t\t\tr = a(i-1)\n\t\t\t\tt =1\n\t\t\t\telse if(t > q)then\n\t\t\t\t\tq = t\n\t\t\t\t\ts = a(i-1)\n\t\t\t\t\tt =1\n\t\t\tendif\n\t\tendif\n\tenddo\n\t\n\tif(t > p)then\n\t\tq = p\n\t\tp = t\n\t\ts = r\n\t\tr = a(i-1)\n\t\telse if(t > q)then\n\t\t\tq = t\n\t\t\ts = a(i-1)\n\tendif\nend subroutine a1", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03244", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1564, "cpu_time_ms": 35, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s825910125", "group_id": "codeNet:p03252", "input_text": "program prob5\n implicit none\n integer, parameter :: N = 200005\n character(N) :: s, t\n integer :: a(26), b(26), c(26)\n integer :: i, L\n read(*,*) s, t\n \n L = len_trim(S)\n do i = 1, 26\n a(i) = 26\n end do\n\n do i = 1, L\n if(a(ichar(s(i:i)) - ichar('a') + 1) == 26) then\n a(ichar(s(i:i)) - ichar('a') + 1) = ichar(t(i:i)) - ichar('a')\n else\n if(a(ichar(s(i:i)) - ichar('a') + 1) == ichar(t(i:i)) - ichar('a')) then\n cycle\n else\n write(*,*) 'No'\n stop\n end if\n end if\n end do\n\n b = 0\n c = 0\n do i = 1, L\n b(ichar(s(i:i)) - ichar('a') + 1) = 1\n c(ichar(t(i:i)) - ichar('a') + 1) = 1\n end do\n do i = 1, 26\n if(b(i) /= c(i)) then\n write(*,*) 'No'\n stop\n end if\n end do\n\n write(*,*) 'Yes'\n\n stop\ncontains\nend program prob5", "language": "Fortran", "metadata": {"date": 1595035664, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03252.html", "problem_id": "p03252", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03252/input.txt", "sample_output_relpath": "derived/input_output/data/p03252/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03252/Fortran/s825910125.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s825910125", "user_id": "u478462004"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program prob5\n implicit none\n integer, parameter :: N = 200005\n character(N) :: s, t\n integer :: a(26), b(26), c(26)\n integer :: i, L\n read(*,*) s, t\n \n L = len_trim(S)\n do i = 1, 26\n a(i) = 26\n end do\n\n do i = 1, L\n if(a(ichar(s(i:i)) - ichar('a') + 1) == 26) then\n a(ichar(s(i:i)) - ichar('a') + 1) = ichar(t(i:i)) - ichar('a')\n else\n if(a(ichar(s(i:i)) - ichar('a') + 1) == ichar(t(i:i)) - ichar('a')) then\n cycle\n else\n write(*,*) 'No'\n stop\n end if\n end if\n end do\n\n b = 0\n c = 0\n do i = 1, L\n b(ichar(s(i:i)) - ichar('a') + 1) = 1\n c(ichar(t(i:i)) - ichar('a') + 1) = 1\n end do\n do i = 1, 26\n if(b(i) /= c(i)) then\n write(*,*) 'No'\n stop\n end if\n end do\n\n write(*,*) 'Yes'\n\n stop\ncontains\nend program prob5", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given strings S and T consisting of lowercase English letters.\n\nYou can perform the following operation on S any number of times:\n\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\n\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\n|S| = |T|\n\nS and T consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S and T can be made equal, print Yes; otherwise, print No.\n\nSample Input 1\n\nazzel\napple\n\nSample Output 1\n\nYes\n\nazzel can be changed to apple, as follows:\n\nChoose e as c_1 and l as c_2. azzel becomes azzle.\n\nChoose z as c_1 and p as c_2. azzle becomes apple.\n\nSample Input 2\n\nchokudai\nredcoder\n\nSample Output 2\n\nNo\n\nNo sequences of operation can change chokudai to redcoder.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu\n\nSample Output 3\n\nYes", "sample_input": "azzel\napple\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03252", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given strings S and T consisting of lowercase English letters.\n\nYou can perform the following operation on S any number of times:\n\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\n\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\n|S| = |T|\n\nS and T consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S and T can be made equal, print Yes; otherwise, print No.\n\nSample Input 1\n\nazzel\napple\n\nSample Output 1\n\nYes\n\nazzel can be changed to apple, as follows:\n\nChoose e as c_1 and l as c_2. azzel becomes azzle.\n\nChoose z as c_1 and p as c_2. azzle becomes apple.\n\nSample Input 2\n\nchokudai\nredcoder\n\nSample Output 2\n\nNo\n\nNo sequences of operation can change chokudai to redcoder.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 939, "cpu_time_ms": 12, "memory_kb": 3412}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s750048060", "group_id": "codeNet:p03253", "input_text": "program abc110d\n implicit none\n integer(8), parameter :: modulo = 10**9 + 7\n integer(8) :: ans = 1, i = 2\n integer(8) n, m, count\n\n read *, n, m\n do\n if (m < i * i) exit\n if (mod(m, i) == 0) then\n count = 0\n do\n m = m / i;\n count = count + 1\n if (mod(m, i) /= 0) exit\n end do\n ans = mod(ans * comb(n + count - 1, count, modulo), modulo)\n end if\n i = i + 1\n end do\n if (m /= 1) then\n ans = mod(ans * n, modulo)\n end if\n print '(i0)', ans\n\ncontains\n\n recursive integer(8) function comb(n, k, m) result(r)\n integer(8), intent(in) :: n, k, m\n integer(8) i, nume, deno\n\n if (n - k < k) then\n r = comb(n, n - k, m)\n else\n nume = 1\n deno = 1\n do i = 0, k - 1\n nume = mod(nume * (n - i), m)\n deno = mod(deno * (i + 1), m)\n end do\n r = mod(nume * modpow(deno, m - 2, m), m)\n end if\n end function comb\n\n recursive integer(8) function modpow(a, p, m) result(r)\n integer(8), intent(in) :: a, p, m\n\n if (p == 0) then\n r = 1\n else if (mod(p, 2) == 0) then\n r = mod(modpow(a, p / 2, m)**2, m)\n else\n r = mod(a * modpow(a, p - 1, m), m)\n end if\n end function modpow\n\nend program abc110d\n", "language": "Fortran", "metadata": {"date": 1539389229, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03253.html", "problem_id": "p03253", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03253/input.txt", "sample_output_relpath": "derived/input_output/data/p03253/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03253/Fortran/s750048060.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s750048060", "user_id": "u081445141"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program abc110d\n implicit none\n integer(8), parameter :: modulo = 10**9 + 7\n integer(8) :: ans = 1, i = 2\n integer(8) n, m, count\n\n read *, n, m\n do\n if (m < i * i) exit\n if (mod(m, i) == 0) then\n count = 0\n do\n m = m / i;\n count = count + 1\n if (mod(m, i) /= 0) exit\n end do\n ans = mod(ans * comb(n + count - 1, count, modulo), modulo)\n end if\n i = i + 1\n end do\n if (m /= 1) then\n ans = mod(ans * n, modulo)\n end if\n print '(i0)', ans\n\ncontains\n\n recursive integer(8) function comb(n, k, m) result(r)\n integer(8), intent(in) :: n, k, m\n integer(8) i, nume, deno\n\n if (n - k < k) then\n r = comb(n, n - k, m)\n else\n nume = 1\n deno = 1\n do i = 0, k - 1\n nume = mod(nume * (n - i), m)\n deno = mod(deno * (i + 1), m)\n end do\n r = mod(nume * modpow(deno, m - 2, m), m)\n end if\n end function comb\n\n recursive integer(8) function modpow(a, p, m) result(r)\n integer(8), intent(in) :: a, p, m\n\n if (p == 0) then\n r = 1\n else if (mod(p, 2) == 0) then\n r = mod(modpow(a, p / 2, m)**2, m)\n else\n r = mod(a * modpow(a, p - 1, m), m)\n end if\n end function modpow\n\nend program abc110d\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given positive integers N and M.\n\nHow many sequences a of length N consisting of positive integers satisfy a_1 \\times a_2 \\times ... \\times a_N = M? Find the count modulo 10^9+7.\n\nHere, two sequences a' and a'' are considered different when there exists some i such that a_i' \\neq a_i''.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of the sequences consisting of positive integers that satisfy the condition, modulo 10^9 + 7.\n\nSample Input 1\n\n2 6\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: \\{a_1, a_2\\} = \\{1, 6\\}, \\{2, 3\\}, \\{3, 2\\} and \\{6, 1\\}.\n\nSample Input 2\n\n3 12\n\nSample Output 2\n\n18\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n957870001", "sample_input": "2 6\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03253", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given positive integers N and M.\n\nHow many sequences a of length N consisting of positive integers satisfy a_1 \\times a_2 \\times ... \\times a_N = M? Find the count modulo 10^9+7.\n\nHere, two sequences a' and a'' are considered different when there exists some i such that a_i' \\neq a_i''.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of the sequences consisting of positive integers that satisfy the condition, modulo 10^9 + 7.\n\nSample Input 1\n\n2 6\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: \\{a_1, a_2\\} = \\{1, 6\\}, \\{2, 3\\}, \\{3, 2\\} and \\{6, 1\\}.\n\nSample Input 2\n\n3 12\n\nSample Output 2\n\n18\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n957870001", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1265, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s970694784", "group_id": "codeNet:p03254", "input_text": "program AGC027A\n implicit none\n integer(8)::N,x,i,ans\n integer(8),allocatable,dimension(:)::A\n read*,N,x\n allocate(A(N))\n read*,A\n ans=0\n call heapsort(N,A)\n\n do i=1,N\n if(x>=A(i))then\n if(i==N)then\n if(x==A(i))ans=ans+1\n else\n x=x-A(i)\n ans=ans+1\n end if\n else\n exit\n end if\n end do\n\n print'(i0)',ans\nend program AGC027A\n\nsubroutine heapsort(n,array)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t\n \n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort", "language": "Fortran", "metadata": {"date": 1584473924, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03254.html", "problem_id": "p03254", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03254/input.txt", "sample_output_relpath": "derived/input_output/data/p03254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03254/Fortran/s970694784.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970694784", "user_id": "u414699019"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program AGC027A\n implicit none\n integer(8)::N,x,i,ans\n integer(8),allocatable,dimension(:)::A\n read*,N,x\n allocate(A(N))\n read*,A\n ans=0\n call heapsort(N,A)\n\n do i=1,N\n if(x>=A(i))then\n if(i==N)then\n if(x==A(i))ans=ans+1\n else\n x=x-A(i)\n ans=ans+1\n end if\n else\n exit\n end if\n end do\n\n print'(i0)',ans\nend program AGC027A\n\nsubroutine heapsort(n,array)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t\n \n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1302, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s589285811", "group_id": "codeNet:p03254", "input_text": "program main\n implicit integer(a-z)\n allocatable::a(:)\n allocatable::sort(:)\n\n read(*,*)n,have\n allocate(a(n))\n allocate(sort(n))\n read(*,*)(a(i),i=1,n)\n\n do i=1,n\n sort(i)=minval(a(1:n-i+1))\n tmp=minval(a(1:n-i+1))\n do j=1,n-i+1\n if(tmp.eq.a(j)) exit\n end do\n a(j)=a(n-i+1)\n a(n-i+1)=tmp\n \n !write(*,*)\"sort\",sort\n !write(*,*)\"a \",a\n !write(*,*)\n end do\n\n do i=1,n\n if(sum(sort(1:i)).gt.have)then\n !ans=sum(a(1:i-1))\n exit\n end if\n end do\n if(sum(sort(1:i-1)).ne.have) i=i-1\n \n !write(*,*)\"sort\",sort\n write(*,*)i-1!,ans\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1537063673, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03254.html", "problem_id": "p03254", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03254/input.txt", "sample_output_relpath": "derived/input_output/data/p03254/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03254/Fortran/s589285811.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s589285811", "user_id": "u594649885"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit integer(a-z)\n allocatable::a(:)\n allocatable::sort(:)\n\n read(*,*)n,have\n allocate(a(n))\n allocate(sort(n))\n read(*,*)(a(i),i=1,n)\n\n do i=1,n\n sort(i)=minval(a(1:n-i+1))\n tmp=minval(a(1:n-i+1))\n do j=1,n-i+1\n if(tmp.eq.a(j)) exit\n end do\n a(j)=a(n-i+1)\n a(n-i+1)=tmp\n \n !write(*,*)\"sort\",sort\n !write(*,*)\"a \",a\n !write(*,*)\n end do\n\n do i=1,n\n if(sum(sort(1:i)).gt.have)then\n !ans=sum(a(1:i-1))\n exit\n end if\n end do\n if(sum(sort(1:i-1)).ne.have) i=i-1\n \n !write(*,*)\"sort\",sort\n write(*,*)i-1!,ans\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s530174531", "group_id": "codeNet:p03264", "input_text": "program pair\n implicit none\n integer :: k\n read(*,*) k\n write(*,'(i0)') k/2*(k-k/2)\nend program pair", "language": "Fortran", "metadata": {"date": 1590784900, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03264.html", "problem_id": "p03264", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03264/input.txt", "sample_output_relpath": "derived/input_output/data/p03264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03264/Fortran/s530174531.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s530174531", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program pair\n implicit none\n integer :: k\n read(*,*) k\n write(*,'(i0)') k/2*(k-k/2)\nend program pair", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "sample_input": "3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03264", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s740786431", "group_id": "codeNet:p03265", "input_text": "INTEGER A,B,C,D\nREAD*,A,B,C,D\nWRITE(*,FMT=\"(I0)\",advance='no') C+B-D\nWRITE(*,FMT=\"(A)\",advance='no') \" \"\nWRITE(*,FMT=\"(I0)\",advance='no') D-A+C\nWRITE(*,FMT=\"(A)\",advance='no') \" \"\nWRITE(*,FMT=\"(I0)\",advance='no') A+B-D\nWRITE(*,FMT=\"(A)\",advance='no') \" \"\nWRITE(*,FMT=\"(I0)\",advance='no') B-A+C\nEND", "language": "Fortran", "metadata": {"date": 1552199919, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03265.html", "problem_id": "p03265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03265/input.txt", "sample_output_relpath": "derived/input_output/data/p03265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03265/Fortran/s740786431.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740786431", "user_id": "u598073939"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "INTEGER A,B,C,D\nREAD*,A,B,C,D\nWRITE(*,FMT=\"(I0)\",advance='no') C+B-D\nWRITE(*,FMT=\"(A)\",advance='no') \" \"\nWRITE(*,FMT=\"(I0)\",advance='no') D-A+C\nWRITE(*,FMT=\"(A)\",advance='no') \" \"\nWRITE(*,FMT=\"(I0)\",advance='no') A+B-D\nWRITE(*,FMT=\"(A)\",advance='no') \" \"\nWRITE(*,FMT=\"(I0)\",advance='no') B-A+C\nEND", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "sample_input": "0 0 0 1\n"}, "reference_outputs": ["-1 1 -1 0\n"], "source_document_id": "p03265", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s077031420", "group_id": "codeNet:p03265", "input_text": "program main\nimplicit None\n\tinteger::x1,y1,x2,y2,x3,y3,x4,y4\n\tcomplex::p1,p2,p3,p4,j\n\t\n\tread *,x1,y1,x2,y2\n\tp1 = cmplx(x1,y1)\n\tp2 = cmplx(x2,y2)\n\t\n\tj = (0,-1)\n\tp3 = p2 + (p1 - p2)*j\n\t\n\tj = (0,1)\n\tp4 = p1 + (p2 - p1)*j\n\t\n\tx3 = int(real(p3))\n\ty3 = int(aimag(p3))\n\tx4 = int(real(p4))\n\ty4 = int(aimag(p4))\n\t\n\tprint 101,x3,y3,x4,y4\n\t\n101 format(i0,1x,i0,1x,i0,1x,i0)\nend program main", "language": "Fortran", "metadata": {"date": 1540330288, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03265.html", "problem_id": "p03265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03265/input.txt", "sample_output_relpath": "derived/input_output/data/p03265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03265/Fortran/s077031420.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077031420", "user_id": "u900266249"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger::x1,y1,x2,y2,x3,y3,x4,y4\n\tcomplex::p1,p2,p3,p4,j\n\t\n\tread *,x1,y1,x2,y2\n\tp1 = cmplx(x1,y1)\n\tp2 = cmplx(x2,y2)\n\t\n\tj = (0,-1)\n\tp3 = p2 + (p1 - p2)*j\n\t\n\tj = (0,1)\n\tp4 = p1 + (p2 - p1)*j\n\t\n\tx3 = int(real(p3))\n\ty3 = int(aimag(p3))\n\tx4 = int(real(p4))\n\ty4 = int(aimag(p4))\n\t\n\tprint 101,x3,y3,x4,y4\n\t\n101 format(i0,1x,i0,1x,i0,1x,i0)\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "sample_input": "0 0 0 1\n"}, "reference_outputs": ["-1 1 -1 0\n"], "source_document_id": "p03265", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s354294690", "group_id": "codeNet:p03266", "input_text": "program triangular_relationship\n implicit none\n integer(8) :: n, k, ans\n read(*,*) n, k\n ans = (n/k)**3\n if (mod(k,2_8) == 0_8) ans = ans+((n+k/2_8)/k)**3\n write(*,'(i0)') ans\nend program triangular_relationship", "language": "Fortran", "metadata": {"date": 1568922868, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03266.html", "problem_id": "p03266", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03266/input.txt", "sample_output_relpath": "derived/input_output/data/p03266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03266/Fortran/s354294690.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s354294690", "user_id": "u506403362"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program triangular_relationship\n implicit none\n integer(8) :: n, k, ans\n read(*,*) n, k\n ans = (n/k)**3\n if (mod(k,2_8) == 0_8) ans = ans+((n+k/2_8)/k)**3\n write(*,'(i0)') ans\nend program triangular_relationship", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03266", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 217, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s269970986", "group_id": "codeNet:p03266", "input_text": "integer N,K\ninteger(16) nK,nK2\ninteger(16) ans\nread*,N,K\nselect case(mod(K,2))\n case(0)\n nK=N/K\n nK2=(N+K/2)/K\n ans=nK**3+nk2**3\n case(1)\n nK=N/K\n ans=nk**3\nend select\nprint\"(i0)\",ans\nend", "language": "Fortran", "metadata": {"date": 1568863194, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03266.html", "problem_id": "p03266", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03266/input.txt", "sample_output_relpath": "derived/input_output/data/p03266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03266/Fortran/s269970986.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269970986", "user_id": "u598073939"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "integer N,K\ninteger(16) nK,nK2\ninteger(16) ans\nread*,N,K\nselect case(mod(K,2))\n case(0)\n nK=N/K\n nK2=(N+K/2)/K\n ans=nK**3+nk2**3\n case(1)\n nK=N/K\n ans=nk**3\nend select\nprint\"(i0)\",ans\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03266", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 204, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s345980627", "group_id": "codeNet:p03268", "input_text": "program arc102_a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,i\n integer(int32):: a0, ah\n read*, n,k\n a0=0\n ah=0\n\n do i=1,n\n if (mod(i,k)==0) a0=a0+1\n end do\n\n if (mod(k,2) == 0) then\n do i=1,n\n if (mod(i,k) == k/2) ah=ah+1\n end do\n end if\n\n print'(i0)', a0**3 + ah**3\n\n\nend program arc102_a", "language": "Fortran", "metadata": {"date": 1591296592, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03268.html", "problem_id": "p03268", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03268/input.txt", "sample_output_relpath": "derived/input_output/data/p03268/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03268/Fortran/s345980627.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s345980627", "user_id": "u234636620"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program arc102_a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,i\n integer(int32):: a0, ah\n read*, n,k\n a0=0\n ah=0\n\n do i=1,n\n if (mod(i,k)==0) a0=a0+1\n end do\n\n if (mod(k,2) == 0) then\n do i=1,n\n if (mod(i,k) == k/2) ah=ah+1\n end do\n end if\n\n print'(i0)', a0**3 + ah**3\n\n\nend program arc102_a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03268", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 385, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s409916768", "group_id": "codeNet:p03273", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h,w,i,j\n character(1),allocatable:: a(:,:),ans(:,:)\n\n read*, h,w\n allocate(a(w,h),ans(w,h))\n a(:,:) = ' '\n ans(:,:) = ' '\n\n block\n character(w):: inpt_a\n integer(int32):: diff=0\n do i=1,h\n read*, inpt_a\n if (all_dot(inpt_a)) then\n diff=diff+1\n cycle\n end if\n do j=1,w\n a(j,i-diff) = inpt_a(j:j)\n end do\n end do\n end block\n\n block\n character(h):: ah\n integer(int32):: diff\n\n do j=1,w\n diff=0\n do i=1,h\n ah(i:i) = a(j,i)\n end do\n if(all_dot(ah))then\n diff=diff+1\n cycle\n end if\n ans(j,:) = a(j+diff,:)\n end do\n end block\n \n block\n character(w):: ansc\n integer(int32):: d\n do i=1,h\n d=0\n ansc = repeat(' ',w)\n do j=1,w\n if (ans(j,i) == ' ') then\n d=d+1\n cycle\n end if\n ansc(j-d:j-d) = ans(j,i)\n end do\n ! if (len_trim(ansc) == 0) cycle\n print'(a)', trim(ansc)\n ! print*, ans(:,i)\n end do\n end block\n\ncontains\n function all_dot(s) result(ret)\n character(*):: s\n logical:: ret\n integer(int32):: l,i\n\n l = len(s)\n ret = .true.\n do i=1,l\n if (s(i:i) == '#') ret=.false.\n end do\n end function\nend program name", "language": "Fortran", "metadata": {"date": 1586706249, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03273/input.txt", "sample_output_relpath": "derived/input_output/data/p03273/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03273/Fortran/s409916768.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409916768", "user_id": "u234636620"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h,w,i,j\n character(1),allocatable:: a(:,:),ans(:,:)\n\n read*, h,w\n allocate(a(w,h),ans(w,h))\n a(:,:) = ' '\n ans(:,:) = ' '\n\n block\n character(w):: inpt_a\n integer(int32):: diff=0\n do i=1,h\n read*, inpt_a\n if (all_dot(inpt_a)) then\n diff=diff+1\n cycle\n end if\n do j=1,w\n a(j,i-diff) = inpt_a(j:j)\n end do\n end do\n end block\n\n block\n character(h):: ah\n integer(int32):: diff\n\n do j=1,w\n diff=0\n do i=1,h\n ah(i:i) = a(j,i)\n end do\n if(all_dot(ah))then\n diff=diff+1\n cycle\n end if\n ans(j,:) = a(j+diff,:)\n end do\n end block\n \n block\n character(w):: ansc\n integer(int32):: d\n do i=1,h\n d=0\n ansc = repeat(' ',w)\n do j=1,w\n if (ans(j,i) == ' ') then\n d=d+1\n cycle\n end if\n ansc(j-d:j-d) = ans(j,i)\n end do\n ! if (len_trim(ansc) == 0) cycle\n print'(a)', trim(ansc)\n ! print*, ans(:,i)\n end do\n end block\n\ncontains\n function all_dot(s) result(ret)\n character(*):: s\n logical:: ret\n integer(int32):: l,i\n\n l = len(s)\n ret = .true.\n do i=1,l\n if (s(i:i) == '#') ret=.false.\n end do\n end function\nend program name", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\n\n..#\n#..\n.#.\n.#.\n#.#", "sample_input": "4 4\n##.#\n....\n##.#\n.#.#\n"}, "reference_outputs": ["###\n###\n.##\n"], "source_document_id": "p03273", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\n\n..#\n#..\n.#.\n.#.\n#.#", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1687, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s908006258", "group_id": "codeNet:p03273", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h,w,i,j\n character(1),allocatable:: a(:,:),ans(:,:)\n\n read*, h,w\n allocate(a(w,h),ans(w,h))\n\n block\n character(w):: inpt_a\n integer(int32):: diff=0\n do i=1,h\n read*, inpt_a\n if (all_dot(inpt_a)) then\n diff=diff+1\n cycle\n end if\n do j=1,w\n a(j,i-diff) = inpt_a(j:j)\n end do\n end do\n end block\n\n block\n character(h):: ah\n integer(int32):: diff\n\n do j=1,w\n diff=0\n do i=1,h\n ah(i:i) = a(j,i)\n end do\n if(all_dot(ah))then\n diff=diff+1\n cycle\n end if\n ans(j,:) = a(j+diff,:)\n end do\n end block\n\n do i=1,h\n print*, ans(:,i)\n end do\n\ncontains\n function all_dot(s) result(ret)\n character(*):: s\n logical:: ret\n integer(int32):: l,i\n\n l = len(s)\n ret = .true.\n do i=1,l\n if (s(i:i) == '#') ret=.false.\n end do\n end function\nend program name", "language": "Fortran", "metadata": {"date": 1586705144, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03273/input.txt", "sample_output_relpath": "derived/input_output/data/p03273/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03273/Fortran/s908006258.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s908006258", "user_id": "u234636620"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: h,w,i,j\n character(1),allocatable:: a(:,:),ans(:,:)\n\n read*, h,w\n allocate(a(w,h),ans(w,h))\n\n block\n character(w):: inpt_a\n integer(int32):: diff=0\n do i=1,h\n read*, inpt_a\n if (all_dot(inpt_a)) then\n diff=diff+1\n cycle\n end if\n do j=1,w\n a(j,i-diff) = inpt_a(j:j)\n end do\n end do\n end block\n\n block\n character(h):: ah\n integer(int32):: diff\n\n do j=1,w\n diff=0\n do i=1,h\n ah(i:i) = a(j,i)\n end do\n if(all_dot(ah))then\n diff=diff+1\n cycle\n end if\n ans(j,:) = a(j+diff,:)\n end do\n end block\n\n do i=1,h\n print*, ans(:,i)\n end do\n\ncontains\n function all_dot(s) result(ret)\n character(*):: s\n logical:: ret\n integer(int32):: l,i\n\n l = len(s)\n ret = .true.\n do i=1,l\n if (s(i:i) == '#') ret=.false.\n end do\n end function\nend program name", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\n\n..#\n#..\n.#.\n.#.\n#.#", "sample_input": "4 4\n##.#\n....\n##.#\n.#.#\n"}, "reference_outputs": ["###\n###\n.##\n"], "source_document_id": "p03273", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\n\n..#\n#..\n.#.\n.#.\n#.#", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1227, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s140626613", "group_id": "codeNet:p03274", "input_text": "implicit none\ninteger :: n,k\ninteger,allocatable :: x(:), z(:)\ninteger :: i,j,t1,t2,rswp,l,r\nlogical :: flg_swp,flg_l,flg_r\n\nread *,n,k\nallocate(x(n))\nread *,(x(i),i=1,n)\n\nallocate(z(n))\n\n!!!!!!!!!!!!!!!!! If go to left first ==> t1\ndo i = 1, n\n if (x(i) < 0) then\n z(i) = 2*x(i)\n else\n z(i) = x(i)\n endif\nenddo\n\ni = n\nflg_swp = .false.\ndo while (i > 1 .or. flg_swp)\n i = (i * 10) / 13\n if (i < 1) then\n i = 1\n else if (i == 9 .or. i == 10) then \n i = 11\n endif\n flg_swp = .false.\n do j = 1, n-i\n if (abs(z(j)) > abs(z(j+i))) then\n rswp = z(j) \n z(j) = z(j+i)\n z(j+i) = rswp\n flg_swp = .true.\n endif\n enddo\nenddo\n\nl = 0\nr = 0\nflg_l = .false.\nflg_r = .false.\ndo i = k,1,-1\n if (z(i) < 0) then\n if (flg_l) cycle\n l = -z(i)\n flg_l = .true.\n else\n if (flg_r) cycle\n r = z(i)\n flg_r = .true.\n endif\n if (flg_l .and. flg_r) then\n exit\n endif\nenddo\nt1 = l + r\n\n!!!!!!!!!!!!!!!!! If go to right first ==> t2\ndo i = 1, n\n if (x(i) < 0) then\n z(i) = x(i)\n else\n z(i) = 2*x(i)\n endif\nenddo\n\ni = n\nflg_swp = .false.\ndo while (i > 1 .or. flg_swp)\n i = (i * 10) / 13\n if (i < 1) then\n i = 1\n else if (i == 9 .or. i == 10) then \n i = 11\n endif\n flg_swp = .false.\n do j = 1, n-i\n if (abs(z(j)) > abs(z(j+i))) then\n rswp = z(j) \n z(j) = z(j+i)\n z(j+i) = rswp\n flg_swp = .true.\n endif\n enddo\nenddo\n\nl = 0\nr = 0\nflg_l = .false.\nflg_r = .false.\ndo i = k,1,-1\n if (z(i) < 0) then\n if (flg_l) cycle\n l = -z(i)\n flg_l = .true.\n else\n if (flg_r) cycle\n r = z(i)\n flg_r = .true.\n endif\n if (flg_l .and. flg_r) then\n exit\n endif\nenddo\nt2 = l + r\n\nprint '(i0)',min(t1,t2)\nend", "language": "Fortran", "metadata": {"date": 1565262601, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/Fortran/s140626613.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s140626613", "user_id": "u193540507"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "implicit none\ninteger :: n,k\ninteger,allocatable :: x(:), z(:)\ninteger :: i,j,t1,t2,rswp,l,r\nlogical :: flg_swp,flg_l,flg_r\n\nread *,n,k\nallocate(x(n))\nread *,(x(i),i=1,n)\n\nallocate(z(n))\n\n!!!!!!!!!!!!!!!!! If go to left first ==> t1\ndo i = 1, n\n if (x(i) < 0) then\n z(i) = 2*x(i)\n else\n z(i) = x(i)\n endif\nenddo\n\ni = n\nflg_swp = .false.\ndo while (i > 1 .or. flg_swp)\n i = (i * 10) / 13\n if (i < 1) then\n i = 1\n else if (i == 9 .or. i == 10) then \n i = 11\n endif\n flg_swp = .false.\n do j = 1, n-i\n if (abs(z(j)) > abs(z(j+i))) then\n rswp = z(j) \n z(j) = z(j+i)\n z(j+i) = rswp\n flg_swp = .true.\n endif\n enddo\nenddo\n\nl = 0\nr = 0\nflg_l = .false.\nflg_r = .false.\ndo i = k,1,-1\n if (z(i) < 0) then\n if (flg_l) cycle\n l = -z(i)\n flg_l = .true.\n else\n if (flg_r) cycle\n r = z(i)\n flg_r = .true.\n endif\n if (flg_l .and. flg_r) then\n exit\n endif\nenddo\nt1 = l + r\n\n!!!!!!!!!!!!!!!!! If go to right first ==> t2\ndo i = 1, n\n if (x(i) < 0) then\n z(i) = x(i)\n else\n z(i) = 2*x(i)\n endif\nenddo\n\ni = n\nflg_swp = .false.\ndo while (i > 1 .or. flg_swp)\n i = (i * 10) / 13\n if (i < 1) then\n i = 1\n else if (i == 9 .or. i == 10) then \n i = 11\n endif\n flg_swp = .false.\n do j = 1, n-i\n if (abs(z(j)) > abs(z(j+i))) then\n rswp = z(j) \n z(j) = z(j+i)\n z(j+i) = rswp\n flg_swp = .true.\n endif\n enddo\nenddo\n\nl = 0\nr = 0\nflg_l = .false.\nflg_r = .false.\ndo i = k,1,-1\n if (z(i) < 0) then\n if (flg_l) cycle\n l = -z(i)\n flg_l = .true.\n else\n if (flg_r) cycle\n r = z(i)\n flg_r = .true.\n endif\n if (flg_l .and. flg_r) then\n exit\n endif\nenddo\nt2 = l + r\n\nprint '(i0)',min(t1,t2)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1802, "cpu_time_ms": 45, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s011979272", "group_id": "codeNet:p03276", "input_text": "integer N,K\ninteger,allocatable,dimension(:)::x\ninteger l,r\ninteger ans,subans\nread*,N,K\nallocate(x(N))\nread*,x\nans=huge(ans)\ndo i=1,N-K+1\n l=x(i);r=x(i+k-1)\n subans=min(abs(l),abs(r))+(r-l)\n ans=min(ans,subans)\nend do\nprint\"(I0)\",ans\nend", "language": "Fortran", "metadata": {"date": 1557600308, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03276.html", "problem_id": "p03276", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03276/input.txt", "sample_output_relpath": "derived/input_output/data/p03276/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03276/Fortran/s011979272.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s011979272", "user_id": "u598073939"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "integer N,K\ninteger,allocatable,dimension(:)::x\ninteger l,r\ninteger ans,subans\nread*,N,K\nallocate(x(N))\nread*,x\nans=huge(ans)\ndo i=1,N-K+1\n l=x(i);r=x(i+k-1)\n subans=min(abs(l),abs(r))+(r-l)\n ans=min(ans,subans)\nend do\nprint\"(I0)\",ans\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03276", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 241, "cpu_time_ms": 33, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s342245603", "group_id": "codeNet:p03280", "input_text": "integer :: a,b\n\nread*,a,b\n\nprint*,(a-1)*(b-1)\nend", "language": "Fortran", "metadata": {"date": 1577087781, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03280.html", "problem_id": "p03280", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03280/input.txt", "sample_output_relpath": "derived/input_output/data/p03280/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03280/Fortran/s342245603.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s342245603", "user_id": "u171356453"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "integer :: a,b\n\nread*,a,b\n\nprint*,(a-1)*(b-1)\nend", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "sample_input": "2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03280", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s846071551", "group_id": "codeNet:p03280", "input_text": "program main\n implicit integer(a-z)\n\n read(*,*)a,b\n\n write(*,*)(a-1)*(b-1)\n\nend program main", "language": "Fortran", "metadata": {"date": 1536547699, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03280.html", "problem_id": "p03280", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03280/input.txt", "sample_output_relpath": "derived/input_output/data/p03280/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03280/Fortran/s846071551.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s846071551", "user_id": "u594649885"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit integer(a-z)\n\n read(*,*)a,b\n\n write(*,*)(a-1)*(b-1)\n\nend program main", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "sample_input": "2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03280", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s927552745", "group_id": "codeNet:p03281", "input_text": "program prime_numbers\n implicit none\n integer(8) i, j,k, n,y\n \n integer(8) :: x(5) = (/3,5,7,11,13/)\n read (*,*)n\n y=0\n do i=3,5\n \n if (x(i)*15<=n)then\n y=y+1\n end if\n\n end do\n write(*,*)y\n stop\nend program prime_numbers", "language": "Fortran", "metadata": {"date": 1590803138, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03281/input.txt", "sample_output_relpath": "derived/input_output/data/p03281/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03281/Fortran/s927552745.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s927552745", "user_id": "u713568912"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program prime_numbers\n implicit none\n integer(8) i, j,k, n,y\n \n integer(8) :: x(5) = (/3,5,7,11,13/)\n read (*,*)n\n y=0\n do i=3,5\n \n if (x(i)*15<=n)then\n y=y+1\n end if\n\n end do\n write(*,*)y\n stop\nend program prime_numbers", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "sample_input": "105\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03281", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s900197863", "group_id": "codeNet:p03281", "input_text": "INTEGER N\nREAD*,N\nIF (N<105) THEN\n PRINT\"(I0)\",0\nELSE IF (N<135) THEN\n PRINT\"(I0)\",1\nELSE IF (N<165) THEN\n PRINT\"(I0)\",2\nELSE IF (N<195) THEN\n PRINT\"(I0)\",3\nELSE\n PRINT\"(I0)\",4 \nENDIF\nEND", "language": "Fortran", "metadata": {"date": 1552196001, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03281/input.txt", "sample_output_relpath": "derived/input_output/data/p03281/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03281/Fortran/s900197863.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s900197863", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "INTEGER N\nREAD*,N\nIF (N<105) THEN\n PRINT\"(I0)\",0\nELSE IF (N<135) THEN\n PRINT\"(I0)\",1\nELSE IF (N<165) THEN\n PRINT\"(I0)\",2\nELSE IF (N<195) THEN\n PRINT\"(I0)\",3\nELSE\n PRINT\"(I0)\",4 \nENDIF\nEND", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "sample_input": "105\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03281", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s344720700", "group_id": "codeNet:p03282", "input_text": "character(100) S\ninteger(16) N,i\nread*,S\nread*,N\nif(N<=len_trim(S))then\n if(S(1:N)==repeat(\"1\",N))then\n print\"(A)\",\"1\"\n stop\n endif\nend if\ndo i=1,len_trim(S)\n if(S(i:i)==\"1\")cycle\n print\"(A)\",S(i:i)\n exit\nend do\nend", "language": "Fortran", "metadata": {"date": 1565325133, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03282.html", "problem_id": "p03282", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03282/input.txt", "sample_output_relpath": "derived/input_output/data/p03282/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03282/Fortran/s344720700.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s344720700", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "character(100) S\ninteger(16) N,i\nread*,S\nread*,N\nif(N<=len_trim(S))then\n if(S(1:N)==repeat(\"1\",N))then\n print\"(A)\",\"1\"\n stop\n endif\nend if\ndo i=1,len_trim(S)\n if(S(i:i)==\"1\")cycle\n print\"(A)\",S(i:i)\n exit\nend do\nend", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s929374511", "group_id": "codeNet:p03284", "input_text": "integer :: n,k\nread*,n,k\n\nprint*,mod(n,k)\nend", "language": "Fortran", "metadata": {"date": 1577087899, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03284/input.txt", "sample_output_relpath": "derived/input_output/data/p03284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03284/Fortran/s929374511.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s929374511", "user_id": "u171356453"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "integer :: n,k\nread*,n,k\n\nprint*,mod(n,k)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 45, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s753619946", "group_id": "codeNet:p03284", "input_text": "program ABC105A\n implicit none\n integer(8)::N,K\n\n read(5,*)N,K\n\n if(mod(N,K)==0)then\n print'(i0)',0\n else\n print'(i0)',1\n end if\n \nend program ABC105A", "language": "Fortran", "metadata": {"date": 1573830892, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03284/input.txt", "sample_output_relpath": "derived/input_output/data/p03284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03284/Fortran/s753619946.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753619946", "user_id": "u414699019"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ABC105A\n implicit none\n integer(8)::N,K\n\n read(5,*)N,K\n\n if(mod(N,K)==0)then\n print'(i0)',0\n else\n print'(i0)',1\n end if\n \nend program ABC105A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 185, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s182384318", "group_id": "codeNet:p03284", "input_text": "integer n,k\nread*,n,k\nif (mod(n,k)==0) then\nprint '(i0)',0\nelse\nprint '(i0)',1\nendif\nend", "language": "Fortran", "metadata": {"date": 1565613585, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03284/input.txt", "sample_output_relpath": "derived/input_output/data/p03284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03284/Fortran/s182384318.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182384318", "user_id": "u193540507"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "integer n,k\nread*,n,k\nif (mod(n,k)==0) then\nprint '(i0)',0\nelse\nprint '(i0)',1\nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s510131268", "group_id": "codeNet:p03284", "input_text": "program main\n\timplicit integer(a-z)\n character(3)::ans=\"No\"\n \n read(*,*)n\n \n imax=n/4\n jmax=n/7\n \n do j=0,jmax\n \tdo i=0,imax\n \tif(i*4+j*7.eq.n) ans=\"Yes\"\n end do\n end do\n \n write(*,*)ans\nend program main", "language": "Fortran", "metadata": {"date": 1536887793, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03284/input.txt", "sample_output_relpath": "derived/input_output/data/p03284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03284/Fortran/s510131268.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s510131268", "user_id": "u594649885"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n\timplicit integer(a-z)\n character(3)::ans=\"No\"\n \n read(*,*)n\n \n imax=n/4\n jmax=n/7\n \n do j=0,jmax\n \tdo i=0,imax\n \tif(i*4+j*7.eq.n) ans=\"Yes\"\n end do\n end do\n \n write(*,*)ans\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 253, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s938199540", "group_id": "codeNet:p03284", "input_text": "program read\n integer n,k;\n read *,n,k\n if (n - (n/k)*k == 0) then\n print *,0\n else \n print *,1\n end if\nend program read", "language": "Fortran", "metadata": {"date": 1534995516, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03284/input.txt", "sample_output_relpath": "derived/input_output/data/p03284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03284/Fortran/s938199540.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938199540", "user_id": "u394482932"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program read\n integer n,k;\n read *,n,k\n if (n - (n/k)*k == 0) then\n print *,0\n else \n print *,1\n end if\nend program read", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 149, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s288551649", "group_id": "codeNet:p03288", "input_text": "integer :: r\ncharacter(3) :: ans = 'AGC'\nread*,r\n\nif( r<1200 ) ans = 'ABC'\nif( r<2800 ) ans = 'ARC'\n\nprint*,ans\nend", "language": "Fortran", "metadata": {"date": 1577088145, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03288.html", "problem_id": "p03288", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03288/input.txt", "sample_output_relpath": "derived/input_output/data/p03288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03288/Fortran/s288551649.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s288551649", "user_id": "u171356453"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "integer :: r\ncharacter(3) :: ans = 'AGC'\nread*,r\n\nif( r<1200 ) ans = 'ABC'\nif( r<2800 ) ans = 'ARC'\n\nprint*,ans\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s873636406", "group_id": "codeNet:p03288", "input_text": "program main\n\timplicit none\n\tinteger :: R\n\tread(*, *) R\n\tif(R < 1200) then\n\t\twrite(*, *) \"ABC\"\n\telse if(R < 2800) then\n\t\twrite(*, *) \"ARC\"\n\telse\n\t\twrite(*, *) \"AGC\"\n\tend if\nend program main", "language": "Fortran", "metadata": {"date": 1535215516, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03288.html", "problem_id": "p03288", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03288/input.txt", "sample_output_relpath": "derived/input_output/data/p03288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03288/Fortran/s873636406.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873636406", "user_id": "u728000113"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger :: R\n\tread(*, *) R\n\tif(R < 1200) then\n\t\twrite(*, *) \"ABC\"\n\telse if(R < 2800) then\n\t\twrite(*, *) \"ARC\"\n\telse\n\t\twrite(*, *) \"AGC\"\n\tend if\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 189, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s380462937", "group_id": "codeNet:p03288", "input_text": "program test\nimplicit none\ninteger :: i,j,k,m,n\n\nread(*,*) i\n\nif(i < 1200) then \nwrite(*,*) 'ABC'\nelse if(i < 2800) then\nwrite(*,*) 'ARC'\nelse\nwrite(*,*) 'AGC'\nendif\n\nend program", "language": "Fortran", "metadata": {"date": 1533517308, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03288.html", "problem_id": "p03288", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03288/input.txt", "sample_output_relpath": "derived/input_output/data/p03288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03288/Fortran/s380462937.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380462937", "user_id": "u454703763"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program test\nimplicit none\ninteger :: i,j,k,m,n\n\nread(*,*) i\n\nif(i < 1200) then \nwrite(*,*) 'ABC'\nelse if(i < 2800) then\nwrite(*,*) 'ARC'\nelse\nwrite(*,*) 'AGC'\nendif\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 178, "cpu_time_ms": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s135464221", "group_id": "codeNet:p03289", "input_text": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n\n integer(8)::a,b,c,d\n integer(8),allocatable::x(:),y(:)\n \n read(*,*) s\n if(s(1:1) .ne. 'A')then\n write(*,*)'WA'\n stop\n end if\n n=len_trim(s)\n\n\n do i=3,n-1\n if(s(i:i) .eq. 'C')then\n t=s(1:i-1)//s(i+1:n)\n exit\n end if\n if(i==n-1)then\n write(*,*)'WA'\n stop\n end if\n end do\n do i=2,n-1\n if(ichar(t(i:i))<97)then\n write(*,*)'WA'\n stop\n end if\n end do\n write(*,*)'AC'\n\n\n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1601083003, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03289.html", "problem_id": "p03289", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03289/input.txt", "sample_output_relpath": "derived/input_output/data/p03289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03289/Fortran/s135464221.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135464221", "user_id": "u713568912"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n\n integer(8)::a,b,c,d\n integer(8),allocatable::x(:),y(:)\n \n read(*,*) s\n if(s(1:1) .ne. 'A')then\n write(*,*)'WA'\n stop\n end if\n n=len_trim(s)\n\n\n do i=3,n-1\n if(s(i:i) .eq. 'C')then\n t=s(1:i-1)//s(i+1:n)\n exit\n end if\n if(i==n-1)then\n write(*,*)'WA'\n stop\n end if\n end do\n do i=2,n-1\n if(ichar(t(i:i))<97)then\n write(*,*)'WA'\n stop\n end if\n end do\n write(*,*)'AC'\n\n\n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "sample_input": "AtCoder\n"}, "reference_outputs": ["AC\n"], "source_document_id": "p03289", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 2824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s709318490", "group_id": "codeNet:p03289", "input_text": "program main\n\timplicit none\n\tinteger :: i, counter_C = 0, counter_Big = 0\n\tcharacter(10) :: S\n\tread(*, *) S\n\tif(S(1:1) /= \"A\") then\n\t\twrite(*, *) \"WA\"\n\telse\n\t\tdo i = 3, len_trim(S)-2\n\t\t\tif(S(i:i) == \"C\") then\n\t\t\t\tcounter_C = counter_C + 1\n\t\t\tend if\n\t\tend do\n\t\tdo i = 1, len_trim(S)\n\t\t\tif(S(i:i) >= \"A\" .AND. S(i:i) <= \"Z\") then\n\t\t\t\tcounter_Big = counter_Big + 1\n\t\t\tend if\n\t\tend do\n\tend if\n\tif(counter_C == 1 .AND. counter_Big == 2) then\n\t\twrite(*, *) \"AC\"\n\telse\n\t\twrite(*, *) \"WA\"\n\tend if\nend program main", "language": "Fortran", "metadata": {"date": 1535225457, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03289.html", "problem_id": "p03289", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03289/input.txt", "sample_output_relpath": "derived/input_output/data/p03289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03289/Fortran/s709318490.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s709318490", "user_id": "u728000113"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger :: i, counter_C = 0, counter_Big = 0\n\tcharacter(10) :: S\n\tread(*, *) S\n\tif(S(1:1) /= \"A\") then\n\t\twrite(*, *) \"WA\"\n\telse\n\t\tdo i = 3, len_trim(S)-2\n\t\t\tif(S(i:i) == \"C\") then\n\t\t\t\tcounter_C = counter_C + 1\n\t\t\tend if\n\t\tend do\n\t\tdo i = 1, len_trim(S)\n\t\t\tif(S(i:i) >= \"A\" .AND. S(i:i) <= \"Z\") then\n\t\t\t\tcounter_Big = counter_Big + 1\n\t\t\tend if\n\t\tend do\n\tend if\n\tif(counter_C == 1 .AND. counter_Big == 2) then\n\t\twrite(*, *) \"AC\"\n\telse\n\t\twrite(*, *) \"WA\"\n\tend if\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "sample_input": "AtCoder\n"}, "reference_outputs": ["AC\n"], "source_document_id": "p03289", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s918272396", "group_id": "codeNet:p03291", "input_text": "program test\nimplicit none\ninteger(8) :: d,i,j,k,m,n,abcs(3),temp(3)\ninteger(8) :: big=1000000000 + 7\ncharacter(100000) :: s\n\nread(*,*) s\nd = len_trim(s)\n\nabcs(1:3) = 0\n\ndo i=1,d\n\n\tif(s(i:i) .eq. '?') then\n\t\tdo j=1,3\n\t\ttemp(j) = abcs(j)\n\t\tenddo\n\t\t\n\t\tabcs(1) = mod(3 * temp(1) + 1,big)\n\t\tabcs(2) = mod(mod(3 * temp(2),big) + temp(1),big)\n\t\tabcs(3) = mod(mod(3 * temp(3),big) + temp(2),big)\n\t\t\n\telse if(s(i:i) .eq. 'A') then\n\t\tabcs(1) = mod(abcs(1) + 1,big)\n\t\t\n\telse if(s(i:i) .eq. 'B') then\n\t\tabcs(2) = mod(abcs(2) + abcs(1),big)\n\t\t\n\t\t\n\telse if(s(i:i) .eq. 'C') then\n\t\tabcs(3) = mod(abcs(3) + abcs(2),big)\n\tendif\n!\twrite(*,*) abcs(3)\nenddo\n\nwrite(*,*) abcs(3)\n\nend program", "language": "Fortran", "metadata": {"date": 1533523973, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03291.html", "problem_id": "p03291", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03291/input.txt", "sample_output_relpath": "derived/input_output/data/p03291/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03291/Fortran/s918272396.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s918272396", "user_id": "u454703763"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: d,i,j,k,m,n,abcs(3),temp(3)\ninteger(8) :: big=1000000000 + 7\ncharacter(100000) :: s\n\nread(*,*) s\nd = len_trim(s)\n\nabcs(1:3) = 0\n\ndo i=1,d\n\n\tif(s(i:i) .eq. '?') then\n\t\tdo j=1,3\n\t\ttemp(j) = abcs(j)\n\t\tenddo\n\t\t\n\t\tabcs(1) = mod(3 * temp(1) + 1,big)\n\t\tabcs(2) = mod(mod(3 * temp(2),big) + temp(1),big)\n\t\tabcs(3) = mod(mod(3 * temp(3),big) + temp(2),big)\n\t\t\n\telse if(s(i:i) .eq. 'A') then\n\t\tabcs(1) = mod(abcs(1) + 1,big)\n\t\t\n\telse if(s(i:i) .eq. 'B') then\n\t\tabcs(2) = mod(abcs(2) + abcs(1),big)\n\t\t\n\t\t\n\telse if(s(i:i) .eq. 'C') then\n\t\tabcs(3) = mod(abcs(3) + abcs(2),big)\n\tendif\n!\twrite(*,*) abcs(3)\nenddo\n\nwrite(*,*) abcs(3)\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThe ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:\n\n1 ≤ i < j < k ≤ |T| (|T| is the length of T.)\n\nT_i = A (T_i is the i-th character of T from the beginning.)\n\nT_j = B\n\nT_k = C\n\nFor example, when T = ABCBC, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.\n\nYou are given a string S. Each character of S is A, B, C or ?.\n\nLet Q be the number of occurrences of ? in S. We can make 3^Q strings by replacing each occurrence of ? in S with A, B or C. Find the sum of the ABC numbers of all these strings.\n\nThis sum can be extremely large, so print the sum modulo 10^9 + 7.\n\nConstraints\n\n3 ≤ |S| ≤ 10^5\n\nEach character of S is A, B, C or ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.\n\nSample Input 1\n\nA??C\n\nSample Output 1\n\n8\n\nIn this case, Q = 2, and we can make 3^Q = 9 strings by by replacing each occurrence of ? with A, B or C. The ABC number of each of these strings is as follows:\n\nAAAC: 0\n\nAABC: 2\n\nAACC: 0\n\nABAC: 1\n\nABBC: 2\n\nABCC: 2\n\nACAC: 0\n\nACBC: 1\n\nACCC: 0\n\nThe sum of these is 0 + 2 + 0 + 1 + 2 + 2 + 0 + 1 + 0 = 8, so we print 8 modulo 10^9 + 7, that is, 8.\n\nSample Input 2\n\nABCBC\n\nSample Output 2\n\n3\n\nWhen Q = 0, we print the ABC number of S itself, modulo 10^9 + 7. This string is the same as the one given as an example in the problem statement, and its ABC number is 3.\n\nSample Input 3\n\n????C?????B??????A???????\n\nSample Output 3\n\n979596887\n\nIn this case, the sum of the ABC numbers of all the 3^Q strings is 2291979612924, and we should print this number modulo 10^9 + 7, that is, 979596887.", "sample_input": "A??C\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03291", "source_text": "Score : 400 points\n\nProblem Statement\n\nThe ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:\n\n1 ≤ i < j < k ≤ |T| (|T| is the length of T.)\n\nT_i = A (T_i is the i-th character of T from the beginning.)\n\nT_j = B\n\nT_k = C\n\nFor example, when T = ABCBC, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.\n\nYou are given a string S. Each character of S is A, B, C or ?.\n\nLet Q be the number of occurrences of ? in S. We can make 3^Q strings by replacing each occurrence of ? in S with A, B or C. Find the sum of the ABC numbers of all these strings.\n\nThis sum can be extremely large, so print the sum modulo 10^9 + 7.\n\nConstraints\n\n3 ≤ |S| ≤ 10^5\n\nEach character of S is A, B, C or ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.\n\nSample Input 1\n\nA??C\n\nSample Output 1\n\n8\n\nIn this case, Q = 2, and we can make 3^Q = 9 strings by by replacing each occurrence of ? with A, B or C. The ABC number of each of these strings is as follows:\n\nAAAC: 0\n\nAABC: 2\n\nAACC: 0\n\nABAC: 1\n\nABBC: 2\n\nABCC: 2\n\nACAC: 0\n\nACBC: 1\n\nACCC: 0\n\nThe sum of these is 0 + 2 + 0 + 1 + 2 + 2 + 0 + 1 + 0 = 8, so we print 8 modulo 10^9 + 7, that is, 8.\n\nSample Input 2\n\nABCBC\n\nSample Output 2\n\n3\n\nWhen Q = 0, we print the ABC number of S itself, modulo 10^9 + 7. This string is the same as the one given as an example in the problem statement, and its ABC number is 3.\n\nSample Input 3\n\n????C?????B??????A???????\n\nSample Output 3\n\n979596887\n\nIn this case, the sum of the ABC numbers of all the 3^Q strings is 2291979612924, and we should print this number modulo 10^9 + 7, that is, 979596887.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 671, "cpu_time_ms": 4, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s305684625", "group_id": "codeNet:p03292", "input_text": "program answer\n implicit none\n\n character(len=100):: S, T, U\n integer :: i, j, a\n\n read(*,*) S\n read(*,*) T\n\n a=len_trim(S)\n\n if(a==1) then\n if(S==T) then\n write(*,*) 'Yes'\n stop\n else\n write(*,*) 'No'\n stop\n end if\n end if\n\n if(S==T) then\n write(*,*) 'Yes'\n stop\n end if\n \n do i = 1, a-1\n U=S\n do j = 1, a-1\n S(j+1:j+1)=U(j:j)\n end do\n S(1:1)=U(a:a)\n \n if(S==T) then\n write(*,*) 'Yes'\n stop\n end if\n end do\n \n write(*,*) 'No' \n\n stop\n end program answer\n", "language": "Fortran", "metadata": {"date": 1593223873, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03292.html", "problem_id": "p03292", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03292/input.txt", "sample_output_relpath": "derived/input_output/data/p03292/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03292/Fortran/s305684625.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s305684625", "user_id": "u873780029"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program answer\n implicit none\n\n character(len=100):: S, T, U\n integer :: i, j, a\n\n read(*,*) S\n read(*,*) T\n\n a=len_trim(S)\n\n if(a==1) then\n if(S==T) then\n write(*,*) 'Yes'\n stop\n else\n write(*,*) 'No'\n stop\n end if\n end if\n\n if(S==T) then\n write(*,*) 'Yes'\n stop\n end if\n \n do i = 1, a-1\n U=S\n do j = 1, a-1\n S(j+1:j+1)=U(j:j)\n end do\n S(1:1)=U(a:a)\n \n if(S==T) then\n write(*,*) 'Yes'\n stop\n end if\n end do\n \n write(*,*) 'No' \n\n stop\n end program answer\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 574, "cpu_time_ms": 13, "memory_kb": 3124}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s306971441", "group_id": "codeNet:p03293", "input_text": "program prob2\n implicit none\n integer::i, l, j\n character(len=100)::S,T\n character::s1,t1\n read(*,*) S\n read(*,*) T\n l = len_trim(S)\n\n do j = 1, l\n do i = 1, l\n if(S(i:i) .ne. T(i:i))then\n exit\n else if(i == l)then\n write(*,'(a)') \"Yes\"\n stop\n end if\n end do\n s1 = S(1:1)\n t1 = T(1:1)\n do i = 1, l-1\n S(i:i) = S(i+1:i+1)\n end do\n S(l:l) = s1\n end do\n\n write(*,'(a)') \"No\"\n stop\nend program", "language": "Fortran", "metadata": {"date": 1593220408, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03293.html", "problem_id": "p03293", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03293/input.txt", "sample_output_relpath": "derived/input_output/data/p03293/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03293/Fortran/s306971441.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306971441", "user_id": "u841856382"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program prob2\n implicit none\n integer::i, l, j\n character(len=100)::S,T\n character::s1,t1\n read(*,*) S\n read(*,*) T\n l = len_trim(S)\n\n do j = 1, l\n do i = 1, l\n if(S(i:i) .ne. T(i:i))then\n exit\n else if(i == l)then\n write(*,'(a)') \"Yes\"\n stop\n end if\n end do\n s1 = S(1:1)\n t1 = T(1:1)\n do i = 1, l-1\n S(i:i) = S(i+1:i+1)\n end do\n S(l:l) = s1\n end do\n\n write(*,'(a)') \"No\"\n stop\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "sample_input": "kyoto\ntokyo\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03293", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 7, "memory_kb": 2912}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s597185295", "group_id": "codeNet:p03294", "input_text": "implicit none\ninteger :: n\ninteger,allocatable :: a(:)\ninteger :: i\nread *,n\nallocate(a(n))\nread *,(a(i),i=1,n)\nprint '(i0)',sum(a)-n\nend", "language": "Fortran", "metadata": {"date": 1565267856, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03294.html", "problem_id": "p03294", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03294/input.txt", "sample_output_relpath": "derived/input_output/data/p03294/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03294/Fortran/s597185295.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s597185295", "user_id": "u193540507"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "implicit none\ninteger :: n\ninteger,allocatable :: a(:)\ninteger :: i\nread *,n\nallocate(a(n))\nread *,(a(i),i=1,n)\nprint '(i0)',sum(a)-n\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s348425442", "group_id": "codeNet:p03295", "input_text": "program test\n\ninteger(8) :: n,m,i,j,k,ans\ninteger(8) :: a(100000),b(100000),aa(100000)=999999\n\nread(*,*) n,m\n\ndo i=1,m\n\tread(*,*) a(i),b(i)\nenddo\n\ndo i=1,m\n\taa(a(i))=min(aa(a(i)),b(i)-1)\nenddo\n\nans = 0\n\ndo i=1,n\n if(aa(i)<999999) then\n \tans = ans + 1\n \tdo j=i+1,n\n \t\tif(aa(j) <= aa(i)) then\n \t\t\taa(j) = 999999\n \t\tendif\n \tenddo\n \taa(i) = 999999\n endif\nenddo\n\nwrite(*,*) ans\n\n\n\n\nend program", "language": "Fortran", "metadata": {"date": 1532641759, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03295.html", "problem_id": "p03295", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03295/input.txt", "sample_output_relpath": "derived/input_output/data/p03295/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03295/Fortran/s348425442.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s348425442", "user_id": "u454703763"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program test\n\ninteger(8) :: n,m,i,j,k,ans\ninteger(8) :: a(100000),b(100000),aa(100000)=999999\n\nread(*,*) n,m\n\ndo i=1,m\n\tread(*,*) a(i),b(i)\nenddo\n\ndo i=1,m\n\taa(a(i))=min(aa(a(i)),b(i)-1)\nenddo\n\nans = 0\n\ndo i=1,n\n if(aa(i)<999999) then\n \tans = ans + 1\n \tdo j=i+1,n\n \t\tif(aa(j) <= aa(i)) then\n \t\t\taa(j) = 999999\n \t\tendif\n \tenddo\n \taa(i) = 999999\n endif\nenddo\n\nwrite(*,*) ans\n\n\n\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands lining up from west to east, connected by N-1 bridges.\n\nThe i-th bridge connects the i-th island from the west and the (i+1)-th island from the west.\n\nOne day, disputes took place between some islands, and there were M requests from the inhabitants of the islands:\n\nRequest i: A dispute took place between the a_i-th island from the west and the b_i-th island from the west. Please make traveling between these islands with bridges impossible.\n\nYou decided to remove some bridges to meet all these M requests.\n\nFind the minimum number of bridges that must be removed.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq a_i < b_i \\leq N\n\nAll pairs (a_i, b_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nPrint the minimum number of bridges that must be removed.\n\nSample Input 1\n\n5 2\n1 4\n2 5\n\nSample Output 1\n\n1\n\nThe requests can be met by removing the bridge connecting the second and third islands from the west.\n\nSample Input 2\n\n9 5\n1 8\n2 7\n3 5\n4 6\n7 9\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n\nSample Output 3\n\n4", "sample_input": "5 2\n1 4\n2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03295", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands lining up from west to east, connected by N-1 bridges.\n\nThe i-th bridge connects the i-th island from the west and the (i+1)-th island from the west.\n\nOne day, disputes took place between some islands, and there were M requests from the inhabitants of the islands:\n\nRequest i: A dispute took place between the a_i-th island from the west and the b_i-th island from the west. Please make traveling between these islands with bridges impossible.\n\nYou decided to remove some bridges to meet all these M requests.\n\nFind the minimum number of bridges that must be removed.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq a_i < b_i \\leq N\n\nAll pairs (a_i, b_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nPrint the minimum number of bridges that must be removed.\n\nSample Input 1\n\n5 2\n1 4\n2 5\n\nSample Output 1\n\n1\n\nThe requests can be met by removing the bridge connecting the second and third islands from the west.\n\nSample Input 2\n\n9 5\n1 8\n2 7\n3 5\n4 6\n7 9\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 388, "cpu_time_ms": 2103, "memory_kb": 2560}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s633555523", "group_id": "codeNet:p03299", "input_text": "program histogram_coloring\n implicit none\n type pair\n integer(8) :: x, y\n end type\n integer(8), parameter :: md = 1000000007_8\n integer :: n, h(100) = 0\n type(pair) :: p\n read(*,*) n\n read(*,*) h(1:n)\n p = solve(h(1:n))\n write(*,'(i0)') p%y\ncontains\n recursive function solve(h) result(ret)\n integer, intent(in) :: h(:)\n integer :: m, x(size(h)+1)\n integer :: n, i, j, w\n integer(8) :: dp1, dp2\n type(pair) :: ret, tmp\n n = size(h)\n m = minval(h)\n x(1:n) = h-m\n x(n+1) = 0\n w = n\n dp1 = 1_8\n dp2 = 1_8\n i = 0\n do while (i <= n)\n j = i+1\n do while (x(j) /= 0)\n j = j+1\n end do\n if (i+1 <= j-1) then\n tmp = solve(x(i+1:j-1))\n dp1 = mod(dp1*tmp%x,md)\n dp2 = mod(dp2*(tmp%x+tmp%y),md)\n w = w-(j-i-1)\n end if\n i = j\n end do\n ret%x = mod(dp1*pow(2_8,m),md)\n ret%y = modulo(mod(dp2*pow(2_8,w),md)+mod(dp1*(pow(2_8,m)-2_8),md),md)\n end\n function pow(a,b) result(r)\n integer(8), intent(in) :: a\n integer, intent(in) :: b\n integer(8) :: r, p\n integer :: k\n r = 1_8\n p = a\n k = b\n do while (k > 0)\n if (btest(k,0)) r = mod(r*p,md)\n p = mod(p*p,md)\n k = rshift(k,1)\n end do\n end\nend program histogram_coloring", "language": "Fortran", "metadata": {"date": 1570487183, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03299.html", "problem_id": "p03299", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03299/input.txt", "sample_output_relpath": "derived/input_output/data/p03299/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03299/Fortran/s633555523.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633555523", "user_id": "u506403362"}, "prompt_components": {"gold_output": "12800\n", "input_to_evaluate": "program histogram_coloring\n implicit none\n type pair\n integer(8) :: x, y\n end type\n integer(8), parameter :: md = 1000000007_8\n integer :: n, h(100) = 0\n type(pair) :: p\n read(*,*) n\n read(*,*) h(1:n)\n p = solve(h(1:n))\n write(*,'(i0)') p%y\ncontains\n recursive function solve(h) result(ret)\n integer, intent(in) :: h(:)\n integer :: m, x(size(h)+1)\n integer :: n, i, j, w\n integer(8) :: dp1, dp2\n type(pair) :: ret, tmp\n n = size(h)\n m = minval(h)\n x(1:n) = h-m\n x(n+1) = 0\n w = n\n dp1 = 1_8\n dp2 = 1_8\n i = 0\n do while (i <= n)\n j = i+1\n do while (x(j) /= 0)\n j = j+1\n end do\n if (i+1 <= j-1) then\n tmp = solve(x(i+1:j-1))\n dp1 = mod(dp1*tmp%x,md)\n dp2 = mod(dp2*(tmp%x+tmp%y),md)\n w = w-(j-i-1)\n end if\n i = j\n end do\n ret%x = mod(dp1*pow(2_8,m),md)\n ret%y = modulo(mod(dp2*pow(2_8,w),md)+mod(dp1*(pow(2_8,m)-2_8),md),md)\n end\n function pow(a,b) result(r)\n integer(8), intent(in) :: a\n integer, intent(in) :: b\n integer(8) :: r, p\n integer :: k\n r = 1_8\n p = a\n k = b\n do while (k > 0)\n if (btest(k,0)) r = mod(r*p,md)\n p = mod(p*p,md)\n k = rshift(k,1)\n end do\n end\nend program histogram_coloring", "problem_context": "Score : 1100 points\n\nProblem Statement\n\nLet us consider a grid of squares with 10^9 rows and N columns. Let (i, j) be the square at the i-th column (1 \\leq i \\leq N) from the left and j-th row (1 \\leq j \\leq 10^9) from the bottom.\n\nSnuke has cut out some part of the grid so that, for each i = 1, 2, ..., N, the bottom-most h_i squares are remaining in the i-th column from the left.\nNow, he will paint the remaining squares in red and blue.\nFind the number of the ways to paint the squares so that the following condition is satisfied:\n\nEvery remaining square is painted either red or blue.\n\nFor all 1 \\leq i \\leq N-1 and 1 \\leq j \\leq min(h_i, h_{i+1})-1, there are exactly two squares painted red and two squares painted blue among the following four squares: (i, j), (i, j+1), (i+1, j) and (i+1, j+1).\n\nSince the number of ways can be extremely large, print the count modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq h_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 ... h_N\n\nOutput\n\nPrint the number of the ways to paint the squares, modulo 10^9+7.\n\nSample Input 1\n\n9\n2 3 5 4 1 2 4 2 1\n\nSample Output 1\n\n12800\n\nOne of the ways to paint the squares is shown below:\n\n#\n## #\n### #\n#### ###\n#########\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n6\n\nThere are six ways to paint the squares, as follows:\n\n## ## ## ## ## ##\n## ## ## ## ## ##\n\nSample Input 3\n\n5\n2 1 2 1 2\n\nSample Output 3\n\n256\n\nEvery way to paint the squares satisfies the condition.\n\nSample Input 4\n\n9\n27 18 28 18 28 45 90 45 23\n\nSample Output 4\n\n844733013\n\nRemember to print the number of ways modulo 10^9 + 7.", "sample_input": "9\n2 3 5 4 1 2 4 2 1\n"}, "reference_outputs": ["12800\n"], "source_document_id": "p03299", "source_text": "Score : 1100 points\n\nProblem Statement\n\nLet us consider a grid of squares with 10^9 rows and N columns. Let (i, j) be the square at the i-th column (1 \\leq i \\leq N) from the left and j-th row (1 \\leq j \\leq 10^9) from the bottom.\n\nSnuke has cut out some part of the grid so that, for each i = 1, 2, ..., N, the bottom-most h_i squares are remaining in the i-th column from the left.\nNow, he will paint the remaining squares in red and blue.\nFind the number of the ways to paint the squares so that the following condition is satisfied:\n\nEvery remaining square is painted either red or blue.\n\nFor all 1 \\leq i \\leq N-1 and 1 \\leq j \\leq min(h_i, h_{i+1})-1, there are exactly two squares painted red and two squares painted blue among the following four squares: (i, j), (i, j+1), (i+1, j) and (i+1, j+1).\n\nSince the number of ways can be extremely large, print the count modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq h_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 ... h_N\n\nOutput\n\nPrint the number of the ways to paint the squares, modulo 10^9+7.\n\nSample Input 1\n\n9\n2 3 5 4 1 2 4 2 1\n\nSample Output 1\n\n12800\n\nOne of the ways to paint the squares is shown below:\n\n#\n## #\n### #\n#### ###\n#########\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n6\n\nThere are six ways to paint the squares, as follows:\n\n## ## ## ## ## ##\n## ## ## ## ## ##\n\nSample Input 3\n\n5\n2 1 2 1 2\n\nSample Output 3\n\n256\n\nEvery way to paint the squares satisfies the condition.\n\nSample Input 4\n\n9\n27 18 28 18 28 45 90 45 23\n\nSample Output 4\n\n844733013\n\nRemember to print the number of ways modulo 10^9 + 7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1272, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s233617675", "group_id": "codeNet:p03303", "input_text": "program aaa\nimplicit none\ninteger :: i,j,k,n,a,b,len,w\n\ncharacter(len=1000) :: s\ncharacter(len=1000) :: s2\n\nread(*,*) s\nread(*,*) w\n\ns2=\"\"\na=1\n\ndo while(a <= len_trim(s))\ns2 = s2(1:len_trim(s2))//s(a:a)\n\na = a + w\nenddo\n\nwrite(*,*) s2(1:len_trim(s2))\n\nend program", "language": "Fortran", "metadata": {"date": 1531014006, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03303.html", "problem_id": "p03303", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03303/input.txt", "sample_output_relpath": "derived/input_output/data/p03303/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03303/Fortran/s233617675.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s233617675", "user_id": "u454703763"}, "prompt_components": {"gold_output": "adg\n", "input_to_evaluate": "program aaa\nimplicit none\ninteger :: i,j,k,n,a,b,len,w\n\ncharacter(len=1000) :: s\ncharacter(len=1000) :: s2\n\nread(*,*) s\nread(*,*) w\n\ns2=\"\"\na=1\n\ndo while(a <= len_trim(s))\ns2 = s2(1:len_trim(s2))//s(a:a)\n\na = a + w\nenddo\n\nwrite(*,*) s2(1:len_trim(s2))\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nWe will write down this string, starting a new line after every w letters. Print the string obtained by concatenating the letters at the beginnings of these lines from top to bottom.\n\nConstraints\n\n1 \\leq w \\leq |S| \\leq 1000\n\nS consists of lowercase English letters.\n\nw is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nw\n\nOutput\n\nPrint the desired string in one line.\n\nSample Input 1\n\nabcdefgh\n3\n\nSample Output 1\n\nadg\n\nWhen we write down abcdefgh, starting a new line after every three letters, we get the following:\n\nabc\n\ndef\n\ngh\n\nConcatenating the letters at the beginnings of these lines, we obtain adg.\n\nSample Input 2\n\nlllll\n1\n\nSample Output 2\n\nlllll\n\nSample Input 3\n\nsouuundhound\n2\n\nSample Output 3\n\nsuudon", "sample_input": "abcdefgh\n3\n"}, "reference_outputs": ["adg\n"], "source_document_id": "p03303", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nWe will write down this string, starting a new line after every w letters. Print the string obtained by concatenating the letters at the beginnings of these lines from top to bottom.\n\nConstraints\n\n1 \\leq w \\leq |S| \\leq 1000\n\nS consists of lowercase English letters.\n\nw is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nw\n\nOutput\n\nPrint the desired string in one line.\n\nSample Input 1\n\nabcdefgh\n3\n\nSample Output 1\n\nadg\n\nWhen we write down abcdefgh, starting a new line after every three letters, we get the following:\n\nabc\n\ndef\n\ngh\n\nConcatenating the letters at the beginnings of these lines, we obtain adg.\n\nSample Input 2\n\nlllll\n1\n\nSample Output 2\n\nlllll\n\nSample Input 3\n\nsouuundhound\n2\n\nSample Output 3\n\nsuudon", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 263, "cpu_time_ms": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s052530561", "group_id": "codeNet:p03304", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,m,d\n\n read*, n,m,d\n if (d==0) then\n print\"(f20.15)\", 1d0/dble(n)*dble(m-1)\n else\n print\"(f20.15)\", 2d0*(1d0/dble(n)-dble(d)/(dble(n))**2)*dble(m-1)\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1600318204, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03304.html", "problem_id": "p03304", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03304/input.txt", "sample_output_relpath": "derived/input_output/data/p03304/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03304/Fortran/s052530561.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052530561", "user_id": "u234636620"}, "prompt_components": {"gold_output": "1.0000000000\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,m,d\n\n read*, n,m,d\n if (d==0) then\n print\"(f20.15)\", 1d0/dble(n)*dble(m-1)\n else\n print\"(f20.15)\", 2d0*(1d0/dble(n)-dble(d)/(dble(n))**2)*dble(m-1)\n end if\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "sample_input": "2 3 1\n"}, "reference_outputs": ["1.0000000000\n"], "source_document_id": "p03304", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3052}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s327068963", "group_id": "codeNet:p03305", "input_text": "module module_sort\n implicit none\n interface sort\n module procedure int_heap_sort, real_heap_sort\n end interface\n\n contains\n\n subroutine int_heap_down(a,node,las)\n implicit none\n integer(8) a(*),x\n integer(8) node,par,ch1,ch2,las\n par = node\n x = a(par); ch1 = par*2\n do while(ch1 <= las)\n ch2 = ch1+1\n if(ch2 <= las .and. a(ch1) < a(ch2)) ch1 = ch2\n if(a(ch1) > x) then\n a(par) = a(ch1); a(ch1) = x\n else \n exit\n endif\n par = ch1; ch1 = par*2\n enddo\n end subroutine int_heap_down\n\n subroutine int_heap_sort(a,n)\n implicit none\n integer(8) a(*),x\n integer(8) n,i\n do i = n/2, 1, -1\n call int_heap_down(a,i,n)\n enddo\n do i=n,2,-1\n x = a(i); a(i) = a(1); a(1) = x\n call int_heap_down(a,1_8,i-1)\n enddo\n end subroutine int_heap_sort\n\n subroutine real_heap_down(a,node,las)\n implicit none\n real a(*), x\n integer(8) node,par,ch1,ch2,las\n par = node\n x = a(par); ch1 = par*2\n do while(ch1 <= las)\n ch2 = ch1+1\n if(ch2 <= las .and. a(ch1) < a(ch2)) ch1 = ch2\n if(a(ch1) > x) then\n a(par) = a(ch1); a(ch1) = x\n else \n exit\n endif\n par = ch1; ch1 = par*2\n enddo\n end subroutine real_heap_down\n\n subroutine real_heap_sort(a,n)\n implicit none\n real a(*),x\n integer(8) n,i\n do i = n/2, 1, -1\n call real_heap_down(a,i,n)\n enddo\n do i=n,2,-1\n x = a(i); a(i) = a(1); a(1) = x\n call real_heap_down(a,1_8,i-1)\n enddo\n end subroutine real_heap_sort\n\nend module module_sort\n\nmodule module_deque\n implicit none\n type deque_node\n type(deque_node) ,pointer:: prev => null(),next => null()\n integer(8) val\n end type deque_node\n\n type deque\n type(deque_node) ,pointer:: first => null(),last => null()\n integer(8):: size=0\n contains\n procedure:: push_back => deque_push_back\n procedure:: push_front => deque_push_front\n procedure:: pop_back => deque_pop_back\n procedure:: pop_front => deque_pop_front\n end type deque\n\n contains\n\n subroutine deque_push_back(self,val)\n class(deque)::self\n integer(8)::val\n if(self%size == 0) then\n allocate(self%first)\n self%last => self%first\n self%first%val = val\n self%size = 1\n else\n allocate(self%last%next)\n self%last%next%prev => self%last\n self%last => self%last%next\n self%last%val = val\n self%size = self%size+1\n endif\n end subroutine deque_push_back\n\n subroutine deque_push_front(self,val)\n class(deque)::self\n integer(8)::val\n if(self%size == 0) then\n allocate(self%first)\n self%last => self%first\n self%first%val = val\n self%size = 1\n else\n allocate(self%first%prev)\n self%first%prev%next => self%first\n self%first => self%first%prev\n self%first%val = val\n self%size = self%size+1\n endif\n end subroutine deque_push_front\n\n subroutine deque_pop_back(self)\n class(deque)::self\n if(self%size == 0) then\n return\n else if(self%size == 1) then\n self%size = 0\n deallocate(self%last)\n self%last => null(); self%first => null()\n else\n self%last => self%last%prev\n deallocate(self%last%next)\n self%last%next => null()\n self%size = self%size-1\n endif\n end subroutine deque_pop_back\n\n subroutine deque_pop_front(self)\n class(deque)::self\n if(self%size == 0) then\n return\n else if(self%size == 1) then\n self%size = 0\n deallocate(self%first)\n self%last => null(); self%first => null()\n else\n self%first => self%first%next\n deallocate(self%first%prev)\n self%first%prev => null()\n self%size = self%size-1\n endif\n end subroutine deque_pop_front\n\nend module module_deque\n\nmodule module_RedBlackTree\n implicit none\n integer(8),parameter :: red = 1,black = 0\n type RBT_KEY\n character(11) :: k\n end type RBT_KEY\n type RBT_node\n type(RBT_node),pointer :: par=>null(), left => null(),right => null()\n type(RBT_KEY) :: key\n integer(8) :: val=0\n integer(8) :: color=red\n end type RBT_node\n\n type(RBT_node) ,pointer,save:: rbt_nil\n\n type RedBlackTree\n type(RBT_node),pointer :: root => null()\n integer(8) :: size = 0\n contains\n procedure:: insert => RedBlackTree_Insert\n procedure:: get_val => RedBlackTree_Get\n procedure:: find => RedBlackTree_Find\n procedure:: add => RedBlackTree_Add\n procedure:: FixUp => RedBlackTree_FixUp\n end type RedBlackTree\n\n contains\n\n subroutine RedBlackTree_Init()\n implicit none\n\n if(.not.associated(rbt_nil)) then\n allocate(rbt_nil)\n rbt_nil%color = black\n endif\n \n end subroutine RedBlackTree_Init\n\n recursive function RedBlackTree_Get(self,key) result(val)\n implicit none\n class(RedBlackTree), intent(in) :: self\n type(RBT_KEY) :: key\n integer(8) :: val\n type(RBT_node),pointer :: u\n\n u => SearchTree(self%root,key)\n val = u%val\n return\n\n end function RedBlackTree_Get\n\n recursive function RedBlackTree_Find(self,key) result(res)\n implicit none\n class(RedBlackTree), intent(in) :: self\n type(RBT_KEY) :: key\n logical :: res\n type(RBT_node),pointer :: u\n\n\n u => SearchTree(self%root,key)\n res = (.not.associated(u,rbt_nil))\n return\n\n end function RedBlackTree_Find\n\n recursive subroutine RedBlackTree_Add(self,key,val)\n implicit none\n class(RedBlackTree), intent(inout) :: self\n type(RBT_KEY) :: key\n type(RBT_node),pointer :: u\n integer(8) :: val\n\n if(.not.associated(self%root)) then\n call self%insert(key,val)\n return\n endif\n\n u => SearchTree(self%root,key)\n if (associated(u,rbt_nil)) then\n call self%insert(key,val)\n else\n u%val = u%val+val \n end if\n return\n\n end subroutine RedBlackTree_Add\n\n recursive function SearchTree(u,key) result(res)\n implicit none\n type(RBT_node), pointer :: u,res\n type(RBT_KEY) :: key\n\n if(associated(u,rbt_nil)) then\n res => rbt_nil\n return\n endif\n\n if(key%k < u%key%k) then\n res => SearchTree(u%left,key)\n return\n else if(key%k > u%key%k) then\n res => SearchTree(u%right,key)\n return\n else\n res => u\n return\n endif\n\n end function SearchTree\n\n subroutine RedBlackTree_Insert(self,key,val)\n implicit none\n class(RedBlackTree),intent(inout):: self\n type(RBT_KEY),intent(in) :: key\n integer(8),intent(in) :: val\n type(RBT_node),pointer,save :: now, u\n\n !allocate new RBT_node\n allocate(u)\n u%key = key; u%val = val\n u%left => rbt_nil; u%right => rbt_nil\n\n !insert new RBT_node\n if(.not. associated(self%root)) then\n u%left => rbt_nil; u%right => rbt_nil; u%par => rbt_nil\n self%root => u\n self%root%color = black\n self%size = 1\n return\n else\n now => self%root\n if(.not.Insert_RBT_node(u,now)) return\n endif\n\n !Fix Tree\n call self%FixUp(u)\n\n self%size = self%size+1\n \n end subroutine RedBlackTree_Insert\n\n recursive function Insert_RBT_node(u,now) result(added) \n implicit none\n type(RBT_node), pointer:: u,now\n logical :: added\n \n if(u%key%k < now%key%k) then\n if(associated(now%left,rbt_nil)) then\n now%left => u\n u%par => now\n added = .true.\n else\n now => now%left\n added = Insert_RBT_node(u,now)\n endif\n return\n else if(u%key%k > now%key%k) then\n if(associated(now%right,rbt_nil)) then\n now%right => u\n u%par => now\n added = .true.\n else\n now => now%right\n added = Insert_RBT_node(u,now)\n endif\n return\n else\n added = .false.\n return\n endif\n\n end function Insert_RBT_node \n\n subroutine RedBlackTree_FixUp(self,u)\n implicit none\n class(RedBlackTree),intent(inout) :: self\n type(RBT_node),pointer,intent(inout) :: u\n type(RBT_node),pointer :: w,g\n\n nullify(w,g)\n do while(u%color == red)\n if(u%key%k == self%root%key%k) then\n u%color = black\n return\n endif\n w => u%par\n if(w%left%color == black) then\n call FripLeft(w,self%root)\n u => w\n w => u%par\n endif\n if(w%color == black) return\n g => w%par\n if(g%right%color == black) then\n call FripRight(g,self%root)\n return\n else\n call PushBlack(g)\n u => g\n endif\n enddo\n \n end subroutine RedBlackTree_FixUp\n\n subroutine PushBlack(u)\n implicit none\n type(RBT_node), pointer:: u\n\n u%color = red; u%left%color = black; u%right%color = black; \n\n end subroutine PushBlack\n\n subroutine PullBlack(u)\n implicit none\n type(RBT_node), pointer:: u\n\n u%color = black; u%left%color = red; u%right%color = red; \n\n end subroutine PullBlack\n\n subroutine FripLeft(u,root)\n implicit none\n type(RBT_node), pointer, intent(inout) :: root\n type(RBT_node), pointer :: u,w\n integer(8) :: tmp\n \n tmp = u%color; u%color = u%right%color; u%right%color = tmp\n\n w => u%right\n w%par => u%par\n if(.not.associated(u%par,rbt_nil)) then\n if(associated(w%par%left,u)) then\n w%par%left=>w\n else \n w%par%right=>w\n endif\n endif\n u%right => w%left\n if(.not.associated(u%right,rbt_nil))u%right%par => u\n u%par => w\n w%left => u\n if(associated(u,root)) then\n root => w\n root%par => rbt_nil\n endif\n\n end subroutine FripLeft\n\n subroutine FripRight(u,root)\n implicit none\n type(RBT_node), pointer,intent(inout):: root\n type(RBT_node), pointer :: u,w\n integer(8) :: tmp\n\n tmp = u%color; u%color = u%left%color; u%left%color = tmp\n\n w => u%left\n w%par => u%par\n if(.not.associated(u%par,rbt_nil)) then\n if(associated(w%par%left,u)) then\n w%par%left=>w\n else \n w%par%right=>w\n endif\n endif\n u%left => w%right\n if(.not.associated(u%left,rbt_nil))u%left%par => u\n u%par => w\n w%right => u\n if(associated(u,root)) then\n root => w\n root%par => rbt_nil\n endif\n\n end subroutine FripRight\n\nend module module_RedBlackTree\n\nmodule module_MinHeap\n implicit none\n type HEAP_TYPE\n integer(8) ::key,val\n end type HEAP_TYPE\n\n type MH_node\n type(MH_node),pointer :: par=>null(), left => null(),right => null()\n type(HEAP_TYPE) :: cont\n integer(8) :: size\n end type MH_node\n type(MH_node) ,pointer,save:: heap_nil\n\n type MinHeap\n type(MH_node),pointer :: root,last\n contains\n procedure:: push => MinHeap_Insert_MH_node\n procedure:: pop => MinHeap_Pop_MH_node\n end type MinHeap\n\n contains\n\n subroutine Swap_HEAP_TYPE(a,b)\n implicit none\n type(HEAP_TYPE),pointer :: a,b,tmp\n\n tmp%key = a%key\n a%key = b%key\n b%key = tmp%key\n tmp%val = a%val\n a%val = b%val\n b%val = tmp%val\n\n end subroutine Swap_HEAP_TYPE\n\n subroutine MinHeap_Up(root,u)\n implicit none\n type(MH_node),pointer :: root,u\n type(HEAP_TYPE) :: tmp\n\n do while(.not.associated(root,u))\n if(u%cont%key < u%par%cont%key) then\n tmp%key = u%cont%key\n u%cont%key = u%par%cont%key\n u%par%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = u%par%cont%val\n u%par%cont%val = tmp%val\n u => u%par\n else\n return\n endif\n enddo\n return\n\n end subroutine MinHeap_Up\n\n subroutine MinHeap_Down(root)\n implicit none\n type(MH_node),pointer :: root,u\n type(HEAP_TYPE) :: tmp\n\n u => root\n do while(.not.associated(u%left,heap_nil))\n\n if(.not.associated(u%right,heap_nil)) then\n if (u%right%cont%key < u%left%cont%key .and. u%right%cont%key < u%cont%key) then\n tmp%key = u%cont%key\n u%cont%key = u%right%cont%key\n u%right%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = u%right%cont%val\n u%right%cont%val = tmp%val\n u => u%right\n cycle\n endif\n endif\n if(u%left%cont%key < u%cont%key) then\n tmp%key = u%cont%key\n u%cont%key = u%left%cont%key\n u%left%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = u%left%cont%val\n u%left%cont%val = tmp%val\n u => u%left\n cycle\n endif\n exit\n enddo\n return\n\n end subroutine MinHeap_Down\n\n subroutine Update_Size(root,u,is_add)\n implicit none\n type(MH_node),pointer :: root,u\n logical :: is_add\n\n do while(.not.associated(root,u))\n if(is_add) then\n u%size = u%size+1\n else\n u%size = u%size-1\n endif\n u => u%par\n enddo\n\n if(is_add) then\n u%size = u%size+1\n else\n u%size = u%size-1\n endif\n\n end subroutine Update_size\n\n subroutine MinHeap_Insert_MH_node(self,cont)\n implicit none\n class(MinHeap) :: self\n type(MH_node),pointer :: u,now\n type(HEAP_TYPE) :: cont\n\n if(.not.associated(heap_nil)) allocate(heap_nil)\n u => null()\n allocate(u)\n u%cont = cont\n u%left => heap_nil; u%right => heap_nil\n u%size = 1\n\n if(.not.associated(self%root)) then\n self%root => u\n self%root%par => heap_nil\n return\n endif\n\n now => self%root\n do\n now%size = now%size+1\n if(.not.associated(now%left,heap_nil)) then\n if(.not.associated(now%right,heap_nil)) then\n if(now%right%size < now%left%size) then\n now => now%right; cycle\n else\n now => now%left; cycle\n endif\n else\n now%right => u\n u%par => now\n exit\n endif\n else\n now%left => u\n u%par => now\n exit\n endif\n enddo\n\n call MinHeap_Up(self%root,u)\n\n end subroutine MinHeap_Insert_MH_node\n\n subroutine MinHeap_Pop_MH_node(self)\n implicit none\n class(MinHeap) :: self\n type(MH_node),pointer :: u,now\n type(HEAP_TYPE) :: tmp\n\n if(.not.associated(heap_nil)) allocate(heap_nil)\n if(.not.associated(self%root)) return\n\n now => self%root\n do\n now%size = now%size-1\n if(.not.associated(now%left,heap_nil)) then\n if(.not.associated(now%right,heap_nil)) then\n if(now%right%size >= now%left%size) then\n now => now%right; cycle\n else\n now => now%left; cycle\n endif\n else\n u => now%left\n tmp%key = u%cont%key\n u%cont%key = self%root%cont%key\n self%root%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = self%root%cont%val\n self%root%cont%val = tmp%val\n now%left => heap_nil\n exit\n endif\n else if(associated(now,self%root)) then\n deallocate(self%root)\n return\n else\n u => now\n tmp%key = u%cont%key\n u%cont%key = self%root%cont%key\n self%root%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = self%root%cont%val\n self%root%cont%val = tmp%val\n if(associated(now%par%left,now)) then\n now%par%left => heap_nil\n else\n now%par%right => heap_nil\n endif\n exit\n endif\n enddo\n\n deallocate(u)\n\n call MinHeap_Down(self%root)\n\n end subroutine MinHeap_Pop_MH_node\n\nend module module_MinHeap\n\nmodule global\n use module_sort\n use module_deque\n use module_RedBlackTree\n use module_MinHeap\n implicit none\n integer(8) :: n,m,s,t,u,v,a,b,ds(100005),dt(100005),ans(100005),mm\n type(deque) :: to(200005),yen(200005),snk(200005)\n type(deque_node),pointer :: tp,yp,sp\n type(HEAP_TYPE) heap_t\n type(MinHeap) pque\nend module global\n\nprogram main\n use global\n integer(8) i\n integer(8) now,dist,nex\n\n call RedBlackTree_Init()\n\n read *,n,m,s,t\n\n do i=1,m\n read*, u,v,a,b\n call to(u)%push_back(v)\n call yen(u)%push_back(a)\n call snk(u)%push_back(b)\n call to(v)%push_back(u)\n call yen(v)%push_back(a)\n call snk(v)%push_back(b)\n enddo\n\n do i=1,n+3\n ds(i) = 1000000000000000_8\n dt(i) = 1000000000000000_8\n enddo\n\n heap_t%key = 0; heap_t%val = s\n call pque%push(heap_t)\n ds(s) = 0\n do while(associated(pque%root))\n now = pque%root%cont%val\n dist = pque%root%cont%key \n call pque%pop()\n if(dist > ds(now)) cycle\n tp => to(now)%first\n yp => yen(now)%first\n do\n nex = tp%val\n if(ds(nex) > dist+yp%val) then\n ds(nex) = dist+yp%val\n heap_t%key = dist+yp%val\n heap_t%val = nex\n call pque%push(heap_t)\n endif\n if(associated(tp,to(now)%last)) exit\n tp => tp%next\n yp => yp%next\n enddo\n enddo\n\n heap_t%key = 0; heap_t%val = t\n call pque%push(heap_t)\n dt(t) = 0\n do while(associated(pque%root))\n now = pque%root%cont%val\n dist = pque%root%cont%key \n call pque%pop()\n if(dist > ds(now)) cycle\n tp => to(now)%first\n sp => snk(now)%first\n do\n nex = tp%val\n if(dt(nex) > dist+sp%val) then\n dt(nex) = dist+sp%val\n heap_t%key = dist+sp%val\n heap_t%val = nex\n call pque%push(heap_t)\n endif\n if(associated(tp,to(now)%last)) exit\n tp => tp%next\n sp => sp%next\n enddo\n enddo\n\n mm = 1000000000000000_8\n\n do i = n, 1,-1\n if(ds(i) /= 1000000000000000_8 .and. dt(i) /= 1000000000000000_8) mm = min(mm,ds(i)+dt(i))\n ans(i) = 1000000000000000_8-mm\n enddo\n\n do i = 1,n\n print '(i0)',ans(i)\n enddo\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1585895065, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03305.html", "problem_id": "p03305", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03305/input.txt", "sample_output_relpath": "derived/input_output/data/p03305/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03305/Fortran/s327068963.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s327068963", "user_id": "u140450365"}, "prompt_components": {"gold_output": "999999999999998\n999999999999989\n999999999999979\n999999999999897\n", "input_to_evaluate": "module module_sort\n implicit none\n interface sort\n module procedure int_heap_sort, real_heap_sort\n end interface\n\n contains\n\n subroutine int_heap_down(a,node,las)\n implicit none\n integer(8) a(*),x\n integer(8) node,par,ch1,ch2,las\n par = node\n x = a(par); ch1 = par*2\n do while(ch1 <= las)\n ch2 = ch1+1\n if(ch2 <= las .and. a(ch1) < a(ch2)) ch1 = ch2\n if(a(ch1) > x) then\n a(par) = a(ch1); a(ch1) = x\n else \n exit\n endif\n par = ch1; ch1 = par*2\n enddo\n end subroutine int_heap_down\n\n subroutine int_heap_sort(a,n)\n implicit none\n integer(8) a(*),x\n integer(8) n,i\n do i = n/2, 1, -1\n call int_heap_down(a,i,n)\n enddo\n do i=n,2,-1\n x = a(i); a(i) = a(1); a(1) = x\n call int_heap_down(a,1_8,i-1)\n enddo\n end subroutine int_heap_sort\n\n subroutine real_heap_down(a,node,las)\n implicit none\n real a(*), x\n integer(8) node,par,ch1,ch2,las\n par = node\n x = a(par); ch1 = par*2\n do while(ch1 <= las)\n ch2 = ch1+1\n if(ch2 <= las .and. a(ch1) < a(ch2)) ch1 = ch2\n if(a(ch1) > x) then\n a(par) = a(ch1); a(ch1) = x\n else \n exit\n endif\n par = ch1; ch1 = par*2\n enddo\n end subroutine real_heap_down\n\n subroutine real_heap_sort(a,n)\n implicit none\n real a(*),x\n integer(8) n,i\n do i = n/2, 1, -1\n call real_heap_down(a,i,n)\n enddo\n do i=n,2,-1\n x = a(i); a(i) = a(1); a(1) = x\n call real_heap_down(a,1_8,i-1)\n enddo\n end subroutine real_heap_sort\n\nend module module_sort\n\nmodule module_deque\n implicit none\n type deque_node\n type(deque_node) ,pointer:: prev => null(),next => null()\n integer(8) val\n end type deque_node\n\n type deque\n type(deque_node) ,pointer:: first => null(),last => null()\n integer(8):: size=0\n contains\n procedure:: push_back => deque_push_back\n procedure:: push_front => deque_push_front\n procedure:: pop_back => deque_pop_back\n procedure:: pop_front => deque_pop_front\n end type deque\n\n contains\n\n subroutine deque_push_back(self,val)\n class(deque)::self\n integer(8)::val\n if(self%size == 0) then\n allocate(self%first)\n self%last => self%first\n self%first%val = val\n self%size = 1\n else\n allocate(self%last%next)\n self%last%next%prev => self%last\n self%last => self%last%next\n self%last%val = val\n self%size = self%size+1\n endif\n end subroutine deque_push_back\n\n subroutine deque_push_front(self,val)\n class(deque)::self\n integer(8)::val\n if(self%size == 0) then\n allocate(self%first)\n self%last => self%first\n self%first%val = val\n self%size = 1\n else\n allocate(self%first%prev)\n self%first%prev%next => self%first\n self%first => self%first%prev\n self%first%val = val\n self%size = self%size+1\n endif\n end subroutine deque_push_front\n\n subroutine deque_pop_back(self)\n class(deque)::self\n if(self%size == 0) then\n return\n else if(self%size == 1) then\n self%size = 0\n deallocate(self%last)\n self%last => null(); self%first => null()\n else\n self%last => self%last%prev\n deallocate(self%last%next)\n self%last%next => null()\n self%size = self%size-1\n endif\n end subroutine deque_pop_back\n\n subroutine deque_pop_front(self)\n class(deque)::self\n if(self%size == 0) then\n return\n else if(self%size == 1) then\n self%size = 0\n deallocate(self%first)\n self%last => null(); self%first => null()\n else\n self%first => self%first%next\n deallocate(self%first%prev)\n self%first%prev => null()\n self%size = self%size-1\n endif\n end subroutine deque_pop_front\n\nend module module_deque\n\nmodule module_RedBlackTree\n implicit none\n integer(8),parameter :: red = 1,black = 0\n type RBT_KEY\n character(11) :: k\n end type RBT_KEY\n type RBT_node\n type(RBT_node),pointer :: par=>null(), left => null(),right => null()\n type(RBT_KEY) :: key\n integer(8) :: val=0\n integer(8) :: color=red\n end type RBT_node\n\n type(RBT_node) ,pointer,save:: rbt_nil\n\n type RedBlackTree\n type(RBT_node),pointer :: root => null()\n integer(8) :: size = 0\n contains\n procedure:: insert => RedBlackTree_Insert\n procedure:: get_val => RedBlackTree_Get\n procedure:: find => RedBlackTree_Find\n procedure:: add => RedBlackTree_Add\n procedure:: FixUp => RedBlackTree_FixUp\n end type RedBlackTree\n\n contains\n\n subroutine RedBlackTree_Init()\n implicit none\n\n if(.not.associated(rbt_nil)) then\n allocate(rbt_nil)\n rbt_nil%color = black\n endif\n \n end subroutine RedBlackTree_Init\n\n recursive function RedBlackTree_Get(self,key) result(val)\n implicit none\n class(RedBlackTree), intent(in) :: self\n type(RBT_KEY) :: key\n integer(8) :: val\n type(RBT_node),pointer :: u\n\n u => SearchTree(self%root,key)\n val = u%val\n return\n\n end function RedBlackTree_Get\n\n recursive function RedBlackTree_Find(self,key) result(res)\n implicit none\n class(RedBlackTree), intent(in) :: self\n type(RBT_KEY) :: key\n logical :: res\n type(RBT_node),pointer :: u\n\n\n u => SearchTree(self%root,key)\n res = (.not.associated(u,rbt_nil))\n return\n\n end function RedBlackTree_Find\n\n recursive subroutine RedBlackTree_Add(self,key,val)\n implicit none\n class(RedBlackTree), intent(inout) :: self\n type(RBT_KEY) :: key\n type(RBT_node),pointer :: u\n integer(8) :: val\n\n if(.not.associated(self%root)) then\n call self%insert(key,val)\n return\n endif\n\n u => SearchTree(self%root,key)\n if (associated(u,rbt_nil)) then\n call self%insert(key,val)\n else\n u%val = u%val+val \n end if\n return\n\n end subroutine RedBlackTree_Add\n\n recursive function SearchTree(u,key) result(res)\n implicit none\n type(RBT_node), pointer :: u,res\n type(RBT_KEY) :: key\n\n if(associated(u,rbt_nil)) then\n res => rbt_nil\n return\n endif\n\n if(key%k < u%key%k) then\n res => SearchTree(u%left,key)\n return\n else if(key%k > u%key%k) then\n res => SearchTree(u%right,key)\n return\n else\n res => u\n return\n endif\n\n end function SearchTree\n\n subroutine RedBlackTree_Insert(self,key,val)\n implicit none\n class(RedBlackTree),intent(inout):: self\n type(RBT_KEY),intent(in) :: key\n integer(8),intent(in) :: val\n type(RBT_node),pointer,save :: now, u\n\n !allocate new RBT_node\n allocate(u)\n u%key = key; u%val = val\n u%left => rbt_nil; u%right => rbt_nil\n\n !insert new RBT_node\n if(.not. associated(self%root)) then\n u%left => rbt_nil; u%right => rbt_nil; u%par => rbt_nil\n self%root => u\n self%root%color = black\n self%size = 1\n return\n else\n now => self%root\n if(.not.Insert_RBT_node(u,now)) return\n endif\n\n !Fix Tree\n call self%FixUp(u)\n\n self%size = self%size+1\n \n end subroutine RedBlackTree_Insert\n\n recursive function Insert_RBT_node(u,now) result(added) \n implicit none\n type(RBT_node), pointer:: u,now\n logical :: added\n \n if(u%key%k < now%key%k) then\n if(associated(now%left,rbt_nil)) then\n now%left => u\n u%par => now\n added = .true.\n else\n now => now%left\n added = Insert_RBT_node(u,now)\n endif\n return\n else if(u%key%k > now%key%k) then\n if(associated(now%right,rbt_nil)) then\n now%right => u\n u%par => now\n added = .true.\n else\n now => now%right\n added = Insert_RBT_node(u,now)\n endif\n return\n else\n added = .false.\n return\n endif\n\n end function Insert_RBT_node \n\n subroutine RedBlackTree_FixUp(self,u)\n implicit none\n class(RedBlackTree),intent(inout) :: self\n type(RBT_node),pointer,intent(inout) :: u\n type(RBT_node),pointer :: w,g\n\n nullify(w,g)\n do while(u%color == red)\n if(u%key%k == self%root%key%k) then\n u%color = black\n return\n endif\n w => u%par\n if(w%left%color == black) then\n call FripLeft(w,self%root)\n u => w\n w => u%par\n endif\n if(w%color == black) return\n g => w%par\n if(g%right%color == black) then\n call FripRight(g,self%root)\n return\n else\n call PushBlack(g)\n u => g\n endif\n enddo\n \n end subroutine RedBlackTree_FixUp\n\n subroutine PushBlack(u)\n implicit none\n type(RBT_node), pointer:: u\n\n u%color = red; u%left%color = black; u%right%color = black; \n\n end subroutine PushBlack\n\n subroutine PullBlack(u)\n implicit none\n type(RBT_node), pointer:: u\n\n u%color = black; u%left%color = red; u%right%color = red; \n\n end subroutine PullBlack\n\n subroutine FripLeft(u,root)\n implicit none\n type(RBT_node), pointer, intent(inout) :: root\n type(RBT_node), pointer :: u,w\n integer(8) :: tmp\n \n tmp = u%color; u%color = u%right%color; u%right%color = tmp\n\n w => u%right\n w%par => u%par\n if(.not.associated(u%par,rbt_nil)) then\n if(associated(w%par%left,u)) then\n w%par%left=>w\n else \n w%par%right=>w\n endif\n endif\n u%right => w%left\n if(.not.associated(u%right,rbt_nil))u%right%par => u\n u%par => w\n w%left => u\n if(associated(u,root)) then\n root => w\n root%par => rbt_nil\n endif\n\n end subroutine FripLeft\n\n subroutine FripRight(u,root)\n implicit none\n type(RBT_node), pointer,intent(inout):: root\n type(RBT_node), pointer :: u,w\n integer(8) :: tmp\n\n tmp = u%color; u%color = u%left%color; u%left%color = tmp\n\n w => u%left\n w%par => u%par\n if(.not.associated(u%par,rbt_nil)) then\n if(associated(w%par%left,u)) then\n w%par%left=>w\n else \n w%par%right=>w\n endif\n endif\n u%left => w%right\n if(.not.associated(u%left,rbt_nil))u%left%par => u\n u%par => w\n w%right => u\n if(associated(u,root)) then\n root => w\n root%par => rbt_nil\n endif\n\n end subroutine FripRight\n\nend module module_RedBlackTree\n\nmodule module_MinHeap\n implicit none\n type HEAP_TYPE\n integer(8) ::key,val\n end type HEAP_TYPE\n\n type MH_node\n type(MH_node),pointer :: par=>null(), left => null(),right => null()\n type(HEAP_TYPE) :: cont\n integer(8) :: size\n end type MH_node\n type(MH_node) ,pointer,save:: heap_nil\n\n type MinHeap\n type(MH_node),pointer :: root,last\n contains\n procedure:: push => MinHeap_Insert_MH_node\n procedure:: pop => MinHeap_Pop_MH_node\n end type MinHeap\n\n contains\n\n subroutine Swap_HEAP_TYPE(a,b)\n implicit none\n type(HEAP_TYPE),pointer :: a,b,tmp\n\n tmp%key = a%key\n a%key = b%key\n b%key = tmp%key\n tmp%val = a%val\n a%val = b%val\n b%val = tmp%val\n\n end subroutine Swap_HEAP_TYPE\n\n subroutine MinHeap_Up(root,u)\n implicit none\n type(MH_node),pointer :: root,u\n type(HEAP_TYPE) :: tmp\n\n do while(.not.associated(root,u))\n if(u%cont%key < u%par%cont%key) then\n tmp%key = u%cont%key\n u%cont%key = u%par%cont%key\n u%par%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = u%par%cont%val\n u%par%cont%val = tmp%val\n u => u%par\n else\n return\n endif\n enddo\n return\n\n end subroutine MinHeap_Up\n\n subroutine MinHeap_Down(root)\n implicit none\n type(MH_node),pointer :: root,u\n type(HEAP_TYPE) :: tmp\n\n u => root\n do while(.not.associated(u%left,heap_nil))\n\n if(.not.associated(u%right,heap_nil)) then\n if (u%right%cont%key < u%left%cont%key .and. u%right%cont%key < u%cont%key) then\n tmp%key = u%cont%key\n u%cont%key = u%right%cont%key\n u%right%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = u%right%cont%val\n u%right%cont%val = tmp%val\n u => u%right\n cycle\n endif\n endif\n if(u%left%cont%key < u%cont%key) then\n tmp%key = u%cont%key\n u%cont%key = u%left%cont%key\n u%left%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = u%left%cont%val\n u%left%cont%val = tmp%val\n u => u%left\n cycle\n endif\n exit\n enddo\n return\n\n end subroutine MinHeap_Down\n\n subroutine Update_Size(root,u,is_add)\n implicit none\n type(MH_node),pointer :: root,u\n logical :: is_add\n\n do while(.not.associated(root,u))\n if(is_add) then\n u%size = u%size+1\n else\n u%size = u%size-1\n endif\n u => u%par\n enddo\n\n if(is_add) then\n u%size = u%size+1\n else\n u%size = u%size-1\n endif\n\n end subroutine Update_size\n\n subroutine MinHeap_Insert_MH_node(self,cont)\n implicit none\n class(MinHeap) :: self\n type(MH_node),pointer :: u,now\n type(HEAP_TYPE) :: cont\n\n if(.not.associated(heap_nil)) allocate(heap_nil)\n u => null()\n allocate(u)\n u%cont = cont\n u%left => heap_nil; u%right => heap_nil\n u%size = 1\n\n if(.not.associated(self%root)) then\n self%root => u\n self%root%par => heap_nil\n return\n endif\n\n now => self%root\n do\n now%size = now%size+1\n if(.not.associated(now%left,heap_nil)) then\n if(.not.associated(now%right,heap_nil)) then\n if(now%right%size < now%left%size) then\n now => now%right; cycle\n else\n now => now%left; cycle\n endif\n else\n now%right => u\n u%par => now\n exit\n endif\n else\n now%left => u\n u%par => now\n exit\n endif\n enddo\n\n call MinHeap_Up(self%root,u)\n\n end subroutine MinHeap_Insert_MH_node\n\n subroutine MinHeap_Pop_MH_node(self)\n implicit none\n class(MinHeap) :: self\n type(MH_node),pointer :: u,now\n type(HEAP_TYPE) :: tmp\n\n if(.not.associated(heap_nil)) allocate(heap_nil)\n if(.not.associated(self%root)) return\n\n now => self%root\n do\n now%size = now%size-1\n if(.not.associated(now%left,heap_nil)) then\n if(.not.associated(now%right,heap_nil)) then\n if(now%right%size >= now%left%size) then\n now => now%right; cycle\n else\n now => now%left; cycle\n endif\n else\n u => now%left\n tmp%key = u%cont%key\n u%cont%key = self%root%cont%key\n self%root%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = self%root%cont%val\n self%root%cont%val = tmp%val\n now%left => heap_nil\n exit\n endif\n else if(associated(now,self%root)) then\n deallocate(self%root)\n return\n else\n u => now\n tmp%key = u%cont%key\n u%cont%key = self%root%cont%key\n self%root%cont%key = tmp%key\n tmp%val = u%cont%val\n u%cont%val = self%root%cont%val\n self%root%cont%val = tmp%val\n if(associated(now%par%left,now)) then\n now%par%left => heap_nil\n else\n now%par%right => heap_nil\n endif\n exit\n endif\n enddo\n\n deallocate(u)\n\n call MinHeap_Down(self%root)\n\n end subroutine MinHeap_Pop_MH_node\n\nend module module_MinHeap\n\nmodule global\n use module_sort\n use module_deque\n use module_RedBlackTree\n use module_MinHeap\n implicit none\n integer(8) :: n,m,s,t,u,v,a,b,ds(100005),dt(100005),ans(100005),mm\n type(deque) :: to(200005),yen(200005),snk(200005)\n type(deque_node),pointer :: tp,yp,sp\n type(HEAP_TYPE) heap_t\n type(MinHeap) pque\nend module global\n\nprogram main\n use global\n integer(8) i\n integer(8) now,dist,nex\n\n call RedBlackTree_Init()\n\n read *,n,m,s,t\n\n do i=1,m\n read*, u,v,a,b\n call to(u)%push_back(v)\n call yen(u)%push_back(a)\n call snk(u)%push_back(b)\n call to(v)%push_back(u)\n call yen(v)%push_back(a)\n call snk(v)%push_back(b)\n enddo\n\n do i=1,n+3\n ds(i) = 1000000000000000_8\n dt(i) = 1000000000000000_8\n enddo\n\n heap_t%key = 0; heap_t%val = s\n call pque%push(heap_t)\n ds(s) = 0\n do while(associated(pque%root))\n now = pque%root%cont%val\n dist = pque%root%cont%key \n call pque%pop()\n if(dist > ds(now)) cycle\n tp => to(now)%first\n yp => yen(now)%first\n do\n nex = tp%val\n if(ds(nex) > dist+yp%val) then\n ds(nex) = dist+yp%val\n heap_t%key = dist+yp%val\n heap_t%val = nex\n call pque%push(heap_t)\n endif\n if(associated(tp,to(now)%last)) exit\n tp => tp%next\n yp => yp%next\n enddo\n enddo\n\n heap_t%key = 0; heap_t%val = t\n call pque%push(heap_t)\n dt(t) = 0\n do while(associated(pque%root))\n now = pque%root%cont%val\n dist = pque%root%cont%key \n call pque%pop()\n if(dist > ds(now)) cycle\n tp => to(now)%first\n sp => snk(now)%first\n do\n nex = tp%val\n if(dt(nex) > dist+sp%val) then\n dt(nex) = dist+sp%val\n heap_t%key = dist+sp%val\n heap_t%val = nex\n call pque%push(heap_t)\n endif\n if(associated(tp,to(now)%last)) exit\n tp => tp%next\n sp => sp%next\n enddo\n enddo\n\n mm = 1000000000000000_8\n\n do i = n, 1,-1\n if(ds(i) /= 1000000000000000_8 .and. dt(i) /= 1000000000000000_8) mm = min(mm,ds(i)+dt(i))\n ans(i) = 1000000000000000_8-mm\n enddo\n\n do i = 1,n\n print '(i0)',ans(i)\n enddo\n\nend program main\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "sample_input": "4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n"}, "reference_outputs": ["999999999999998\n999999999999989\n999999999999979\n999999999999897\n"], "source_document_id": "p03305", "source_text": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 23021, "cpu_time_ms": 345, "memory_kb": 39040}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s110987429", "group_id": "codeNet:p03305", "input_text": "module mod_graph\n implicit none\n integer(8), parameter :: inf = 1000000000000000000_8\n\n type item\n integer :: id = 0\n integer(8) :: wt = 0_8\n end type\n\n type priorityqueue\n integer :: num = 0\n type(item), pointer :: heap(:) => null()\n end type\n\n type edge\n integer :: fm = 0, to = 0, cp = 0, rv = 0\n integer(8) :: wt = 0_8\n end type\n\n type arraylist\n integer :: num = 0\n type(edge), pointer :: arr(:) => null()\n contains\n procedure :: add => adde\n procedure :: bellman_ford => bellman_ford\n end type\n\n type graph\n type(arraylist), pointer :: egs(:) => null()\n logical, pointer :: used(:) => null()\n contains\n procedure :: add => add\n procedure :: dijkstra => dijkstra\n procedure :: ford_fulkerson => ford_fulkerson\n end type\n\n interface graph\n module procedure :: newg\n end interface graph\n\ncontains\n\n function newi(id,wt) result(ret)\n integer, intent(in) :: id\n integer(8), intent(in) :: wt\n type(item) :: ret\n ret%id = id\n ret%wt = wt\n end\n\n subroutine swapi(a,b)\n type(item), intent(inout) :: a, b\n type(item) :: c\n c = a\n a = b\n b = c\n end\n\n subroutine appendi(a)\n type(item), pointer, intent(inout) :: a(:)\n integer :: n\n type(item), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lessi(a,b) result(ret)\n type(item), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizei(pq)\n type(priorityqueue), intent(inout) :: pq\n if (associated(pq%heap)) deallocate(pq%heap)\n pq%num = 0\n end\n\n subroutine offer(pq,it)\n type(priorityqueue), intent(inout) :: pq\n type(item), intent(in) :: it\n integer :: i, j\n if (.not.associated(pq%heap)) allocate(pq%heap(1))\n if (pq%num == size(pq%heap)) call appendi(pq%heap)\n pq%num = pq%num+1\n pq%heap(pq%num) = it\n i = pq%num\n do while (i > 1)\n j = i/2\n if (lessi(pq%heap(i),pq%heap(j))) call swapi(pq%heap(i),pq%heap(j))\n i = j\n end do\n end\n\n function poll(pq) result(ret)\n type(priorityqueue), intent(inout) :: pq\n type(item) :: ret\n integer :: n, i, j\n n = pq%num\n ret = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. lessi(pq%heap(j+1),pq%heap(j))) j = j+1\n if (lessi(pq%heap(j),pq%heap(i))) call swapi(pq%heap(j),pq%heap(i))\n i = j\n end do\n end\n\n function newe(to,wt,fm,cp,rv) result(ret)\n integer, intent(in) :: to\n integer(8), intent(in) :: wt\n integer, intent(in), optional :: fm, cp, rv\n type(edge) :: ret\n if (present(fm)) ret%fm = fm\n ret%to = to\n ret%wt = wt\n if (present(cp) .and. present(rv)) then\n ret%cp = cp\n ret%rv = rv\n end if\n end\n\n subroutine appende(a)\n type(edge), pointer, intent(inout) :: a(:)\n integer :: n\n type(edge), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lesse(a,b) result(ret)\n type(edge), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizee(list)\n type(arraylist), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n list%num = 0\n end\n\n subroutine adde(list,e)\n class(arraylist), intent(inout) :: list\n type(edge), intent(in) :: e\n if (.not.associated(list%arr)) allocate(list%arr(1))\n if (list%num == size(list%arr)) call appende(list%arr)\n list%num = list%num+1\n list%arr(list%num) = e\n end\n\n function newg(n) result(ret)\n integer, intent(in) :: n\n type(graph) :: ret\n allocate(ret%egs(n))\n end\n\n subroutine add(g,fm,to,wt,cp)\n class(graph), intent(inout) :: g\n integer, intent(in) :: fm, to\n integer, intent(in), optional :: cp\n integer(8) :: wt\n if (present(cp)) then\n call adde(g%egs(fm),newe(to,wt,cp=cp,rv=g%egs(to)%num))\n call adde(g%egs(to),newe(fm,wt,cp=0,rv=g%egs(fm)%num-1))\n else\n call adde(g%egs(fm),newe(to,wt))\n end if\n end\n\n function dijkstra(g,s) result(ret)\n class(graph), intent(in) :: g\n integer, intent(in) :: s\n integer(8) :: ret(size(g%egs))\n type(priorityqueue) :: pq\n type(item) :: it\n type(edge) :: e\n integer :: i\n ret = inf\n ret(s) = 0_8\n call offer(pq,newi(s,ret(s)))\n do while (pq%num > 0)\n it = poll(pq)\n if (it%wt > ret(it%id)) cycle\n do i = 1, g%egs(it%id)%num\n e = g%egs(it%id)%arr(i)\n if (ret(e%to) > ret(it%id)+e%wt) then\n ret(e%to) = ret(it%id)+e%wt\n call offer(pq,newi(e%to,ret(e%to)))\n end if\n end do\n end do\n end\n\n recursive subroutine dfs_bf(g,u)\n type(graph), intent(inout) :: g\n integer, intent(in) :: u\n integer :: i, v\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n if (g%used(v)) cycle\n call dfs_bf(g,v)\n end do\n end\n\n function bellman_ford(es,s,t) result(ret)\n class(arraylist), intent(in) :: es\n integer, intent(in) :: s, t\n integer(8) :: ret\n integer :: n, i, fm, to, step\n integer(8) :: wt\n logical :: updated\n integer(8), allocatable :: tmp(:)\n type(graph) :: gs, gt\n type(arraylist) :: reach\n n = 0\n do i = 1, es%num\n n = max(n,es%arr(i)%fm,es%arr(i)%to)\n end do\n gs = newg(n)\n gt = newg(n)\n allocate(gs%used(n),gt%used(n))\n gs%used = .false.\n gt%used = .false.\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n wt = es%arr(i)%wt\n call add(gs,fm,to,wt)\n call add(gt,to,fm,wt)\n end do\n call dfs_bf(gs,s)\n call dfs_bf(gt,t)\n n = 0\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n if (gs%used(fm) .and. gt%used(fm) .and. gs%used(to) .and. gt%used(to)) then\n call adde(reach,es%arr(i))\n n = max(n,fm,to)\n end if\n end do\n deallocate(gs%used,gt%used)\n allocate(tmp(n))\n tmp = inf\n tmp(s) = 0_8\n step = 0\n updated = .true.\n do while (updated)\n updated = .false.\n do i = 1, reach%num\n fm = reach%arr(i)%fm\n to = reach%arr(i)%to\n wt = reach%arr(i)%wt\n if (tmp(to) > tmp(fm)+wt) then\n tmp(to) = tmp(fm)+wt\n updated = .true.\n end if\n end do\n step = step+1\n if (step > n) then\n ret = -inf\n return\n end if\n end do\n ret = tmp(t)\n deallocate(tmp)\n end\n\n recursive function dfs_ff(g,u,t,f) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: u, t, f\n integer :: ret\n integer :: i, v, cp, rv\n ret = f\n if (u == t) return\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n cp = g%egs(u)%arr(i)%cp\n if (g%used(v) .or. cp <= 0) cycle\n ret = dfs_ff(g,v,t,min(f,cp))\n rv = g%egs(u)%arr(i)%rv\n if (ret > 0) then\n g%egs(u)%arr(i)%cp = g%egs(u)%arr(i)%cp-ret\n g%egs(v)%arr(rv)%cp = g%egs(v)%arr(rv)%cp+ret\n return\n end if\n end do\n ret = 0\n end\n\n function ford_fulkerson(g,s,t) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: s, t\n integer :: ret\n integer :: f\n ret = 0\n if (.not.associated(g%used)) allocate(g%used(size(g%egs)))\n do\n g%used = .false.\n f = dfs_ff(g,s,t,1000000000)\n if (f == 0) then\n deallocate(g%used)\n return\n end if\n ret = ret+f\n end do\n end\n\nend module mod_graph\n\nprogram saving_snuuk\n use mod_graph\n implicit none\n integer(8), parameter :: dyen = 1000000000000000_8\n integer :: n, m, s, t, u, v, i\n integer(8) :: a, b, cy(100000) = 0_8, cs(100000) = 0_8, ans(100000) = 0_8\n type(graph) :: gy, gs\n read(*,*) n, m, s, t\n gy = graph(n)\n gs = graph(n)\n do i = 1, m\n read(*,*) u, v, a, b\n call gy%add(u,v,a)\n call gy%add(v,u,a)\n call gs%add(u,v,b)\n call gs%add(v,u,b)\n end do\n cy(1:n) = gy%dijkstra(s)\n cs(1:n) = gs%dijkstra(t)\n ans(n) = cy(n)+cs(n)\n do i = n-1, 1, -1\n ans(i) = min(ans(i+1),cy(i)+cs(i))\n end do\n do i = 1, n\n write(*,'(i0)') dyen-ans(i)\n end do\nend program saving_snuuk", "language": "Fortran", "metadata": {"date": 1567280420, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03305.html", "problem_id": "p03305", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03305/input.txt", "sample_output_relpath": "derived/input_output/data/p03305/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03305/Fortran/s110987429.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110987429", "user_id": "u506403362"}, "prompt_components": {"gold_output": "999999999999998\n999999999999989\n999999999999979\n999999999999897\n", "input_to_evaluate": "module mod_graph\n implicit none\n integer(8), parameter :: inf = 1000000000000000000_8\n\n type item\n integer :: id = 0\n integer(8) :: wt = 0_8\n end type\n\n type priorityqueue\n integer :: num = 0\n type(item), pointer :: heap(:) => null()\n end type\n\n type edge\n integer :: fm = 0, to = 0, cp = 0, rv = 0\n integer(8) :: wt = 0_8\n end type\n\n type arraylist\n integer :: num = 0\n type(edge), pointer :: arr(:) => null()\n contains\n procedure :: add => adde\n procedure :: bellman_ford => bellman_ford\n end type\n\n type graph\n type(arraylist), pointer :: egs(:) => null()\n logical, pointer :: used(:) => null()\n contains\n procedure :: add => add\n procedure :: dijkstra => dijkstra\n procedure :: ford_fulkerson => ford_fulkerson\n end type\n\n interface graph\n module procedure :: newg\n end interface graph\n\ncontains\n\n function newi(id,wt) result(ret)\n integer, intent(in) :: id\n integer(8), intent(in) :: wt\n type(item) :: ret\n ret%id = id\n ret%wt = wt\n end\n\n subroutine swapi(a,b)\n type(item), intent(inout) :: a, b\n type(item) :: c\n c = a\n a = b\n b = c\n end\n\n subroutine appendi(a)\n type(item), pointer, intent(inout) :: a(:)\n integer :: n\n type(item), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lessi(a,b) result(ret)\n type(item), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizei(pq)\n type(priorityqueue), intent(inout) :: pq\n if (associated(pq%heap)) deallocate(pq%heap)\n pq%num = 0\n end\n\n subroutine offer(pq,it)\n type(priorityqueue), intent(inout) :: pq\n type(item), intent(in) :: it\n integer :: i, j\n if (.not.associated(pq%heap)) allocate(pq%heap(1))\n if (pq%num == size(pq%heap)) call appendi(pq%heap)\n pq%num = pq%num+1\n pq%heap(pq%num) = it\n i = pq%num\n do while (i > 1)\n j = i/2\n if (lessi(pq%heap(i),pq%heap(j))) call swapi(pq%heap(i),pq%heap(j))\n i = j\n end do\n end\n\n function poll(pq) result(ret)\n type(priorityqueue), intent(inout) :: pq\n type(item) :: ret\n integer :: n, i, j\n n = pq%num\n ret = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. lessi(pq%heap(j+1),pq%heap(j))) j = j+1\n if (lessi(pq%heap(j),pq%heap(i))) call swapi(pq%heap(j),pq%heap(i))\n i = j\n end do\n end\n\n function newe(to,wt,fm,cp,rv) result(ret)\n integer, intent(in) :: to\n integer(8), intent(in) :: wt\n integer, intent(in), optional :: fm, cp, rv\n type(edge) :: ret\n if (present(fm)) ret%fm = fm\n ret%to = to\n ret%wt = wt\n if (present(cp) .and. present(rv)) then\n ret%cp = cp\n ret%rv = rv\n end if\n end\n\n subroutine appende(a)\n type(edge), pointer, intent(inout) :: a(:)\n integer :: n\n type(edge), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lesse(a,b) result(ret)\n type(edge), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizee(list)\n type(arraylist), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n list%num = 0\n end\n\n subroutine adde(list,e)\n class(arraylist), intent(inout) :: list\n type(edge), intent(in) :: e\n if (.not.associated(list%arr)) allocate(list%arr(1))\n if (list%num == size(list%arr)) call appende(list%arr)\n list%num = list%num+1\n list%arr(list%num) = e\n end\n\n function newg(n) result(ret)\n integer, intent(in) :: n\n type(graph) :: ret\n allocate(ret%egs(n))\n end\n\n subroutine add(g,fm,to,wt,cp)\n class(graph), intent(inout) :: g\n integer, intent(in) :: fm, to\n integer, intent(in), optional :: cp\n integer(8) :: wt\n if (present(cp)) then\n call adde(g%egs(fm),newe(to,wt,cp=cp,rv=g%egs(to)%num))\n call adde(g%egs(to),newe(fm,wt,cp=0,rv=g%egs(fm)%num-1))\n else\n call adde(g%egs(fm),newe(to,wt))\n end if\n end\n\n function dijkstra(g,s) result(ret)\n class(graph), intent(in) :: g\n integer, intent(in) :: s\n integer(8) :: ret(size(g%egs))\n type(priorityqueue) :: pq\n type(item) :: it\n type(edge) :: e\n integer :: i\n ret = inf\n ret(s) = 0_8\n call offer(pq,newi(s,ret(s)))\n do while (pq%num > 0)\n it = poll(pq)\n if (it%wt > ret(it%id)) cycle\n do i = 1, g%egs(it%id)%num\n e = g%egs(it%id)%arr(i)\n if (ret(e%to) > ret(it%id)+e%wt) then\n ret(e%to) = ret(it%id)+e%wt\n call offer(pq,newi(e%to,ret(e%to)))\n end if\n end do\n end do\n end\n\n recursive subroutine dfs_bf(g,u)\n type(graph), intent(inout) :: g\n integer, intent(in) :: u\n integer :: i, v\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n if (g%used(v)) cycle\n call dfs_bf(g,v)\n end do\n end\n\n function bellman_ford(es,s,t) result(ret)\n class(arraylist), intent(in) :: es\n integer, intent(in) :: s, t\n integer(8) :: ret\n integer :: n, i, fm, to, step\n integer(8) :: wt\n logical :: updated\n integer(8), allocatable :: tmp(:)\n type(graph) :: gs, gt\n type(arraylist) :: reach\n n = 0\n do i = 1, es%num\n n = max(n,es%arr(i)%fm,es%arr(i)%to)\n end do\n gs = newg(n)\n gt = newg(n)\n allocate(gs%used(n),gt%used(n))\n gs%used = .false.\n gt%used = .false.\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n wt = es%arr(i)%wt\n call add(gs,fm,to,wt)\n call add(gt,to,fm,wt)\n end do\n call dfs_bf(gs,s)\n call dfs_bf(gt,t)\n n = 0\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n if (gs%used(fm) .and. gt%used(fm) .and. gs%used(to) .and. gt%used(to)) then\n call adde(reach,es%arr(i))\n n = max(n,fm,to)\n end if\n end do\n deallocate(gs%used,gt%used)\n allocate(tmp(n))\n tmp = inf\n tmp(s) = 0_8\n step = 0\n updated = .true.\n do while (updated)\n updated = .false.\n do i = 1, reach%num\n fm = reach%arr(i)%fm\n to = reach%arr(i)%to\n wt = reach%arr(i)%wt\n if (tmp(to) > tmp(fm)+wt) then\n tmp(to) = tmp(fm)+wt\n updated = .true.\n end if\n end do\n step = step+1\n if (step > n) then\n ret = -inf\n return\n end if\n end do\n ret = tmp(t)\n deallocate(tmp)\n end\n\n recursive function dfs_ff(g,u,t,f) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: u, t, f\n integer :: ret\n integer :: i, v, cp, rv\n ret = f\n if (u == t) return\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n cp = g%egs(u)%arr(i)%cp\n if (g%used(v) .or. cp <= 0) cycle\n ret = dfs_ff(g,v,t,min(f,cp))\n rv = g%egs(u)%arr(i)%rv\n if (ret > 0) then\n g%egs(u)%arr(i)%cp = g%egs(u)%arr(i)%cp-ret\n g%egs(v)%arr(rv)%cp = g%egs(v)%arr(rv)%cp+ret\n return\n end if\n end do\n ret = 0\n end\n\n function ford_fulkerson(g,s,t) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: s, t\n integer :: ret\n integer :: f\n ret = 0\n if (.not.associated(g%used)) allocate(g%used(size(g%egs)))\n do\n g%used = .false.\n f = dfs_ff(g,s,t,1000000000)\n if (f == 0) then\n deallocate(g%used)\n return\n end if\n ret = ret+f\n end do\n end\n\nend module mod_graph\n\nprogram saving_snuuk\n use mod_graph\n implicit none\n integer(8), parameter :: dyen = 1000000000000000_8\n integer :: n, m, s, t, u, v, i\n integer(8) :: a, b, cy(100000) = 0_8, cs(100000) = 0_8, ans(100000) = 0_8\n type(graph) :: gy, gs\n read(*,*) n, m, s, t\n gy = graph(n)\n gs = graph(n)\n do i = 1, m\n read(*,*) u, v, a, b\n call gy%add(u,v,a)\n call gy%add(v,u,a)\n call gs%add(u,v,b)\n call gs%add(v,u,b)\n end do\n cy(1:n) = gy%dijkstra(s)\n cs(1:n) = gs%dijkstra(t)\n ans(n) = cy(n)+cs(n)\n do i = n-1, 1, -1\n ans(i) = min(ans(i+1),cy(i)+cs(i))\n end do\n do i = 1, n\n write(*,'(i0)') dyen-ans(i)\n end do\nend program saving_snuuk", "problem_context": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "sample_input": "4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n"}, "reference_outputs": ["999999999999998\n999999999999989\n999999999999979\n999999999999897\n"], "source_document_id": "p03305", "source_text": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8229, "cpu_time_ms": 327, "memory_kb": 30156}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s702205032", "group_id": "codeNet:p03307", "input_text": "integer(16) n\n\nread*,n\n\nif( mod(n,2)==1 ) n = n *2\n\nprint*,n\nend", "language": "Fortran", "metadata": {"date": 1577261553, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/Fortran/s702205032.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s702205032", "user_id": "u171356453"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "integer(16) n\n\nread*,n\n\nif( mod(n,2)==1 ) n = n *2\n\nprint*,n\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 64, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s953633641", "group_id": "codeNet:p03307", "input_text": "integer N\nread*,N\nprint\"(I0)\",N+N*mod(N,2)\nend", "language": "Fortran", "metadata": {"date": 1551432211, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/Fortran/s953633641.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s953633641", "user_id": "u598073939"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "integer N\nread*,N\nprint\"(I0)\",N+N*mod(N,2)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 46, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s255487969", "group_id": "codeNet:p03308", "input_text": "program main\n implicit none\n integer :: n\n integer, allocatable :: a(:)\n\n read(*, *) n\n allocate(a(n))\n read(*, *) a(:)\n write(*, \"(i0)\") maxval(a) - minval(a)\n deallocate(a)\nend program main\n", "language": "Fortran", "metadata": {"date": 1548571384, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03308.html", "problem_id": "p03308", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03308/input.txt", "sample_output_relpath": "derived/input_output/data/p03308/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03308/Fortran/s255487969.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s255487969", "user_id": "u388927326"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer :: n\n integer, allocatable :: a(:)\n\n read(*, *) n\n allocate(a(n))\n read(*, *) a(:)\n write(*, \"(i0)\") maxval(a) - minval(a)\n deallocate(a)\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s714546670", "group_id": "codeNet:p03308", "input_text": "program main\n implicit none\n integer n\n integer,allocatable,dimension(:)::a\n read(*,*)n\n allocate(a(n))\n read(*,*)a\n write(*,*)maxval(a)-minval(a)\nend program main\n", "language": "Fortran", "metadata": {"date": 1530617290, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03308.html", "problem_id": "p03308", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03308/input.txt", "sample_output_relpath": "derived/input_output/data/p03308/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03308/Fortran/s714546670.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714546670", "user_id": "u539011156"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program main\n implicit none\n integer n\n integer,allocatable,dimension(:)::a\n read(*,*)n\n allocate(a(n))\n read(*,*)a\n write(*,*)maxval(a)-minval(a)\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s146643412", "group_id": "codeNet:p03309", "input_text": "program linear\n implicit none\n integer(8) :: n, i, ans, j, k, loc(1)\n integer(8),allocatable :: a(:),flag(:)\n! logical,allocatable :: m(:)\n\n read *, n\n allocate(a(n))\n allocate(flag(n))\n flag = 0\n read *, a\n do i = 1, n\n a(i) = a(i) - i\n end do\n! print *, a\n do j = 1, (n+1)/2\n! if (minval(a, mask = (flag == 0)) > 0) then\n loc = minloc(a,mask = (flag == 0))\n a = a - minval(a,mask = (flag == 0))\n flag(loc(1)) = 1\n! else\n! flag(minloc(a,mask = (flag == 0))) = 1\n! end if\n end do\n! print *, a\n ans = 0\n do k = 1, n\n ans = ans + abs(a(k))\n end do\n print '(i0)', ans\n stop\nend program linear\n", "language": "Fortran", "metadata": {"date": 1557511027, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Fortran/s146643412.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s146643412", "user_id": "u121479332"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program linear\n implicit none\n integer(8) :: n, i, ans, j, k, loc(1)\n integer(8),allocatable :: a(:),flag(:)\n! logical,allocatable :: m(:)\n\n read *, n\n allocate(a(n))\n allocate(flag(n))\n flag = 0\n read *, a\n do i = 1, n\n a(i) = a(i) - i\n end do\n! print *, a\n do j = 1, (n+1)/2\n! if (minval(a, mask = (flag == 0)) > 0) then\n loc = minloc(a,mask = (flag == 0))\n a = a - minval(a,mask = (flag == 0))\n flag(loc(1)) = 1\n! else\n! flag(minloc(a,mask = (flag == 0))) = 1\n! end if\n end do\n! print *, a\n ans = 0\n do k = 1, n\n ans = ans + abs(a(k))\n end do\n print '(i0)', ans\n stop\nend program linear\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 645, "cpu_time_ms": 2103, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s571282486", "group_id": "codeNet:p03309", "input_text": "module ABC102\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_C\n private :: sort_quick\n private :: swap\n private :: print_progression\n private :: calc_median\n private :: is_greater\n\n ! variables for this \n integer(INT32), private :: len_progression\n integer(INT64), private :: median_progression\n\n ! array for this \n integer(INT64), allocatable, private :: progression(:)\n\n ! contained s and s are below\n contains\n\n subroutine task_C\n\n ! support variables for this \n integer(INT32) :: iter\n\n ! STEP.01\n ! read out the length of the given progression\n read(unit=INPUT_UNIT, fmt=*) len_progression\n\n ! STEP.02\n ! allocate the array to store the given progression\n allocate(progression(1:len_progression))\n\n ! STEP.03\n ! read out the values of the given progression\n read(unit=INPUT_UNIT, fmt=*) progression(1:len_progression)\n\n ! STEP.for debug\n ! call print_progression\n ! call sort_quick(1, len_progression)\n ! call print_progression\n\n ! STEP.04\n ! shift the values of given progression using the iterator\n do iter = 1, len_progression, 1\n progression(iter) = progression(iter) - iter\n end do\n\n ! STEP.05\n ! sort the given progression\n call sort_quick(1, len_progression)\n\n ! STEP.06\n ! calculate the median of the given progression\n median_progression = calc_median(len_progression, progression(:))\n\n ! STEP.07\n ! subtract the median of the given progression from the each term of the progression\n ! calculate the absolute the value of the each term of the given progression\n progression(:) = abs(progression(:) - median_progression)\n\n ! STEP.08\n ! calculate & output the minimum value of the sadness\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') sum(progression(:), dim=1)\n\n ! STEP.07\n ! deallocate the array to store the given progression\n deallocate(progression)\n\n ! STEP.END\n return\n\n end subroutine task_C\n\n recursive subroutine sort_quick(elm_first, elm_last)\n\n ! arguments for this \n integer(INT32), intent(in) :: elm_first, elm_last\n\n ! support variables for this \n integer(INT32) :: itr_first, itr_last, itr_pivot\n\n itr_pivot = (elm_first + elm_last) / 2_INT32\n itr_first = elm_first\n itr_last = elm_last\n\n do\n\n do while( is_greater(itr_first, itr_pivot) ); itr_first = itr_first + 1_INT32; end do\n do while( is_greater(itr_pivot, itr_last ) ); itr_last = itr_last - 1_INT32; end do\n\n if (itr_first .ge. itr_last) exit\n\n call swap(itr_first, itr_last)\n itr_first = itr_first + 1_INT32\n itr_last = itr_last - 1_INT32\n\n end do\n\n if (elm_first .lt. itr_first - 1_INT32) call sort_quick(elm_first, itr_first - 1_INT32)\n if (elm_first .lt. itr_first - 1_INT32) call sort_quick(itr_last + 1_INT32, elm_last )\n\n return\n\n end subroutine sort_quick\n\n subroutine swap(iter1, iter2)\n\n ! arguments for this \n integer(INT32), intent(in) :: iter1, iter2\n\n ! variables for this \n integer(INT64) :: tmp\n\n tmp = progression(iter1)\n progression(iter1) = progression(iter2)\n progression(iter2) = tmp\n return\n\n end subroutine swap\n\n subroutine print_progression\n\n print '(1000(1X,I0))', progression(1:len_progression)\n return\n\n end subroutine print_progression\n\n pure function is_greater(iter_trgt, iter_ref) result(stat)\n\n ! arguments for this \n integer(INT32), intent(in) :: iter_trgt, iter_ref\n\n ! return value of this \n logical :: stat\n\n stat = progression(iter_trgt) .gt. progression(iter_ref)\n return\n\n end function is_greater\n\n pure function calc_median(size, array) result(median)\n\n ! arguments for this \n integer(INT32), intent(in) :: size\n integer(INT64), intent(in) :: array(1:size)\n\n ! return value of this \n integer(INT64) :: median\n\n ! variables for this \n integer(INT32) :: postion\n\n if (mod(size, 2_INT32) .eq. 0) then\n postion = size / 2\n median = (array(postion) + array(postion+1)) / 2_INT64\n else\n median = array((size+1)/2)\n end if\n\n return\n\n end function calc_median\n\nend module ABC102\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC102\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_C\n\nend program main", "language": "Fortran", "metadata": {"date": 1557062084, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Fortran/s571282486.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s571282486", "user_id": "u484703930"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module ABC102\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_C\n private :: sort_quick\n private :: swap\n private :: print_progression\n private :: calc_median\n private :: is_greater\n\n ! variables for this \n integer(INT32), private :: len_progression\n integer(INT64), private :: median_progression\n\n ! array for this \n integer(INT64), allocatable, private :: progression(:)\n\n ! contained s and s are below\n contains\n\n subroutine task_C\n\n ! support variables for this \n integer(INT32) :: iter\n\n ! STEP.01\n ! read out the length of the given progression\n read(unit=INPUT_UNIT, fmt=*) len_progression\n\n ! STEP.02\n ! allocate the array to store the given progression\n allocate(progression(1:len_progression))\n\n ! STEP.03\n ! read out the values of the given progression\n read(unit=INPUT_UNIT, fmt=*) progression(1:len_progression)\n\n ! STEP.for debug\n ! call print_progression\n ! call sort_quick(1, len_progression)\n ! call print_progression\n\n ! STEP.04\n ! shift the values of given progression using the iterator\n do iter = 1, len_progression, 1\n progression(iter) = progression(iter) - iter\n end do\n\n ! STEP.05\n ! sort the given progression\n call sort_quick(1, len_progression)\n\n ! STEP.06\n ! calculate the median of the given progression\n median_progression = calc_median(len_progression, progression(:))\n\n ! STEP.07\n ! subtract the median of the given progression from the each term of the progression\n ! calculate the absolute the value of the each term of the given progression\n progression(:) = abs(progression(:) - median_progression)\n\n ! STEP.08\n ! calculate & output the minimum value of the sadness\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') sum(progression(:), dim=1)\n\n ! STEP.07\n ! deallocate the array to store the given progression\n deallocate(progression)\n\n ! STEP.END\n return\n\n end subroutine task_C\n\n recursive subroutine sort_quick(elm_first, elm_last)\n\n ! arguments for this \n integer(INT32), intent(in) :: elm_first, elm_last\n\n ! support variables for this \n integer(INT32) :: itr_first, itr_last, itr_pivot\n\n itr_pivot = (elm_first + elm_last) / 2_INT32\n itr_first = elm_first\n itr_last = elm_last\n\n do\n\n do while( is_greater(itr_first, itr_pivot) ); itr_first = itr_first + 1_INT32; end do\n do while( is_greater(itr_pivot, itr_last ) ); itr_last = itr_last - 1_INT32; end do\n\n if (itr_first .ge. itr_last) exit\n\n call swap(itr_first, itr_last)\n itr_first = itr_first + 1_INT32\n itr_last = itr_last - 1_INT32\n\n end do\n\n if (elm_first .lt. itr_first - 1_INT32) call sort_quick(elm_first, itr_first - 1_INT32)\n if (elm_first .lt. itr_first - 1_INT32) call sort_quick(itr_last + 1_INT32, elm_last )\n\n return\n\n end subroutine sort_quick\n\n subroutine swap(iter1, iter2)\n\n ! arguments for this \n integer(INT32), intent(in) :: iter1, iter2\n\n ! variables for this \n integer(INT64) :: tmp\n\n tmp = progression(iter1)\n progression(iter1) = progression(iter2)\n progression(iter2) = tmp\n return\n\n end subroutine swap\n\n subroutine print_progression\n\n print '(1000(1X,I0))', progression(1:len_progression)\n return\n\n end subroutine print_progression\n\n pure function is_greater(iter_trgt, iter_ref) result(stat)\n\n ! arguments for this \n integer(INT32), intent(in) :: iter_trgt, iter_ref\n\n ! return value of this \n logical :: stat\n\n stat = progression(iter_trgt) .gt. progression(iter_ref)\n return\n\n end function is_greater\n\n pure function calc_median(size, array) result(median)\n\n ! arguments for this \n integer(INT32), intent(in) :: size\n integer(INT64), intent(in) :: array(1:size)\n\n ! return value of this \n integer(INT64) :: median\n\n ! variables for this \n integer(INT32) :: postion\n\n if (mod(size, 2_INT32) .eq. 0) then\n postion = size / 2\n median = (array(postion) + array(postion+1)) / 2_INT64\n else\n median = array((size+1)/2)\n end if\n\n return\n\n end function calc_median\n\nend module ABC102\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC102\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_C\n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4632, "cpu_time_ms": 78, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s715028798", "group_id": "codeNet:p03309", "input_text": "program main\n implicit none\n integer n,i,sumv1,sumv2,b1,b2\n integer,allocatable,dimension(:)::a\n read(*,*)n\n allocate(a(n))\n read(*,*)a\n do i=1,n\n a(i)=a(i)-i\n enddo\n sumv1=0;sumv2=0\n b1=sum(a)/n\n b2=b1-1\n do i=1,n\n sumv1=sumv1+abs(b1-a(i))\n sumv2=sumv2+abs(b2-a(i))\n enddo\n write(*,*)sumv1,sumv2\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1530617873, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Fortran/s715028798.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s715028798", "user_id": "u539011156"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n,i,sumv1,sumv2,b1,b2\n integer,allocatable,dimension(:)::a\n read(*,*)n\n allocate(a(n))\n read(*,*)a\n do i=1,n\n a(i)=a(i)-i\n enddo\n sumv1=0;sumv2=0\n b1=sum(a)/n\n b2=b1-1\n do i=1,n\n sumv1=sumv1+abs(b1-a(i))\n sumv2=sumv2+abs(b2-a(i))\n enddo\n write(*,*)sumv1,sumv2\n \nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 65, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s996452804", "group_id": "codeNet:p03309", "input_text": "program main\n implicit none\n integer n,i,sumv1,sumv2,b1,b2\n integer,allocatable,dimension(:)::a\n read(*,*)n\n allocate(a(n))\n read(*,*)a\n do i=1,n\n a(i)=a(i)-i\n enddo\n sumv1=0;sumv2=0\n b1=sum(a)/n\n b2=b1-1\n do i=1,n\n sumv1=sumv1+abs(b1-a(i))\n sumv2=sumv2+abs(b2-a(i))\n enddo\n write(*,*)sumv1,sumv2\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1530617830, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03309/input.txt", "sample_output_relpath": "derived/input_output/data/p03309/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03309/Fortran/s996452804.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s996452804", "user_id": "u539011156"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer n,i,sumv1,sumv2,b1,b2\n integer,allocatable,dimension(:)::a\n read(*,*)n\n allocate(a(n))\n read(*,*)a\n do i=1,n\n a(i)=a(i)-i\n enddo\n sumv1=0;sumv2=0\n b1=sum(a)/n\n b2=b1-1\n do i=1,n\n sumv1=sumv1+abs(b1-a(i))\n sumv2=sumv2+abs(b2-a(i))\n enddo\n write(*,*)sumv1,sumv2\n \nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 64, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s281367285", "group_id": "codeNet:p03311", "input_text": "integer N\ninteger(16),allocatable,dimension(:)::A\ninteger(16) median,ans\nread*,N\nallocate(A(N))\nread*,A\ndo i=1,N\n A(I)=A(I)-i\nend do\ncall heapsort(N,A)\nif(mod(N,2)==1)then\n median=A(N/2+1)\nelse\n median=(A(N/2)+A(N/2+1))/2\nendif\nans=0\ndo i=1,N\n ans=ans+abs(median-A(i))\nend do\nprint\"(I0)\",ans\ncontains\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer,intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n integer::i,k,j,l\n integer(16):: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend", "language": "Fortran", "metadata": {"date": 1565400457, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03311.html", "problem_id": "p03311", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03311/input.txt", "sample_output_relpath": "derived/input_output/data/p03311/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03311/Fortran/s281367285.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281367285", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "integer N\ninteger(16),allocatable,dimension(:)::A\ninteger(16) median,ans\nread*,N\nallocate(A(N))\nread*,A\ndo i=1,N\n A(I)=A(I)-i\nend do\ncall heapsort(N,A)\nif(mod(N,2)==1)then\n median=A(N/2+1)\nelse\n median=(A(N/2)+A(N/2+1))/2\nendif\nans=0\ndo i=1,N\n ans=ans+abs(median-A(i))\nend do\nprint\"(I0)\",ans\ncontains\nsubroutine heapsort(n,array)\n implicit none\n!ここの入力は状況に応じて変更すること\n integer,intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n integer::i,k,j,l\n integer(16):: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03311", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1079, "cpu_time_ms": 113, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s885706312", "group_id": "codeNet:p03315", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n character(4):: s\n integer(int32):: i,ans\n\n read*, s\n ans=0\n do i=1,4\n if (s(i:i) == '+')then\n ans=ans+1\n else\n ans=ans-1\n end if\n end do\n\n print*, ans\nend program name", "language": "Fortran", "metadata": {"date": 1586825317, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03315.html", "problem_id": "p03315", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03315/input.txt", "sample_output_relpath": "derived/input_output/data/p03315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03315/Fortran/s885706312.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s885706312", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n character(4):: s\n integer(int32):: i,ans\n\n read*, s\n ans=0\n do i=1,4\n if (s(i:i) == '+')then\n ans=ans+1\n else\n ans=ans-1\n end if\n end do\n\n print*, ans\nend program name", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 300, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s619670510", "group_id": "codeNet:p03315", "input_text": "program main\nimplicit none\ninteger :: i, n\ncharacter(len=4) :: s\n\nread(*,*) s\nn=0\ndo i = 1, 4\n if ( s(i:i) == '+' ) then\n n = n + 1\n else\n n = n - 1\n end if\nend do\n\nwrite(*,'(i0)') n\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1551247950, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03315.html", "problem_id": "p03315", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03315/input.txt", "sample_output_relpath": "derived/input_output/data/p03315/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03315/Fortran/s619670510.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619670510", "user_id": "u696547932"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, n\ncharacter(len=4) :: s\n\nread(*,*) s\nn=0\ndo i = 1, 4\n if ( s(i:i) == '+' ) then\n n = n + 1\n else\n n = n - 1\n end if\nend do\n\nwrite(*,'(i0)') n\n\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s688960687", "group_id": "codeNet:p03316", "input_text": "program ds\n implicit none\n integer(4) n\n integer :: i=0,digit=0,tmp=0,sn=0\n\n read(*,*) n\n if(n<1 .or. 10**9s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_C\n private :: calculate_min_num_operations\n\n ! contained s and s are below\n contains\n\n subroutine task_C\n\n ! variables for this \n integer(INT32) :: len_sequence\n integer(INT32) :: num_elements_replacing\n\n ! STEP.01\n ! read out ...\n ! 1. the length of the given sequence\n ! 2. the number of elements to replace at once\n read(unit=INPUT_UNIT, fmt=*) len_sequence, num_elements_replacing\n\n ! STEP.02\n ! calculate & output minumum value of the number of operations that can be realized in a given sequence\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') calculate_min_num_operations(len_sequence, num_elements_replacing)\n\n ! STEP.END\n return\n\n end subroutine task_C\n\n pure function calculate_min_num_operations (len_sequence, num_elements_replacing) result(num_operations)\n\n ! arguments for this \n integer(INT32), intent(in) :: len_sequence\n integer(INT32), intent(in) :: num_elements_replacing\n\n ! return value of this \n integer(INT32) :: num_operations\n\n num_operations &!\n = ceiling( &!\n real(len_sequence - 1_INT32, kind=REAL64) / &!\n real(num_elements_replacing - 1_INT32, kind=REAL64), &!\n kind=INT32 &!\n )\n\n return\n\n end function calculate_min_num_operations\n\nend module ABC101\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC101\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_C\n\nend program main", "language": "Fortran", "metadata": {"date": 1560115401, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03317.html", "problem_id": "p03317", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03317/input.txt", "sample_output_relpath": "derived/input_output/data/p03317/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03317/Fortran/s038600260.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038600260", "user_id": "u484703930"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module ABC101\n\n ! s to import\n use, intrinsic :: iso_fortran_env\n\n ! require all variables to be explicitly declared\n implicit none\n\n ! accessibility of s and s in this \n public :: task_C\n private :: calculate_min_num_operations\n\n ! contained s and s are below\n contains\n\n subroutine task_C\n\n ! variables for this \n integer(INT32) :: len_sequence\n integer(INT32) :: num_elements_replacing\n\n ! STEP.01\n ! read out ...\n ! 1. the length of the given sequence\n ! 2. the number of elements to replace at once\n read(unit=INPUT_UNIT, fmt=*) len_sequence, num_elements_replacing\n\n ! STEP.02\n ! calculate & output minumum value of the number of operations that can be realized in a given sequence\n write(unit=OUTPUT_UNIT, fmt='(I0)', advance='yes') calculate_min_num_operations(len_sequence, num_elements_replacing)\n\n ! STEP.END\n return\n\n end subroutine task_C\n\n pure function calculate_min_num_operations (len_sequence, num_elements_replacing) result(num_operations)\n\n ! arguments for this \n integer(INT32), intent(in) :: len_sequence\n integer(INT32), intent(in) :: num_elements_replacing\n\n ! return value of this \n integer(INT32) :: num_operations\n\n num_operations &!\n = ceiling( &!\n real(len_sequence - 1_INT32, kind=REAL64) / &!\n real(num_elements_replacing - 1_INT32, kind=REAL64), &!\n kind=INT32 &!\n )\n\n return\n\n end function calculate_min_num_operations\n\nend module ABC101\n\n\nprogram main\n\n ! s to import\n use, non_intrinsic :: ABC101\n\n ! require all variables to be explicitly declared\n implicit none\n\n call task_C\n\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03317", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1796, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s411973694", "group_id": "codeNet:p03317", "input_text": "program main\n\timplicit none\n\tinteger N, K, i, m, n1, l1, S, l, S1, S2\n\tinteger, allocatable :: A(:)\n\tread(*, *) N, K\n\tallocate(A(1: N))\n\tread(*, *) A(1: N)\n\tS = 0\n\tS1 = 0\n\tS2 = 0\n\tdo i = 1, N\n\t\tif(A(i) == 1) then\n\t\t\tl = i\n\t\t\texit\n\t\tend if\n\tend do\n\tm = 1\n\tdo i = 1, K\n\t\tif((l-K+i) == 1) then\n\t\t\tm = -K+i\n\t\tend if\n\tend do\n\tn1 = -1\n\tdo i = 1, K\n\t\tif((l+K-i) == 1) then\n\t\t\tn1 = K-i\n\t\tend if\n\tend do\n\tif(n1-m+1==N) then\n\t\twrite(*, *) 1\n\telse if(m /= 1 .or. n1 /= -1) then\n\t\tdo i = 1, 10000000\n\t\t\tN = N - K + 1\n\t\t\tS = S + 1\n\t\t\tif(N < 2) then\n\t\t\t\twrite(*, *) S\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\telse \n\tl1 = l\n\t\tdo i = 1, 10000000\n\t\t\tl1 = l1 - K + 1\n\t\t\tS1 = S1 + 1\n\t\t\tif(N < 2) then\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\t\tl = (N-l+1)\n\t\tdo i = 1, 10000000\n\t\t\tl = (N-l+1) - K + 1\n\t\t\tS2 = S2 + 1\n\t\t\tif(N < 2) then\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\t\twrite(*, *) S1+S2\n\tend if\nend program main", "language": "Fortran", "metadata": {"date": 1529808290, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03317.html", "problem_id": "p03317", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03317/input.txt", "sample_output_relpath": "derived/input_output/data/p03317/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03317/Fortran/s411973694.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s411973694", "user_id": "u728000113"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger N, K, i, m, n1, l1, S, l, S1, S2\n\tinteger, allocatable :: A(:)\n\tread(*, *) N, K\n\tallocate(A(1: N))\n\tread(*, *) A(1: N)\n\tS = 0\n\tS1 = 0\n\tS2 = 0\n\tdo i = 1, N\n\t\tif(A(i) == 1) then\n\t\t\tl = i\n\t\t\texit\n\t\tend if\n\tend do\n\tm = 1\n\tdo i = 1, K\n\t\tif((l-K+i) == 1) then\n\t\t\tm = -K+i\n\t\tend if\n\tend do\n\tn1 = -1\n\tdo i = 1, K\n\t\tif((l+K-i) == 1) then\n\t\t\tn1 = K-i\n\t\tend if\n\tend do\n\tif(n1-m+1==N) then\n\t\twrite(*, *) 1\n\telse if(m /= 1 .or. n1 /= -1) then\n\t\tdo i = 1, 10000000\n\t\t\tN = N - K + 1\n\t\t\tS = S + 1\n\t\t\tif(N < 2) then\n\t\t\t\twrite(*, *) S\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\telse \n\tl1 = l\n\t\tdo i = 1, 10000000\n\t\t\tl1 = l1 - K + 1\n\t\t\tS1 = S1 + 1\n\t\t\tif(N < 2) then\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\t\tl = (N-l+1)\n\t\tdo i = 1, 10000000\n\t\t\tl = (N-l+1) - K + 1\n\t\t\tS2 = S2 + 1\n\t\t\tif(N < 2) then\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\t\twrite(*, *) S1+S2\n\tend if\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03317", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 862, "cpu_time_ms": 25, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s859064400", "group_id": "codeNet:p03319", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,a,b,c,k\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) n,k\n allocate(x(n))\n read(*,*)x\n do i=1,n\n if(x(i)==1)then\n a=i\n exit\n endif\n end do\n k=k-1\n j=0\n if(mod(a-1,k)==0)then\n b=(a-1)/k\n c=0\n else\n b=(a-1)/k+1\n c=mod(a-1,k)\n j=1\n end if\n if(mod(n-a,k)==0)then\n b=b+(n-a)/k\n else\n b=b+(n-a)/k+1\n c=c+mod(n-a,k)\n j=j+1\n end if\n if(j==2)then\n b=b-1\n end if\n\n write(*,*) b \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1597365407, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03319.html", "problem_id": "p03319", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03319/input.txt", "sample_output_relpath": "derived/input_output/data/p03319/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03319/Fortran/s859064400.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s859064400", "user_id": "u713568912"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,a,b,c,k\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) n,k\n allocate(x(n))\n read(*,*)x\n do i=1,n\n if(x(i)==1)then\n a=i\n exit\n endif\n end do\n k=k-1\n j=0\n if(mod(a-1,k)==0)then\n b=(a-1)/k\n c=0\n else\n b=(a-1)/k+1\n c=mod(a-1,k)\n j=1\n end if\n if(mod(n-a,k)==0)then\n b=b+(n-a)/k\n else\n b=b+(n-a)/k+1\n c=c+mod(n-a,k)\n j=j+1\n end if\n if(j==2)then\n b=b-1\n end if\n\n write(*,*) b \n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03319", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 626, "cpu_time_ms": 34, "memory_kb": 3884}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s620301807", "group_id": "codeNet:p03319", "input_text": "program main\n implicit none\n integer(4):: k,n\n integer(4),allocatable:: a(:)\n\n read*, n,k\n allocate(a(n))\n read*, a(:)\n\n print*, nint(dble(n-k)/dble(k-1))+1\nend program main", "language": "Fortran", "metadata": {"date": 1585397535, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03319.html", "problem_id": "p03319", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03319/input.txt", "sample_output_relpath": "derived/input_output/data/p03319/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03319/Fortran/s620301807.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s620301807", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n integer(4):: k,n\n integer(4),allocatable:: a(:)\n\n read*, n,k\n allocate(a(n))\n read*, a(:)\n\n print*, nint(dble(n-k)/dble(k-1))+1\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03319", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s359208332", "group_id": "codeNet:p03319", "input_text": "read*,i,j\nprint\"(i0)\",(i-2)/(j-1)+1\nend", "language": "Fortran", "metadata": {"date": 1565243454, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03319.html", "problem_id": "p03319", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03319/input.txt", "sample_output_relpath": "derived/input_output/data/p03319/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03319/Fortran/s359208332.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359208332", "user_id": "u598073939"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "read*,i,j\nprint\"(i0)\",(i-2)/(j-1)+1\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03319", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 39, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s891606951", "group_id": "codeNet:p03323", "input_text": "program atcoder\n implicit none\n integer a, b\n read *, a, b ! 変数mに、標準入力から数字を読み込み代入する\n if (a.lt.9 .and. b.lt.9) then\n write(*,*) 'Yay!'\n else\n write(*,*) ':('\n end if ! \",\"のあとに解答となる変数を書く\nend program atcoder", "language": "Fortran", "metadata": {"date": 1583634857, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03323/input.txt", "sample_output_relpath": "derived/input_output/data/p03323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03323/Fortran/s891606951.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s891606951", "user_id": "u190743932"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "program atcoder\n implicit none\n integer a, b\n read *, a, b ! 変数mに、標準入力から数字を読み込み代入する\n if (a.lt.9 .and. b.lt.9) then\n write(*,*) 'Yay!'\n else\n write(*,*) ':('\n end if ! \",\"のあとに解答となる変数を書く\nend program atcoder", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 289, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s597310490", "group_id": "codeNet:p03323", "input_text": "program Ringo\n\tinteger D, N\n read(*, *) D, N\n if (N.NE.100) then\n X = (100**D)*N\n print '(i0)', int(X)\n else if (N.EQ.100) then\n X = (100**D)*(N + 1)\n\tend if\nend program", "language": "Fortran", "metadata": {"date": 1557613669, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03323/input.txt", "sample_output_relpath": "derived/input_output/data/p03323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03323/Fortran/s597310490.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s597310490", "user_id": "u039189422"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "program Ringo\n\tinteger D, N\n read(*, *) D, N\n if (N.NE.100) then\n X = (100**D)*N\n print '(i0)', int(X)\n else if (N.EQ.100) then\n X = (100**D)*(N + 1)\n\tend if\nend program", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s112208270", "group_id": "codeNet:p03323", "input_text": "program HappyBirthday\n\tinteger A, B, X\n read(*, *)A, B\n X = max(A, B)\n if (X.LT.9) then\n print *, \"yay!\"\n else if (X.GE.9) then\n print *, \":(\"\n\tend if\nend program", "language": "Fortran", "metadata": {"date": 1557612037, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03323/input.txt", "sample_output_relpath": "derived/input_output/data/p03323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03323/Fortran/s112208270.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s112208270", "user_id": "u039189422"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "program HappyBirthday\n\tinteger A, B, X\n read(*, *)A, B\n X = max(A, B)\n if (X.LT.9) then\n print *, \"yay!\"\n else if (X.GE.9) then\n print *, \":(\"\n\tend if\nend program", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s966437635", "group_id": "codeNet:p03325", "input_text": "program main\nimplicit none\ninteger(8) :: i, j, k\ninteger(8) :: n\ninteger(8) , allocatable :: a(:)\n\nread(*,*) n\nallocate(a(n))\nread(*,*) a\nk = 0\ndo i = 1, n\n j = a(i)\n do while( mod(j,2) == 0 )\n k = k + 1\n j = j/2\n end do\nend do\nwrite(*,'(i0)') k\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1563302543, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03325.html", "problem_id": "p03325", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03325/input.txt", "sample_output_relpath": "derived/input_output/data/p03325/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03325/Fortran/s966437635.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s966437635", "user_id": "u696547932"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\nimplicit none\ninteger(8) :: i, j, k\ninteger(8) :: n\ninteger(8) , allocatable :: a(:)\n\nread(*,*) n\nallocate(a(n))\nread(*,*) a\nk = 0\ndo i = 1, n\n j = a(i)\n do while( mod(j,2) == 0 )\n k = k + 1\n j = j/2\n end do\nend do\nwrite(*,'(i0)') k\n\nend program main\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nAs AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.\n\nSnuke, an employee, would like to play with this sequence.\n\nSpecifically, he would like to repeat the following operation as many times as possible:\n\nFor every i satisfying 1 \\leq i \\leq N, perform one of the following: \"divide a_i by 2\" and \"multiply a_i by 3\".\nHere, choosing \"multiply a_i by 3\" for every i is not allowed, and the value of a_i after the operation must be an integer.\n\nAt most how many operations can be performed?\n\nConstraints\n\nN is an integer between 1 and 10 \\ 000 (inclusive).\n\na_i is an integer between 1 and 1 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint the maximum number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n5 2 4\n\nSample Output 1\n\n3\n\nThe sequence is initially {5, 2, 4}. Three operations can be performed as follows:\n\nFirst, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.\n\nNext, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.\n\nFinally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.\n\nSample Input 2\n\n4\n631 577 243 199\n\nSample Output 2\n\n0\n\nNo operation can be performed since all the elements are odd. Thus, the answer is 0.\n\nSample Input 3\n\n10\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\n\nSample Output 3\n\n39", "sample_input": "3\n5 2 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03325", "source_text": "Score: 300 points\n\nProblem Statement\n\nAs AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.\n\nSnuke, an employee, would like to play with this sequence.\n\nSpecifically, he would like to repeat the following operation as many times as possible:\n\nFor every i satisfying 1 \\leq i \\leq N, perform one of the following: \"divide a_i by 2\" and \"multiply a_i by 3\".\nHere, choosing \"multiply a_i by 3\" for every i is not allowed, and the value of a_i after the operation must be an integer.\n\nAt most how many operations can be performed?\n\nConstraints\n\nN is an integer between 1 and 10 \\ 000 (inclusive).\n\na_i is an integer between 1 and 1 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint the maximum number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n5 2 4\n\nSample Output 1\n\n3\n\nThe sequence is initially {5, 2, 4}. Three operations can be performed as follows:\n\nFirst, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.\n\nNext, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.\n\nFinally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.\n\nSample Input 2\n\n4\n631 577 243 199\n\nSample Output 2\n\n0\n\nNo operation can be performed since all the elements are odd. Thus, the answer is 0.\n\nSample Input 3\n\n10\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\n\nSample Output 3\n\n39", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 280, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s894838252", "group_id": "codeNet:p03325", "input_text": "program abc100c\n implicit none\n integer n\n integer,allocatable,dimension(:) :: a\n\n read *, n\n allocate(a(n))\n read *, a\n print '(i0)', sum(trailz(a))\nend program abc100c\n", "language": "Fortran", "metadata": {"date": 1538567893, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03325.html", "problem_id": "p03325", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03325/input.txt", "sample_output_relpath": "derived/input_output/data/p03325/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03325/Fortran/s894838252.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s894838252", "user_id": "u081445141"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program abc100c\n implicit none\n integer n\n integer,allocatable,dimension(:) :: a\n\n read *, n\n allocate(a(n))\n read *, a\n print '(i0)', sum(trailz(a))\nend program abc100c\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nAs AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.\n\nSnuke, an employee, would like to play with this sequence.\n\nSpecifically, he would like to repeat the following operation as many times as possible:\n\nFor every i satisfying 1 \\leq i \\leq N, perform one of the following: \"divide a_i by 2\" and \"multiply a_i by 3\".\nHere, choosing \"multiply a_i by 3\" for every i is not allowed, and the value of a_i after the operation must be an integer.\n\nAt most how many operations can be performed?\n\nConstraints\n\nN is an integer between 1 and 10 \\ 000 (inclusive).\n\na_i is an integer between 1 and 1 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint the maximum number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n5 2 4\n\nSample Output 1\n\n3\n\nThe sequence is initially {5, 2, 4}. Three operations can be performed as follows:\n\nFirst, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.\n\nNext, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.\n\nFinally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.\n\nSample Input 2\n\n4\n631 577 243 199\n\nSample Output 2\n\n0\n\nNo operation can be performed since all the elements are odd. Thus, the answer is 0.\n\nSample Input 3\n\n10\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\n\nSample Output 3\n\n39", "sample_input": "3\n5 2 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03325", "source_text": "Score: 300 points\n\nProblem Statement\n\nAs AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.\n\nSnuke, an employee, would like to play with this sequence.\n\nSpecifically, he would like to repeat the following operation as many times as possible:\n\nFor every i satisfying 1 \\leq i \\leq N, perform one of the following: \"divide a_i by 2\" and \"multiply a_i by 3\".\nHere, choosing \"multiply a_i by 3\" for every i is not allowed, and the value of a_i after the operation must be an integer.\n\nAt most how many operations can be performed?\n\nConstraints\n\nN is an integer between 1 and 10 \\ 000 (inclusive).\n\na_i is an integer between 1 and 1 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint the maximum number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n5 2 4\n\nSample Output 1\n\n3\n\nThe sequence is initially {5, 2, 4}. Three operations can be performed as follows:\n\nFirst, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.\n\nNext, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.\n\nFinally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.\n\nSample Input 2\n\n4\n631 577 243 199\n\nSample Output 2\n\n0\n\nNo operation can be performed since all the elements are odd. Thus, the answer is 0.\n\nSample Input 3\n\n10\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\n\nSample Output 3\n\n39", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 9, "memory_kb": 800}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s288813052", "group_id": "codeNet:p03326", "input_text": "program patisserie_abc\n implicit none\n integer :: n, m, i\n integer(8) :: r(1000,3), x(3)\n r = 0_8\n read(*,*) n, m\n if (m.eq.0) then\n write(*,'(i0)') 0\n stop\n end if\n do i = 1, n\n read(*,*) r(i,:)\n end do\n do i = 1, 3\n call merge_sort(n,r(1:n,:),i)\n x(i) = abs(sum(r(1:m,1)))+abs(sum(r(1:m,2)))+abs(sum(r(1:m,3)))\n end do\n write(*,'(i0)') maxval(x)\n stop\ncontains\n subroutine merge_sort(n,c,idx)\n implicit none\n integer, intent(in) :: n, idx\n integer(8), intent(inout) :: c(n,3)\n integer :: number, length, i, ubnd\n number = n\n length = 1\n do while (number.gt.1)\n do i = 1, number/2\n ubnd = min(2*i*length,n)\n call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubnd,:),idx)\n end do\n length = 2*length\n number = (number+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merge(c1,c2,idx)\n implicit none\n integer(8), intent(inout) :: c1(:,:), c2(:,:)\n integer, intent(in) :: idx\n integer(8) :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while ((i1.le.n1).and.(i2.le.n2))\n if (c1(i1,idx).le.c2(i2,idx)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 .le. n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merge\nend program patisserie_abc", "language": "Fortran", "metadata": {"date": 1556068420, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03326.html", "problem_id": "p03326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03326/input.txt", "sample_output_relpath": "derived/input_output/data/p03326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03326/Fortran/s288813052.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s288813052", "user_id": "u506403362"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "program patisserie_abc\n implicit none\n integer :: n, m, i\n integer(8) :: r(1000,3), x(3)\n r = 0_8\n read(*,*) n, m\n if (m.eq.0) then\n write(*,'(i0)') 0\n stop\n end if\n do i = 1, n\n read(*,*) r(i,:)\n end do\n do i = 1, 3\n call merge_sort(n,r(1:n,:),i)\n x(i) = abs(sum(r(1:m,1)))+abs(sum(r(1:m,2)))+abs(sum(r(1:m,3)))\n end do\n write(*,'(i0)') maxval(x)\n stop\ncontains\n subroutine merge_sort(n,c,idx)\n implicit none\n integer, intent(in) :: n, idx\n integer(8), intent(inout) :: c(n,3)\n integer :: number, length, i, ubnd\n number = n\n length = 1\n do while (number.gt.1)\n do i = 1, number/2\n ubnd = min(2*i*length,n)\n call merge(c(2*(i-1)*length+1:(2*i-1)*length,:),c((2*i-1)*length+1:ubnd,:),idx)\n end do\n length = 2*length\n number = (number+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merge(c1,c2,idx)\n implicit none\n integer(8), intent(inout) :: c1(:,:), c2(:,:)\n integer, intent(in) :: idx\n integer(8) :: c(size(c1(:,1))+size(c2(:,1)),size(c1(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while ((i1.le.n1).and.(i2.le.n2))\n if (c1(i1,idx).le.c2(i2,idx)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 .le. n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merge\nend program patisserie_abc", "problem_context": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "sample_input": "5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03326", "source_text": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s028015475", "group_id": "codeNet:p03326", "input_text": "program test\nimplicit none\ninteger(8) :: i,j,k,n,m,ii\ninteger(8) :: x(1000),y(1000),z(1000),value(1000)\ninteger(8) :: dp(0:1000,0:1000)=0,value_max=0\ninteger(8) :: x_sig(8) = (/-1,-1,-1,-1, 1, 1, 1, 1/)\ninteger(8) :: y_sig(8) = (/-1,-1, 1, 1,-1,-1, 1, 1/)\ninteger(8) :: z_sig(8) = (/-1, 1,-1, 1,-1, 1,-1, 1/)\n\nread(*,*) n,m\n\ndo i=1,n\n\tread(*,*) x(i),y(i),z(i)\nenddo\n\n\ndo ii= 1,8\n\tdp = 0\n\tdo i=1,n\n\t\tvalue(i) = x_sig(ii)*x(i) + y_sig(ii)*y(i) + z_sig(ii)*z(i)\n\tenddo\n\t\n\tdo i=1,n\n\t\tdo j=1,m\n\t\t\tdp(i,j) = max(dp(i-1,j) , dp(i-1,j-1)+value(i))\n\t\tenddo\n\tenddo\n\t\n\tvalue_max = max(value_max,dp(n,m))\n\t\nenddo\n\nwrite(*,*) value_max\n\n\nend program", "language": "Fortran", "metadata": {"date": 1532857409, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03326.html", "problem_id": "p03326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03326/input.txt", "sample_output_relpath": "derived/input_output/data/p03326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03326/Fortran/s028015475.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s028015475", "user_id": "u454703763"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: i,j,k,n,m,ii\ninteger(8) :: x(1000),y(1000),z(1000),value(1000)\ninteger(8) :: dp(0:1000,0:1000)=0,value_max=0\ninteger(8) :: x_sig(8) = (/-1,-1,-1,-1, 1, 1, 1, 1/)\ninteger(8) :: y_sig(8) = (/-1,-1, 1, 1,-1,-1, 1, 1/)\ninteger(8) :: z_sig(8) = (/-1, 1,-1, 1,-1, 1,-1, 1/)\n\nread(*,*) n,m\n\ndo i=1,n\n\tread(*,*) x(i),y(i),z(i)\nenddo\n\n\ndo ii= 1,8\n\tdp = 0\n\tdo i=1,n\n\t\tvalue(i) = x_sig(ii)*x(i) + y_sig(ii)*y(i) + z_sig(ii)*z(i)\n\tenddo\n\t\n\tdo i=1,n\n\t\tdo j=1,m\n\t\t\tdp(i,j) = max(dp(i-1,j) , dp(i-1,j-1)+value(i))\n\t\tenddo\n\tenddo\n\t\n\tvalue_max = max(value_max,dp(n,m))\n\t\nenddo\n\nwrite(*,*) value_max\n\n\nend program", "problem_context": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "sample_input": "5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03326", "source_text": "Score: 400 points\n\nProblem Statement\n\nTakahashi became a pastry chef and opened a shop La Confiserie d'ABC to celebrate AtCoder Beginner Contest 100.\n\nThe shop sells N kinds of cakes.\n\nEach kind of cake has three parameters \"beauty\", \"tastiness\" and \"popularity\". The i-th kind of cake has the beauty of x_i, the tastiness of y_i and the popularity of z_i.\n\nThese values may be zero or negative.\n\nRingo has decided to have M pieces of cakes here. He will choose the set of cakes as follows:\n\nDo not have two or more pieces of the same kind of cake.\n\nUnder the condition above, choose the set of cakes to maximize (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity).\n\nFind the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nConstraints\n\nN is an integer between 1 and 1 \\ 000 (inclusive).\n\nM is an integer between 0 and N (inclusive).\n\nx_i, y_i, z_i \\ (1 \\leq i \\leq N) are integers between -10 \\ 000 \\ 000 \\ 000 and 10 \\ 000 \\ 000 \\ 000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nx_1 y_1 z_1\nx_2 y_2 z_2\n: :\nx_N y_N z_N\n\nOutput\n\nPrint the maximum possible value of (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) for the set of cakes that Ringo chooses.\n\nSample Input 1\n\n5 3\n3 1 4\n1 5 9\n2 6 5\n3 5 8\n9 7 9\n\nSample Output 1\n\n56\n\nConsider having the 2-nd, 4-th and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 3 + 9 = 13\n\nTastiness: 5 + 5 + 7 = 17\n\nPopularity: 9 + 8 + 9 = 26\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 13 + 17 + 26 = 56. This is the maximum value.\n\nSample Input 2\n\n5 3\n1 -2 3\n-4 5 -6\n7 -8 -9\n-10 11 -12\n13 -14 15\n\nSample Output 2\n\n54\n\nConsider having the 1-st, 3-rd and 5-th kinds of cakes. The total beauty, tastiness and popularity will be as follows:\n\nBeauty: 1 + 7 + 13 = 21\n\nTastiness: (-2) + (-8) + (-14) = -24\n\nPopularity: 3 + (-9) + 15 = 9\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 21 + 24 + 9 = 54. This is the maximum value.\n\nSample Input 3\n\n10 5\n10 -80 21\n23 8 38\n-94 28 11\n-26 -2 18\n-69 72 79\n-26 -86 -54\n-72 -50 59\n21 65 -32\n40 -94 87\n-62 18 82\n\nSample Output 3\n\n638\n\nIf we have the 3-rd, 4-th, 5-th, 7-th and 10-th kinds of cakes, the total beauty, tastiness and popularity will be -323, 66 and 249, respectively.\n\nThe value (the absolute value of the total beauty) + (the absolute value of the total tastiness) + (the absolute value of the total popularity) here is 323 + 66 + 249 = 638. This is the maximum value.\n\nSample Input 4\n\n3 2\n2000000000 -9000000000 4000000000\n7000000000 -5000000000 3000000000\n6000000000 -1000000000 8000000000\n\nSample Output 4\n\n30000000000\n\nThe values of the beauty, tastiness and popularity of the cakes and the value to be printed may not fit into 32-bit integers.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 45, "memory_kb": 8064}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s649144858", "group_id": "codeNet:p03327", "input_text": "program sample\n\timplicit none\n integer :: N\n \n read(*,*) N\n \n if (N<=999) then\n \twrite(*,*) 'ABC'\n else\n \twrite(*,*) 'ABD'\n\tend if\n\n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1592629448, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03327.html", "problem_id": "p03327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03327/input.txt", "sample_output_relpath": "derived/input_output/data/p03327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03327/Fortran/s649144858.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649144858", "user_id": "u323210830"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program sample\n\timplicit none\n integer :: N\n \n read(*,*) N\n \n if (N<=999) then\n \twrite(*,*) 'ABC'\n else\n \twrite(*,*) 'ABD'\n\tend if\n\n stop\nend program sample", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "sample_input": "999\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03327", "source_text": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s265675501", "group_id": "codeNet:p03327", "input_text": "program prob20\n implicit none\n integer :: n\n read(*,*) n\n if(n >= 1000) then\n write(*,'(a)') \"ABD\"\n else\n write(*,'(a)') \"ABC\"\n end if\n stop\ncontains\nend program prob20", "language": "Fortran", "metadata": {"date": 1592629188, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03327.html", "problem_id": "p03327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03327/input.txt", "sample_output_relpath": "derived/input_output/data/p03327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03327/Fortran/s265675501.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s265675501", "user_id": "u478462004"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program prob20\n implicit none\n integer :: n\n read(*,*) n\n if(n >= 1000) then\n write(*,'(a)') \"ABD\"\n else\n write(*,'(a)') \"ABC\"\n end if\n stop\ncontains\nend program prob20", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "sample_input": "999\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03327", "source_text": "Score : 100 points\n\nProblem Statement\n\nDecades have passed since the beginning of AtCoder Beginner Contest.\n\nThe contests are labeled as ABC001, ABC002, ... from the first round, but after the 999-th round ABC999, a problem occurred: how the future rounds should be labeled?\n\nIn the end, the labels for the rounds from the 1000-th to the 1998-th are decided: ABD001, ABD002, ..., ABD999.\n\nYou are given an integer N between 1 and 1998 (inclusive). Print the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nConstraints\n\n1 \\leq N \\leq 1998\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the first three characters of the label of the N-th round of AtCoder Beginner Contest.\n\nSample Input 1\n\n999\n\nSample Output 1\n\nABC\n\nThe 999-th round of AtCoder Beginner Contest is labeled as ABC999.\n\nSample Input 2\n\n1000\n\nSample Output 2\n\nABD\n\nThe 1000-th round of AtCoder Beginner Contest is labeled as ABD001.\n\nSample Input 3\n\n1481\n\nSample Output 3\n\nABD\n\nThe 1481-th round of AtCoder Beginner Contest is labeled as ABD482.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 2864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s705258105", "group_id": "codeNet:p03328", "input_text": "program main\n implicit none\n \n integer :: a,b,c,s,i\n \n read(*,*)a,b\n c = b-a-1\n s = 0\n do i = 1, c\n s = s + i\n end do\n \n write(*,*)s-a\nend program main", "language": "Fortran", "metadata": {"date": 1571170122, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03328.html", "problem_id": "p03328", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03328/input.txt", "sample_output_relpath": "derived/input_output/data/p03328/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03328/Fortran/s705258105.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s705258105", "user_id": "u287431190"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: a,b,c,s,i\n \n read(*,*)a,b\n c = b-a-1\n s = 0\n do i = 1, c\n s = s + i\n end do\n \n write(*,*)s-a\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "sample_input": "8 13\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03328", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s670665328", "group_id": "codeNet:p03331", "input_text": "program sum\nimplicit none\ninteger::n, a, b, c, d ,e ,ans\n \nread(5,*)n\n \n if(n==10.or.n==100.or.n==1000.or.n==10000.or.n==100000) then \n ans=10\n else\n a=n/10000\n b=n/1000-10*a\n c=n/100-10*b-100*a\n d=n/10-10*c-100*b-1000*a\n e=n-10*d-100*c-1000*b-10000*a\n ans=a+b+c+d+e\nendif\n \nwrite(6,*)ans\n \nend program sum", "language": "Fortran", "metadata": {"date": 1528076388, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03331.html", "problem_id": "p03331", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03331/input.txt", "sample_output_relpath": "derived/input_output/data/p03331/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03331/Fortran/s670665328.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670665328", "user_id": "u723571904"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program sum\nimplicit none\ninteger::n, a, b, c, d ,e ,ans\n \nread(5,*)n\n \n if(n==10.or.n==100.or.n==1000.or.n==10000.or.n==100000) then \n ans=10\n else\n a=n/10000\n b=n/1000-10*a\n c=n/100-10*b-100*a\n d=n/10-10*c-100*b-1000*a\n e=n-10*d-100*c-1000*b-10000*a\n ans=a+b+c+d+e\nendif\n \nwrite(6,*)ans\n \nend program sum", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "sample_input": "15\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03331", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 3, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s337801526", "group_id": "codeNet:p03333", "input_text": "program interval_game\n implicit none\n integer :: n, l(100001), r(100001), i\n integer(8) :: k\n l = 0\n r = 0\n k = 0_8\n read(*,*) n\n do i = 1, n\n read(*,*) l(i), r(i)\n end do\n call bitonic_sort(l(1:n+1),.false.)\n call bitonic_sort(r(1:n+1),.true.)\n do i = 1, n+1\n k = k+2_8*max(0_8,int(l(i)-r(i),8))\n end do\n write(*,'(i0)') k\n stop\ncontains\n recursive subroutine bitonic_sort(a,ascend)\n implicit none\n integer, intent(inout) :: a(:)\n logical, intent(in) :: ascend\n integer :: n\n n = size(a)\n if (n.eq.1) return\n call bitonic_sort(a(1:n/2),.not.ascend)\n call bitonic_sort(a(n/2+1:n),ascend)\n call bitonic_merge(a,ascend)\n return\n end subroutine bitonic_sort\n recursive subroutine bitonic_merge(a,ascend)\n implicit none\n integer, intent(inout) :: a(:)\n logical, intent(in) :: ascend\n integer :: n, m, i, b\n n = size(a)\n if (n.eq.1) return\n m = 1\n do while (2*m.lt.n)\n m = 2*m\n end do\n do i = 1, n-m\n if ((a(i).gt.a(i+m)).eqv.ascend) then\n b = a(i)\n a(i) = a(i+m)\n a(i+m) = b\n end if\n end do\n call bitonic_merge(a(1:m),ascend)\n call bitonic_merge(a(m+1:n),ascend)\n return\n end subroutine bitonic_merge\nend program interval_game", "language": "Fortran", "metadata": {"date": 1562693560, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03333.html", "problem_id": "p03333", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03333/input.txt", "sample_output_relpath": "derived/input_output/data/p03333/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03333/Fortran/s337801526.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s337801526", "user_id": "u506403362"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program interval_game\n implicit none\n integer :: n, l(100001), r(100001), i\n integer(8) :: k\n l = 0\n r = 0\n k = 0_8\n read(*,*) n\n do i = 1, n\n read(*,*) l(i), r(i)\n end do\n call bitonic_sort(l(1:n+1),.false.)\n call bitonic_sort(r(1:n+1),.true.)\n do i = 1, n+1\n k = k+2_8*max(0_8,int(l(i)-r(i),8))\n end do\n write(*,'(i0)') k\n stop\ncontains\n recursive subroutine bitonic_sort(a,ascend)\n implicit none\n integer, intent(inout) :: a(:)\n logical, intent(in) :: ascend\n integer :: n\n n = size(a)\n if (n.eq.1) return\n call bitonic_sort(a(1:n/2),.not.ascend)\n call bitonic_sort(a(n/2+1:n),ascend)\n call bitonic_merge(a,ascend)\n return\n end subroutine bitonic_sort\n recursive subroutine bitonic_merge(a,ascend)\n implicit none\n integer, intent(inout) :: a(:)\n logical, intent(in) :: ascend\n integer :: n, m, i, b\n n = size(a)\n if (n.eq.1) return\n m = 1\n do while (2*m.lt.n)\n m = 2*m\n end do\n do i = 1, n-m\n if ((a(i).gt.a(i+m)).eqv.ascend) then\n b = a(i)\n a(i) = a(i+m)\n a(i+m) = b\n end if\n end do\n call bitonic_merge(a(1:m),ascend)\n call bitonic_merge(a(m+1:n),ascend)\n return\n end subroutine bitonic_merge\nend program interval_game", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi and Aoki will play a game with a number line and some segments.\nTakahashi is standing on the number line and he is initially at coordinate 0.\nAoki has N segments. The i-th segment is [L_i,R_i], that is, a segment consisting of points with coordinates between L_i and R_i (inclusive).\n\nThe game has N steps. The i-th step proceeds as follows:\n\nFirst, Aoki chooses a segment that is still not chosen yet from the N segments and tells it to Takahashi.\n\nThen, Takahashi walks along the number line to some point within the segment chosen by Aoki this time.\n\nAfter N steps are performed, Takahashi will return to coordinate 0 and the game ends.\n\nLet K be the total distance traveled by Takahashi throughout the game. Aoki will choose segments so that K will be as large as possible, and Takahashi walks along the line so that K will be as small as possible. What will be the value of K in the end?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n-10^5 ≤ L_i < R_i ≤ 10^5\n\nL_i and R_i 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 total distance traveled by Takahashi throughout the game when Takahashi and Aoki acts as above.\nIt is guaranteed that K is always an integer when L_i,R_i are integers.\n\nSample Input 1\n\n3\n-5 1\n3 7\n-4 -2\n\nSample Output 1\n\n10\n\nOne possible sequence of actions of Takahashi and Aoki is as follows:\n\nAoki chooses the first segment. Takahashi moves from coordinate 0 to -4, covering a distance of 4.\n\nAoki chooses the third segment. Takahashi stays at coordinate -4.\n\nAoki chooses the second segment. Takahashi moves from coordinate -4 to 3, covering a distance of 7.\n\nTakahashi moves from coordinate 3 to 0, covering a distance of 3.\n\nThe distance covered by Takahashi here is 14 (because Takahashi didn't move optimally).\nIt turns out that if both players move optimally, the distance covered by Takahashi will be 10.\n\nSample Input 2\n\n3\n1 2\n3 4\n5 6\n\nSample Output 2\n\n12\n\nSample Input 3\n\n5\n-2 0\n-2 0\n7 8\n9 10\n-2 -1\n\nSample Output 3\n\n34", "sample_input": "3\n-5 1\n3 7\n-4 -2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03333", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi and Aoki will play a game with a number line and some segments.\nTakahashi is standing on the number line and he is initially at coordinate 0.\nAoki has N segments. The i-th segment is [L_i,R_i], that is, a segment consisting of points with coordinates between L_i and R_i (inclusive).\n\nThe game has N steps. The i-th step proceeds as follows:\n\nFirst, Aoki chooses a segment that is still not chosen yet from the N segments and tells it to Takahashi.\n\nThen, Takahashi walks along the number line to some point within the segment chosen by Aoki this time.\n\nAfter N steps are performed, Takahashi will return to coordinate 0 and the game ends.\n\nLet K be the total distance traveled by Takahashi throughout the game. Aoki will choose segments so that K will be as large as possible, and Takahashi walks along the line so that K will be as small as possible. What will be the value of K in the end?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n-10^5 ≤ L_i < R_i ≤ 10^5\n\nL_i and R_i 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 total distance traveled by Takahashi throughout the game when Takahashi and Aoki acts as above.\nIt is guaranteed that K is always an integer when L_i,R_i are integers.\n\nSample Input 1\n\n3\n-5 1\n3 7\n-4 -2\n\nSample Output 1\n\n10\n\nOne possible sequence of actions of Takahashi and Aoki is as follows:\n\nAoki chooses the first segment. Takahashi moves from coordinate 0 to -4, covering a distance of 4.\n\nAoki chooses the third segment. Takahashi stays at coordinate -4.\n\nAoki chooses the second segment. Takahashi moves from coordinate -4 to 3, covering a distance of 7.\n\nTakahashi moves from coordinate 3 to 0, covering a distance of 3.\n\nThe distance covered by Takahashi here is 14 (because Takahashi didn't move optimally).\nIt turns out that if both players move optimally, the distance covered by Takahashi will be 10.\n\nSample Input 2\n\n3\n1 2\n3 4\n5 6\n\nSample Output 2\n\n12\n\nSample Input 3\n\n5\n-2 0\n-2 0\n7 8\n9 10\n-2 -1\n\nSample Output 3\n\n34", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1255, "cpu_time_ms": 139, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s925136659", "group_id": "codeNet:p03337", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: a,b\n read*, a,b\n print'(i0)', max(a+b,a-b,a*b)\nend program main", "language": "Fortran", "metadata": {"date": 1591395933, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/Fortran/s925136659.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s925136659", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: a,b\n read*, a,b\n print'(i0)', max(a+b,a-b,a*b)\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 158, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s442314600", "group_id": "codeNet:p03337", "input_text": "program main\n implicit integer(a-z)\n\n read(*,*)a,b\n\n ans=max(a+b,a-b,a*b)\n\n write(*,*)ans\n\nend program main", "language": "Fortran", "metadata": {"date": 1536654745, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/Fortran/s442314600.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s442314600", "user_id": "u594649885"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main\n implicit integer(a-z)\n\n read(*,*)a,b\n\n ans=max(a+b,a-b,a*b)\n\n write(*,*)ans\n\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s698088240", "group_id": "codeNet:p03338", "input_text": "program name\n implicit none\n character(:),allocatable:: s\n integer(4):: n,i,cnt\n\n read*, n\n allocate(character(n):: s)\n read*, s\n cnt = 0\n do i=1,n-1\n cnt = max(cnt,snum(s(1:i), s(i+1:n)))\n end do\n print*, cnt\n\ncontains\nfunction snum(s1, s2) result(ret)\n implicit none\n character(*):: s1, s2\n integer(4):: ret,i\n logical:: is1(ichar('a'):ichar('z')),is2(ichar('a'):ichar('z'))\n\n is1(:) = .false.\n is2(:) = .false.\n do i=1,len(s1)\n is1(ichar(s1(i:i))) = .true.\n end do\n do i=1,len(s2)\n is2(ichar(s2(i:i))) = .true.\n end do\n\n ret = 0\n do i=ichar('a'),ichar('z')\n if (is1(i) .and. is2(i)) ret=ret+1\n end do\nend function snum\nend program name", "language": "Fortran", "metadata": {"date": 1586661303, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03338.html", "problem_id": "p03338", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03338/input.txt", "sample_output_relpath": "derived/input_output/data/p03338/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03338/Fortran/s698088240.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s698088240", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program name\n implicit none\n character(:),allocatable:: s\n integer(4):: n,i,cnt\n\n read*, n\n allocate(character(n):: s)\n read*, s\n cnt = 0\n do i=1,n-1\n cnt = max(cnt,snum(s(1:i), s(i+1:n)))\n end do\n print*, cnt\n\ncontains\nfunction snum(s1, s2) result(ret)\n implicit none\n character(*):: s1, s2\n integer(4):: ret,i\n logical:: is1(ichar('a'):ichar('z')),is2(ichar('a'):ichar('z'))\n\n is1(:) = .false.\n is2(:) = .false.\n do i=1,len(s1)\n is1(ichar(s1(i:i))) = .true.\n end do\n do i=1,len(s2)\n is2(ichar(s2(i:i))) = .true.\n end do\n\n ret = 0\n do i=ichar('a'),ichar('z')\n if (is1(i) .and. is2(i)) ret=ret+1\n end do\nend function snum\nend program name", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 735, "cpu_time_ms": 9, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s789655313", "group_id": "codeNet:p03338", "input_text": "INTEGER N\nCHARACTER(100) S\nCHARACTER(26)::A=\"abcdefghijklmnopqrstuvwxyz\"\nINTEGER B,P\nINTEGER M,U\nREAD*,N,S\nP=0\nDO I=1, N-1\n B=0\n DO J=1,26\n M=SCAN(S,A(J:J))\n IF(M==0)CYCLE\n U=SCAN(S,A(J:J),.TRUE.)\n IF( M<=I .AND. I0) then\nimp = 1\nendif\n\ndo i=2,n\n\n\t\tif(retsu(i) - retsu(i-1) > 1) then\n\t\t\timp = 1\n\t\tendif\n\t\t\n\t\tif(retsu(i)==0) then\n\t\t\tnumber = number\n\t\telse if(retsu(i)==1)then\n\t\t\tnumber = number + 1\n\t\telse if(retsu(i) - retsu(i-1) == 1) then\n\t\t\tnumber = number + 1\n\t\telse if(retsu(i) <= retsu(i-1)) then\n\t\t\tnumber = number + retsu(i)\n\t\tendif\n\t\t\t\nenddo\n\nif(imp == 1)then\n\twrite(*,*) -1\nelse\n\twrite(*,*) number\nendif\n\nend program", "language": "Fortran", "metadata": {"date": 1526870340, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03347.html", "problem_id": "p03347", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03347/input.txt", "sample_output_relpath": "derived/input_output/data/p03347/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03347/Fortran/s405474900.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405474900", "user_id": "u454703763"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: n,i\ninteger(8) :: retsu(2*10**5) = 0, imp=0, number=0\n\nread(*,*) n\n\ndo i=1,n\n\tread(*,*) retsu(i)\nenddo\n\nif(retsu(1)>0) then\nimp = 1\nendif\n\ndo i=2,n\n\n\t\tif(retsu(i) - retsu(i-1) > 1) then\n\t\t\timp = 1\n\t\tendif\n\t\t\n\t\tif(retsu(i)==0) then\n\t\t\tnumber = number\n\t\telse if(retsu(i)==1)then\n\t\t\tnumber = number + 1\n\t\telse if(retsu(i) - retsu(i-1) == 1) then\n\t\t\tnumber = number + 1\n\t\telse if(retsu(i) <= retsu(i-1)) then\n\t\t\tnumber = number + retsu(i)\n\t\tendif\n\t\t\t\nenddo\n\nif(imp == 1)then\n\twrite(*,*) -1\nelse\n\twrite(*,*) number\nendif\n\nend program", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere is a sequence X of length N, where every element is initially 0. Let X_i denote the i-th element of X.\n\nYou are given a sequence A of length N. The i-th element of A is A_i. Determine if we can make X equal to A by repeating the operation below. If we can, find the minimum number of operations required.\n\nChoose an integer i such that 1\\leq i\\leq N-1. Replace the value of X_{i+1} with the value of X_i plus 1.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nIf we can make X equal to A by repeating the operation, print the minimum number of operations required. If we cannot, print -1.\n\nSample Input 1\n\n4\n0\n1\n1\n2\n\nSample Output 1\n\n3\n\nWe can make X equal to A as follows:\n\nChoose i=2. X becomes (0,0,1,0).\n\nChoose i=1. X becomes (0,1,1,0).\n\nChoose i=3. X becomes (0,1,1,2).\n\nSample Input 2\n\n3\n1\n2\n1\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n9\n0\n1\n1\n0\n1\n2\n2\n1\n2\n\nSample Output 3\n\n8", "sample_input": "4\n0\n1\n1\n2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03347", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere is a sequence X of length N, where every element is initially 0. Let X_i denote the i-th element of X.\n\nYou are given a sequence A of length N. The i-th element of A is A_i. Determine if we can make X equal to A by repeating the operation below. If we can, find the minimum number of operations required.\n\nChoose an integer i such that 1\\leq i\\leq N-1. Replace the value of X_{i+1} with the value of X_i plus 1.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nIf we can make X equal to A by repeating the operation, print the minimum number of operations required. If we cannot, print -1.\n\nSample Input 1\n\n4\n0\n1\n1\n2\n\nSample Output 1\n\n3\n\nWe can make X equal to A as follows:\n\nChoose i=2. X becomes (0,0,1,0).\n\nChoose i=1. X becomes (0,1,1,0).\n\nChoose i=3. X becomes (0,1,1,2).\n\nSample Input 2\n\n3\n1\n2\n1\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n9\n0\n1\n1\n0\n1\n2\n2\n1\n2\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 569, "cpu_time_ms": 84, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s047039199", "group_id": "codeNet:p03351", "input_text": "integer a,b,c,d\nread*, a,b,c,d\nif(abs(a-b)a(j)) then\n y=a(i)\n a(i)=a(j)\n a(j)=y\n end if\n end do\n end do\n\n do i=1,41\n if (a(i) <= x) then\n count=a(i)\n end if\n end do\n\n write(*,*) count\n \n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1592619005, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/Fortran/s960810692.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960810692", "user_id": "u323210830"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program sample\n implicit none\n integer(8) :: i,j,x,y,count\n integer(8) :: a(41)\n \n read(*,*) x\n\n a(1) =1\n \n \n do i=2,9\n a(i) = 2**i\n end do\n \n do i=10,14\n a(i) = 3**(i-8)\n end do\n\n do i=15,17\n a(i) = 5**(i-13)\n end do\n do i=18,19\n a(i) =6**(i-16)\n end do\n\n do i=20,21\n a(i) = 7**(i-18)\n end do\n\n do i=22,23\n a(i) = 10**(i-20)\n end do\n\n do i=24,28\n a(i) = (i-13)**2\n end do\n\n do i=29,36\n a(i) = (i-12)**2\n end do\n\n a(37) = 26**2\n \n do i=38,41\n a(i)=(i-10)**2\n end do\n\n do i=1,41\n do j=i,41\n if (a(i)>a(j)) then\n y=a(i)\n a(i)=a(j)\n a(j)=y\n end if\n end do\n end do\n\n do i=1,41\n if (a(i) <= x) then\n count=a(i)\n end if\n end do\n\n write(*,*) count\n \n stop\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 810, "cpu_time_ms": 5, "memory_kb": 2836}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s145581401", "group_id": "codeNet:p03352", "input_text": "program main\n\timplicit none\n integer(8)::x,i,j,ans\n \n read(*,*)x\n ans=0\n \n do i=1,x\n \tdo j=2,x\n \tif(i**j<=x .and. i**j>ans)then\n \tans=i**j\n end if\n end do\n end do\n write(*,*) ans\n stop\nend program main\n\n\n", "language": "Fortran", "metadata": {"date": 1592616327, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/Fortran/s145581401.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s145581401", "user_id": "u884601206"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n\timplicit none\n integer(8)::x,i,j,ans\n \n read(*,*)x\n ans=0\n \n do i=1,x\n \tdo j=2,x\n \tif(i**j<=x .and. i**j>ans)then\n \tans=i**j\n end if\n end do\n end do\n write(*,*) ans\n stop\nend program main\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 49, "memory_kb": 2844}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s155872627", "group_id": "codeNet:p03352", "input_text": "program exp\n\timplicit none\n\tinteger :: y, c, i\n\treal(8) :: x\n\tinteger,parameter :: money(3) = (/300000,200000,100000/)\n\n\tread(*,*) x\n\t\n\tdo i = 1, int(sqrt(x))+1\n\t\tdo y = 2, int(log(x)/log(2.0_8))\n\t\t\tif (i**y <= x) then\n\t\t\t\tc = i ** y\n\t\t\telse\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\tend do\n\t\n\twrite(*,'(i0)') c\n\nend program exp", "language": "Fortran", "metadata": {"date": 1592615635, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/Fortran/s155872627.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s155872627", "user_id": "u961266059"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program exp\n\timplicit none\n\tinteger :: y, c, i\n\treal(8) :: x\n\tinteger,parameter :: money(3) = (/300000,200000,100000/)\n\n\tread(*,*) x\n\t\n\tdo i = 1, int(sqrt(x))+1\n\t\tdo y = 2, int(log(x)/log(2.0_8))\n\t\t\tif (i**y <= x) then\n\t\t\t\tc = i ** y\n\t\t\telse\n\t\t\t\texit\n\t\t\tend if\n\t\tend do\n\tend do\n\t\n\twrite(*,'(i0)') c\n\nend program exp", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 315, "cpu_time_ms": 12, "memory_kb": 3052}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s581994881", "group_id": "codeNet:p03352", "input_text": "program exponential\n implicit none\n integer :: x, n, i, s, t, k\n read(*,*) x\n if (x.lt.4) then\n write(*,'(i0)') 1\n end if\n k = 1+int(sqrt(real(x,8)))\n s = 0\n do i = 2, k\n t = i*i\n do\n if (t.gt.x) exit\n if (s.lt.t) s = t\n t = t*i\n end do\n end do\n write(*,'(i0)') s\n stop\nend program exponential", "language": "Fortran", "metadata": {"date": 1552170380, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03352/input.txt", "sample_output_relpath": "derived/input_output/data/p03352/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03352/Fortran/s581994881.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s581994881", "user_id": "u506403362"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program exponential\n implicit none\n integer :: x, n, i, s, t, k\n read(*,*) x\n if (x.lt.4) then\n write(*,'(i0)') 1\n end if\n k = 1+int(sqrt(real(x,8)))\n s = 0\n do i = 2, k\n t = i*i\n do\n if (t.gt.x) exit\n if (s.lt.t) s = t\n t = t*i\n end do\n end do\n write(*,'(i0)') s\n stop\nend program exponential", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03352", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a positive integer X.\nFind the largest perfect power that is at most X.\nHere, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.\n\nConstraints\n\n1 ≤ X ≤ 1000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the largest perfect power that is at most X.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\nThere are four perfect powers that are at most 10: 1, 4, 8 and 9.\nWe should print the largest among them, 9.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n999\n\nSample Output 3\n\n961", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 331, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s404777248", "group_id": "codeNet:p03355", "input_text": "program arc097_a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,j,l,r,k\n character(5000):: s, s_list(5),subs\n\n read*, s\n read*, k\n s_list(:) = ''\n do i=1,5\n do j=1,5000\n s_list(i) = trim(s_list(i)) // 'z'\n end do\n end do\n n = len_trim(s)\n \n do l=1,n\n do r=l,n\n subs = s(l:r)\n do i=1,5\n if (subs == s_list(i)) exit\n if (subs < s_list(i)) call swap(subs, s_list(i))\n end do\n end do\n end do\n print'(a)', trim(s_list(k))\ncontains\n subroutine swap(s1,s2)\n character(5000):: s1,s2,tmp\n tmp=s1; s1=s2; s2=tmp\n end subroutine\n\nend program arc097_a", "language": "Fortran", "metadata": {"date": 1591981714, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03355.html", "problem_id": "p03355", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03355/input.txt", "sample_output_relpath": "derived/input_output/data/p03355/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03355/Fortran/s404777248.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s404777248", "user_id": "u234636620"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "program arc097_a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,j,l,r,k\n character(5000):: s, s_list(5),subs\n\n read*, s\n read*, k\n s_list(:) = ''\n do i=1,5\n do j=1,5000\n s_list(i) = trim(s_list(i)) // 'z'\n end do\n end do\n n = len_trim(s)\n \n do l=1,n\n do r=l,n\n subs = s(l:r)\n do i=1,5\n if (subs == s_list(i)) exit\n if (subs < s_list(i)) call swap(subs, s_list(i))\n end do\n end do\n end do\n print'(a)', trim(s_list(k))\ncontains\n subroutine swap(s1,s2)\n character(5000):: s1,s2,tmp\n tmp=s1; s1=s2; s2=tmp\n end subroutine\n\nend program arc097_a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03355", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 727, "cpu_time_ms": 2103, "memory_kb": 892}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s090455674", "group_id": "codeNet:p03359", "input_text": "program takahashi\n implicit none\n integer a, b ,c\n read *, a, b\n if (a>b) then\n c=a-1\n else\n c=a\n end if\n print *, c\n end program takahashi", "language": "Fortran", "metadata": {"date": 1525569839, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03359.html", "problem_id": "p03359", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03359/input.txt", "sample_output_relpath": "derived/input_output/data/p03359/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03359/Fortran/s090455674.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s090455674", "user_id": "u723571904"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program takahashi\n implicit none\n integer a, b ,c\n read *, a, b\n if (a>b) then\n c=a-1\n else\n c=a\n end if\n print *, c\n end program takahashi", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 155, "cpu_time_ms": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s008655450", "group_id": "codeNet:p03360", "input_text": "program ABC096B\n\tinteger(8)::A,B,C,K,i,result\n\tread(5,*)A,B,C\n\tread(5,*)K\n\t\n\tresult=A+B+C\n\t\n\tdo i=1,K\n\t\tresult=result+i*max(A,max(B,C))\n\tend do\n\t\n\tprint'(i0)',result\nend program ABC096B\n", "language": "Fortran", "metadata": {"date": 1575000455, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03360.html", "problem_id": "p03360", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03360/input.txt", "sample_output_relpath": "derived/input_output/data/p03360/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03360/Fortran/s008655450.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s008655450", "user_id": "u414699019"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program ABC096B\n\tinteger(8)::A,B,C,K,i,result\n\tread(5,*)A,B,C\n\tread(5,*)K\n\t\n\tresult=A+B+C\n\t\n\tdo i=1,K\n\t\tresult=result+i*max(A,max(B,C))\n\tend do\n\t\n\tprint'(i0)',result\nend program ABC096B\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "sample_input": "5 3 11\n1\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03360", "source_text": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 186, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s828479200", "group_id": "codeNet:p03360", "input_text": "program main\n implicit none\n integer a(1:3), K, i\n read(*, *) a(1:3)\n read(*, *) K\n do i = 1, K\n a(maxloc(a,1))=2*maxval(a) \n end do\n write(*, *) sum(a)\nend program main", "language": "Fortran", "metadata": {"date": 1525569099, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03360.html", "problem_id": "p03360", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03360/input.txt", "sample_output_relpath": "derived/input_output/data/p03360/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03360/Fortran/s828479200.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828479200", "user_id": "u728000113"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program main\n implicit none\n integer a(1:3), K, i\n read(*, *) a(1:3)\n read(*, *) K\n do i = 1, K\n a(maxloc(a,1))=2*maxval(a) \n end do\n write(*, *) sum(a)\nend program main", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "sample_input": "5 3 11\n1\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03360", "source_text": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s165557422", "group_id": "codeNet:p03360", "input_text": "\nprogram main\n implicit none\n integer*8::a,b,c,k\n read(*,*)a,b,c\n read*,k\n print*,max(lshift(a,k)+b+c,a+lshift(b,k)+c,a+b+lshift(c,k))\nend program\n", "language": "Fortran", "metadata": {"date": 1525568823, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03360.html", "problem_id": "p03360", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03360/input.txt", "sample_output_relpath": "derived/input_output/data/p03360/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03360/Fortran/s165557422.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s165557422", "user_id": "u313111801"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "\nprogram main\n implicit none\n integer*8::a,b,c,k\n read(*,*)a,b,c\n read*,k\n print*,max(lshift(a,k)+b+c,a+lshift(b,k)+c,a+b+lshift(c,k))\nend program\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "sample_input": "5 3 11\n1\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03360", "source_text": "Score: 200 points\n\nProblem Statement\n\nThere are three positive integers A, B and C written on a blackboard. E869120 performs the following operation K times:\n\nChoose one integer written on the blackboard and let the chosen integer be n. Replace the chosen integer with 2n.\n\nWhat is the largest possible sum of the integers written on the blackboard after K operations?\n\nConstraints\n\nA, B and C are integers between 1 and 50 (inclusive).\n\nK is an integer between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nPrint the largest possible sum of the integers written on the blackboard after K operations by E869220.\n\nSample Input 1\n\n5 3 11\n1\n\nSample Output 1\n\n30\n\nIn this sample, 5, 3, 11 are initially written on the blackboard, and E869120 can perform the operation once.\n\nThere are three choices:\n\nDouble 5: The integers written on the board after the operation are 10, 3, 11.\n\nDouble 3: The integers written on the board after the operation are 5, 6, 11.\n\nDouble 11: The integers written on the board after the operation are 5, 3, 22.\n\nIf he chooses 3., the sum of the integers written on the board afterwards is 5 + 3 + 22 = 30, which is the largest among 1. through 3.\n\nSample Input 2\n\n3 3 4\n2\n\nSample Output 2\n\n22\n\nE869120 can perform the operation twice. The sum of the integers eventually written on the blackboard is maximized as follows:\n\nFirst, double 4. The integers written on the board are now 3, 3, 8.\n\nNext, double 8. The integers written on the board are now 3, 3, 16.\n\nThen, the sum of the integers eventually written on the blackboard is 3 + 3 + 16 = 22.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s512647270", "group_id": "codeNet:p03362", "input_text": "program test\nimplicit none\n\ninteger :: sosuu(55555)=1,i,j,k,nn,n,ans(55555),count=0\n\nread(*,*) n\n\nsosuu(1) = 0\n\nnn = int(55555**0.5)\n\ndo i=2,nn\n\tdo j=2,55555\n\t\tif(j>i .and. mod(j,i) == 0)then\n\t\t\tsosuu(j) = 0\n\t\tendif\n\tenddo\nenddo\n\ncount=0\ndo i=1,55555\n\tif(sosuu(i)==1 .and. mod(i,10)==1 )then\n\t\tcount =count + 1\n\t\tans(count)=i\n\tendif\n\n\tif(count == 55)then\n\tgoto 100\n\tendif\n\nenddo\n\n100 continue\n\nwrite(*,*) ans(1:n)\n\nend program", "language": "Fortran", "metadata": {"date": 1551174314, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03362.html", "problem_id": "p03362", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03362/input.txt", "sample_output_relpath": "derived/input_output/data/p03362/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03362/Fortran/s512647270.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s512647270", "user_id": "u454703763"}, "prompt_components": {"gold_output": "3 5 7 11 31\n", "input_to_evaluate": "program test\nimplicit none\n\ninteger :: sosuu(55555)=1,i,j,k,nn,n,ans(55555),count=0\n\nread(*,*) n\n\nsosuu(1) = 0\n\nnn = int(55555**0.5)\n\ndo i=2,nn\n\tdo j=2,55555\n\t\tif(j>i .and. mod(j,i) == 0)then\n\t\t\tsosuu(j) = 0\n\t\tendif\n\tenddo\nenddo\n\ncount=0\ndo i=1,55555\n\tif(sosuu(i)==1 .and. mod(i,10)==1 )then\n\t\tcount =count + 1\n\t\tans(count)=i\n\tendif\n\n\tif(count == 55)then\n\tgoto 100\n\tendif\n\nenddo\n\n100 continue\n\nwrite(*,*) ans(1:n)\n\nend program", "problem_context": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "sample_input": "5\n"}, "reference_outputs": ["3 5 7 11 31\n"], "source_document_id": "p03362", "source_text": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 426, "cpu_time_ms": 49, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s080189749", "group_id": "codeNet:p03363", "input_text": "program test\nimplicit none\ninteger(8) :: n,a(200000),ruiseki(200000)=0,y(200000)=0.,t\ninteger :: x=0,i,j,k,l,combo\nread(*,*) n\n\n read(*,*) (a(i),i=1,n)\n\nruiseki(1) = a(1)\n \ndo i=2,n\n ruiseki(i) = ruiseki(i-1) + a(i)\nenddo\n\n\ndo i=1,n\n if(ruiseki(i) == 0) then\n x = x+1\n endif\nenddo\n\ny = ruiseki\n \nl = n/2+1\nk = n\ndo while(k /= 1)\n if(l > 1) then\n l = l-1\n t = y(l)\n else\n t = y(k)\n y(k) = y(1)\n k = k-1\n if(k == 1) then\n y(1) = t\n exit\n endif\n endif\n i = l\n j = l+l\n do while(j <= k)\n if(j < k) then\n if(y(j) < y(j+1)) j = j+1\n endif\n if (t < y(j)) then\n y(i) = y(j)\n i = j\n j = j+j\n else\n j = k+1\n endif\n enddo\n y(i) = t\nenddo\n\ncombo = 1\n\ndo i = 2,n\n if(y(i) == y(i-1)) then\n combo = combo + 1\n else if (combo >= 2) then\n x = x + combo * (combo-1) /2 \n combo = 1\n else\n combo = 1\n endif\nenddo\n\n if (combo >= 2) then\n x = x + combo * (combo-1) /2 \n endif\n\nwrite(*,*) x\n\n\nend program", "language": "Fortran", "metadata": {"date": 1524970244, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03363.html", "problem_id": "p03363", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03363/input.txt", "sample_output_relpath": "derived/input_output/data/p03363/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03363/Fortran/s080189749.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s080189749", "user_id": "u454703763"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: n,a(200000),ruiseki(200000)=0,y(200000)=0.,t\ninteger :: x=0,i,j,k,l,combo\nread(*,*) n\n\n read(*,*) (a(i),i=1,n)\n\nruiseki(1) = a(1)\n \ndo i=2,n\n ruiseki(i) = ruiseki(i-1) + a(i)\nenddo\n\n\ndo i=1,n\n if(ruiseki(i) == 0) then\n x = x+1\n endif\nenddo\n\ny = ruiseki\n \nl = n/2+1\nk = n\ndo while(k /= 1)\n if(l > 1) then\n l = l-1\n t = y(l)\n else\n t = y(k)\n y(k) = y(1)\n k = k-1\n if(k == 1) then\n y(1) = t\n exit\n endif\n endif\n i = l\n j = l+l\n do while(j <= k)\n if(j < k) then\n if(y(j) < y(j+1)) j = j+1\n endif\n if (t < y(j)) then\n y(i) = y(j)\n i = j\n j = j+j\n else\n j = k+1\n endif\n enddo\n y(i) = t\nenddo\n\ncombo = 1\n\ndo i = 2,n\n if(y(i) == y(i-1)) then\n combo = combo + 1\n else if (combo >= 2) then\n x = x + combo * (combo-1) /2 \n combo = 1\n else\n combo = 1\n endif\nenddo\n\n if (combo >= 2) then\n x = x + combo * (combo-1) /2 \n endif\n\nwrite(*,*) x\n\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 991, "cpu_time_ms": 90, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s257820671", "group_id": "codeNet:p03363", "input_text": "program test\nimplicit none\ninteger(8) :: n,a(200000),ruiseki(200000)=0,x=0,i,j\nread(*,*) n\n\n read(*,*) (a(i),i=1,n)\n\nruiseki(1) = a(1)\n \ndo i=2,n\n ruiseki(i) = ruiseki(i-1) + a(i)\nenddo\n\ndo i=2,n\n if(ruiseki(i) == 0) then\n x = x+1\n endif\nenddo\n\ndo i=1,n\n do j=i+1,n\n if(ruiseki(i) == ruiseki(j)) then\n x = x + 1\n endif\n enddo\nenddo\n\nwrite(*,*) x\n\nend program", "language": "Fortran", "metadata": {"date": 1524964963, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03363.html", "problem_id": "p03363", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03363/input.txt", "sample_output_relpath": "derived/input_output/data/p03363/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03363/Fortran/s257820671.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s257820671", "user_id": "u454703763"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program test\nimplicit none\ninteger(8) :: n,a(200000),ruiseki(200000)=0,x=0,i,j\nread(*,*) n\n\n read(*,*) (a(i),i=1,n)\n\nruiseki(1) = a(1)\n \ndo i=2,n\n ruiseki(i) = ruiseki(i-1) + a(i)\nenddo\n\ndo i=2,n\n if(ruiseki(i) == 0) then\n x = x+1\n endif\nenddo\n\ndo i=1,n\n do j=i+1,n\n if(ruiseki(i) == ruiseki(j)) then\n x = x + 1\n endif\n enddo\nenddo\n\nwrite(*,*) x\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 377, "cpu_time_ms": 2104, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s172579219", "group_id": "codeNet:p03365", "input_text": "module mod_modulo_util\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8), allocatable :: f(:), invf(:)\ncontains\n subroutine init(n)\n implicit none\n integer, intent(in) :: n\n integer :: i\n if (allocated(f)) deallocate(f)\n if (allocated(invf)) deallocate(invf)\n allocate(f(0:n),invf(0:n))\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n end do\n invf(n) = inv(f(n))\n do i = n, 1, -1\n invf(i-1) = mod(invf(i)*int(i,8),md)\n end do\n return\n end subroutine init\n integer(8) function perm(n,k)\n implicit none\n integer, intent(in) :: n, k\n perm = 0_8\n if (n < 0 .or. k > n) return\n perm = mod(f(n)*invf(n-k),md)\n return\n end function perm\n integer(8) function comb(n,k)\n implicit none\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n return\n end function comb\n integer(8) function homo(n,k)\n implicit none\n integer, intent(in) :: n, k\n homo = comb(n+k-1,k)\n return\n end function homo\n function inv(n) result(y)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0_8\n y = 1_8\n do while (b /= 0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n y = mod(y,md)\n if (y < 0_8) y = y+md\n return\n end function inv\n function pow(a,b) result(r)\n implicit none\n integer(8), intent(in) :: a\n integer, intent(in) :: b\n integer :: i\n integer(8) :: r, p\n r = 1_8\n p = a\n do i = 0, 32\n if (btest(b,i)) r = mod(r*p,md)\n p = mod(p*p,md)\n end do\n return\n end function pow\n integer(8) function fact(n)\n implicit none\n integer, intent(in) :: n\n fact = 0_8\n if (n < 0) return\n fact = f(n)\n return\n end function fact\nend module mod_modulo_util\nprogram painting_machines\n use mod_modulo_util\n implicit none\n integer :: n, k\n integer(8) :: ans = 0_8\n read(*,*) n\n call init(n)\n ans = mod(mod(f(n)*f(n),md)*invf(n),md)\n do k = (n+1)/2, n-1\n ans = mod(ans+md-mod(mod(f(k-1)*f(k),md)*invf(2*k-n),md),md)\n end do\n write(*,'(i0)') ans\n stop\nend program painting_machines", "language": "Fortran", "metadata": {"date": 1565113039, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03365.html", "problem_id": "p03365", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03365/input.txt", "sample_output_relpath": "derived/input_output/data/p03365/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03365/Fortran/s172579219.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s172579219", "user_id": "u506403362"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "module mod_modulo_util\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8), allocatable :: f(:), invf(:)\ncontains\n subroutine init(n)\n implicit none\n integer, intent(in) :: n\n integer :: i\n if (allocated(f)) deallocate(f)\n if (allocated(invf)) deallocate(invf)\n allocate(f(0:n),invf(0:n))\n f = 0_8\n invf = 0_8\n f(0) = 1_8\n do i = 1, n\n f(i) = mod(f(i-1)*int(i,8),md)\n end do\n invf(n) = inv(f(n))\n do i = n, 1, -1\n invf(i-1) = mod(invf(i)*int(i,8),md)\n end do\n return\n end subroutine init\n integer(8) function perm(n,k)\n implicit none\n integer, intent(in) :: n, k\n perm = 0_8\n if (n < 0 .or. k > n) return\n perm = mod(f(n)*invf(n-k),md)\n return\n end function perm\n integer(8) function comb(n,k)\n implicit none\n integer, intent(in) :: n, k\n comb = mod(perm(n,k)*invf(k),md)\n return\n end function comb\n integer(8) function homo(n,k)\n implicit none\n integer, intent(in) :: n, k\n homo = comb(n+k-1,k)\n return\n end function homo\n function inv(n) result(y)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: a, b, x, y, t, q\n a = mod(n,md)\n b = md\n x = 0_8\n y = 1_8\n do while (b /= 0_8)\n q = a/b\n t = b\n b = mod(a,b)\n a = t\n t = y\n y = x\n x = t-q*x\n end do\n y = mod(y,md)\n if (y < 0_8) y = y+md\n return\n end function inv\n function pow(a,b) result(r)\n implicit none\n integer(8), intent(in) :: a\n integer, intent(in) :: b\n integer :: i\n integer(8) :: r, p\n r = 1_8\n p = a\n do i = 0, 32\n if (btest(b,i)) r = mod(r*p,md)\n p = mod(p*p,md)\n end do\n return\n end function pow\n integer(8) function fact(n)\n implicit none\n integer, intent(in) :: n\n fact = 0_8\n if (n < 0) return\n fact = f(n)\n return\n end function fact\nend module mod_modulo_util\nprogram painting_machines\n use mod_modulo_util\n implicit none\n integer :: n, k\n integer(8) :: ans = 0_8\n read(*,*) n\n call init(n)\n ans = mod(mod(f(n)*f(n),md)*invf(n),md)\n do k = (n+1)/2, n-1\n ans = mod(ans+md-mod(mod(f(k-1)*f(k),md)*invf(2*k-n),md),md)\n end do\n write(*,'(i0)') ans\n stop\nend program painting_machines", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere are N squares lining up in a row, numbered 1 through N from left to right.\nInitially, all squares are white.\nWe also have N-1 painting machines, numbered 1 through N-1.\nWhen operated, Machine i paints Square i and i+1 black.\n\nSnuke will operate these machines one by one.\nThe order in which he operates them is represented by a permutation of (1, 2, ..., N-1), P, which means that the i-th operated machine is Machine P_i.\n\nHere, the score of a permutation P is defined as the number of machines that are operated before all the squares are painted black for the first time, when the machines are operated in the order specified by P.\nSnuke has not decided what permutation P to use, but he is interested in the scores of possible permutations.\nFind the sum of the scores over all possible permutations for him.\nSince this can be extremely large, compute the sum modulo 10^9+7.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of the scores over all possible permutations, modulo 10^9+7.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n16\n\nThere are six possible permutations as P.\nAmong them, P = (1, 3, 2) and P = (3, 1, 2) have a score of 2, and the others have a score of 3.\nThus, the answer is 2 \\times 2 + 3 \\times 4 = 16.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nThere is only one possible permutation: P = (1), which has a score of 1.\n\nSample Input 3\n\n5\n\nSample Output 3\n\n84\n\nSample Input 4\n\n100000\n\nSample Output 4\n\n341429644", "sample_input": "4\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03365", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere are N squares lining up in a row, numbered 1 through N from left to right.\nInitially, all squares are white.\nWe also have N-1 painting machines, numbered 1 through N-1.\nWhen operated, Machine i paints Square i and i+1 black.\n\nSnuke will operate these machines one by one.\nThe order in which he operates them is represented by a permutation of (1, 2, ..., N-1), P, which means that the i-th operated machine is Machine P_i.\n\nHere, the score of a permutation P is defined as the number of machines that are operated before all the squares are painted black for the first time, when the machines are operated in the order specified by P.\nSnuke has not decided what permutation P to use, but he is interested in the scores of possible permutations.\nFind the sum of the scores over all possible permutations for him.\nSince this can be extremely large, compute the sum modulo 10^9+7.\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the sum of the scores over all possible permutations, modulo 10^9+7.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n16\n\nThere are six possible permutations as P.\nAmong them, P = (1, 3, 2) and P = (3, 1, 2) have a score of 2, and the others have a score of 3.\nThus, the answer is 2 \\times 2 + 3 \\times 4 = 16.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n1\n\nThere is only one possible permutation: P = (1), which has a score of 1.\n\nSample Input 3\n\n5\n\nSample Output 3\n\n84\n\nSample Input 4\n\n100000\n\nSample Output 4\n\n341429644", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2232, "cpu_time_ms": 18, "memory_kb": 15872}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s089949928", "group_id": "codeNet:p03371", "input_text": "program ABC095C\n implicit none\n integer(8)::A,B,C,X,Y\n read*,A,B,C,X,Y\n\n if(XY)then\n print'(i0)',min(A*X+B*Y,2*C*Y+A*(X-Y),2*C*X)\n else\n print'(i0)',min(A*X+B*Y,2*C*X)\n end if\nend program ABC095C", "language": "Fortran", "metadata": {"date": 1586645907, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03371.html", "problem_id": "p03371", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03371/input.txt", "sample_output_relpath": "derived/input_output/data/p03371/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03371/Fortran/s089949928.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s089949928", "user_id": "u414699019"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "program ABC095C\n implicit none\n integer(8)::A,B,C,X,Y\n read*,A,B,C,X,Y\n\n if(XY)then\n print'(i0)',min(A*X+B*Y,2*C*Y+A*(X-Y),2*C*X)\n else\n print'(i0)',min(A*X+B*Y,2*C*X)\n end if\nend program ABC095C", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s673769079", "group_id": "codeNet:p03371", "input_text": "program Half_and_Half\n implicit none\n integer(4):: a,b,c\n integer(4):: x,y\n \n read*, a,b,c,x,y\n\n print*, min(x,y) * min(a+b, 2*c) + abs(x-y)*min(extra(),2*c)\n\ncontains\n function extra() result(ret)\n integer(4):: ret\n\n if (x==y) then\n ret=0\n else if (x > y) then\n ret=a\n else\n ret=b\n end if\n end function\nend program Half_and_Half", "language": "Fortran", "metadata": {"date": 1585926749, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03371.html", "problem_id": "p03371", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03371/input.txt", "sample_output_relpath": "derived/input_output/data/p03371/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03371/Fortran/s673769079.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673769079", "user_id": "u234636620"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "program Half_and_Half\n implicit none\n integer(4):: a,b,c\n integer(4):: x,y\n \n read*, a,b,c,x,y\n\n print*, min(x,y) * min(a+b, 2*c) + abs(x-y)*min(extra(),2*c)\n\ncontains\n function extra() result(ret)\n integer(4):: ret\n\n if (x==y) then\n ret=0\n else if (x > y) then\n ret=a\n else\n ret=b\n end if\n end function\nend program Half_and_Half", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s856379878", "group_id": "codeNet:p03371", "input_text": "program test\nimplicit none\ninteger :: a,b,c,x,y,p(3)\n\nread(*,*) a,b,c,x,y\n\np(1) = b * max(y-x,0) + c * 2 * x\np(2) = a * max(x-y,0) + c * 2 * y\np(3) = a * x + b * y\n\nwrite(*,*) minval(p(1:3))\n \nend program", "language": "Fortran", "metadata": {"date": 1524360368, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03371.html", "problem_id": "p03371", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03371/input.txt", "sample_output_relpath": "derived/input_output/data/p03371/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03371/Fortran/s856379878.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856379878", "user_id": "u454703763"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "program test\nimplicit none\ninteger :: a,b,c,x,y,p(3)\n\nread(*,*) a,b,c,x,y\n\np(1) = b * max(y-x,0) + c * 2 * x\np(2) = a * max(x-y,0) + c * 2 * y\np(3) = a * x + b * y\n\nwrite(*,*) minval(p(1:3))\n \nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s760457679", "group_id": "codeNet:p03372", "input_text": "program test\nimplicit none\ninteger :: i,j,n\ndouble precision :: c,x(100000),v(100000),tokei,hantokei(100000),goukei(100000)=0,saikou\n\nread(*,*) n,c\ndo i = 1,n\nread(*,*) x(i),v(i)\nenddo\n\ndo i = 0, n\n\nif(i == 0) then\n tokei = 0\n hantokei = 0\nelse\ntokei = sum(v(1:i)) - x(i)\nhantokei = 0\nendif\n\ndo j = i+1, n\nhantokei(j) = sum(v(j:n)) - (x(i) + c - x(j))\nenddo\n\ngoukei(i) = tokei + maxval(hantokei(:))\n\nenddo\n\nsaikou = maxval(goukei(:))\n\ndo i = 1, n\n\ntokei = sum(v(i:n)) - ( c - x(i))\nhantokei = 0\n\ndo j = 1, i-1\nif(j>=1) then\nhantokei(j) = sum(v(1:j)) - (c - x(i) + x(j))\nendif\nenddo\n\ngoukei(i) = tokei + maxval(hantokei(:))\n\nenddo\n\nwrite(*,*) max(saikou,maxval(goukei(:)))\n\nend program", "language": "Fortran", "metadata": {"date": 1524365494, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03372.html", "problem_id": "p03372", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03372/input.txt", "sample_output_relpath": "derived/input_output/data/p03372/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03372/Fortran/s760457679.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s760457679", "user_id": "u454703763"}, "prompt_components": {"gold_output": "191\n", "input_to_evaluate": "program test\nimplicit none\ninteger :: i,j,n\ndouble precision :: c,x(100000),v(100000),tokei,hantokei(100000),goukei(100000)=0,saikou\n\nread(*,*) n,c\ndo i = 1,n\nread(*,*) x(i),v(i)\nenddo\n\ndo i = 0, n\n\nif(i == 0) then\n tokei = 0\n hantokei = 0\nelse\ntokei = sum(v(1:i)) - x(i)\nhantokei = 0\nendif\n\ndo j = i+1, n\nhantokei(j) = sum(v(j:n)) - (x(i) + c - x(j))\nenddo\n\ngoukei(i) = tokei + maxval(hantokei(:))\n\nenddo\n\nsaikou = maxval(goukei(:))\n\ndo i = 1, n\n\ntokei = sum(v(i:n)) - ( c - x(i))\nhantokei = 0\n\ndo j = 1, i-1\nif(j>=1) then\nhantokei(j) = sum(v(1:j)) - (c - x(i) + x(j))\nendif\nenddo\n\ngoukei(i) = tokei + maxval(hantokei(:))\n\nenddo\n\nwrite(*,*) max(saikou,maxval(goukei(:)))\n\nend program", "problem_context": "Score : 500 points\n\nProblem Statement\n\n\"Teishi-zushi\", a Japanese restaurant, is a plain restaurant with only one round counter. The outer circumference of the counter is C meters. Customers cannot go inside the counter.\n\nNakahashi entered Teishi-zushi, and he was guided to the counter. Now, there are N pieces of sushi (vinegared rice with seafood and so on) on the counter. The distance measured clockwise from the point where Nakahashi is standing to the point where the i-th sushi is placed, is x_i meters. Also, the i-th sushi has a nutritive value of v_i kilocalories.\n\nNakahashi can freely walk around the circumference of the counter. When he reach a point where a sushi is placed, he can eat that sushi and take in its nutrition (naturally, the sushi disappears). However, while walking, he consumes 1 kilocalories per meter.\n\nWhenever he is satisfied, he can leave the restaurant from any place (he does not have to return to the initial place). On balance, at most how much nutrition can he take in before he leaves? That is, what is the maximum possible value of the total nutrition taken in minus the total energy consumed? Assume that there are no other customers, and no new sushi will be added to the counter. Also, since Nakahashi has plenty of nutrition in his body, assume that no matter how much he walks and consumes energy, he never dies from hunger.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ C ≤ 10^{14}\n\n1 ≤ x_1 < x_2 < ... < x_N < C\n\n1 ≤ v_i ≤ 10^9\n\nAll values in input are integers.\n\nSubscores\n\n300 points will be awarded for passing the test set satisfying N ≤ 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nx_1 v_1\nx_2 v_2\n:\nx_N v_N\n\nOutput\n\nIf Nakahashi can take in at most c kilocalories on balance before he leaves the restaurant, print c.\n\nSample Input 1\n\n3 20\n2 80\n9 120\n16 1\n\nSample Output 1\n\n191\n\nThere are three sushi on the counter with a circumference of 20 meters. If he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks seven more meters clockwise, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 9 kilocalories, thus he can take in 191 kilocalories on balance, which is the largest possible value.\n\nSample Input 2\n\n3 20\n2 80\n9 1\n16 120\n\nSample Output 2\n\n192\n\nThe second and third sushi have been swapped. Again, if he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks six more meters counterclockwise this time, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 8 kilocalories, thus he can take in 192 kilocalories on balance, which is the largest possible value.\n\nSample Input 3\n\n1 100000000000000\n50000000000000 1\n\nSample Output 3\n\n0\n\nEven though the only sushi is so far that it does not fit into a 32-bit integer, its nutritive value is low, thus he should immediately leave without doing anything.\n\nSample Input 4\n\n15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 1000000000\n3800000000 1000000000\n4000000000 1000000000\n4100000000 1000000000\n5200000000 1000000000\n6600000000 1000000000\n8000000000 1000000000\n9300000000 1000000000\n9700000000 1000000000\n\nSample Output 4\n\n6500000000\n\nAll these sample inputs above are included in the test set for the partial score.", "sample_input": "3 20\n2 80\n9 120\n16 1\n"}, "reference_outputs": ["191\n"], "source_document_id": "p03372", "source_text": "Score : 500 points\n\nProblem Statement\n\n\"Teishi-zushi\", a Japanese restaurant, is a plain restaurant with only one round counter. The outer circumference of the counter is C meters. Customers cannot go inside the counter.\n\nNakahashi entered Teishi-zushi, and he was guided to the counter. Now, there are N pieces of sushi (vinegared rice with seafood and so on) on the counter. The distance measured clockwise from the point where Nakahashi is standing to the point where the i-th sushi is placed, is x_i meters. Also, the i-th sushi has a nutritive value of v_i kilocalories.\n\nNakahashi can freely walk around the circumference of the counter. When he reach a point where a sushi is placed, he can eat that sushi and take in its nutrition (naturally, the sushi disappears). However, while walking, he consumes 1 kilocalories per meter.\n\nWhenever he is satisfied, he can leave the restaurant from any place (he does not have to return to the initial place). On balance, at most how much nutrition can he take in before he leaves? That is, what is the maximum possible value of the total nutrition taken in minus the total energy consumed? Assume that there are no other customers, and no new sushi will be added to the counter. Also, since Nakahashi has plenty of nutrition in his body, assume that no matter how much he walks and consumes energy, he never dies from hunger.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ C ≤ 10^{14}\n\n1 ≤ x_1 < x_2 < ... < x_N < C\n\n1 ≤ v_i ≤ 10^9\n\nAll values in input are integers.\n\nSubscores\n\n300 points will be awarded for passing the test set satisfying N ≤ 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nx_1 v_1\nx_2 v_2\n:\nx_N v_N\n\nOutput\n\nIf Nakahashi can take in at most c kilocalories on balance before he leaves the restaurant, print c.\n\nSample Input 1\n\n3 20\n2 80\n9 120\n16 1\n\nSample Output 1\n\n191\n\nThere are three sushi on the counter with a circumference of 20 meters. If he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks seven more meters clockwise, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 9 kilocalories, thus he can take in 191 kilocalories on balance, which is the largest possible value.\n\nSample Input 2\n\n3 20\n2 80\n9 1\n16 120\n\nSample Output 2\n\n192\n\nThe second and third sushi have been swapped. Again, if he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks six more meters counterclockwise this time, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 8 kilocalories, thus he can take in 192 kilocalories on balance, which is the largest possible value.\n\nSample Input 3\n\n1 100000000000000\n50000000000000 1\n\nSample Output 3\n\n0\n\nEven though the only sushi is so far that it does not fit into a 32-bit integer, its nutritive value is low, thus he should immediately leave without doing anything.\n\nSample Input 4\n\n15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 1000000000\n3800000000 1000000000\n4000000000 1000000000\n4100000000 1000000000\n5200000000 1000000000\n6600000000 1000000000\n8000000000 1000000000\n9300000000 1000000000\n9700000000 1000000000\n\nSample Output 4\n\n6500000000\n\nAll these sample inputs above are included in the test set for the partial score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 688, "cpu_time_ms": 2103, "memory_kb": 2560}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s950808100", "group_id": "codeNet:p03377", "input_text": "integer a,b,x\nread*,a,b,x\nif(x= a .and. x <= a+b ) then\n write(*,*) \"YES\"\nelse\n write(*,*) \"NO\"\nendif\n\n\nend program", "language": "Fortran", "metadata": {"date": 1523754761, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03377.html", "problem_id": "p03377", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03377/input.txt", "sample_output_relpath": "derived/input_output/data/p03377/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03377/Fortran/s788898161.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788898161", "user_id": "u454703763"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program test\nimplicit none\ninteger :: a,b,x\n\nread(*,*) a,b,x\n\nif(x >= a .and. x <= a+b ) then\n write(*,*) \"YES\"\nelse\n write(*,*) \"NO\"\nendif\n\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s027467749", "group_id": "codeNet:p03378", "input_text": "program main\n implicit none\n \n integer :: n,m,x,a(100),i,j,b(100)=0,ss=0,bb=0\n \n read(*,*)n,m,x\n read(*,*)(a(i),i=1, m)\n do i = 1, m\n if (i == a(i)) then\n b(i) = 1\n end if\n end do\n \n do i = 1, x-1\n ss = ss + b(i)\n end do\n do i = x+1,100\n bb = bb + b(i)\n end do\n \n write(*,*)min(ss,bb)\nend program main", "language": "Fortran", "metadata": {"date": 1571273806, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03378.html", "problem_id": "p03378", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03378/input.txt", "sample_output_relpath": "derived/input_output/data/p03378/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03378/Fortran/s027467749.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s027467749", "user_id": "u287431190"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: n,m,x,a(100),i,j,b(100)=0,ss=0,bb=0\n \n read(*,*)n,m,x\n read(*,*)(a(i),i=1, m)\n do i = 1, m\n if (i == a(i)) then\n b(i) = 1\n end if\n end do\n \n do i = 1, x-1\n ss = ss + b(i)\n end do\n do i = x+1,100\n bb = bb + b(i)\n end do\n \n write(*,*)min(ss,bb)\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "sample_input": "5 3 3\n1 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03378", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s892552146", "group_id": "codeNet:p03378", "input_text": "program abc094b\n implicit none\n integer :: n, m, x\n integer,allocatable :: a(:)\n\n read *, n, m, x\n allocate(a(m))\n read *, a\n print *, min(count(ax))\nend program abc094b\n", "language": "Fortran", "metadata": {"date": 1558637479, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03378.html", "problem_id": "p03378", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03378/input.txt", "sample_output_relpath": "derived/input_output/data/p03378/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03378/Fortran/s892552146.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892552146", "user_id": "u081445141"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program abc094b\n implicit none\n integer :: n, m, x\n integer,allocatable :: a(:)\n\n read *, n, m, x\n allocate(a(m))\n read *, a\n print *, min(count(ax))\nend program abc094b\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "sample_input": "5 3 3\n1 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03378", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s890196140", "group_id": "codeNet:p03379", "input_text": "program main\n\timplicit none\n integer::n,i\n real(8)::t\n integer,allocatable::x(:),y(:)\n read(*,*) n\n allocate(x(n))\n allocate(y(n))\n \n read(*,*) x\n y=x\n call heapsort(n,y)\n \n t=(real(y(n/2),kind=8)+real(y(n/2 +1),kind=8))/2.0_8\n \n do i=1,n\n \tif(real(x(i),8)= abs(dble(l/2) - dble(a(i))) .and. a(i) /= l) then\n\t r = a(i)\n\t end if\n end do\n write(*, *) l, r \nend program ABC_094_D_BinomialCoefficients", "language": "Fortran", "metadata": {"date": 1523760530, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03380.html", "problem_id": "p03380", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03380/input.txt", "sample_output_relpath": "derived/input_output/data/p03380/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03380/Fortran/s919746214.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s919746214", "user_id": "u728000113"}, "prompt_components": {"gold_output": "11 6\n", "input_to_evaluate": "program ABC_094_D_BinomialCoefficients\n implicit none\n integer(8) n, l, r, i\n integer(8), allocatable :: a(:)\n read(*, *) n\n allocate(a(1: n))\n read(*, *) a(1: n)\n l = maxval(a(1:n))\n r = a(1)\n do i = 1, n\n if( abs(dble(l/2) - dble(r)) >= abs(dble(l/2) - dble(a(i))) .and. a(i) /= l) then\n\t r = a(i)\n\t end if\n end do\n write(*, *) l, r \nend program ABC_094_D_BinomialCoefficients", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "sample_input": "5\n6 9 4 2 11\n"}, "reference_outputs": ["11 6\n"], "source_document_id": "p03380", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 34, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s338890493", "group_id": "codeNet:p03380", "input_text": "program ABC_094_D_BinomialCoefficients\n implicit none\n integer n, l, r, i\n integer, allocatable :: a(:)\n read(*, *) n\n allocate(a(1: n))\n read(*, *) a(1: n)\n l = maxval(a(1:n))\n r = a(1)\n do i = 2, n\n if( abs(dble(l/2) - r) > abs(dble(l/2) - a(i)) .and. a(i) /= l) then\n\t r = a(i)\n\t end if\n end do\n write(*, *) l, r \nend program ABC_094_D_BinomialCoefficients", "language": "Fortran", "metadata": {"date": 1523759983, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03380.html", "problem_id": "p03380", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03380/input.txt", "sample_output_relpath": "derived/input_output/data/p03380/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03380/Fortran/s338890493.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s338890493", "user_id": "u728000113"}, "prompt_components": {"gold_output": "11 6\n", "input_to_evaluate": "program ABC_094_D_BinomialCoefficients\n implicit none\n integer n, l, r, i\n integer, allocatable :: a(:)\n read(*, *) n\n allocate(a(1: n))\n read(*, *) a(1: n)\n l = maxval(a(1:n))\n r = a(1)\n do i = 2, n\n if( abs(dble(l/2) - r) > abs(dble(l/2) - a(i)) .and. a(i) /= l) then\n\t r = a(i)\n\t end if\n end do\n write(*, *) l, r \nend program ABC_094_D_BinomialCoefficients", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "sample_input": "5\n6 9 4 2 11\n"}, "reference_outputs": ["11 6\n"], "source_document_id": "p03380", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 35, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s411816435", "group_id": "codeNet:p03385", "input_text": "character(3) a\nread*,a\nif(a(1:1)==a(2:2).or.a(2:2)==a(3:3).or.a(3:3)==a(1:1))then\n\tprint\"(A)\",\"No\"\nelse\n\tprint\"(A)\",\"Yes\"\nendif\nend", "language": "Fortran", "metadata": {"date": 1551430451, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03385.html", "problem_id": "p03385", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03385/input.txt", "sample_output_relpath": "derived/input_output/data/p03385/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03385/Fortran/s411816435.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411816435", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "character(3) a\nread*,a\nif(a(1:1)==a(2:2).or.a(2:2)==a(3:3).or.a(3:3)==a(1:1))then\n\tprint\"(A)\",\"No\"\nelse\n\tprint\"(A)\",\"Yes\"\nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "sample_input": "bac\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03385", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s037653770", "group_id": "codeNet:p03386", "input_text": "implicit none\ninteger :: a,b,k\ninteger :: i\n\nread*,a,b,k\n\ndo i = a,min(a+k-1,b)\n write(*,'(i0)') i\nenddo\ndo i = max(a+k,b-k+1),b\n write(*,'(i0)') i\nenddo\nstop\nend", "language": "Fortran", "metadata": {"date": 1565228098, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03386.html", "problem_id": "p03386", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03386/input.txt", "sample_output_relpath": "derived/input_output/data/p03386/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03386/Fortran/s037653770.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037653770", "user_id": "u193540507"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "implicit none\ninteger :: a,b,k\ninteger :: i\n\nread*,a,b,k\n\ndo i = a,min(a+k-1,b)\n write(*,'(i0)') i\nenddo\ndo i = max(a+k,b-k+1),b\n write(*,'(i0)') i\nenddo\nstop\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "sample_input": "3 8 2\n"}, "reference_outputs": ["3\n4\n7\n8\n"], "source_document_id": "p03386", "source_text": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s346625011", "group_id": "codeNet:p03386", "input_text": "INTEGER(16) A,B,K,AKI\nREAD*,A,B,K\nDO I=0,K-1\n AKI=A+I\n IF(A+I>B)EXIT\n PRINT\"(I0)\",A+I\nEND DO\nDO I=1,K\n IF(B-K+I<=AKI)CYCLE\n PRINT\"(I0)\",B-K+I\nEND DO \nEND", "language": "Fortran", "metadata": {"date": 1551844883, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03386.html", "problem_id": "p03386", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03386/input.txt", "sample_output_relpath": "derived/input_output/data/p03386/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03386/Fortran/s346625011.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346625011", "user_id": "u598073939"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "INTEGER(16) A,B,K,AKI\nREAD*,A,B,K\nDO I=0,K-1\n AKI=A+I\n IF(A+I>B)EXIT\n PRINT\"(I0)\",A+I\nEND DO\nDO I=1,K\n IF(B-K+I<=AKI)CYCLE\n PRINT\"(I0)\",B-K+I\nEND DO \nEND", "problem_context": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "sample_input": "3 8 2\n"}, "reference_outputs": ["3\n4\n7\n8\n"], "source_document_id": "p03386", "source_text": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 159, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s934970618", "group_id": "codeNet:p03387", "input_text": "read*,i,j,k\nif(j y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "sample_input": "atcoder\n"}, "reference_outputs": ["atcoderb\n"], "source_document_id": "p03393", "source_text": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 946, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s340531481", "group_id": "codeNet:p03393", "input_text": "program test\nimplicit none\ncharacter*26 :: s1\ncharacter*26 :: s2 = 'abcdefghijklmnopqrstuvwxyz'\ninteger :: i,max_i=0\n\nread(*,*) s1 \n\nif(s1 == 'zyxwvutsrqponmlkjihgfedcba') then\n write(*,*) -1\nelse if (len_trim(s1) < 26) then\n write(*,*) trim(s1)//s2(verify(s2,s1):verify(s2,s1))\nelse\n do i = 1,25\n if(llt(s1(i:i),s1(i+1:i+1))) then\n max_i = i\n endif\n end do\n write(*,*) s1(1:max_i-1),s2(scan(s2,s1(max_i+1:26)):scan(s2,s1(max_i+1:26)))\nend if\nend program", "language": "Fortran", "metadata": {"date": 1524949118, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03393.html", "problem_id": "p03393", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03393/input.txt", "sample_output_relpath": "derived/input_output/data/p03393/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03393/Fortran/s340531481.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s340531481", "user_id": "u454703763"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "program test\nimplicit none\ncharacter*26 :: s1\ncharacter*26 :: s2 = 'abcdefghijklmnopqrstuvwxyz'\ninteger :: i,max_i=0\n\nread(*,*) s1 \n\nif(s1 == 'zyxwvutsrqponmlkjihgfedcba') then\n write(*,*) -1\nelse if (len_trim(s1) < 26) then\n write(*,*) trim(s1)//s2(verify(s2,s1):verify(s2,s1))\nelse\n do i = 1,25\n if(llt(s1(i:i),s1(i+1:i+1))) then\n max_i = i\n endif\n end do\n write(*,*) s1(1:max_i-1),s2(scan(s2,s1(max_i+1:26)):scan(s2,s1(max_i+1:26)))\nend if\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "sample_input": "atcoder\n"}, "reference_outputs": ["atcoderb\n"], "source_document_id": "p03393", "source_text": "Score : 300 points\n\nProblem Statement\n\nGotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.\n\nA word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, atcoder, zscoder and agc are diverse words while gotou and connect aren't diverse words.\n\nGiven a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 \\leq |S| \\leq 26\n\nS is a diverse word.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the next word that appears after S in the dictionary, or -1 if it doesn't exist.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\natcoderb\n\natcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nabcd\n\nSample Input 3\n\nzyxwvutsrqponmlkjihgfedcba\n\nSample Output 3\n\n-1\n\nThis is the lexicographically largest diverse word, so the answer is -1.\n\nSample Input 4\n\nabcdefghijklmnopqrstuvwzyx\n\nSample Output 4\n\nabcdefghijklmnopqrstuvx", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 470, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s952838354", "group_id": "codeNet:p03399", "input_text": "program main\n\timplicit none\n integer::a,b,c,d\n read(*,*)a,b,c,d\n write(*,*)min(a,b)+min(c,d)\n stop\nend program main", "language": "Fortran", "metadata": {"date": 1592629975, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Fortran/s952838354.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952838354", "user_id": "u884601206"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "program main\n\timplicit none\n integer::a,b,c,d\n read(*,*)a,b,c,d\n write(*,*)min(a,b)+min(c,d)\n stop\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2772}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s805090787", "group_id": "codeNet:p03399", "input_text": "integer a,b,c,d\nread*, a,b,c,d\nprint*, min(a,b)+min(c,d)\nend", "language": "Fortran", "metadata": {"date": 1571891136, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Fortran/s805090787.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805090787", "user_id": "u244203620"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "integer a,b,c,d\nread*, a,b,c,d\nprint*, min(a,b)+min(c,d)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s030370235", "group_id": "codeNet:p03399", "input_text": "integer :: a, b, c, d\nread *, a, b, c, d\nwrite (*,'(I0)') MIN(a, b, c, d)\nend", "language": "Fortran", "metadata": {"date": 1525777460, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03399.html", "problem_id": "p03399", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03399/input.txt", "sample_output_relpath": "derived/input_output/data/p03399/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03399/Fortran/s030370235.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s030370235", "user_id": "u917715822"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "integer :: a, b, c, d\nread *, a, b, c, d\nwrite (*,'(I0)') MIN(a, b, c, d)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "sample_input": "600\n300\n220\n420\n"}, "reference_outputs": ["520\n"], "source_document_id": "p03399", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou planned a trip using trains and buses.\nThe train fare will be A yen (the currency of Japan) if you buy ordinary tickets along the way, and B yen if you buy an unlimited ticket.\nSimilarly, the bus fare will be C yen if you buy ordinary tickets along the way, and D yen if you buy an unlimited ticket.\n\nFind the minimum total fare when the optimal choices are made for trains and buses.\n\nConstraints\n\n1 \\leq A \\leq 1 000\n\n1 \\leq B \\leq 1 000\n\n1 \\leq C \\leq 1 000\n\n1 \\leq D \\leq 1 000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\n\nOutput\n\nPrint the minimum total fare.\n\nSample Input 1\n\n600\n300\n220\n420\n\nSample Output 1\n\n520\n\nThe train fare will be 600 yen if you buy ordinary tickets, and 300 yen if you buy an unlimited ticket.\nThus, the optimal choice for trains is to buy an unlimited ticket for 300 yen.\nOn the other hand, the optimal choice for buses is to buy ordinary tickets for 220 yen.\n\nTherefore, the minimum total fare is 300 + 220 = 520 yen.\n\nSample Input 2\n\n555\n555\n400\n200\n\nSample Output 2\n\n755\n\nSample Input 3\n\n549\n817\n715\n603\n\nSample Output 3\n\n1152", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s327140939", "group_id": "codeNet:p03415", "input_text": "program ABC090A\n\tcharacter(3)::a,b,c\n\tread(5,*)a,b,c\n\tprint'(A)',a(1:1)//b(2:2)//c(3:3)\nend program ABC090A\n", "language": "Fortran", "metadata": {"date": 1575356594, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03415.html", "problem_id": "p03415", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03415/input.txt", "sample_output_relpath": "derived/input_output/data/p03415/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03415/Fortran/s327140939.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327140939", "user_id": "u414699019"}, "prompt_components": {"gold_output": "abc\n", "input_to_evaluate": "program ABC090A\n\tcharacter(3)::a,b,c\n\tread(5,*)a,b,c\n\tprint'(A)',a(1:1)//b(2:2)//c(3:3)\nend program ABC090A\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "sample_input": "ant\nobe\nrec\n"}, "reference_outputs": ["abc\n"], "source_document_id": "p03415", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s916361303", "group_id": "codeNet:p03417", "input_text": "program main\nimplicit None\n\tinteger::n,m\n\tread *,n,m\n\t\n\tif(n == 1 .or. m == 1)then\n\t\tprint \"(i0)\",n*m-2\n\t\tstop\n\tendif\n\t\n\tprint \"(i0)\",(n-2)*(m-2)\nend program main", "language": "Fortran", "metadata": {"date": 1545358144, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03417.html", "problem_id": "p03417", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03417/input.txt", "sample_output_relpath": "derived/input_output/data/p03417/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03417/Fortran/s916361303.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s916361303", "user_id": "u900266249"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "program main\nimplicit None\n\tinteger::n,m\n\tread *,n,m\n\t\n\tif(n == 1 .or. m == 1)then\n\t\tprint \"(i0)\",n*m-2\n\t\tstop\n\tendif\n\t\n\tprint \"(i0)\",(n-2)*(m-2)\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03417", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s724770648", "group_id": "codeNet:p03419", "input_text": "integer(8) n,m\nread *,n,m\nprint '(i0)',abs((n-2)*(m-2))\nend", "language": "Fortran", "metadata": {"date": 1565957781, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03419.html", "problem_id": "p03419", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03419/input.txt", "sample_output_relpath": "derived/input_output/data/p03419/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03419/Fortran/s724770648.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s724770648", "user_id": "u193540507"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "integer(8) n,m\nread *,n,m\nprint '(i0)',abs((n-2)*(m-2))\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03419", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s195881500", "group_id": "codeNet:p03419", "input_text": "integer N,M\nread*,N,M\nprint\"(i0)\",merge(max(m,n)-2,(N-2)*(M-2),(N-1)*(M-1)==0)+merge(2,0,m+n==2)\nend", "language": "Fortran", "metadata": {"date": 1558935582, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03419.html", "problem_id": "p03419", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03419/input.txt", "sample_output_relpath": "derived/input_output/data/p03419/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03419/Fortran/s195881500.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195881500", "user_id": "u598073939"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "integer N,M\nread*,N,M\nprint\"(i0)\",merge(max(m,n)-2,(N-2)*(M-2),(N-1)*(M-1)==0)+merge(2,0,m+n==2)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03419", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s830991631", "group_id": "codeNet:p03420", "input_text": "program arc091_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,b,ans=0\n\n read*, n,k\n\n do b = k+1,n\n ans=ans+(n/(b)*(b-k))+max((n-((n/b)*b+k)+1),0)\n end do\n if (k==0) ans=ans-n\n print'(i0)', ans\nend program arc091_d", "language": "Fortran", "metadata": {"date": 1591986923, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03420.html", "problem_id": "p03420", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03420/input.txt", "sample_output_relpath": "derived/input_output/data/p03420/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03420/Fortran/s830991631.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s830991631", "user_id": "u234636620"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program arc091_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,k,b,ans=0\n\n read*, n,k\n\n do b = k+1,n\n ans=ans+(n/(b)*(b-k))+max((n-((n/b)*b+k)+1),0)\n end do\n if (k==0) ans=ans-n\n print'(i0)', ans\nend program arc091_d", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "sample_input": "5 2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03420", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi had a pair of two positive integers not exceeding N, (a,b), which he has forgotten.\nHe remembers that the remainder of a divided by b was greater than or equal to K.\nFind the number of possible pairs that he may have had.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N-1\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of possible pairs that he may have had.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n7\n\nThere are seven possible pairs: (2,3),(5,3),(2,4),(3,4),(2,5),(3,5) and (4,5).\n\nSample Input 2\n\n10 0\n\nSample Output 2\n\n100\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n287927211", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s397299647", "group_id": "codeNet:p03422", "input_text": "program strange_nim\n implicit none\n integer :: n, a, k, d, m, i, g = 0\n read(*,*) n\n do i = 1, n\n read(*,*) a, k\n do\n d = a/k\n m = mod(a,k)\n if (m == 0) exit\n a = a-(m+d)/(d+1)*(d+1)\n end do\n g = xor(g,d)\n end do\n if (g == 0) then\n write(*,'(a)') \"Aoki\"\n else\n write(*,'(a)') \"Takahashi\"\n end if\nend program strange_nim", "language": "Fortran", "metadata": {"date": 1568178818, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03422.html", "problem_id": "p03422", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03422/input.txt", "sample_output_relpath": "derived/input_output/data/p03422/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03422/Fortran/s397299647.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397299647", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Aoki\n", "input_to_evaluate": "program strange_nim\n implicit none\n integer :: n, a, k, d, m, i, g = 0\n read(*,*) n\n do i = 1, n\n read(*,*) a, k\n do\n d = a/k\n m = mod(a,k)\n if (m == 0) exit\n a = a-(m+d)/(d+1)*(d+1)\n end do\n g = xor(g,d)\n end do\n if (g == 0) then\n write(*,'(a)') \"Aoki\"\n else\n write(*,'(a)') \"Takahashi\"\n end if\nend program strange_nim", "problem_context": "Score : 900 points\n\nProblem Statement\n\nTakahashi and Aoki are playing a stone-taking game. Initially, there are N piles of stones, and the i-th pile contains A_i stones and has an associated integer K_i.\n\nStarting from Takahashi, Takahashi and Aoki take alternate turns to perform the following operation:\n\nChoose a pile. If the i-th pile is selected and there are X stones left in the pile, remove some number of stones between 1 and floor(X/K_i) (inclusive) from the pile.\n\nThe player who first becomes unable to perform the operation loses the game. Assuming that both players play optimally, determine the winner of the game.\nHere, floor(x) represents the largest integer not greater than x.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i,K_i \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 K_1\n:\nA_N K_N\n\nOutput\n\nIf Takahashi will win, print Takahashi; if Aoki will win, print Aoki.\n\nSample Input 1\n\n2\n5 2\n3 3\n\nSample Output 1\n\nAoki\n\nInitially, from the first pile at most floor(5/2)=2 stones can be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nIf Takahashi first takes two stones from the first pile, from the first pile at most floor(3/2)=1 stone can now be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nThen, if Aoki takes one stone from the second pile, from the first pile at most floor(3/2)=1 stone can be removed at a time, and from the second pile no more stones can be removed (since floor(2/3)=0).\n\nThen, if Takahashi takes one stone from the first pile, from the first pile at most floor(2/2)=1 stone can now be removed at a time, and from the second pile no more stones can be removed.\n\nThen, if Aoki takes one stone from the first pile, from the first pile at most floor(1/2)=0 stones can now be removed at a time, and from the second pile no more stones can be removed.\n\nNo more operation can be performed, thus Aoki wins. If Takahashi plays differently, Aoki can also win by play accordingly.\n\nSample Input 2\n\n3\n3 2\n4 3\n5 1\n\nSample Output 2\n\nTakahashi\n\nSample Input 3\n\n3\n28 3\n16 4\n19 2\n\nSample Output 3\n\nAoki\n\nSample Input 4\n\n4\n3141 59\n26535 897\n93 23\n8462 64\n\nSample Output 4\n\nTakahashi", "sample_input": "2\n5 2\n3 3\n"}, "reference_outputs": ["Aoki\n"], "source_document_id": "p03422", "source_text": "Score : 900 points\n\nProblem Statement\n\nTakahashi and Aoki are playing a stone-taking game. Initially, there are N piles of stones, and the i-th pile contains A_i stones and has an associated integer K_i.\n\nStarting from Takahashi, Takahashi and Aoki take alternate turns to perform the following operation:\n\nChoose a pile. If the i-th pile is selected and there are X stones left in the pile, remove some number of stones between 1 and floor(X/K_i) (inclusive) from the pile.\n\nThe player who first becomes unable to perform the operation loses the game. Assuming that both players play optimally, determine the winner of the game.\nHere, floor(x) represents the largest integer not greater than x.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i,K_i \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 K_1\n:\nA_N K_N\n\nOutput\n\nIf Takahashi will win, print Takahashi; if Aoki will win, print Aoki.\n\nSample Input 1\n\n2\n5 2\n3 3\n\nSample Output 1\n\nAoki\n\nInitially, from the first pile at most floor(5/2)=2 stones can be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nIf Takahashi first takes two stones from the first pile, from the first pile at most floor(3/2)=1 stone can now be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nThen, if Aoki takes one stone from the second pile, from the first pile at most floor(3/2)=1 stone can be removed at a time, and from the second pile no more stones can be removed (since floor(2/3)=0).\n\nThen, if Takahashi takes one stone from the first pile, from the first pile at most floor(2/2)=1 stone can now be removed at a time, and from the second pile no more stones can be removed.\n\nThen, if Aoki takes one stone from the first pile, from the first pile at most floor(1/2)=0 stones can now be removed at a time, and from the second pile no more stones can be removed.\n\nNo more operation can be performed, thus Aoki wins. If Takahashi plays differently, Aoki can also win by play accordingly.\n\nSample Input 2\n\n3\n3 2\n4 3\n5 1\n\nSample Output 2\n\nTakahashi\n\nSample Input 3\n\n3\n28 3\n16 4\n19 2\n\nSample Output 3\n\nAoki\n\nSample Input 4\n\n4\n3141 59\n26535 897\n93 23\n8462 64\n\nSample Output 4\n\nTakahashi", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 365, "cpu_time_ms": 34, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s256831546", "group_id": "codeNet:p03423", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n\n read*, n\n print'(i0)', n/3\nend program main", "language": "Fortran", "metadata": {"date": 1591399383, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03423.html", "problem_id": "p03423", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03423/input.txt", "sample_output_relpath": "derived/input_output/data/p03423/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03423/Fortran/s256831546.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s256831546", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n\n read*, n\n print'(i0)', n/3\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "sample_input": "8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03423", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s243325553", "group_id": "codeNet:p03424", "input_text": "IMPLICIT NONE\nINTEGER :: N, I\nCHARACTER,DIMENSION(100) :: C\nLOGICAL :: P = .false. , W = .false. , G = .false. , Y = .false.\n\nREAD*, N\nREAD*, C(1:N)\n\nDO I = 1, N \n IF ( C(I) == \"P\") THEN\n P = .true.\n ELSE IF (C(I) == \"W\") THEN\n W = .true.\n ELSE IF (C(I) == \"G\") THEN\n G = .true.\n ELSE IF (C(I) == \"Y\") THEN\n Y = .true.\n END IF\nEND DO\n\nIF (P .AND. W .AND. G .AND. Y) THEN\n PRINT*, \"Four\"\nELSE\n PRINT*, \"Three\"\nEND IF\n \nEND", "language": "Fortran", "metadata": {"date": 1598196055, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/Fortran/s243325553.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s243325553", "user_id": "u643827819"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "IMPLICIT NONE\nINTEGER :: N, I\nCHARACTER,DIMENSION(100) :: C\nLOGICAL :: P = .false. , W = .false. , G = .false. , Y = .false.\n\nREAD*, N\nREAD*, C(1:N)\n\nDO I = 1, N \n IF ( C(I) == \"P\") THEN\n P = .true.\n ELSE IF (C(I) == \"W\") THEN\n W = .true.\n ELSE IF (C(I) == \"G\") THEN\n G = .true.\n ELSE IF (C(I) == \"Y\") THEN\n Y = .true.\n END IF\nEND DO\n\nIF (P .AND. W .AND. G .AND. Y) THEN\n PRINT*, \"Four\"\nELSE\n PRINT*, \"Three\"\nEND IF\n \nEND", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 5, "memory_kb": 2636}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s289922314", "group_id": "codeNet:p03425", "input_text": "program probc\n implicit none\n integer::i,j,k,N\n integer(16)::ans,v(5)\n character(len=10)::S\n character::c(5) = (/\"M\",\"A\",\"R\",\"C\",\"H\"/)\n\n read(*,*) N\n v = 0\n do i = 1, N\n read(*,*) S\n do j = 1,5\n if(S(1:1) .eq. c(j)) then\n v(j) = v(j) + 1\n end if\n end do\n end do\n\n ans = 0\n do i = 1,3\n do j = 2,4\n do k = 3,5\n if(i < j .and. j < k)then\n ans = ans + v(i)*v(j)*v(k)\n end if\n end do\n end do\n end do\n\n write(*,*) ans\n stop\nend program", "language": "Fortran", "metadata": {"date": 1594069074, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03425.html", "problem_id": "p03425", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03425/input.txt", "sample_output_relpath": "derived/input_output/data/p03425/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03425/Fortran/s289922314.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289922314", "user_id": "u841856382"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program probc\n implicit none\n integer::i,j,k,N\n integer(16)::ans,v(5)\n character(len=10)::S\n character::c(5) = (/\"M\",\"A\",\"R\",\"C\",\"H\"/)\n\n read(*,*) N\n v = 0\n do i = 1, N\n read(*,*) S\n do j = 1,5\n if(S(1:1) .eq. c(j)) then\n v(j) = v(j) + 1\n end if\n end do\n end do\n\n ans = 0\n do i = 1,3\n do j = 2,4\n do k = 3,5\n if(i < j .and. j < k)then\n ans = ans + v(i)*v(j)*v(k)\n end if\n end do\n end do\n end do\n\n write(*,*) ans\n stop\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "sample_input": "5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03425", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 614, "cpu_time_ms": 44, "memory_kb": 2828}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s268082493", "group_id": "codeNet:p03425", "input_text": "program march\n implicit none\n integer :: n, i, j, k\n integer(8) :: cnt(5) = 0_8, ans = 0_8\n character(10) :: s\n read(*,*) n\n do i = 1, n\n read(*,*) s\n select case (s(1:1))\n case (\"M\")\n cnt(1) = cnt(1)+1_8\n case (\"A\")\n cnt(2) = cnt(2)+1_8\n case (\"R\")\n cnt(3) = cnt(3)+1_8\n case (\"C\")\n cnt(4) = cnt(4)+1_8\n case (\"H\")\n cnt(5) = cnt(5)+1_8\n end select\n end do\n do i = 1, 3\n do j = i+1, 4\n do k = j+1, 5\n ans = ans+cnt(i)*cnt(j)*cnt(k)\n end do\n end do\n end do\n write(*,'(i0)') ans\nend program march", "language": "Fortran", "metadata": {"date": 1568503809, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03425.html", "problem_id": "p03425", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03425/input.txt", "sample_output_relpath": "derived/input_output/data/p03425/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03425/Fortran/s268082493.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s268082493", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program march\n implicit none\n integer :: n, i, j, k\n integer(8) :: cnt(5) = 0_8, ans = 0_8\n character(10) :: s\n read(*,*) n\n do i = 1, n\n read(*,*) s\n select case (s(1:1))\n case (\"M\")\n cnt(1) = cnt(1)+1_8\n case (\"A\")\n cnt(2) = cnt(2)+1_8\n case (\"R\")\n cnt(3) = cnt(3)+1_8\n case (\"C\")\n cnt(4) = cnt(4)+1_8\n case (\"H\")\n cnt(5) = cnt(5)+1_8\n end select\n end do\n do i = 1, 3\n do j = i+1, 4\n do k = j+1, 5\n ans = ans+cnt(i)*cnt(j)*cnt(k)\n end do\n end do\n end do\n write(*,'(i0)') ans\nend program march", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "sample_input": "5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03425", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 576, "cpu_time_ms": 40, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s075659920", "group_id": "codeNet:p03427", "input_text": "program prob4\n implicit none\n integer(16)::N, M\n integer(16)::i,j,ans,com\n integer::v(17)\n read(*,*) N\n\n v = 0\n M = N\n do i = 16, 0, -1\n if(N >= 10**i) then\n v(i+1) = N/(10**i)\n N = N - N/(10**i) * 10**i\n end if\n end do\n\n ans = sum(v)\n do i = 17, 1, -1\n if(v(i) > 0)then\n j = i\n exit\n end if\n end do\n\n if(M/10 > 0)then\n if( M < 100)then\n if(M/10 > 2) then\n write(*,*) M/10 + 8\n else\n write(*,*) 9\n end if\n stop\n else\n if(v(j) + v(j-1) > 9) then\n ans = v(j) + v(j-1) + 9*(j-2)\n com = 0\n do i = 1, j-2\n com = v(i)*10**(i-1) + v(j-1)*10**(j-2) + v(j)*10**j\n end do\n if(com > M)then\n ans = ans - 1\n end if\n else if(v(j) > 1)then\n ans = v(j) - 1 + 9*(j-1)\n else\n if(sum(v) - 1 < 9*(j-1))then\n ans = 9*(j-1)\n end if\n end if\n end if\n end if\n\n \n write(*,*) ans\n stop\nend program", "language": "Fortran", "metadata": {"date": 1592619758, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03427.html", "problem_id": "p03427", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03427/input.txt", "sample_output_relpath": "derived/input_output/data/p03427/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03427/Fortran/s075659920.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s075659920", "user_id": "u841856382"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "program prob4\n implicit none\n integer(16)::N, M\n integer(16)::i,j,ans,com\n integer::v(17)\n read(*,*) N\n\n v = 0\n M = N\n do i = 16, 0, -1\n if(N >= 10**i) then\n v(i+1) = N/(10**i)\n N = N - N/(10**i) * 10**i\n end if\n end do\n\n ans = sum(v)\n do i = 17, 1, -1\n if(v(i) > 0)then\n j = i\n exit\n end if\n end do\n\n if(M/10 > 0)then\n if( M < 100)then\n if(M/10 > 2) then\n write(*,*) M/10 + 8\n else\n write(*,*) 9\n end if\n stop\n else\n if(v(j) + v(j-1) > 9) then\n ans = v(j) + v(j-1) + 9*(j-2)\n com = 0\n do i = 1, j-2\n com = v(i)*10**(i-1) + v(j-1)*10**(j-2) + v(j)*10**j\n end do\n if(com > M)then\n ans = ans - 1\n end if\n else if(v(j) > 1)then\n ans = v(j) - 1 + 9*(j-1)\n else\n if(sum(v) - 1 < 9*(j-1))then\n ans = 9*(j-1)\n end if\n end if\n end if\n end if\n\n \n write(*,*) ans\n stop\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "sample_input": "100\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03427", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 6, "memory_kb": 2836}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s375101101", "group_id": "codeNet:p03427", "input_text": "program digit\n\timplicit none\n character(len=17) :: n\n character(len=17),parameter :: q = '99999999999999999'\n integer :: j\n integer :: i, ans\n \n read(*,*) n\n read(n(1:1),*) j !最高位の数字\n \n i = len_trim(n) !桁数\n\n if ( i==1 ) then\n \twrite(*,*) n\n stop\n end if\n \n if ( n(2:i) == q(2:i) ) then\n \tans = 9*(i-1) + j \n write (*,*) ans\n stop\n end if\n \n ans = 9*(i-1) + j - 1\n write(*,*) ans\n stop\nend program digit", "language": "Fortran", "metadata": {"date": 1592619598, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03427.html", "problem_id": "p03427", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03427/input.txt", "sample_output_relpath": "derived/input_output/data/p03427/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03427/Fortran/s375101101.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375101101", "user_id": "u961266059"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "program digit\n\timplicit none\n character(len=17) :: n\n character(len=17),parameter :: q = '99999999999999999'\n integer :: j\n integer :: i, ans\n \n read(*,*) n\n read(n(1:1),*) j !最高位の数字\n \n i = len_trim(n) !桁数\n\n if ( i==1 ) then\n \twrite(*,*) n\n stop\n end if\n \n if ( n(2:i) == q(2:i) ) then\n \tans = 9*(i-1) + j \n write (*,*) ans\n stop\n end if\n \n ans = 9*(i-1) + j - 1\n write(*,*) ans\n stop\nend program digit", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "sample_input": "100\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03427", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 506, "cpu_time_ms": 3, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s317455883", "group_id": "codeNet:p03427", "input_text": "program main\n implicit none\n\n character(len=17) :: num\n integer, allocatable :: n(:)\n integer :: k, i, ans, end\n\n read(*,*) num\n k = len_trim(num)\n allocate(n(k))\n\n do i = 1, k\n read(num(i:i),*) n(i)\n end do\n\n end = 0\n ans = 0\n if(k == 1) then\n ans = n(1)\n else if(n(2) /= 9) then\n ans = 9 * (k-1) + (n(1) - 1)\n else\n ans = n(1)\n do i = 3, k\n if(n(i) == 9) then\n ans = ans + 9\n end = 1\n else\n ans = ans + 17 + 9 * (k - i)\n end = 0\n exit\n end if\n end do\n if(end == 1) then\n ans = ans + 9\n end if\n \n end if\n\n write(*,*) ans\n \n\n deallocate(n)\n\nend program main\n\n \n", "language": "Fortran", "metadata": {"date": 1592618104, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03427.html", "problem_id": "p03427", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03427/input.txt", "sample_output_relpath": "derived/input_output/data/p03427/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03427/Fortran/s317455883.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s317455883", "user_id": "u979474608"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "program main\n implicit none\n\n character(len=17) :: num\n integer, allocatable :: n(:)\n integer :: k, i, ans, end\n\n read(*,*) num\n k = len_trim(num)\n allocate(n(k))\n\n do i = 1, k\n read(num(i:i),*) n(i)\n end do\n\n end = 0\n ans = 0\n if(k == 1) then\n ans = n(1)\n else if(n(2) /= 9) then\n ans = 9 * (k-1) + (n(1) - 1)\n else\n ans = n(1)\n do i = 3, k\n if(n(i) == 9) then\n ans = ans + 9\n end = 1\n else\n ans = ans + 17 + 9 * (k - i)\n end = 0\n exit\n end if\n end do\n if(end == 1) then\n ans = ans + 9\n end if\n \n end if\n\n write(*,*) ans\n \n\n deallocate(n)\n\nend program main\n\n \n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "sample_input": "100\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03427", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 703, "cpu_time_ms": 5, "memory_kb": 2876}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s159720123", "group_id": "codeNet:p03427", "input_text": "program A819B\n implicit none\n integer(8)::i,ans,Nlen\n character(16)::N\n integer(8),allocatable,dimension(:)::A\n read*,N\n Nlen=len_trim(N)\n ans=0\n allocate(A(Nlen))\n do i=1,Nlen\n A(i)=ichar(N(i:i))-48\n ans=ans+A(i)\n end do\n\n if(ans==A(1)+9*(Nlen-1))then\n print'(i0)',ans\n else\n print'(i0)',A(1)+9*(Nlen-1)-1\n end if\nend program A819B", "language": "Fortran", "metadata": {"date": 1584632913, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03427.html", "problem_id": "p03427", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03427/input.txt", "sample_output_relpath": "derived/input_output/data/p03427/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03427/Fortran/s159720123.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s159720123", "user_id": "u414699019"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "program A819B\n implicit none\n integer(8)::i,ans,Nlen\n character(16)::N\n integer(8),allocatable,dimension(:)::A\n read*,N\n Nlen=len_trim(N)\n ans=0\n allocate(A(Nlen))\n do i=1,Nlen\n A(i)=ichar(N(i:i))-48\n ans=ans+A(i)\n end do\n\n if(ans==A(1)+9*(Nlen-1))then\n print'(i0)',ans\n else\n print'(i0)',A(1)+9*(Nlen-1)-1\n end if\nend program A819B", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "sample_input": "100\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03427", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 399, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s608244621", "group_id": "codeNet:p03433", "input_text": "program coin\n implicit NONE\n integer::n, a, m\n\n read*,n, a\n m=mod(n,500)\n if (m.le.a) then\n print*,\"Yes\"\n else\n print*,\"No\"\n end if\n\nend program coin\n", "language": "Fortran", "metadata": {"date": 1556562025, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03433.html", "problem_id": "p03433", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03433/input.txt", "sample_output_relpath": "derived/input_output/data/p03433/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03433/Fortran/s608244621.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s608244621", "user_id": "u665274802"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program coin\n implicit NONE\n integer::n, a, m\n\n read*,n, a\n m=mod(n,500)\n if (m.le.a) then\n print*,\"Yes\"\n else\n print*,\"No\"\n end if\n\nend program coin\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "sample_input": "2018\n218\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03433", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 163, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s315008310", "group_id": "codeNet:p03433", "input_text": "module ABC088\n\n\t! s to import\n\tuse, intrinsic :: iso_fortran_env\n\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\n\t! accessibility of s and s in this \n\tpublic :: ABC088_A\n\n\n\t! contained s and s are below\n\tcontains\n\n\n\tsubroutine ABC088_A\n\n\t\t! variables for this \n\t\tcharacter( len=3, kind=1 ) :: stat\n\t\tinteger( kind= INT16 ) :: N, A\n\n\t\t! STEP.01\n\t\t! read out the target positive integers\n\t\tread *, N\n\t\tread *, A\n\n\t\t! STEP.02\n\t\t! judge whether the target integer is the multiplie of 4 or not\n\t\tif( mod( N, 500 ) .le. A ) then\n\t\t\tstat = 'Yes'\n\t\telse\n\t\t\tstat = 'No'\n\t\tend if\n\n\t\t! STEP.03\n\t\t! output the result\n\t\twrite( unit=OUTPUT_UNIT, fmt='(A)', advance='yes' ) trim( stat )\n\n\t\t! STEP.END\n\t\treturn\n\n\tend subroutine ABC088_A\n\nend module ABC088\n\n\nprogram main\n\n\t! s to import\n\tuse, non_intrinsic :: ABC088\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\tcall ABC088_A\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1550898314, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03433.html", "problem_id": "p03433", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03433/input.txt", "sample_output_relpath": "derived/input_output/data/p03433/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03433/Fortran/s315008310.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s315008310", "user_id": "u484703930"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module ABC088\n\n\t! s to import\n\tuse, intrinsic :: iso_fortran_env\n\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\n\t! accessibility of s and s in this \n\tpublic :: ABC088_A\n\n\n\t! contained s and s are below\n\tcontains\n\n\n\tsubroutine ABC088_A\n\n\t\t! variables for this \n\t\tcharacter( len=3, kind=1 ) :: stat\n\t\tinteger( kind= INT16 ) :: N, A\n\n\t\t! STEP.01\n\t\t! read out the target positive integers\n\t\tread *, N\n\t\tread *, A\n\n\t\t! STEP.02\n\t\t! judge whether the target integer is the multiplie of 4 or not\n\t\tif( mod( N, 500 ) .le. A ) then\n\t\t\tstat = 'Yes'\n\t\telse\n\t\t\tstat = 'No'\n\t\tend if\n\n\t\t! STEP.03\n\t\t! output the result\n\t\twrite( unit=OUTPUT_UNIT, fmt='(A)', advance='yes' ) trim( stat )\n\n\t\t! STEP.END\n\t\treturn\n\n\tend subroutine ABC088_A\n\nend module ABC088\n\n\nprogram main\n\n\t! s to import\n\tuse, non_intrinsic :: ABC088\n\n\t! require all variables to be explicitly declared\n\timplicit none\n\n\tcall ABC088_A\n\n\nend program main\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "sample_input": "2018\n218\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03433", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1010, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s374882447", "group_id": "codeNet:p03434", "input_text": " PROGRAM cardGameForTwo\n IMPLICIT NONE\n INTEGER :: N\n INTEGER,ALLOCATABLE :: a(:)\n INTEGER :: buffer(2),ans,i,piyo, alice,bob\n LOGICAL :: flag\n \n READ*,N\n ALLOCATE( a(N) )\n READ*,a(:)\n \n DO while(.TRUE.)\n flag = .TRUE. \n DO i = 1,N-1\n IF(a(i)= j) exit\n t = a(i); a(i) = a(j); a(j) = t\n i=i+1\n j=j-1\n end do\n if (first < i - 1) call quicksort(a, first, i - 1)\n if (j + 1 < last) call quicksort(a, j + 1, last)\nend subroutine quicksort", "language": "Fortran", "metadata": {"date": 1519007121, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03434.html", "problem_id": "p03434", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03434/input.txt", "sample_output_relpath": "derived/input_output/data/p03434/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03434/Fortran/s978834271.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978834271", "user_id": "u177040005"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program probB\n implicit none\n integer n\n integer i,j,k,alice,bob\n integer,allocatable :: a(:),a_tmp(:)\n \n\n read(*,*) n\n allocate(a(n),a_tmp(n))\n read(*,*) a(1:n)\n\n a_tmp=a\n call quicksort(a_tmp,1,n)\n\n do i=1,n\n a(i)=a_tmp(n+1-i)\n end do\n\n alice=0\n bob=0\n\n do i=n,1,-1\n if(mod(i,2)==1) then\n alice=alice+a(i)\n else\n bob=bob+a(i)\n end if\n end do\n \n write(*,*) alice-bob\n \n \nend program probB\n\n\nrecursive subroutine quicksort(a, first, last)\n implicit none\n integer a(*)\n integer first, last\n integer i, j\n integer x, t\n\n x = a( (first+last) / 2 )\n i = first\n j = last\n do\n do while (a(i) < x)\n i=i+1\n end do\n do while (x < a(j))\n j=j-1\n end do\n if (i >= j) exit\n t = a(i); a(i) = a(j); a(j) = t\n i=i+1\n j=j-1\n end do\n if (first < i - 1) call quicksort(a, first, i - 1)\n if (j + 1 < last) call quicksort(a, j + 1, last)\nend subroutine quicksort", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have N cards. A number a_i is written on the i-th card.\n\nAlice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first.\n\nThe game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\na_i \\ (1 \\leq i \\leq N) is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint Alice's score minus Bob's score when both players take the optimal strategy to maximize their scores.\n\nSample Input 1\n\n2\n3 1\n\nSample Output 1\n\n2\n\nFirst, Alice will take the card with 3. Then, Bob will take the card with 1.\nThe difference of their scores will be 3 - 1 = 2.\n\nSample Input 2\n\n3\n2 7 4\n\nSample Output 2\n\n5\n\nFirst, Alice will take the card with 7. Then, Bob will take the card with 4. Lastly, Alice will take the card with 2. The difference of their scores will be 7 - 4 + 2 = 5. The difference of their scores will be 3 - 1 = 2.\n\nSample Input 3\n\n4\n20 18 2 18\n\nSample Output 3\n\n18", "sample_input": "2\n3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03434", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have N cards. A number a_i is written on the i-th card.\n\nAlice and Bob will play a game using these cards. In this game, Alice and Bob alternately take one card. Alice goes first.\n\nThe game ends when all the cards are taken by the two players, and the score of each player is the sum of the numbers written on the cards he/she has taken. When both players take the optimal strategy to maximize their scores, find Alice's score minus Bob's score.\n\nConstraints\n\nN is an integer between 1 and 100 (inclusive).\n\na_i \\ (1 \\leq i \\leq N) is an integer between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 a_3 ... a_N\n\nOutput\n\nPrint Alice's score minus Bob's score when both players take the optimal strategy to maximize their scores.\n\nSample Input 1\n\n2\n3 1\n\nSample Output 1\n\n2\n\nFirst, Alice will take the card with 3. Then, Bob will take the card with 1.\nThe difference of their scores will be 3 - 1 = 2.\n\nSample Input 2\n\n3\n2 7 4\n\nSample Output 2\n\n5\n\nFirst, Alice will take the card with 7. Then, Bob will take the card with 4. Lastly, Alice will take the card with 2. The difference of their scores will be 7 - 4 + 2 = 5. The difference of their scores will be 3 - 1 = 2.\n\nSample Input 3\n\n4\n20 18 2 18\n\nSample Output 3\n\n18", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 953, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s166547967", "group_id": "codeNet:p03435", "input_text": "program ABC088C\n implicit none\n integer(8)::C(3,3),i,j,A(3)\n read*,C\n A(1)=C(1,1)+C(1,2)-2*C(1,3)\n A(2)=C(2,1)+C(2,2)-2*C(2,3)\n A(3)=C(3,1)+C(3,2)-2*C(3,3)\n if(A(1)==A(2).and.A(2)==A(3))then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\nend program ABC088C", "language": "Fortran", "metadata": {"date": 1597352663, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03435.html", "problem_id": "p03435", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03435/input.txt", "sample_output_relpath": "derived/input_output/data/p03435/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03435/Fortran/s166547967.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166547967", "user_id": "u414699019"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC088C\n implicit none\n integer(8)::C(3,3),i,j,A(3)\n read*,C\n A(1)=C(1,1)+C(1,2)-2*C(1,3)\n A(2)=C(2,1)+C(2,2)-2*C(2,3)\n A(3)=C(3,1)+C(3,2)-2*C(3,3)\n if(A(1)==A(2).and.A(2)==A(3))then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\nend program ABC088C", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a 3 \\times 3 grid. A number c_{i, j} is written in the square (i, j), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nAccording to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3 whose values are fixed, and the number written in the square (i, j) is equal to a_i + b_j.\n\nDetermine if he is correct.\n\nConstraints\n\nc_{i, j} \\ (1 \\leq i \\leq 3, 1 \\leq j \\leq 3) is an integer between 0 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{1,1} c_{1,2} c_{1,3}\nc_{2,1} c_{2,2} c_{2,3}\nc_{3,1} c_{3,2} c_{3,3}\n\nOutput\n\nIf Takahashi's statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 0 1\n2 1 2\n1 0 1\n\nSample Output 1\n\nYes\n\nTakahashi is correct, since there are possible sets of integers such as: a_1=0,a_2=1,a_3=0,b_1=1,b_2=0,b_3=1.\n\nSample Input 2\n\n2 2 2\n2 1 2\n2 2 2\n\nSample Output 2\n\nNo\n\nTakahashi is incorrect in this case.\n\nSample Input 3\n\n0 8 8\n0 8 8\n0 8 8\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1 8 6\n2 9 7\n0 7 7\n\nSample Output 4\n\nNo", "sample_input": "1 0 1\n2 1 2\n1 0 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03435", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a 3 \\times 3 grid. A number c_{i, j} is written in the square (i, j), where (i, j) denotes the square at the i-th row from the top and the j-th column from the left.\n\nAccording to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3 whose values are fixed, and the number written in the square (i, j) is equal to a_i + b_j.\n\nDetermine if he is correct.\n\nConstraints\n\nc_{i, j} \\ (1 \\leq i \\leq 3, 1 \\leq j \\leq 3) is an integer between 0 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{1,1} c_{1,2} c_{1,3}\nc_{2,1} c_{2,2} c_{2,3}\nc_{3,1} c_{3,2} c_{3,3}\n\nOutput\n\nIf Takahashi's statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 0 1\n2 1 2\n1 0 1\n\nSample Output 1\n\nYes\n\nTakahashi is correct, since there are possible sets of integers such as: a_1=0,a_2=1,a_3=0,b_1=1,b_2=0,b_3=1.\n\nSample Input 2\n\n2 2 2\n2 1 2\n2 2 2\n\nSample Output 2\n\nNo\n\nTakahashi is incorrect in this case.\n\nSample Input 3\n\n0 8 8\n0 8 8\n0 8 8\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n1 8 6\n2 9 7\n0 7 7\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 2888}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s970627174", "group_id": "codeNet:p03436", "input_text": "module mod_que\n type queue\n integer,pointer:: v(:)\n integer(4):: i=0\n end type\ncontains\n subroutine que_init(q)\n type(queue):: q\n allocate(q%v(1))\n end subroutine\n\n subroutine que(q,num)\n type(queue):: q\n integer(4):: num\n\n q%i=q%i+1\n if (q%i > size(q%v)) call add(q)\n q%v(q%i) = num\n end subroutine\n\n subroutine add(q)\n type(queue):: q\n integer(4),pointer:: tmp(:)\n integer(4):: l\n\n l = size(q%v)\n allocate(tmp(l))\n tmp(1:l) = q%v(1:l)\n deallocate(q%v)\n allocate(q%v(2*l))\n q%v(1:l) = tmp(1:l)\n deallocate(tmp)\n end subroutine\n\n function deque(q) result(ret)\n type(queue):: q\n integer(4):: ret\n\n ret = q%v(1)\n q%i=q%i-1\n q%v(1:q%i) = q%v(2:q%i+1)\n end function\nend module mod_que\n\n\nprogram name\n use mod_que\n implicit none\n integer(4):: h,w\n integer(4),allocatable:: dtc(:,:)\n integer(4):: i,j, nx,ny, dx,dy\n integer(4):: black_num\n character(1),allocatable:: c(:,:)\n character(:),allocatable:: inpt_c\n type(queue):: x,y\n call que_init(x)\n call que_init(y)\n read*, h,w\n\n allocate(dtc(w,h), c(0:w+1,0:h+1))\n allocate(character(w):: inpt_c)\n black_num = 0\n do i=1,h\n read*, inpt_c(:)\n do j=1,w\n c(j,i) = inpt_c(j:j)\n if (c(j,i) == '#') black_num=black_num+1\n end do\n end do\n\n c(:,0) = '#'\n c(:,h+1) = '#'\n c(0,:) = '#'\n c(w+1,:) = '#'\n\n call que(x,1)\n call que(y,1)\n dtc(:,:) = -1\n dtc(1,1) = 1\n\n do while(x%i > 0)\n nx = deque(x)\n ny = deque(y)\n do dx=-1,1\n do dy=-1,1\n if (abs(dx) == abs(dy)) cycle\n if (c(nx+dx,ny+dy) == '#') cycle\n if (dtc(nx+dx, ny+dy) == -1) then\n call que(x,nx+dx)\n call que(y,ny+dy)\n dtc(nx+dx,ny+dy) = dtc(nx,ny)+1\n else if (dtc(nx+dx,ny+dy) > dtc(nx,ny)+1) then\n call que(x,nx+dx)\n call que(y,ny+dy)\n dtc(nx+dx,ny+dy) = dtc(nx,ny)+1\n end if\n end do\n end do\n end do\n\n if (dtc(w,h) == -1) then\n print*, -1\n else\n print*, w*h - dtc(w,h) - black_num\n end if\nend program name", "language": "Fortran", "metadata": {"date": 1586459123, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03436.html", "problem_id": "p03436", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03436/input.txt", "sample_output_relpath": "derived/input_output/data/p03436/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03436/Fortran/s970627174.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970627174", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module mod_que\n type queue\n integer,pointer:: v(:)\n integer(4):: i=0\n end type\ncontains\n subroutine que_init(q)\n type(queue):: q\n allocate(q%v(1))\n end subroutine\n\n subroutine que(q,num)\n type(queue):: q\n integer(4):: num\n\n q%i=q%i+1\n if (q%i > size(q%v)) call add(q)\n q%v(q%i) = num\n end subroutine\n\n subroutine add(q)\n type(queue):: q\n integer(4),pointer:: tmp(:)\n integer(4):: l\n\n l = size(q%v)\n allocate(tmp(l))\n tmp(1:l) = q%v(1:l)\n deallocate(q%v)\n allocate(q%v(2*l))\n q%v(1:l) = tmp(1:l)\n deallocate(tmp)\n end subroutine\n\n function deque(q) result(ret)\n type(queue):: q\n integer(4):: ret\n\n ret = q%v(1)\n q%i=q%i-1\n q%v(1:q%i) = q%v(2:q%i+1)\n end function\nend module mod_que\n\n\nprogram name\n use mod_que\n implicit none\n integer(4):: h,w\n integer(4),allocatable:: dtc(:,:)\n integer(4):: i,j, nx,ny, dx,dy\n integer(4):: black_num\n character(1),allocatable:: c(:,:)\n character(:),allocatable:: inpt_c\n type(queue):: x,y\n call que_init(x)\n call que_init(y)\n read*, h,w\n\n allocate(dtc(w,h), c(0:w+1,0:h+1))\n allocate(character(w):: inpt_c)\n black_num = 0\n do i=1,h\n read*, inpt_c(:)\n do j=1,w\n c(j,i) = inpt_c(j:j)\n if (c(j,i) == '#') black_num=black_num+1\n end do\n end do\n\n c(:,0) = '#'\n c(:,h+1) = '#'\n c(0,:) = '#'\n c(w+1,:) = '#'\n\n call que(x,1)\n call que(y,1)\n dtc(:,:) = -1\n dtc(1,1) = 1\n\n do while(x%i > 0)\n nx = deque(x)\n ny = deque(y)\n do dx=-1,1\n do dy=-1,1\n if (abs(dx) == abs(dy)) cycle\n if (c(nx+dx,ny+dy) == '#') cycle\n if (dtc(nx+dx, ny+dy) == -1) then\n call que(x,nx+dx)\n call que(y,ny+dy)\n dtc(nx+dx,ny+dy) = dtc(nx,ny)+1\n else if (dtc(nx+dx,ny+dy) > dtc(nx,ny)+1) then\n call que(x,nx+dx)\n call que(y,ny+dy)\n dtc(nx+dx,ny+dy) = dtc(nx,ny)+1\n end if\n end do\n end do\n end do\n\n if (dtc(w,h) == -1) then\n print*, -1\n else\n print*, w*h - dtc(w,h) - black_num\n end if\nend program name", "problem_context": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1}s_{1, 2}s_{1, 3} ... s_{1, W}\ns_{2, 1}s_{2, 2}s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1}s_{H, 2}s_{H, 3} ... s_{H, W}\n\nOutput\n\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "sample_input": "3 3\n..#\n#..\n...\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03436", "source_text": "Score: 400 points\n\nProblem statement\n\nWe have an H \\times W grid whose squares are painted black or white. The square at the i-th row from the top and the j-th column from the left is denoted as (i, j).\n\nSnuke would like to play the following game on this grid. At the beginning of the game, there is a character called Kenus at square (1, 1). The player repeatedly moves Kenus up, down, left or right by one square. The game is completed when Kenus reaches square (H, W) passing only white squares.\n\nBefore Snuke starts the game, he can change the color of some of the white squares to black. However, he cannot change the color of square (1, 1) and (H, W). Also, changes of color must all be carried out before the beginning of the game.\n\nWhen the game is completed, Snuke's score will be the number of times he changed the color of a square before the beginning of the game. Find the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed, that is, Kenus can never reach square (H, W) regardless of how Snuke changes the color of the squares.\n\nThe color of the squares are given to you as characters s_{i, j}. If square (i, j) is initially painted by white, s_{i, j} is .; if square (i, j) is initially painted by black, s_{i, j} is #.\n\nConstraints\n\nH is an integer between 2 and 50 (inclusive).\n\nW is an integer between 2 and 50 (inclusive).\n\ns_{i, j} is . or # (1 \\leq i \\leq H, 1 \\leq j \\leq W).\n\ns_{1, 1} and s_{H, W} are ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1}s_{1, 2}s_{1, 3} ... s_{1, W}\ns_{2, 1}s_{2, 2}s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1}s_{H, 2}s_{H, 3} ... s_{H, W}\n\nOutput\n\nPrint the maximum possible score that Snuke can achieve, or print -1 if the game cannot be completed.\n\nSample Input 1\n\n3 3\n..#\n#..\n...\n\nSample Output 1\n\n2\n\nThe score 2 can be achieved by changing the color of squares as follows:\n\nSample Input 2\n\n10 37\n.....................................\n...#...####...####..###...###...###..\n..#.#..#...#.##....#...#.#...#.#...#.\n..#.#..#...#.#.....#...#.#...#.#...#.\n.#...#.#..##.#.....#...#.#.###.#.###.\n.#####.####..#.....#...#..##....##...\n.#...#.#...#.#.....#...#.#...#.#...#.\n.#...#.#...#.##....#...#.#...#.#...#.\n.#...#.####...####..###...###...###..\n.....................................\n\nSample Output 2\n\n209", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2379, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s633449205", "group_id": "codeNet:p03437", "input_text": "program main\n implicit none\n integer X, Y, i\n integer(8) N\n\n read(*,*) X, Y\n\n if(mod(X,Y)==0)then\n write(*,*) -1\n stop\n endif\n\n do i = 1, 1000000000\n N = X*i\n if(mod(N,Y)/=0)then\n write(*,*) N\n stop\n endif\n enddo\n\n write(*,*) -1\n\n\nend program", "language": "Fortran", "metadata": {"date": 1517718674, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03437.html", "problem_id": "p03437", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03437/input.txt", "sample_output_relpath": "derived/input_output/data/p03437/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03437/Fortran/s633449205.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633449205", "user_id": "u872669364"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "program main\n implicit none\n integer X, Y, i\n integer(8) N\n\n read(*,*) X, Y\n\n if(mod(X,Y)==0)then\n write(*,*) -1\n stop\n endif\n\n do i = 1, 1000000000\n N = X*i\n if(mod(N,Y)/=0)then\n write(*,*) N\n stop\n endif\n enddo\n\n write(*,*) -1\n\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers X and Y.\nIf there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it.\nIf it does not exist, print -1.\n\nConstraints\n\n1 ≤ X,Y ≤ 10^9\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\n16\n\nFor example, 16 is a multiple of 8 but not a multiple of 6.\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1\n\nA multiple of 3 is a multiple of 3.", "sample_input": "8 6\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03437", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers X and Y.\nIf there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it.\nIf it does not exist, print -1.\n\nConstraints\n\n1 ≤ X,Y ≤ 10^9\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\n16\n\nFor example, 16 is a multiple of 8 but not a multiple of 6.\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1\n\nA multiple of 3 is a multiple of 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 326, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s693620836", "group_id": "codeNet:p03438", "input_text": "program probB\n implicit none\n integer*8 n,i,j,pl,mi,tmp\n integer*8,allocatable :: a(:),b(:),del(:)\n\n read(*,*) n\n allocate(a(n),b(n),del(n))\n read(*,*) a\n read(*,*) b\n\n del(:)=b(:)-a(:)\n\n if(sum(del)<0) then\n write(*,*)'No'\n stop\n end if\n \n do i=1,n\n if(del(i)>0) then\n pl=pl+del(i)\n else\n mi=mi-del(i)\n end if\n end do\n\n\n tmp=1\n do i=1,n\n do while(del(i)<0)\n do j=tmp,n\n if(del(j)>0) then\n a(j)=a(j)+2\n b(i)=b(i)+1\n del(i)=b(i)-a(i)\n del(j)=b(j)-a(j)\n tmp=j\n if(sum(del)<0) then\n write(*,*)'No'\n stop\n end if\n exit\n end if\n end do\n if(sum(del)<0) then\n write(*,*)'No'\n stop\n end if\n end do\n end do\n\n write(*,*) 'Yes' \nend program probB\n", "language": "Fortran", "metadata": {"date": 1517721941, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03438.html", "problem_id": "p03438", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03438/input.txt", "sample_output_relpath": "derived/input_output/data/p03438/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03438/Fortran/s693620836.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s693620836", "user_id": "u177040005"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program probB\n implicit none\n integer*8 n,i,j,pl,mi,tmp\n integer*8,allocatable :: a(:),b(:),del(:)\n\n read(*,*) n\n allocate(a(n),b(n),del(n))\n read(*,*) a\n read(*,*) b\n\n del(:)=b(:)-a(:)\n\n if(sum(del)<0) then\n write(*,*)'No'\n stop\n end if\n \n do i=1,n\n if(del(i)>0) then\n pl=pl+del(i)\n else\n mi=mi-del(i)\n end if\n end do\n\n\n tmp=1\n do i=1,n\n do while(del(i)<0)\n do j=tmp,n\n if(del(j)>0) then\n a(j)=a(j)+2\n b(i)=b(i)+1\n del(i)=b(i)-a(i)\n del(j)=b(j)-a(j)\n tmp=j\n if(sum(del)<0) then\n write(*,*)'No'\n stop\n end if\n exit\n end if\n end do\n if(sum(del)<0) then\n write(*,*)'No'\n stop\n end if\n end do\n end do\n\n write(*,*) 'Yes' \nend program probB\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.\nDetermine if we can repeat the following operation zero or more times so that the sequences a and b become equal.\n\nOperation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:\n\nAdd 2 to a_i.\n\nAdd 1 to b_j.\n\nConstraints\n\n1 ≤ N ≤ 10 000\n\n0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\nb_1 b_2 .. b_N\n\nOutput\n\nIf we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 2 3\n5 2 2\n\nSample Output 1\n\nYes\n\nFor example, we can perform three operations as follows to do our job:\n\nFirst operation: i=1 and j=2. Now we have a = \\{3,2,3\\}, b = \\{5,3,2\\}.\n\nSecond operation: i=1 and j=2. Now we have a = \\{5,2,3\\}, b = \\{5,4,2\\}.\n\nThird operation: i=2 and j=3. Now we have a = \\{5,4,3\\}, b = \\{5,4,3\\}.\n\nSample Input 2\n\n5\n3 1 4 1 5\n2 7 1 8 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n2 7 1 8 2\n3 1 4 1 5\n\nSample Output 3\n\nNo", "sample_input": "3\n1 2 3\n5 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03438", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.\nDetermine if we can repeat the following operation zero or more times so that the sequences a and b become equal.\n\nOperation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:\n\nAdd 2 to a_i.\n\nAdd 1 to b_j.\n\nConstraints\n\n1 ≤ N ≤ 10 000\n\n0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\nb_1 b_2 .. b_N\n\nOutput\n\nIf we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 2 3\n5 2 2\n\nSample Output 1\n\nYes\n\nFor example, we can perform three operations as follows to do our job:\n\nFirst operation: i=1 and j=2. Now we have a = \\{3,2,3\\}, b = \\{5,3,2\\}.\n\nSecond operation: i=1 and j=2. Now we have a = \\{5,2,3\\}, b = \\{5,4,2\\}.\n\nThird operation: i=2 and j=3. Now we have a = \\{5,4,3\\}, b = \\{5,4,3\\}.\n\nSample Input 2\n\n5\n3 1 4 1 5\n2 7 1 8 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n2 7 1 8 2\n3 1 4 1 5\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 900, "cpu_time_ms": 2103, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s730379782", "group_id": "codeNet:p03447", "input_text": "integer a,b,c\nread*, a,b,c\nprint*, mod(a-b,c)\nend", "language": "Fortran", "metadata": {"date": 1571889609, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03447.html", "problem_id": "p03447", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03447/input.txt", "sample_output_relpath": "derived/input_output/data/p03447/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03447/Fortran/s730379782.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s730379782", "user_id": "u244203620"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "integer a,b,c\nread*, a,b,c\nprint*, mod(a-b,c)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou went shopping to buy cakes and donuts with X yen (the currency of Japan).\n\nFirst, you bought one cake for A yen at a cake shop.\nThen, you bought as many donuts as possible for B yen each, at a donut shop.\n\nHow much do you have left after shopping?\n\nConstraints\n\n1 \\leq A, B \\leq 1 000\n\nA + B \\leq X \\leq 10 000\n\nX, A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\nA\nB\n\nOutput\n\nPrint the amount you have left after shopping.\n\nSample Input 1\n\n1234\n150\n100\n\nSample Output 1\n\n84\n\nYou have 1234 - 150 = 1084 yen left after buying a cake.\nWith this amount, you can buy 10 donuts, after which you have 84 yen left.\n\nSample Input 2\n\n1000\n108\n108\n\nSample Output 2\n\n28\n\nSample Input 3\n\n579\n123\n456\n\nSample Output 3\n\n0\n\nSample Input 4\n\n7477\n549\n593\n\nSample Output 4\n\n405", "sample_input": "1234\n150\n100\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03447", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou went shopping to buy cakes and donuts with X yen (the currency of Japan).\n\nFirst, you bought one cake for A yen at a cake shop.\nThen, you bought as many donuts as possible for B yen each, at a donut shop.\n\nHow much do you have left after shopping?\n\nConstraints\n\n1 \\leq A, B \\leq 1 000\n\nA + B \\leq X \\leq 10 000\n\nX, A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\nA\nB\n\nOutput\n\nPrint the amount you have left after shopping.\n\nSample Input 1\n\n1234\n150\n100\n\nSample Output 1\n\n84\n\nYou have 1234 - 150 = 1084 yen left after buying a cake.\nWith this amount, you can buy 10 donuts, after which you have 84 yen left.\n\nSample Input 2\n\n1000\n108\n108\n\nSample Output 2\n\n28\n\nSample Input 3\n\n579\n123\n456\n\nSample Output 3\n\n0\n\nSample Input 4\n\n7477\n549\n593\n\nSample Output 4\n\n405", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 49, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s342890993", "group_id": "codeNet:p03447", "input_text": "program ABC_087_A_BuyingSweets\n implicit none\n integer A, B, X\n read(*, *) X, A, B\n write(*, *) mod(X - A, B) \nend program ABC_087_A_BuyingSweets", "language": "Fortran", "metadata": {"date": 1523084266, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03447.html", "problem_id": "p03447", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03447/input.txt", "sample_output_relpath": "derived/input_output/data/p03447/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03447/Fortran/s342890993.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s342890993", "user_id": "u728000113"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "program ABC_087_A_BuyingSweets\n implicit none\n integer A, B, X\n read(*, *) X, A, B\n write(*, *) mod(X - A, B) \nend program ABC_087_A_BuyingSweets", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou went shopping to buy cakes and donuts with X yen (the currency of Japan).\n\nFirst, you bought one cake for A yen at a cake shop.\nThen, you bought as many donuts as possible for B yen each, at a donut shop.\n\nHow much do you have left after shopping?\n\nConstraints\n\n1 \\leq A, B \\leq 1 000\n\nA + B \\leq X \\leq 10 000\n\nX, A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\nA\nB\n\nOutput\n\nPrint the amount you have left after shopping.\n\nSample Input 1\n\n1234\n150\n100\n\nSample Output 1\n\n84\n\nYou have 1234 - 150 = 1084 yen left after buying a cake.\nWith this amount, you can buy 10 donuts, after which you have 84 yen left.\n\nSample Input 2\n\n1000\n108\n108\n\nSample Output 2\n\n28\n\nSample Input 3\n\n579\n123\n456\n\nSample Output 3\n\n0\n\nSample Input 4\n\n7477\n549\n593\n\nSample Output 4\n\n405", "sample_input": "1234\n150\n100\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03447", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou went shopping to buy cakes and donuts with X yen (the currency of Japan).\n\nFirst, you bought one cake for A yen at a cake shop.\nThen, you bought as many donuts as possible for B yen each, at a donut shop.\n\nHow much do you have left after shopping?\n\nConstraints\n\n1 \\leq A, B \\leq 1 000\n\nA + B \\leq X \\leq 10 000\n\nX, A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\nA\nB\n\nOutput\n\nPrint the amount you have left after shopping.\n\nSample Input 1\n\n1234\n150\n100\n\nSample Output 1\n\n84\n\nYou have 1234 - 150 = 1084 yen left after buying a cake.\nWith this amount, you can buy 10 donuts, after which you have 84 yen left.\n\nSample Input 2\n\n1000\n108\n108\n\nSample Output 2\n\n28\n\nSample Input 3\n\n579\n123\n456\n\nSample Output 3\n\n0\n\nSample Input 4\n\n7477\n549\n593\n\nSample Output 4\n\n405", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s617292212", "group_id": "codeNet:p03449", "input_text": "program main\n\timplicit none\n integer::n,i,j\n integer,allocatable::a(:),b(:),c(:,:)\n read(*,*) n\n allocate(a(n))\n allocate(b(n))\n read(*,*) a\n read(*,*) b\n allocate(c(2,n))\n c(1,1)=a(1)\n do j=2,n\n c(1,j)=c(1,j-1)+a(j)\n end do\n c(2,1)=a(1)+b(1)\n do i=2,n\n \tc(2,i)=max(c(1,i),c(2,i-1))+b(i)\n end do\n write(*,*) c(2,n)\n deallocate(a)\n deallocate(b)\n deallocate(c)\n stop\nend program main\n\n\n", "language": "Fortran", "metadata": {"date": 1591406601, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03449.html", "problem_id": "p03449", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03449/input.txt", "sample_output_relpath": "derived/input_output/data/p03449/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03449/Fortran/s617292212.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s617292212", "user_id": "u884601206"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program main\n\timplicit none\n integer::n,i,j\n integer,allocatable::a(:),b(:),c(:,:)\n read(*,*) n\n allocate(a(n))\n allocate(b(n))\n read(*,*) a\n read(*,*) b\n allocate(c(2,n))\n c(1,1)=a(1)\n do j=2,n\n c(1,j)=c(1,j-1)+a(j)\n end do\n c(2,1)=a(1)+b(1)\n do i=2,n\n \tc(2,i)=max(c(1,i),c(2,i-1))+b(i)\n end do\n write(*,*) c(2,n)\n deallocate(a)\n deallocate(b)\n deallocate(c)\n stop\nend program main\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "sample_input": "5\n3 2 2 4 1\n1 2 2 2 1\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03449", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a 2 \\times N grid. We will denote the square at the i-th row and j-th column (1 \\leq i \\leq 2, 1 \\leq j \\leq N) as (i, j).\n\nYou are initially in the top-left square, (1, 1).\nYou will travel to the bottom-right square, (2, N), by repeatedly moving right or down.\n\nThe square (i, j) contains A_{i, j} candies.\nYou will collect all the candies you visit during the travel.\nThe top-left and bottom-right squares also contain candies, and you will also collect them.\n\nAt most how many candies can you collect when you choose the best way to travel?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_{i, j} \\leq 100 (1 \\leq i \\leq 2, 1 \\leq j \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n\nOutput\n\nPrint the maximum number of candies that can be collected.\n\nSample Input 1\n\n5\n3 2 2 4 1\n1 2 2 2 1\n\nSample Output 1\n\n14\n\nThe number of collected candies will be maximized when you:\n\nmove right three times, then move down once, then move right once.\n\nSample Input 2\n\n4\n1 1 1 1\n1 1 1 1\n\nSample Output 2\n\n5\n\nYou will always collect the same number of candies, regardless of how you travel.\n\nSample Input 3\n\n7\n3 3 4 5 4 5 3\n5 3 4 4 2 3 2\n\nSample Output 3\n\n29\n\nSample Input 4\n\n1\n2\n3\n\nSample Output 4\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 452, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s055359542", "group_id": "codeNet:p03450", "input_text": "module UnionFind_Potential\n\nimplicit none\ninteger,allocatable,dimension(:)::par\n!parentより\ninteger,allocatable,dimension(:)::diff_weight\n\ncontains\n\nrecursive function root(x) result(res)\n integer :: x,res,r\n r=par(x)\n if(par(r) /= r)then\n diff_weight(x)=diff_weight(x)+diff_weight(par(x))\n par(x)=root(r)\n endif\n res = r\nend function\n\nsubroutine unite(x,y,w)\n !x+w=yとなるように繋げます\n integer :: x,y,w,rx,ry,rw\n !rx,ryはそれぞれの根っこ\n !rwはrxとryの差分です\n \n rx = root(x);ry = root(y)\n \n !rx + weight(x) +w=ry+weight(y)から\n rw = w + weight(x)-weight(y)\n \n if(rx /= ry)then\n par(ry) = rx\n diff_weight(ry)=rw\n endif\nend subroutine\n\nfunction weight(x)\n integer::x,weight\n weight=root(x)\n weight=diff_weight(x)\nend function\n\nfunction diff(x,y)\n integer::x,y,diff\n diff=weight(y)-weight(x)\nend function\nend module UnionFind_Potential\n\nuse UnionFind_Potential\n\ninteger n,m\ninteger l,r,d\nread*,n,m\nallocate(par(n),diff_weight(n))\n\n!初期化\ndo i=1,n\n par(i)=i\nend do\ndiff_weight=0\n\ndo i=1,m\n read*,l,r,d\n \n if(root(l)==root(r))then\n if(diff(l,r)/=d)then\n print\"(A)\",\"No\"\n STOP\n end if\n else \n call unite(l,r,d)\n endif\nend do\n\nprint\"(A)\",\"Yes\"\n\nend ", "language": "Fortran", "metadata": {"date": 1561841986, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03450.html", "problem_id": "p03450", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03450/input.txt", "sample_output_relpath": "derived/input_output/data/p03450/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03450/Fortran/s055359542.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s055359542", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module UnionFind_Potential\n\nimplicit none\ninteger,allocatable,dimension(:)::par\n!parentより\ninteger,allocatable,dimension(:)::diff_weight\n\ncontains\n\nrecursive function root(x) result(res)\n integer :: x,res,r\n r=par(x)\n if(par(r) /= r)then\n diff_weight(x)=diff_weight(x)+diff_weight(par(x))\n par(x)=root(r)\n endif\n res = r\nend function\n\nsubroutine unite(x,y,w)\n !x+w=yとなるように繋げます\n integer :: x,y,w,rx,ry,rw\n !rx,ryはそれぞれの根っこ\n !rwはrxとryの差分です\n \n rx = root(x);ry = root(y)\n \n !rx + weight(x) +w=ry+weight(y)から\n rw = w + weight(x)-weight(y)\n \n if(rx /= ry)then\n par(ry) = rx\n diff_weight(ry)=rw\n endif\nend subroutine\n\nfunction weight(x)\n integer::x,weight\n weight=root(x)\n weight=diff_weight(x)\nend function\n\nfunction diff(x,y)\n integer::x,y,diff\n diff=weight(y)-weight(x)\nend function\nend module UnionFind_Potential\n\nuse UnionFind_Potential\n\ninteger n,m\ninteger l,r,d\nread*,n,m\nallocate(par(n),diff_weight(n))\n\n!初期化\ndo i=1,n\n par(i)=i\nend do\ndiff_weight=0\n\ndo i=1,m\n read*,l,r,d\n \n if(root(l)==root(r))then\n if(diff(l,r)/=d)then\n print\"(A)\",\"No\"\n STOP\n end if\n else \n call unite(l,r,d)\n endif\nend do\n\nprint\"(A)\",\"Yes\"\n\nend ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "sample_input": "3 3\n1 2 1\n2 3 1\n1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03450", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1245, "cpu_time_ms": 326, "memory_kb": 263552}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s706690205", "group_id": "codeNet:p03450", "input_text": "module UnionFind_Potential\n\nimplicit none\ninteger,allocatable,dimension(:)::par\n!parentより\ninteger,allocatable,dimension(:)::diff_weight\n\ncontains\n\nrecursive function root(x) result(res)\n integer :: x,res\n\n if(par(x) /= x)then\n diff_weight(x)=diff_weight(x)+diff_weight(par(x))\n par(x) = root(par(x))\n endif\n res = par(x)\nend function\n\nsubroutine unite(x,y,w)\n !x+w=yとなるように繋げます\n integer :: x,y,w,rx,ry,rw\n !rx,ryはそれぞれの根っこ\n !rwはrxとryの差分です\n \n rx = root(x);ry = root(y)\n \n !rx + weight(x) +w=ry+weight(y)から\n rw = w + weight(x)-weight(y)\n \n if(rx /= ry)then\n par(ry) = rx\n diff_weight(ry)=rw\n endif\nend subroutine\n\nfunction weight(x)\n integer::x,weight\n if(root(x)==x)then\n weight=0\n else\n weight=diff_weight(x)\n endif\nend function\n\nfunction diff(x,y)\n integer::x,y,diff\n diff=weight(y)-weight(x)\nend function\nend module UnionFind_Potential\n\nuse UnionFind_Potential\n\ninteger n,m\ninteger l,r,d\nread*,n,m\nallocate(par(n),diff_weight(n))\n\n!初期化\ndo i=1,n\n par(i)=i\nend do\ndiff_weight=0\n\ndo i=1,m\n read*,l,r,d\n if(root(l)/=root(r))then\n call unite(l,r,d)\n else\n if(diff(l,r)/=d)then\n print\"(A)\",\"No\"\n STOP\n end if\n endif\nend do\n\nprint\"(A)\",\"Yes\"\n\nend ", "language": "Fortran", "metadata": {"date": 1561836078, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03450.html", "problem_id": "p03450", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03450/input.txt", "sample_output_relpath": "derived/input_output/data/p03450/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03450/Fortran/s706690205.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s706690205", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module UnionFind_Potential\n\nimplicit none\ninteger,allocatable,dimension(:)::par\n!parentより\ninteger,allocatable,dimension(:)::diff_weight\n\ncontains\n\nrecursive function root(x) result(res)\n integer :: x,res\n\n if(par(x) /= x)then\n diff_weight(x)=diff_weight(x)+diff_weight(par(x))\n par(x) = root(par(x))\n endif\n res = par(x)\nend function\n\nsubroutine unite(x,y,w)\n !x+w=yとなるように繋げます\n integer :: x,y,w,rx,ry,rw\n !rx,ryはそれぞれの根っこ\n !rwはrxとryの差分です\n \n rx = root(x);ry = root(y)\n \n !rx + weight(x) +w=ry+weight(y)から\n rw = w + weight(x)-weight(y)\n \n if(rx /= ry)then\n par(ry) = rx\n diff_weight(ry)=rw\n endif\nend subroutine\n\nfunction weight(x)\n integer::x,weight\n if(root(x)==x)then\n weight=0\n else\n weight=diff_weight(x)\n endif\nend function\n\nfunction diff(x,y)\n integer::x,y,diff\n diff=weight(y)-weight(x)\nend function\nend module UnionFind_Potential\n\nuse UnionFind_Potential\n\ninteger n,m\ninteger l,r,d\nread*,n,m\nallocate(par(n),diff_weight(n))\n\n!初期化\ndo i=1,n\n par(i)=i\nend do\ndiff_weight=0\n\ndo i=1,m\n read*,l,r,d\n if(root(l)/=root(r))then\n call unite(l,r,d)\n else\n if(diff(l,r)/=d)then\n print\"(A)\",\"No\"\n STOP\n end if\n endif\nend do\n\nprint\"(A)\",\"Yes\"\n\nend ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "sample_input": "3 3\n1 2 1\n2 3 1\n1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03450", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1271, "cpu_time_ms": 56, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s554594740", "group_id": "codeNet:p03456", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,a,b,k\n \n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) a,b\n k=int(log10(real(b)))+1\n m=a*10**k+b\n if (int(sqrt(real(m)))**2==m)then\n write(*,*) 'Yes'\n else\n write(*,*)'No'\n end if\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1592094363, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03456/input.txt", "sample_output_relpath": "derived/input_output/data/p03456/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03456/Fortran/s554594740.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s554594740", "user_id": "u713568912"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,a,b,k\n \n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) a,b\n k=int(log10(real(b)))+1\n m=a*10**k+b\n if (int(sqrt(real(m)))**2==m)then\n write(*,*) 'Yes'\n else\n write(*,*)'No'\n end if\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s369999231", "group_id": "codeNet:p03456", "input_text": "program name\n\n implicit none\n character(3) a,b\n character(6) c\n integer num,i\n integer hei(100)\n do i = 1, 100, 1\n hei(i) = i**2\n end do\n read*, a,b\n a = a(1:len_trim(a))\n b = b(1:len_trim(b))\n c = a//b\n read (c,*) num\n if ( count(hei==num)==1 ) then\n print*, \"Yes\"\n else\n print*, \"No\"\n end if\n\nend program", "language": "Fortran", "metadata": {"date": 1560912848, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03456/input.txt", "sample_output_relpath": "derived/input_output/data/p03456/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03456/Fortran/s369999231.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369999231", "user_id": "u762420987"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program name\n\n implicit none\n character(3) a,b\n character(6) c\n integer num,i\n integer hei(100)\n do i = 1, 100, 1\n hei(i) = i**2\n end do\n read*, a,b\n a = a(1:len_trim(a))\n b = b(1:len_trim(b))\n c = a//b\n read (c,*) num\n if ( count(hei==num)==1 ) then\n print*, \"Yes\"\n else\n print*, \"No\"\n end if\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s527227421", "group_id": "codeNet:p03456", "input_text": "CHARACTER(20) S,T,U\nREAL N\nREAD*,S,T\nU=TRIM(S)//TRIM(T)\nREAD(U,*) N\nPRINT\"(A)\",MERGE(\"Yes\",\" No\",FLOOR(SQRT(N))**2==N)\nEND", "language": "Fortran", "metadata": {"date": 1551796608, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03456/input.txt", "sample_output_relpath": "derived/input_output/data/p03456/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03456/Fortran/s527227421.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s527227421", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "CHARACTER(20) S,T,U\nREAL N\nREAD*,S,T\nU=TRIM(S)//TRIM(T)\nREAD(U,*) N\nPRINT\"(A)\",MERGE(\"Yes\",\" No\",FLOOR(SQRT(N))**2==N)\nEND", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s697747472", "group_id": "codeNet:p03457", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,a,b,t,a0,b0,t0\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) n\n a0=0\n b0=0\n t0=0\n do i=1,n\n read(*,*)t,a,b\n m=abs(a-a0)+abs(b-b0)\n if (m>t-t0)then\n write(*,*)'No'\n stop\n elseif(mod(m,2)/=mod(t-t0,2))then\n write(*,*)'No'\n stop\n end if\n a0=a\n b0=b\n t0=t\n end do\n\n\n \n write(*,*) 'Yes'\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1594511855, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03457/input.txt", "sample_output_relpath": "derived/input_output/data/p03457/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03457/Fortran/s697747472.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s697747472", "user_id": "u713568912"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,a,b,t,a0,b0,t0\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) n\n a0=0\n b0=0\n t0=0\n do i=1,n\n read(*,*)t,a,b\n m=abs(a-a0)+abs(b-b0)\n if (m>t-t0)then\n write(*,*)'No'\n stop\n elseif(mod(m,2)/=mod(t-t0,2))then\n write(*,*)'No'\n stop\n end if\n a0=a\n b0=b\n t0=t\n end do\n\n\n \n write(*,*) 'Yes'\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "sample_input": "2\n3 1 2\n6 1 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03457", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 67, "memory_kb": 2796}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s484798667", "group_id": "codeNet:p03457", "input_text": "program main\n integer, allocatable :: i(:, :)\n read (*, *) n\n allocate(i(3, 0:n))\n i(:, 0) = (/0, 0, 0/)\n read (*, *) i(:, 1:n)\n do k = 1, n\n jx = abs(i(2, k) - i(2, k - 1)) + abs(i(3, k) - i(3, k - 1))\n jt = i(1, k) - i(1, k - 1)\n if (jx > jt .or. ibits(jx, 0, 1) /= ibits(jt, 0, 1)) then\n write (*, *) \"No\"\n stop\n endif\n enddo\n write (*, *) \"Yes\"\nend\n", "language": "Fortran", "metadata": {"date": 1588452549, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03457/input.txt", "sample_output_relpath": "derived/input_output/data/p03457/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03457/Fortran/s484798667.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s484798667", "user_id": "u975073965"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n integer, allocatable :: i(:, :)\n read (*, *) n\n allocate(i(3, 0:n))\n i(:, 0) = (/0, 0, 0/)\n read (*, *) i(:, 1:n)\n do k = 1, n\n jx = abs(i(2, k) - i(2, k - 1)) + abs(i(3, k) - i(3, k - 1))\n jt = i(1, k) - i(1, k - 1)\n if (jx > jt .or. ibits(jx, 0, 1) /= ibits(jt, 0, 1)) then\n write (*, *) \"No\"\n stop\n endif\n enddo\n write (*, *) \"Yes\"\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "sample_input": "2\n3 1 2\n6 1 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03457", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 383, "cpu_time_ms": 68, "memory_kb": 1920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s746312802", "group_id": "codeNet:p03458", "input_text": "implicit none\n\ninteger:: n,i,j,k,count,jj,count_max\ncharacter,allocatable,dimension(:) :: c*1\ninteger,allocatable,dimension(:):: x,y\nread (5,*) n,k\n\nallocate(x(n))\nallocate(y(n))\nallocate(c(n))\n\ndo i=1,n\n read(5,*) x(i),y(i),c(i)\nenddo\n\ndo j=1,int(k/2)+1\n do jj=1,int(k/2)+1\n count=0\n do i=1,n\n if (mod(mod(x(i)-j+1,k),2)==1 .and. mod(mod(x(i)-jj+1,k),2)==1 .and. c(i)==\"W\" ) then\n count=count+1\n endif\n\nenddo\nenddo\n count_max=max(count,n-count)\nenddo\n\n!write(*,*) n,k\n!write(*,*) x,y,c\nwrite(*,*) count_max\n\nstop\nend", "language": "Fortran", "metadata": {"date": 1516591918, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03458.html", "problem_id": "p03458", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03458/input.txt", "sample_output_relpath": "derived/input_output/data/p03458/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03458/Fortran/s746312802.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s746312802", "user_id": "u909643606"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "implicit none\n\ninteger:: n,i,j,k,count,jj,count_max\ncharacter,allocatable,dimension(:) :: c*1\ninteger,allocatable,dimension(:):: x,y\nread (5,*) n,k\n\nallocate(x(n))\nallocate(y(n))\nallocate(c(n))\n\ndo i=1,n\n read(5,*) x(i),y(i),c(i)\nenddo\n\ndo j=1,int(k/2)+1\n do jj=1,int(k/2)+1\n count=0\n do i=1,n\n if (mod(mod(x(i)-j+1,k),2)==1 .and. mod(mod(x(i)-jj+1,k),2)==1 .and. c(i)==\"W\" ) then\n count=count+1\n endif\n\nenddo\nenddo\n count_max=max(count,n-count)\nenddo\n\n!write(*,*) n,k\n!write(*,*) x,y,c\nwrite(*,*) count_max\n\nstop\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.\nHere, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.\nBelow is an example of a checked pattern of side 3:\n\nAtCoDeer has N desires.\nThe i-th desire is represented by x_i, y_i and c_i.\nIf c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.\nAt most how many desires can he satisfy at the same time?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 1000\n\n0 ≤ x_i ≤ 10^9\n\n0 ≤ y_i ≤ 10^9\n\nIf i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).\n\nc_i is B or W.\n\nN, K, x_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\nx_2 y_2 c_2\n:\nx_N y_N c_N\n\nOutput\n\nPrint the maximum number of desires that can be satisfied at the same time.\n\nSample Input 1\n\n4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n\nSample Output 1\n\n4\n\nHe can satisfy all his desires by painting as shown in the example above.\n\nSample Input 2\n\n2 1000\n0 0 B\n0 1 W\n\nSample Output 2\n\n2\n\nSample Input 3\n\n6 2\n1 2 B\n2 1 W\n2 2 B\n1 0 B\n0 6 W\n4 5 W\n\nSample Output 3\n\n4", "sample_input": "4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03458", "source_text": "Score : 500 points\n\nProblem Statement\n\nAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.\nHere, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.\nBelow is an example of a checked pattern of side 3:\n\nAtCoDeer has N desires.\nThe i-th desire is represented by x_i, y_i and c_i.\nIf c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.\nAt most how many desires can he satisfy at the same time?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 1000\n\n0 ≤ x_i ≤ 10^9\n\n0 ≤ y_i ≤ 10^9\n\nIf i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).\n\nc_i is B or W.\n\nN, K, x_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\nx_2 y_2 c_2\n:\nx_N y_N c_N\n\nOutput\n\nPrint the maximum number of desires that can be satisfied at the same time.\n\nSample Input 1\n\n4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n\nSample Output 1\n\n4\n\nHe can satisfy all his desires by painting as shown in the example above.\n\nSample Input 2\n\n2 1000\n0 0 B\n0 1 W\n\nSample Output 2\n\n2\n\nSample Input 3\n\n6 2\n1 2 B\n2 1 W\n2 2 B\n1 0 B\n0 6 W\n4 5 W\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 561, "cpu_time_ms": 2103, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s065312937", "group_id": "codeNet:p03463", "input_text": "program AGC020A\n implicit none\n integer(8)::N,A,B\n read*,N,A,B\n if(mod(B-A,2)==0)print'(A)',\"Alice\"\n if(mod(B-A,2)==1)print'(A)',\"Borys\"\nend program AGC020A", "language": "Fortran", "metadata": {"date": 1584314182, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03463.html", "problem_id": "p03463", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03463/input.txt", "sample_output_relpath": "derived/input_output/data/p03463/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03463/Fortran/s065312937.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065312937", "user_id": "u414699019"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "program AGC020A\n implicit none\n integer(8)::N,A,B\n read*,N,A,B\n if(mod(B-A,2)==0)print'(A)',\"Alice\"\n if(mod(B-A,2)==1)print'(A)',\"Borys\"\nend program AGC020A", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA game is played on a strip consisting of N cells consecutively numbered from 1 to N.\n\nAlice has her token on cell A. Borys has his token on a different cell B.\n\nPlayers take turns, Alice moves first.\nThe moving player must shift his or her token from its current cell X to the neighboring cell on the left, cell X-1, or on the right, cell X+1.\nNote that it's disallowed to move the token outside the strip or to the cell with the other player's token.\nIn one turn, the token of the moving player must be shifted exactly once.\n\nThe player who can't make a move loses, and the other player wins.\n\nBoth players want to win. Who wins if they play optimally?\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint Alice if Alice wins, Borys if Borys wins, and Draw if nobody wins.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\nAlice\n\nAlice can move her token to cell 3.\nAfter that, Borys will be unable to move his token to cell 3, so he will have to move his token to cell 5.\nThen, Alice moves her token to cell 4. Borys can't make a move and loses.\n\nSample Input 2\n\n2 1 2\n\nSample Output 2\n\nBorys\n\nAlice can't make the very first move and loses.\n\nSample Input 3\n\n58 23 42\n\nSample Output 3\n\nBorys", "sample_input": "5 2 4\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03463", "source_text": "Score : 300 points\n\nProblem Statement\n\nA game is played on a strip consisting of N cells consecutively numbered from 1 to N.\n\nAlice has her token on cell A. Borys has his token on a different cell B.\n\nPlayers take turns, Alice moves first.\nThe moving player must shift his or her token from its current cell X to the neighboring cell on the left, cell X-1, or on the right, cell X+1.\nNote that it's disallowed to move the token outside the strip or to the cell with the other player's token.\nIn one turn, the token of the moving player must be shifted exactly once.\n\nThe player who can't make a move loses, and the other player wins.\n\nBoth players want to win. Who wins if they play optimally?\n\nConstraints\n\n2 \\leq N \\leq 100\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint Alice if Alice wins, Borys if Borys wins, and Draw if nobody wins.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\nAlice\n\nAlice can move her token to cell 3.\nAfter that, Borys will be unable to move his token to cell 3, so he will have to move his token to cell 5.\nThen, Alice moves her token to cell 4. Borys can't make a move and loses.\n\nSample Input 2\n\n2 1 2\n\nSample Output 2\n\nBorys\n\nAlice can't make the very first move and loses.\n\nSample Input 3\n\n58 23 42\n\nSample Output 3\n\nBorys", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s518887597", "group_id": "codeNet:p03464", "input_text": "implicit none\n\ninteger(8) :: ans_min=10000000000_8, ans_max=0, count=0\ninteger(8) :: k, i, j, n, n_org\ninteger,allocatable,dimension(:):: a\n\nread(5,*) k\nallocate(a(k))\n\nread(5,*) (a(i),i=1,k)\n\nn=maxval(a)-mod(maxval(a),a(1))\n\n\n!write(6,*) n\ndo j=1,300\n n_org=n\n do i=1, k\n n=(int(n/a(i)))*a(i)\n enddo\n \n if (n==2) then\n ans_min=min(ans_min,n_org)\n ans_max=max(ans_max,n_org)\n count=1\n endif\nn=n_org+a(1)\n\nenddo\n\nif (count==0) then\n write(6,*), -1\nelse\n write(6,*) ans_min,ans_max+a(1)-1\nendif \n\nstop\nend", "language": "Fortran", "metadata": {"date": 1515989926, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03464.html", "problem_id": "p03464", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03464/input.txt", "sample_output_relpath": "derived/input_output/data/p03464/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03464/Fortran/s518887597.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s518887597", "user_id": "u909643606"}, "prompt_components": {"gold_output": "6 8\n", "input_to_evaluate": "implicit none\n\ninteger(8) :: ans_min=10000000000_8, ans_max=0, count=0\ninteger(8) :: k, i, j, n, n_org\ninteger,allocatable,dimension(:):: a\n\nread(5,*) k\nallocate(a(k))\n\nread(5,*) (a(i),i=1,k)\n\nn=maxval(a)-mod(maxval(a),a(1))\n\n\n!write(6,*) n\ndo j=1,300\n n_org=n\n do i=1, k\n n=(int(n/a(i)))*a(i)\n enddo\n \n if (n==2) then\n ans_min=min(ans_min,n_org)\n ans_max=max(ans_max,n_org)\n count=1\n endif\nn=n_org+a(1)\n\nenddo\n\nif (count==0) then\n write(6,*), -1\nelse\n write(6,*) ans_min,ans_max+a(1)-1\nendif \n\nstop\nend", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAn adult game master and N children are playing a game on an ice rink.\nThe game consists of K rounds.\nIn the i-th round, the game master announces:\n\nForm groups consisting of A_i children each!\n\nThen the children who are still in the game form as many groups of A_i children as possible.\nOne child may belong to at most one group.\nThose who are left without a group leave the game. The others proceed to the next round.\nNote that it's possible that nobody leaves the game in some round.\n\nIn the end, after the K-th round, there are exactly two children left, and they are declared the winners.\n\nYou have heard the values of A_1, A_2, ..., A_K. You don't know N, but you want to estimate it.\n\nFind the smallest and the largest possible number of children in the game before the start, or determine that no valid values of N exist.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\n2 \\leq A_i \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA_1 A_2 ... A_K\n\nOutput\n\nPrint two integers representing the smallest and the largest possible value of N, respectively,\nor a single integer -1 if the described situation is impossible.\n\nSample Input 1\n\n4\n3 4 3 2\n\nSample Output 1\n\n6 8\n\nFor example, if the game starts with 6 children, then it proceeds as follows:\n\nIn the first round, 6 children form 2 groups of 3 children, and nobody leaves the game.\n\nIn the second round, 6 children form 1 group of 4 children, and 2 children leave the game.\n\nIn the third round, 4 children form 1 group of 3 children, and 1 child leaves the game.\n\nIn the fourth round, 3 children form 1 group of 2 children, and 1 child leaves the game.\n\nThe last 2 children are declared the winners.\n\nSample Input 2\n\n5\n3 4 100 3 2\n\nSample Output 2\n\n-1\n\nThis situation is impossible.\nIn particular, if the game starts with less than 100 children, everyone leaves after the third round.\n\nSample Input 3\n\n10\n2 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\n2 3", "sample_input": "4\n3 4 3 2\n"}, "reference_outputs": ["6 8\n"], "source_document_id": "p03464", "source_text": "Score : 500 points\n\nProblem Statement\n\nAn adult game master and N children are playing a game on an ice rink.\nThe game consists of K rounds.\nIn the i-th round, the game master announces:\n\nForm groups consisting of A_i children each!\n\nThen the children who are still in the game form as many groups of A_i children as possible.\nOne child may belong to at most one group.\nThose who are left without a group leave the game. The others proceed to the next round.\nNote that it's possible that nobody leaves the game in some round.\n\nIn the end, after the K-th round, there are exactly two children left, and they are declared the winners.\n\nYou have heard the values of A_1, A_2, ..., A_K. You don't know N, but you want to estimate it.\n\nFind the smallest and the largest possible number of children in the game before the start, or determine that no valid values of N exist.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\n2 \\leq A_i \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA_1 A_2 ... A_K\n\nOutput\n\nPrint two integers representing the smallest and the largest possible value of N, respectively,\nor a single integer -1 if the described situation is impossible.\n\nSample Input 1\n\n4\n3 4 3 2\n\nSample Output 1\n\n6 8\n\nFor example, if the game starts with 6 children, then it proceeds as follows:\n\nIn the first round, 6 children form 2 groups of 3 children, and nobody leaves the game.\n\nIn the second round, 6 children form 1 group of 4 children, and 2 children leave the game.\n\nIn the third round, 4 children form 1 group of 3 children, and 1 child leaves the game.\n\nIn the fourth round, 3 children form 1 group of 2 children, and 1 child leaves the game.\n\nThe last 2 children are declared the winners.\n\nSample Input 2\n\n5\n3 4 100 3 2\n\nSample Output 2\n\n-1\n\nThis situation is impossible.\nIn particular, if the game starts with less than 100 children, everyone leaves after the third round.\n\nSample Input 3\n\n10\n2 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\n2 3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 556, "cpu_time_ms": 467, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s570433705", "group_id": "codeNet:p03473", "input_text": "read*, M\nwrite(*,*) 48-M\nend", "language": "Fortran", "metadata": {"date": 1597968638, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03473.html", "problem_id": "p03473", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03473/input.txt", "sample_output_relpath": "derived/input_output/data/p03473/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03473/Fortran/s570433705.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s570433705", "user_id": "u841856382"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "read*, M\nwrite(*,*) 48-M\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 28, "cpu_time_ms": 6, "memory_kb": 2712}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s911933474", "group_id": "codeNet:p03473", "input_text": "program main\n implicit none\n integer :: m\n read *, m\n print \"(i0)\", 48 - m\nend program main\n", "language": "Fortran", "metadata": {"date": 1587694751, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03473.html", "problem_id": "p03473", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03473/input.txt", "sample_output_relpath": "derived/input_output/data/p03473/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03473/Fortran/s911933474.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s911933474", "user_id": "u388927326"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "program main\n implicit none\n integer :: m\n read *, m\n print \"(i0)\", 48 - m\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 5, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s906877254", "group_id": "codeNet:p03473", "input_text": "program atcoder\n implicit none\n integer m\n read *, m ! 変数mに、標準入力から数字を読み込み代入する\n\n ! このあたりに、解答を導く計算を書く\n\n print '(i0)',48-m ! \",\"のあとに解答となる変数を書く\nend program atcoder", "language": "Fortran", "metadata": {"date": 1578251791, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03473.html", "problem_id": "p03473", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03473/input.txt", "sample_output_relpath": "derived/input_output/data/p03473/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03473/Fortran/s906877254.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s906877254", "user_id": "u190743932"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "program atcoder\n implicit none\n integer m\n read *, m ! 変数mに、標準入力から数字を読み込み代入する\n\n ! このあたりに、解答を導く計算を書く\n\n print '(i0)',48-m ! \",\"のあとに解答となる変数を書く\nend program atcoder", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s940242635", "group_id": "codeNet:p03474", "input_text": "program main\n implicit none\n integer :: a, b, i\n character(11) :: s\n logical :: ishyphen, needhyphen\n read(*, *) a, b\n read(*, *) s\n do i = 1, a + b\n ishyphen = (s(i:i) == \"-\")\n needhyphen = (i == a + 1)\n if (ishyphen .neqv. needhyphen) then\n write(*, \"(a)\") \"No\"\n stop 0\n end if\n end do\n write(*, \"(a)\") \"Yes\"\nend program main\n", "language": "Fortran", "metadata": {"date": 1551075951, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03474.html", "problem_id": "p03474", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03474/input.txt", "sample_output_relpath": "derived/input_output/data/p03474/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03474/Fortran/s940242635.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s940242635", "user_id": "u388927326"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n implicit none\n integer :: a, b, i\n character(11) :: s\n logical :: ishyphen, needhyphen\n read(*, *) a, b\n read(*, *) s\n do i = 1, a + b\n ishyphen = (s(i:i) == \"-\")\n needhyphen = (i == a + 1)\n if (ishyphen .neqv. needhyphen) then\n write(*, \"(a)\") \"No\"\n stop 0\n end if\n end do\n write(*, \"(a)\") \"Yes\"\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "sample_input": "3 4\n269-6650\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03474", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s563528583", "group_id": "codeNet:p03475", "input_text": "program abc084c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,j\n integer(int32):: time, nt\n integer(int32), allocatable:: c(:), s(:), f(:),ans(:)\n\n read*, n\n allocate(c(n-1), s(n-1), f(n-1), ans(n))\n\n do i=1,n-1\n read*, c(i),s(i),f(i)\n end do\n\n do j=1,n-1\n time=0\n do i=j,n-1\n if (time <= s(i)) then\n time = s(i)+c(i)\n else\n nt=s(i)\n do while(time > nt)\n nt=nt+f(i)\n end do\n time=nt+c(i)\n end if\n end do\n ans(j)=time\n end do\n\n print'(i0)', ans(:)\nend program abc084c", "language": "Fortran", "metadata": {"date": 1591014957, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03475.html", "problem_id": "p03475", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03475/input.txt", "sample_output_relpath": "derived/input_output/data/p03475/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03475/Fortran/s563528583.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s563528583", "user_id": "u234636620"}, "prompt_components": {"gold_output": "12\n11\n0\n", "input_to_evaluate": "program abc084c\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,i,j\n integer(int32):: time, nt\n integer(int32), allocatable:: c(:), s(:), f(:),ans(:)\n\n read*, n\n allocate(c(n-1), s(n-1), f(n-1), ans(n))\n\n do i=1,n-1\n read*, c(i),s(i),f(i)\n end do\n\n do j=1,n-1\n time=0\n do i=j,n-1\n if (time <= s(i)) then\n time = s(i)+c(i)\n else\n nt=s(i)\n do while(time > nt)\n nt=nt+f(i)\n end do\n time=nt+c(i)\n end if\n end do\n ans(j)=time\n end do\n\n print'(i0)', ans(:)\nend program abc084c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA railroad running from west to east in Atcoder Kingdom is now complete.\n\nThere are N stations on the railroad, numbered 1 through N from west to east.\n\nTomorrow, the opening ceremony of the railroad will take place.\n\nOn this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated.\n\nThe first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds.\n\nHere, it is guaranteed that F_i divides S_i.\n\nThat is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains.\n\nFor each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.\n\nConstraints\n\n1≤N≤500\n\n1≤C_i≤100\n\n1≤S_i≤10^5\n\n1≤F_i≤10\n\nS_i％F_i=0\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 S_1 F_1\n:\nC_{N-1} S_{N-1} F_{N-1}\n\nOutput\n\nPrint N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony begins, if the earliest possible time we can reach Station N is x seconds after the ceremony begins, the i-th line should contain x.\n\nSample Input 1\n\n3\n6 5 1\n1 10 1\n\nSample Output 1\n\n12\n11\n0\n\nWe will travel from Station 1 as follows:\n\n5 seconds after the beginning: take the train to Station 2.\n\n11 seconds: arrive at Station 2.\n\n11 seconds: take the train to Station 3.\n\n12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n10 seconds: take the train to Station 3.\n\n11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\nSample Input 2\n\n4\n12 24 6\n52 16 4\n99 2 2\n\nSample Output 2\n\n187\n167\n101\n0\n\nSample Input 3\n\n4\n12 13 1\n44 17 17\n66 4096 64\n\nSample Output 3\n\n4162\n4162\n4162\n0", "sample_input": "3\n6 5 1\n1 10 1\n"}, "reference_outputs": ["12\n11\n0\n"], "source_document_id": "p03475", "source_text": "Score : 300 points\n\nProblem Statement\n\nA railroad running from west to east in Atcoder Kingdom is now complete.\n\nThere are N stations on the railroad, numbered 1 through N from west to east.\n\nTomorrow, the opening ceremony of the railroad will take place.\n\nOn this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated.\n\nThe first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds.\n\nHere, it is guaranteed that F_i divides S_i.\n\nThat is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains.\n\nFor each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.\n\nConstraints\n\n1≤N≤500\n\n1≤C_i≤100\n\n1≤S_i≤10^5\n\n1≤F_i≤10\n\nS_i％F_i=0\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 S_1 F_1\n:\nC_{N-1} S_{N-1} F_{N-1}\n\nOutput\n\nPrint N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony begins, if the earliest possible time we can reach Station N is x seconds after the ceremony begins, the i-th line should contain x.\n\nSample Input 1\n\n3\n6 5 1\n1 10 1\n\nSample Output 1\n\n12\n11\n0\n\nWe will travel from Station 1 as follows:\n\n5 seconds after the beginning: take the train to Station 2.\n\n11 seconds: arrive at Station 2.\n\n11 seconds: take the train to Station 3.\n\n12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n10 seconds: take the train to Station 3.\n\n11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\nSample Input 2\n\n4\n12 24 6\n52 16 4\n99 2 2\n\nSample Output 2\n\n187\n167\n101\n0\n\nSample Input 3\n\n4\n12 13 1\n44 17 17\n66 4096 64\n\nSample Output 3\n\n4162\n4162\n4162\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 689, "cpu_time_ms": 138, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s874350249", "group_id": "codeNet:p03476", "input_text": "program prob4\n implicit none\n integer::p(100005), a(100005)\n integer::i, j, Q, l, r\n\n p = 0\n do i = 2, 100000\n if(p(i) == 0) then\n do j = 2*i, 100000, i\n p(j) = 1\n end do\n end if\n end do\n\n a = 0\n do i = 3, 100000\n if(p(i) == 0 .and. p((i+1)/2) == 0) then\n a(i) = a(i-1) + 1\n else\n a(i) = a(i-1)\n end if\n end do\n \n read(*,*) Q\n do i = 1, Q\n read(*,*) l, r\n write(*,*) a(r) - a(l-1)\n end do\n stop\nend program", "language": "Fortran", "metadata": {"date": 1595614445, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03476.html", "problem_id": "p03476", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03476/input.txt", "sample_output_relpath": "derived/input_output/data/p03476/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03476/Fortran/s874350249.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s874350249", "user_id": "u841856382"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program prob4\n implicit none\n integer::p(100005), a(100005)\n integer::i, j, Q, l, r\n\n p = 0\n do i = 2, 100000\n if(p(i) == 0) then\n do j = 2*i, 100000, i\n p(j) = 1\n end do\n end if\n end do\n\n a = 0\n do i = 3, 100000\n if(p(i) == 0 .and. p((i+1)/2) == 0) then\n a(i) = a(i-1) + 1\n else\n a(i) = a(i-1)\n end if\n end do\n \n read(*,*) Q\n do i = 1, Q\n read(*,*) l, r\n write(*,*) a(r) - a(l-1)\n end do\n stop\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\n1\n1\n2", "sample_input": "1\n3 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03476", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\n1\n1\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 556, "cpu_time_ms": 86, "memory_kb": 3616}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s512289755", "group_id": "codeNet:p03477", "input_text": "program prob47\n implicit none\n integer :: a,b,c,d\n read(*,*) a,b,c,d\n\n if(a + b > c + d)then\n write(*,*) \"Left\"\n else if(a + b == c + d) then\n write(*,*) \"Balanced\"\n else \n write(*,*) \"Right\"\n end if\n\n stop\ncontains\nend program prob47\n", "language": "Fortran", "metadata": {"date": 1592631601, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03477.html", "problem_id": "p03477", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03477/input.txt", "sample_output_relpath": "derived/input_output/data/p03477/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03477/Fortran/s512289755.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s512289755", "user_id": "u478462004"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "program prob47\n implicit none\n integer :: a,b,c,d\n read(*,*) a,b,c,d\n\n if(a + b > c + d)then\n write(*,*) \"Left\"\n else if(a + b == c + d) then\n write(*,*) \"Balanced\"\n else \n write(*,*) \"Right\"\n end if\n\n stop\ncontains\nend program prob47\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "sample_input": "3 8 7 1\n"}, "reference_outputs": ["Left\n"], "source_document_id": "p03477", "source_text": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 8, "memory_kb": 2780}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s781629455", "group_id": "codeNet:p03477", "input_text": "integer a, b, c, d\nread*, a, b, c, d\n\nif(a+b > c+d) then\n write(*,'(A)') 'Left'\nelse if(a+b == c+d) then\n write(*,'(A)') 'Balanced'\nelse\n write(*,'(A)') 'Right'\nendif\nend", "language": "Fortran", "metadata": {"date": 1525947390, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03477.html", "problem_id": "p03477", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03477/input.txt", "sample_output_relpath": "derived/input_output/data/p03477/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03477/Fortran/s781629455.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s781629455", "user_id": "u917715822"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "integer a, b, c, d\nread*, a, b, c, d\n\nif(a+b > c+d) then\n write(*,'(A)') 'Left'\nelse if(a+b == c+d) then\n write(*,'(A)') 'Balanced'\nelse\n write(*,'(A)') 'Right'\nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "sample_input": "3 8 7 1\n"}, "reference_outputs": ["Left\n"], "source_document_id": "p03477", "source_text": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s408404028", "group_id": "codeNet:p03479", "input_text": "program main\n\timplicit none\n\tinteger counter, i\n\tinteger(8) X, Y\n\tread(*, *) X, Y\n\tcounter = 1\n\tdo i = 2, 72\n\t\tX = X*2\n\t\tif(X <= Y) then\n\t\t\tcounter = counter + 1\n\t\telse\n\t\t\texit\n\t\tend if\n\tend do\n\t\twrite(*, *) counter\nend program main", "language": "Fortran", "metadata": {"date": 1529697767, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03479.html", "problem_id": "p03479", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03479/input.txt", "sample_output_relpath": "derived/input_output/data/p03479/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03479/Fortran/s408404028.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408404028", "user_id": "u728000113"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger counter, i\n\tinteger(8) X, Y\n\tread(*, *) X, Y\n\tcounter = 1\n\tdo i = 2, 72\n\t\tX = X*2\n\t\tif(X <= Y) then\n\t\t\tcounter = counter + 1\n\t\telse\n\t\t\texit\n\t\tend if\n\tend do\n\t\twrite(*, *) counter\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "sample_input": "3 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03479", "source_text": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 232, "cpu_time_ms": 6, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s414481387", "group_id": "codeNet:p03479", "input_text": "program main\nimplicit none\ninteger(8) X,Y,An\ninteger length\n \nread(*,*) X,Y\nAn=X+X\nlength=1\ndo\n\tAn = An+An\n if(An<=Y)then\n\t length = length + 1\n else\n \texit\n endif\nenddo\n \nwrite(*,*) length\n \nend program", "language": "Fortran", "metadata": {"date": 1514628210, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03479.html", "problem_id": "p03479", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03479/input.txt", "sample_output_relpath": "derived/input_output/data/p03479/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03479/Fortran/s414481387.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s414481387", "user_id": "u351524992"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\nimplicit none\ninteger(8) X,Y,An\ninteger length\n \nread(*,*) X,Y\nAn=X+X\nlength=1\ndo\n\tAn = An+An\n if(An<=Y)then\n\t length = length + 1\n else\n \texit\n endif\nenddo\n \nwrite(*,*) length\n \nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "sample_input": "3 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03479", "source_text": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s334396776", "group_id": "codeNet:p03494", "input_text": "program shift_only\n implicit none\n integer :: n, a(200) = 0, i\n read(*,*) n\n read(*,*) a(1:n)\n do i = 0, 31\n if (any(btest(a(1:n), 0))) then\n write(*,'(i0)') i\n stop\n end if\n a(1:n) = rshift(a(1:n), 1)\n end do\nend program shift_only", "language": "Fortran", "metadata": {"date": 1597784262, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03494.html", "problem_id": "p03494", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03494/input.txt", "sample_output_relpath": "derived/input_output/data/p03494/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03494/Fortran/s334396776.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334396776", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program shift_only\n implicit none\n integer :: n, a(200) = 0, i\n read(*,*) n\n read(*,*) a(1:n)\n do i = 0, 31\n if (any(btest(a(1:n), 0))) then\n write(*,'(i0)') i\n stop\n end if\n a(1:n) = rshift(a(1:n), 1)\n end do\nend program shift_only", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "sample_input": "3\n8 12 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03494", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 5, "memory_kb": 2948}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s017079213", "group_id": "codeNet:p03494", "input_text": "program ABC081B\n implicit none\n integer(8)::N,i,calc,ans=1000000000\n integer(8),allocatable::A(:)\n read*,N\n allocate(A(N))\n read*,A\n\n do i=1,N\n calc=0\n do\n if(mod(A(i),2)==1)exit\n A(i)=A(i)/2\n calc=calc+1\n end do\n ans=min(ans,calc)\n end do\n print'(i0)',ans\nend program ABC081B", "language": "Fortran", "metadata": {"date": 1596827732, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03494.html", "problem_id": "p03494", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03494/input.txt", "sample_output_relpath": "derived/input_output/data/p03494/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03494/Fortran/s017079213.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s017079213", "user_id": "u414699019"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ABC081B\n implicit none\n integer(8)::N,i,calc,ans=1000000000\n integer(8),allocatable::A(:)\n read*,N\n allocate(A(N))\n read*,A\n\n do i=1,N\n calc=0\n do\n if(mod(A(i),2)==1)exit\n A(i)=A(i)/2\n calc=calc+1\n end do\n ans=min(ans,calc)\n end do\n print'(i0)',ans\nend program ABC081B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "sample_input": "3\n8 12 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03494", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 364, "cpu_time_ms": 11, "memory_kb": 2848}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s985564299", "group_id": "codeNet:p03497", "input_text": "program ARC086C\n implicit none\n integer(8)::N,K,valiation,i\n integer(8)::remove=0\n integer(8)::result=0\n integer(8),allocatable,dimension(:)::A,L\n read(5,*)N,K\n allocate(A(N))\n allocate(L(N))\n valiation=N\n L=0\n read(5,*)(A(i),i=1,N)\n\n do i=1,N\n L(A(i))=L(A(i))+1\n end do\n\n L=iqsort(L)\n\n do i=1,N\n if(L(i)==0)then\n valiation=valiation-1\n else\n exit\n end if\n end do\n\n remove=valiation-K\n\n if(remove>0)then\n do i=1,N\n if(L(i)/=0)then\n result=result+L(i)\n remove=remove-1\n end if\n\n if(remove==0)then\n exit\n end if\n end do\n end if\n\n print'(i0)',result\n\ncontains\n recursive function iqsort(ix) result(ires)\n integer(8), allocatable :: ires(:)\n integer(8), intent(in) :: ix(:)\n integer :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort\nend program ARC086C", "language": "Fortran", "metadata": {"date": 1574966417, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03497.html", "problem_id": "p03497", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03497/input.txt", "sample_output_relpath": "derived/input_output/data/p03497/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03497/Fortran/s985564299.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985564299", "user_id": "u414699019"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ARC086C\n implicit none\n integer(8)::N,K,valiation,i\n integer(8)::remove=0\n integer(8)::result=0\n integer(8),allocatable,dimension(:)::A,L\n read(5,*)N,K\n allocate(A(N))\n allocate(L(N))\n valiation=N\n L=0\n read(5,*)(A(i),i=1,N)\n\n do i=1,N\n L(A(i))=L(A(i))+1\n end do\n\n L=iqsort(L)\n\n do i=1,N\n if(L(i)==0)then\n valiation=valiation-1\n else\n exit\n end if\n end do\n\n remove=valiation-K\n\n if(remove>0)then\n do i=1,N\n if(L(i)/=0)then\n result=result+L(i)\n remove=remove-1\n end if\n\n if(remove==0)then\n exit\n end if\n end do\n end if\n\n print'(i0)',result\n\ncontains\n recursive function iqsort(ix) result(ires)\n integer(8), allocatable :: ires(:)\n integer(8), intent(in) :: ix(:)\n integer :: k\n if (size(ix) <= 1) then \n ires = ix\n else \n k = ix(size(ix) / 2)\n ires = [iqsort(pack(ix, ix < k)), pack(ix, ix == k), iqsort(pack(ix, ix > k))] \n end if\n end function iqsort\nend program ARC086C", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03497", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1151, "cpu_time_ms": 63, "memory_kb": 8748}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s844549482", "group_id": "codeNet:p03501", "input_text": "integer :: a,n,b\nread *,n,a,b\nprint*,min(a*n,b)\nend", "language": "Fortran", "metadata": {"date": 1580589176, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03501.html", "problem_id": "p03501", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03501/input.txt", "sample_output_relpath": "derived/input_output/data/p03501/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03501/Fortran/s844549482.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s844549482", "user_id": "u171356453"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "integer :: a,n,b\nread *,n,a,b\nprint*,min(a*n,b)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are parking at a parking lot. You can choose from the following two fee plans:\n\nPlan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.\n\nPlan 2: The fee will be B yen, regardless of the duration.\n\nFind the minimum fee when you park for N hours.\n\nConstraints\n\n1≤N≤20\n\n1≤A≤100\n\n1≤B≤2000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nWhen the minimum fee is x yen, print the value of x.\n\nSample Input 1\n\n7 17 120\n\nSample Output 1\n\n119\n\nIf you choose Plan 1, the fee will be 7×17=119 yen.\n\nIf you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\nSample Input 2\n\n5 20 100\n\nSample Output 2\n\n100\n\nThe fee might be the same in the two plans.\n\nSample Input 3\n\n6 18 100\n\nSample Output 3\n\n100", "sample_input": "7 17 120\n"}, "reference_outputs": ["119\n"], "source_document_id": "p03501", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are parking at a parking lot. You can choose from the following two fee plans:\n\nPlan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.\n\nPlan 2: The fee will be B yen, regardless of the duration.\n\nFind the minimum fee when you park for N hours.\n\nConstraints\n\n1≤N≤20\n\n1≤A≤100\n\n1≤B≤2000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nWhen the minimum fee is x yen, print the value of x.\n\nSample Input 1\n\n7 17 120\n\nSample Output 1\n\n119\n\nIf you choose Plan 1, the fee will be 7×17=119 yen.\n\nIf you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\nSample Input 2\n\n5 20 100\n\nSample Output 2\n\n100\n\nThe fee might be the same in the two plans.\n\nSample Input 3\n\n6 18 100\n\nSample Output 3\n\n100", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s234139408", "group_id": "codeNet:p03502", "input_text": "program ABC_080_B_HarshadNumber\n implicit none\n integer i, N, Nold, fN\n read(*, *) N\n fN = 0\n Nold = N\n do i = 1, 9\n fN = fN + mod(N, 10) \n\t N = N / 10\n end do\n if(mod(Nold, fN) == 0) then\n write(*, *) 'Yes'\n else\n write(*, *) 'No'\n end if\nend program ABC_080_B_HarshadNumber", "language": "Fortran", "metadata": {"date": 1523301336, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03502.html", "problem_id": "p03502", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03502/input.txt", "sample_output_relpath": "derived/input_output/data/p03502/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03502/Fortran/s234139408.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s234139408", "user_id": "u728000113"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC_080_B_HarshadNumber\n implicit none\n integer i, N, Nold, fN\n read(*, *) N\n fN = 0\n Nold = N\n do i = 1, 9\n fN = fN + mod(N, 10) \n\t N = N / 10\n end do\n if(mod(Nold, fN) == 0) then\n write(*, *) 'Yes'\n else\n write(*, *) 'No'\n end if\nend program ABC_080_B_HarshadNumber", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 315, "cpu_time_ms": 8, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s556012857", "group_id": "codeNet:p03504", "input_text": "program recording\n implicit none\n integer :: n, k, s, t, c, x(200000,30), i, m\n s = 0\n x = 0\n read(*,*) n, k\n do i = 1, n\n read(*,*) s, t, c\n x(2*s-1,c) = x(2*s-1,c) + 1\n x(2*t,c) = x(2*t,c) - 1\n end do\n do i = 2, 200000\n x(i,1:k) = x(i,1:k) + x(i-1,1:k)\n end do\n m = 0\n do i = 1, 200000\n c = sum(x(i,1:k))\n if (m.lt.c) m = c\n end do\n write(*,'(i0)') m\n stop\nend program recording", "language": "Fortran", "metadata": {"date": 1556211795, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03504.html", "problem_id": "p03504", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03504/input.txt", "sample_output_relpath": "derived/input_output/data/p03504/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03504/Fortran/s556012857.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s556012857", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program recording\n implicit none\n integer :: n, k, s, t, c, x(200000,30), i, m\n s = 0\n x = 0\n read(*,*) n, k\n do i = 1, n\n read(*,*) s, t, c\n x(2*s-1,c) = x(2*s-1,c) + 1\n x(2*t,c) = x(2*t,c) - 1\n end do\n do i = 2, 200000\n x(i,1:k) = x(i,1:k) + x(i-1,1:k)\n end do\n m = 0\n do i = 1, 200000\n c = sum(x(i,1:k))\n if (m.lt.c) m = c\n end do\n write(*,'(i0)') m\n stop\nend program recording", "problem_context": "Score : 400 points\n\nProblem Statement\n\nJoisino is planning to record N TV programs with recorders.\n\nThe TV can receive C channels numbered 1 through C.\n\nThe i-th program that she wants to record will be broadcast from time s_i to time t_i (including time s_i but not t_i) on Channel c_i.\n\nHere, there will never be more than one program that are broadcast on the same channel at the same time.\n\nWhen the recorder is recording a channel from time S to time T (including time S but not T), it cannot record other channels from time S-0.5 to time T (including time S-0.5 but not T).\n\nFind the minimum number of recorders required to record the channels so that all the N programs are completely recorded.\n\nConstraints\n\n1≤N≤10^5\n\n1≤C≤30\n\n1≤s_i9)flg=0\n do i=1,len_trim(S)\n if(S(i:i)==\"A\")then\n a_count=a_count+1\n else if(S(i:i)==T(cur:cur))then\n if(a_count>A(cur))then\n flg=0\n exit\n else\n a_count=0\n cur=cur+1\n end if\n else\n flg=0\n exit\n end if\n end do\n if(flg==1.and.a_count>A(6))flg=0\n if(flg==1)print'(A)',\"YES\"\n if(flg==0)print'(A)',\"NO\"\nend program main", "language": "Fortran", "metadata": {"date": 1597353902, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/Fortran/s336808706.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s336808706", "user_id": "u414699019"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program main\n implicit none\n integer(8)::A(6)=(/1,0,0,1,1,1/),a_count=0,flg=1,cur=1,i\n character(50)::S,T=\"KIHBR\"\n read*,S\n if(len_trim(S)>9)flg=0\n do i=1,len_trim(S)\n if(S(i:i)==\"A\")then\n a_count=a_count+1\n else if(S(i:i)==T(cur:cur))then\n if(a_count>A(cur))then\n flg=0\n exit\n else\n a_count=0\n cur=cur+1\n end if\n else\n flg=0\n exit\n end if\n end do\n if(flg==1.and.a_count>A(6))flg=0\n if(flg==1)print'(A)',\"YES\"\n if(flg==0)print'(A)',\"NO\"\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2828}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s508054713", "group_id": "codeNet:p03523", "input_text": "character(9)mihon(16)\ncharacter(9) S\nmihon(1)=\"AKIHABARA\"\nmihon(2)=\"AKIHABAR\"\nmihon(3)=\"AKIHABRA\"\nmihon(4)=\"AKIHABR\"\nmihon(5)=\"AKIHBARA\"\nmihon(6)=\"AKIHBAR\"\nmihon(7)=\"AKIHBRA\"\nmihon(8)=\"AKIHBR\"\nmihon(9)=\"KIHABARA\"\nmihon(10)=\"KIHABAR\"\nmihon(11)=\"KIHABRA\"\nmihon(12)=\"KIHABR\"\nmihon(13)=\"KIHBARA\"\nmihon(14)=\"KIHBAR\"\nmihon(15)=\"KIHBRA\"\nmihon(16)=\"KIHBR\"\nread*,S\ndo i=1,16\n if(S==mihon(i))then\n print\"(A)\",\"YES\"\n stop\n endif\nend do\nprint\"(A)\",\"NO\"\nend", "language": "Fortran", "metadata": {"date": 1557108141, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03523.html", "problem_id": "p03523", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03523/input.txt", "sample_output_relpath": "derived/input_output/data/p03523/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03523/Fortran/s508054713.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s508054713", "user_id": "u598073939"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "character(9)mihon(16)\ncharacter(9) S\nmihon(1)=\"AKIHABARA\"\nmihon(2)=\"AKIHABAR\"\nmihon(3)=\"AKIHABRA\"\nmihon(4)=\"AKIHABR\"\nmihon(5)=\"AKIHBARA\"\nmihon(6)=\"AKIHBAR\"\nmihon(7)=\"AKIHBRA\"\nmihon(8)=\"AKIHBR\"\nmihon(9)=\"KIHABARA\"\nmihon(10)=\"KIHABAR\"\nmihon(11)=\"KIHABRA\"\nmihon(12)=\"KIHABR\"\nmihon(13)=\"KIHBARA\"\nmihon(14)=\"KIHBAR\"\nmihon(15)=\"KIHBRA\"\nmihon(16)=\"KIHBR\"\nread*,S\ndo i=1,16\n if(S==mihon(i))then\n print\"(A)\",\"YES\"\n stop\n endif\nend do\nprint\"(A)\",\"NO\"\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "sample_input": "KIHBR\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03523", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S.\n\nTakahashi can insert the character A at any position in this string any number of times.\n\nCan he change S into AKIHABARA?\n\nConstraints\n\n1 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf it is possible to change S into AKIHABARA, print YES; otherwise, print NO.\n\nSample Input 1\n\nKIHBR\n\nSample Output 1\n\nYES\n\nInsert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.\n\nSample Input 2\n\nAKIBAHARA\n\nSample Output 2\n\nNO\n\nThe correct spell is AKIHABARA.\n\nSample Input 3\n\nAAKIAHBAARA\n\nSample Output 3\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 448, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s485936756", "group_id": "codeNet:p03524", "input_text": "program sample\n implicit none\n character(len=100000)::s\n integer(8) :: i,j,m,n,a,b,c,x(3)\n integer(8),allocatable :: y(:)\n \n read(*,*) s\n x(:)=0\n n=len_trim(s)\n do i=1,n\n if (s(i:i) .eq. 'a')then\n x(1)=x(1)+1\n else if (s(i:i) .eq. 'b')then\n x(2)=x(2)+1\n else\n x(3)=x(3)+1\n end if\n end do\n \n if (abs(x(1)-x(2))<2 .and. abs(x(2)-x(3))<2 .and. abs(x(1)-x(3))<2 )then\n write(*,*) 'YES'\n else\n write(*,*)'NO'\n end if\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1593827202, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03524.html", "problem_id": "p03524", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03524/input.txt", "sample_output_relpath": "derived/input_output/data/p03524/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03524/Fortran/s485936756.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s485936756", "user_id": "u713568912"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program sample\n implicit none\n character(len=100000)::s\n integer(8) :: i,j,m,n,a,b,c,x(3)\n integer(8),allocatable :: y(:)\n \n read(*,*) s\n x(:)=0\n n=len_trim(s)\n do i=1,n\n if (s(i:i) .eq. 'a')then\n x(1)=x(1)+1\n else if (s(i:i) .eq. 'b')then\n x(2)=x(2)+1\n else\n x(3)=x(3)+1\n end if\n end do\n \n if (abs(x(1)-x(2))<2 .and. abs(x(2)-x(3))<2 .and. abs(x(1)-x(3))<2 )then\n write(*,*) 'YES'\n else\n write(*,*)'NO'\n end if\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has a string S consisting of three kinds of letters: a, b and c.\n\nHe has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this is possible.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the objective is achievable, print YES; if it is unachievable, print NO.\n\nSample Input 1\n\nabac\n\nSample Output 1\n\nYES\n\nAs it stands now, S contains a palindrome aba, but we can permute the characters to get acba, for example, that does not contain a palindrome of length 2 or more.\n\nSample Input 2\n\naba\n\nSample Output 2\n\nNO\n\nSample Input 3\n\nbabacccabab\n\nSample Output 3\n\nYES", "sample_input": "abac\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03524", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has a string S consisting of three kinds of letters: a, b and c.\n\nHe has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this is possible.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the objective is achievable, print YES; if it is unachievable, print NO.\n\nSample Input 1\n\nabac\n\nSample Output 1\n\nYES\n\nAs it stands now, S contains a palindrome aba, but we can permute the characters to get acba, for example, that does not contain a palindrome of length 2 or more.\n\nSample Input 2\n\naba\n\nSample Output 2\n\nNO\n\nSample Input 3\n\nbabacccabab\n\nSample Output 3\n\nYES", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 559, "cpu_time_ms": 13, "memory_kb": 3080}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s339698714", "group_id": "codeNet:p03524", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n character(100000):: s\n integer(int32):: cnt(3),l,i\n\n read*, s\n l= len_trim(s)\n cnt(:) = 0\n do i=1,l\n cnt(ichar(s(i:i))-ichar('a')+1)=cnt(ichar(s(i:i))-ichar('a')+1)+1\n end do\n\n if (maxval(cnt) - minval(cnt) <= 1) then\n print'(a)', 'YES'\n else\n print'(a)', 'NO'\n end if\nend program name", "language": "Fortran", "metadata": {"date": 1587088212, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03524.html", "problem_id": "p03524", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03524/input.txt", "sample_output_relpath": "derived/input_output/data/p03524/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03524/Fortran/s339698714.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339698714", "user_id": "u234636620"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n character(100000):: s\n integer(int32):: cnt(3),l,i\n\n read*, s\n l= len_trim(s)\n cnt(:) = 0\n do i=1,l\n cnt(ichar(s(i:i))-ichar('a')+1)=cnt(ichar(s(i:i))-ichar('a')+1)+1\n end do\n\n if (maxval(cnt) - minval(cnt) <= 1) then\n print'(a)', 'YES'\n else\n print'(a)', 'NO'\n end if\nend program name", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has a string S consisting of three kinds of letters: a, b and c.\n\nHe has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this is possible.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the objective is achievable, print YES; if it is unachievable, print NO.\n\nSample Input 1\n\nabac\n\nSample Output 1\n\nYES\n\nAs it stands now, S contains a palindrome aba, but we can permute the characters to get acba, for example, that does not contain a palindrome of length 2 or more.\n\nSample Input 2\n\naba\n\nSample Output 2\n\nNO\n\nSample Input 3\n\nbabacccabab\n\nSample Output 3\n\nYES", "sample_input": "abac\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03524", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has a string S consisting of three kinds of letters: a, b and c.\n\nHe has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this is possible.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the objective is achievable, print YES; if it is unachievable, print NO.\n\nSample Input 1\n\nabac\n\nSample Output 1\n\nYES\n\nAs it stands now, S contains a palindrome aba, but we can permute the characters to get acba, for example, that does not contain a palindrome of length 2 or more.\n\nSample Input 2\n\naba\n\nSample Output 2\n\nNO\n\nSample Input 3\n\nbabacccabab\n\nSample Output 3\n\nYES", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 3, "memory_kb": 700}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s462518280", "group_id": "codeNet:p03535", "input_text": "program time_gap\n implicit none\n integer :: n, d(50), t(0:12), x, y(11), u, m, s, i, j, k\n logical :: c(0:24), f(0:24)\n d = 0\n t = 0\n y = 0\n c = .false.\n t(0) = 1\n read(*,*) n\n read(*,*) d(1:n)\n do i = 1, n\n t(d(i)) = t(d(i))+1\n end do\n if (t(0).gt.1.or.t(12).gt.1) then\n write(*,'(i0)') 0\n stop\n end if\n x = 0\n c(0) = .true.\n c(24) = .true.\n do i = 1, 11\n if (t(i).gt.2) then\n write(*,'(i0)') 0\n stop\n else if (t(i).eq.2) then\n c(i) = .true.\n c(24-i) = .true.\n else if (t(i).eq.1) then\n x = x+1\n y(x) = i\n end if\n end do\n if (t(12).eq.1) c(12) = .true.\n u = 2**x-1\n m = 0\n do k = 0, u\n f = c\n do i = 1, x\n if (btest(k,i-1)) then\n f(y(i)) = .true.\n else\n f(24-y(i)) = .true.\n end if\n end do\n s = 24\n i = 0\n do\n j = i+1\n do while (.not.f(j))\n j = j+1\n end do\n s = min(s,j-i)\n if (j.eq.24) exit\n i = j\n end do\n m = max(m,s)\n end do\n write(*,'(i0)') m\n stop\nend program time_gap", "language": "Fortran", "metadata": {"date": 1561572171, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03535.html", "problem_id": "p03535", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03535/input.txt", "sample_output_relpath": "derived/input_output/data/p03535/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03535/Fortran/s462518280.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462518280", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program time_gap\n implicit none\n integer :: n, d(50), t(0:12), x, y(11), u, m, s, i, j, k\n logical :: c(0:24), f(0:24)\n d = 0\n t = 0\n y = 0\n c = .false.\n t(0) = 1\n read(*,*) n\n read(*,*) d(1:n)\n do i = 1, n\n t(d(i)) = t(d(i))+1\n end do\n if (t(0).gt.1.or.t(12).gt.1) then\n write(*,'(i0)') 0\n stop\n end if\n x = 0\n c(0) = .true.\n c(24) = .true.\n do i = 1, 11\n if (t(i).gt.2) then\n write(*,'(i0)') 0\n stop\n else if (t(i).eq.2) then\n c(i) = .true.\n c(24-i) = .true.\n else if (t(i).eq.1) then\n x = x+1\n y(x) = i\n end if\n end do\n if (t(12).eq.1) c(12) = .true.\n u = 2**x-1\n m = 0\n do k = 0, u\n f = c\n do i = 1, x\n if (btest(k,i-1)) then\n f(y(i)) = .true.\n else\n f(24-y(i)) = .true.\n end if\n end do\n s = 24\n i = 0\n do\n j = i+1\n do while (.not.f(j))\n j = j+1\n end do\n s = min(s,j-i)\n if (j.eq.24) exit\n i = j\n end do\n m = max(m,s)\n end do\n write(*,'(i0)') m\n stop\nend program time_gap", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIn CODE FESTIVAL XXXX, there are N+1 participants from all over the world, including Takahashi.\n\nTakahashi checked and found that the time gap (defined below) between the local times in his city and the i-th person's city was D_i hours.\nThe time gap between two cities is defined as follows. For two cities A and B, if the local time in city B is d o'clock at the moment when the local time in city A is 0 o'clock, then the time gap between these two cities is defined to be min(d,24-d) hours.\nHere, we are using 24-hour notation.\nThat is, the local time in the i-th person's city is either d o'clock or 24-d o'clock at the moment when the local time in Takahashi's city is 0 o'clock, for example.\n\nThen, for each pair of two people chosen from the N+1 people, he wrote out the time gap between their cities. Let the smallest time gap among them be s hours.\n\nFind the maximum possible value of s.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq D_i \\leq 12\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the maximum possible value of s.\n\nSample Input 1\n\n3\n7 12 8\n\nSample Output 1\n\n4\n\nFor example, consider the situation where it is 7, 12 and 16 o'clock in each person's city at the moment when it is 0 o'clock in Takahashi's city. In this case, the time gap between the second and third persons' cities is 4 hours.\n\nSample Input 2\n\n2\n11 11\n\nSample Output 2\n\n2\n\nSample Input 3\n\n1\n0\n\nSample Output 3\n\n0\n\nNote that Takahashi himself is also a participant.", "sample_input": "3\n7 12 8\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03535", "source_text": "Score : 500 points\n\nProblem Statement\n\nIn CODE FESTIVAL XXXX, there are N+1 participants from all over the world, including Takahashi.\n\nTakahashi checked and found that the time gap (defined below) between the local times in his city and the i-th person's city was D_i hours.\nThe time gap between two cities is defined as follows. For two cities A and B, if the local time in city B is d o'clock at the moment when the local time in city A is 0 o'clock, then the time gap between these two cities is defined to be min(d,24-d) hours.\nHere, we are using 24-hour notation.\nThat is, the local time in the i-th person's city is either d o'clock or 24-d o'clock at the moment when the local time in Takahashi's city is 0 o'clock, for example.\n\nThen, for each pair of two people chosen from the N+1 people, he wrote out the time gap between their cities. Let the smallest time gap among them be s hours.\n\nFind the maximum possible value of s.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n0 \\leq D_i \\leq 12\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\n\nOutput\n\nPrint the maximum possible value of s.\n\nSample Input 1\n\n3\n7 12 8\n\nSample Output 1\n\n4\n\nFor example, consider the situation where it is 7, 12 and 16 o'clock in each person's city at the moment when it is 0 o'clock in Takahashi's city. In this case, the time gap between the second and third persons' cities is 4 hours.\n\nSample Input 2\n\n2\n11 11\n\nSample Output 2\n\n2\n\nSample Input 3\n\n1\n0\n\nSample Output 3\n\n0\n\nNote that Takahashi himself is also a participant.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1042, "cpu_time_ms": 7, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s381907767", "group_id": "codeNet:p03543", "input_text": "program main\n\timplicit none\n\tcharacter a*4\n\tinteger j(4),i\n\tread(*,*)a\n\tdo i=1,4\n\t\tread(a(i:i),*)j(i)\n\tenddo\n\tif((j(1)==j(2).and.j(1)==j(3)).or.(j(1)==j(3).and.j(3)==j(4)).or.&\n\t&(j(3)==j(2).and.j(4)==j(3)).or.(j(1)==j(2).and.j(2)==j(4)))then\n\t\twrite(*,*)\"Yes\"\n\telse \n\t\twrite(*,*)\"No\"\n\tendif\nend program main\n", "language": "Fortran", "metadata": {"date": 1513266549, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03543.html", "problem_id": "p03543", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03543/input.txt", "sample_output_relpath": "derived/input_output/data/p03543/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03543/Fortran/s381907767.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381907767", "user_id": "u539011156"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n\timplicit none\n\tcharacter a*4\n\tinteger j(4),i\n\tread(*,*)a\n\tdo i=1,4\n\t\tread(a(i:i),*)j(i)\n\tenddo\n\tif((j(1)==j(2).and.j(1)==j(3)).or.(j(1)==j(3).and.j(3)==j(4)).or.&\n\t&(j(3)==j(2).and.j(4)==j(3)).or.(j(1)==j(2).and.j(2)==j(4)))then\n\t\twrite(*,*)\"Yes\"\n\telse \n\t\twrite(*,*)\"No\"\n\tendif\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "sample_input": "1118\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03543", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s954129005", "group_id": "codeNet:p03544", "input_text": "program name\n\n implicit none\n integer(8) nums(87)\n integer i,N\n nums(1) = 2\n nums(2) = 1\n do i = 3, 87, 1\n nums(i) = nums(i - 1)+nums(i - 2)\n print*, nums(i)\n end do\n read*, N\n print*, (nums(N + 1))\n\nend program", "language": "Fortran", "metadata": {"date": 1560897463, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03544.html", "problem_id": "p03544", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03544/input.txt", "sample_output_relpath": "derived/input_output/data/p03544/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03544/Fortran/s954129005.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s954129005", "user_id": "u762420987"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "program name\n\n implicit none\n integer(8) nums(87)\n integer i,N\n nums(1) = 2\n nums(2) = 1\n do i = 3, 87, 1\n nums(i) = nums(i - 1)+nums(i - 2)\n print*, nums(i)\n end do\n read*, N\n print*, (nums(N + 1))\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s499437220", "group_id": "codeNet:p03545", "input_text": "integer N\ninteger A,B,C,D\nread*,N\nA=N/1000\nN=N-A*1000\nB=N/100\nN=N-B*100\nC=N/10\nN=N-C*10\nD=N\nif(A+B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"+\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A+B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"+\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"+\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nend", "language": "Fortran", "metadata": {"date": 1557118142, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03545.html", "problem_id": "p03545", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03545/input.txt", "sample_output_relpath": "derived/input_output/data/p03545/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03545/Fortran/s499437220.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s499437220", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "integer N\ninteger A,B,C,D\nread*,N\nA=N/1000\nN=N-A*1000\nB=N/100\nN=N-B*100\nC=N/10\nN=N-C*10\nD=N\nif(A+B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"+\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A+B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"+\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"+\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0,A)\",A,\"-\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "sample_input": "1222\n"}, "reference_outputs": ["1+2+2+2=7\n"], "source_document_id": "p03545", "source_text": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 805, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s211479502", "group_id": "codeNet:p03545", "input_text": "integer N\ninteger A,B,C,D\nread*,N\nA=N/1000\nN=N-A*1000\nB=N/100\nN=N-B*100\nC=N/10\nN=N-C*10\nD=N\nif(A+B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A+B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nend", "language": "Fortran", "metadata": {"date": 1557113992, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03545.html", "problem_id": "p03545", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03545/input.txt", "sample_output_relpath": "derived/input_output/data/p03545/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03545/Fortran/s211479502.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s211479502", "user_id": "u598073939"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "integer N\ninteger A,B,C,D\nread*,N\nA=N/1000\nN=N-A*1000\nB=N/100\nN=N-B*100\nC=N/10\nN=N-C*10\nD=N\nif(A+B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A+B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A+B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"+\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B+C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"+\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B+C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"+\",C,\"-\",D,\"=7\"\n stop\nend if\nif(A-B-C+D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"-\",C,\"+\",D,\"=7\"\n stop\nend if\nif(A-B-C-D==7)then\n print\"(i0,A,i0,A,i0,A,i0)\",A,\"-\",B,\"-\",C,\"-\",D,\"=7\"\n stop\nend if\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "sample_input": "1222\n"}, "reference_outputs": ["1+2+2+2=7\n"], "source_document_id": "p03545", "source_text": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s500998164", "group_id": "codeNet:p03547", "input_text": "character a,b\nread*,a,b\nif(ichar(a)ichar(b))then\n\tprint\"(A)\",\">\"\nelse\n\tprint\"(A)\",\"=\"\nendif\nend", "language": "Fortran", "metadata": {"date": 1551426807, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03547.html", "problem_id": "p03547", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03547/input.txt", "sample_output_relpath": "derived/input_output/data/p03547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03547/Fortran/s500998164.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s500998164", "user_id": "u598073939"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "character a,b\nread*,a,b\nif(ichar(a)ichar(b))then\n\tprint\"(A)\",\">\"\nelse\n\tprint\"(A)\",\"=\"\nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "sample_input": "A B\n"}, "reference_outputs": ["<\n"], "source_document_id": "p03547", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s752999994", "group_id": "codeNet:p03548", "input_text": "program name\n\n implicit none\n integer X,Y,Z\n read*, X,Y,Z\n print*, (X-Z)/(Y+Z)\n\nend program", "language": "Fortran", "metadata": {"date": 1560896377, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03548.html", "problem_id": "p03548", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03548/input.txt", "sample_output_relpath": "derived/input_output/data/p03548/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03548/Fortran/s752999994.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s752999994", "user_id": "u762420987"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program name\n\n implicit none\n integer X,Y,Z\n read*, X,Y,Z\n print*, (X-Z)/(Y+Z)\n\nend program", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a long seat of width X centimeters.\nThere are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.\n\nWe would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.\n\nAt most how many people can sit on the seat?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq X, Y, Z \\leq 10^5\n\nY+2Z \\leq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n13 3 1\n\nSample Output 1\n\n3\n\nThere is just enough room for three, as shown below:\n\nFigure\n\nSample Input 2\n\n12 3 1\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1 1\n\nSample Output 3\n\n49999\n\nSample Input 4\n\n64146 123 456\n\nSample Output 4\n\n110\n\nSample Input 5\n\n64145 123 456\n\nSample Output 5\n\n109", "sample_input": "13 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03548", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a long seat of width X centimeters.\nThere are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.\n\nWe would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.\n\nAt most how many people can sit on the seat?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq X, Y, Z \\leq 10^5\n\nY+2Z \\leq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n13 3 1\n\nSample Output 1\n\n3\n\nThere is just enough room for three, as shown below:\n\nFigure\n\nSample Input 2\n\n12 3 1\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1 1\n\nSample Output 3\n\n49999\n\nSample Input 4\n\n64146 123 456\n\nSample Output 4\n\n110\n\nSample Input 5\n\n64145 123 456\n\nSample Output 5\n\n109", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 103, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s952737103", "group_id": "codeNet:p03548", "input_text": "program main\n\timplicit none\n\tinteger x,y,z,a\n\tread(*,*)x,y,z\n\tx=x-z\n\ta=x/(y+z)\n\twrite(*,*)a\nend program main\n", "language": "Fortran", "metadata": {"date": 1512850466, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03548.html", "problem_id": "p03548", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03548/input.txt", "sample_output_relpath": "derived/input_output/data/p03548/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03548/Fortran/s952737103.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952737103", "user_id": "u539011156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger x,y,z,a\n\tread(*,*)x,y,z\n\tx=x-z\n\ta=x/(y+z)\n\twrite(*,*)a\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a long seat of width X centimeters.\nThere are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.\n\nWe would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.\n\nAt most how many people can sit on the seat?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq X, Y, Z \\leq 10^5\n\nY+2Z \\leq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n13 3 1\n\nSample Output 1\n\n3\n\nThere is just enough room for three, as shown below:\n\nFigure\n\nSample Input 2\n\n12 3 1\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1 1\n\nSample Output 3\n\n49999\n\nSample Input 4\n\n64146 123 456\n\nSample Output 4\n\n110\n\nSample Input 5\n\n64145 123 456\n\nSample Output 5\n\n109", "sample_input": "13 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03548", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a long seat of width X centimeters.\nThere are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.\n\nWe would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.\n\nAt most how many people can sit on the seat?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq X, Y, Z \\leq 10^5\n\nY+2Z \\leq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n13 3 1\n\nSample Output 1\n\n3\n\nThere is just enough room for three, as shown below:\n\nFigure\n\nSample Input 2\n\n12 3 1\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1 1\n\nSample Output 3\n\n49999\n\nSample Input 4\n\n64146 123 456\n\nSample Output 4\n\n110\n\nSample Input 5\n\n64145 123 456\n\nSample Output 5\n\n109", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s954483303", "group_id": "codeNet:p03549", "input_text": "program main\n\timplicit none\n\tinteger :: N, M\n\tread(*, *) N, M\n\twrite(*, *) (1900*M+100*(N-M))*2**M\nend program main", "language": "Fortran", "metadata": {"date": 1553109745, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03549.html", "problem_id": "p03549", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03549/input.txt", "sample_output_relpath": "derived/input_output/data/p03549/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03549/Fortran/s954483303.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954483303", "user_id": "u728000113"}, "prompt_components": {"gold_output": "3800\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger :: N, M\n\tread(*, *) N, M\n\twrite(*, *) (1900*M+100*(N-M))*2**M\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is now competing in a programming contest, but he received TLE in a problem where the answer is YES or NO.\n\nWhen he checked the detailed status of the submission, there were N test cases in the problem, and the code received TLE in M of those cases.\n\nThen, he rewrote the code to correctly solve each of those M cases with 1/2 probability in 1900 milliseconds, and correctly solve each of the other N-M cases without fail in 100 milliseconds.\n\nNow, he goes through the following process:\n\nSubmit the code.\n\nWait until the code finishes execution on all the cases.\n\nIf the code fails to correctly solve some of the M cases, submit it again.\n\nRepeat until the code correctly solve all the cases in one submission.\n\nLet the expected value of the total execution time of the code be X milliseconds. Print X (as an integer).\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq {\\rm min}(N, 5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint X, the expected value of the total execution time of the code, as an integer. It can be proved that, under the constraints in this problem, X is an integer not exceeding 10^9.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n3800\n\nIn this input, there is only one case. Takahashi will repeatedly submit the code that correctly solves this case with 1/2 probability in 1900 milliseconds.\n\nThe code will succeed in one attempt with 1/2 probability, in two attempts with 1/4 probability, and in three attempts with 1/8 probability, and so on.\n\nThus, the answer is 1900 \\times 1/2 + (2 \\times 1900) \\times 1/4 + (3 \\times 1900) \\times 1/8 + ... = 3800.\n\nSample Input 2\n\n10 2\n\nSample Output 2\n\n18400\n\nThe code will take 1900 milliseconds in each of the 2 cases, and 100 milliseconds in each of the 10-2=8 cases. The probability of the code correctly solving all the cases is 1/2 \\times 1/2 = 1/4.\n\nSample Input 3\n\n100 5\n\nSample Output 3\n\n608000", "sample_input": "1 1\n"}, "reference_outputs": ["3800\n"], "source_document_id": "p03549", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is now competing in a programming contest, but he received TLE in a problem where the answer is YES or NO.\n\nWhen he checked the detailed status of the submission, there were N test cases in the problem, and the code received TLE in M of those cases.\n\nThen, he rewrote the code to correctly solve each of those M cases with 1/2 probability in 1900 milliseconds, and correctly solve each of the other N-M cases without fail in 100 milliseconds.\n\nNow, he goes through the following process:\n\nSubmit the code.\n\nWait until the code finishes execution on all the cases.\n\nIf the code fails to correctly solve some of the M cases, submit it again.\n\nRepeat until the code correctly solve all the cases in one submission.\n\nLet the expected value of the total execution time of the code be X milliseconds. Print X (as an integer).\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq {\\rm min}(N, 5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint X, the expected value of the total execution time of the code, as an integer. It can be proved that, under the constraints in this problem, X is an integer not exceeding 10^9.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n3800\n\nIn this input, there is only one case. Takahashi will repeatedly submit the code that correctly solves this case with 1/2 probability in 1900 milliseconds.\n\nThe code will succeed in one attempt with 1/2 probability, in two attempts with 1/4 probability, and in three attempts with 1/8 probability, and so on.\n\nThus, the answer is 1900 \\times 1/2 + (2 \\times 1900) \\times 1/4 + (3 \\times 1900) \\times 1/8 + ... = 3800.\n\nSample Input 2\n\n10 2\n\nSample Output 2\n\n18400\n\nThe code will take 1900 milliseconds in each of the 2 cases, and 100 milliseconds in each of the 10-2=8 cases. The probability of the code correctly solving all the cases is 1/2 \\times 1/2 = 1/4.\n\nSample Input 3\n\n100 5\n\nSample Output 3\n\n608000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 3, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s782301890", "group_id": "codeNet:p03550", "input_text": "program main\n\timplicit none\n\tinteger n,z,w\n\tinteger,allocatable,dimension(:)::a\n\tread(*,*)n,z,w\n\tallocate(a(n))\n\tread(*,*)a(1:n)\n\tz=max(maxval(a),z)\n\tw=min(minval(a(2:n)),w)\n\twrite(*,*)abs(z-w)\nend program main\n", "language": "Fortran", "metadata": {"date": 1512852058, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03550.html", "problem_id": "p03550", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03550/input.txt", "sample_output_relpath": "derived/input_output/data/p03550/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03550/Fortran/s782301890.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s782301890", "user_id": "u539011156"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger n,z,w\n\tinteger,allocatable,dimension(:)::a\n\tread(*,*)n,z,w\n\tallocate(a(n))\n\tread(*,*)a(1:n)\n\tz=max(maxval(a),z)\n\tw=min(minval(a(2:n)),w)\n\twrite(*,*)abs(z-w)\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03550", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 5, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s214235093", "group_id": "codeNet:p03555", "input_text": "character(3) ::s,ss\nread*,s\nread*,ss\n\nif( s(1:1)==ss(3:3).and.s(2:2)==ss(2:2).and.s(3:3)==ss(1:1) )then\n print*,'YES'\nelse\n print*,'NO'\nend if\nend", "language": "Fortran", "metadata": {"date": 1580589901, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03555.html", "problem_id": "p03555", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03555/input.txt", "sample_output_relpath": "derived/input_output/data/p03555/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03555/Fortran/s214235093.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s214235093", "user_id": "u171356453"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "character(3) ::s,ss\nread*,s\nread*,ss\n\nif( s(1:1)==ss(3:3).and.s(2:2)==ss(2:2).and.s(3:3)==ss(1:1) )then\n print*,'YES'\nelse\n print*,'NO'\nend if\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "sample_input": "pot\ntop\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03555", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid with 2 rows and 3 columns of squares.\nThe color of the square at the i-th row and j-th column is represented by the character C_{ij}.\n\nWrite a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.\n\nConstraints\n\nC_{i,j}(1 \\leq i \\leq 2, 1 \\leq j \\leq 3) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nC_{11}C_{12}C_{13}\nC_{21}C_{22}C_{23}\n\nOutput\n\nPrint YES if this grid remains the same when rotated 180 degrees; print NO otherwise.\n\nSample Input 1\n\npot\ntop\n\nSample Output 1\n\nYES\n\nThis grid remains the same when rotated 180 degrees.\n\nSample Input 2\n\ntab\nbet\n\nSample Output 2\n\nNO\n\nThis grid does not remain the same when rotated 180 degrees.\n\nSample Input 3\n\neye\neel\n\nSample Output 3\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 148, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s983459008", "group_id": "codeNet:p03556", "input_text": "program main\n implicit none\n integer a,b\n integer i\n read(*,*)a\n do i=1,a\n\tb=i**2\n\tif(b>a)exit\n enddo\n write(*,*)(i-1)**2\nend program main\n", "language": "Fortran", "metadata": {"date": 1555807334, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03556.html", "problem_id": "p03556", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03556/input.txt", "sample_output_relpath": "derived/input_output/data/p03556/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03556/Fortran/s983459008.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s983459008", "user_id": "u539011156"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n integer a,b\n integer i\n read(*,*)a\n do i=1,a\n\tb=i**2\n\tif(b>a)exit\n enddo\n write(*,*)(i-1)**2\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03556", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s189828656", "group_id": "codeNet:p03557", "input_text": "integer(16) N\ninteger(16),allocatable,dimension(:)::A,B,C,D\ninteger(16) ans,i,j,k\nread*,N\nallocate(A(N),B(N),C(N),D(N))\nread*,A\nread*,B\nread*,C\ncall heapsort(n,a)\ncall heapsort(n,b)\ncall heapsort(n,c)\n\nD=0\nj=1\ndo i = 1, n\n do while (j <= n .and. a(j) < b(i))\n j = j + 1\n end do\n D(i) = j - 1\nend do\nans=0\nk=0\nj=1\ndo i = 1, n\n do while (j <= n .and. b(j) < c(i))\n k = k + D(j)\n j = j + 1\n enddo\n ans = ans + K\nenddo\n\nprint\"(i0)\",ans\n\ncontains\n\nsubroutine heapsort(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n integer(16)::i,k,j,l\n integer(16):: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\n\nend", "language": "Fortran", "metadata": {"date": 1567317143, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03557.html", "problem_id": "p03557", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03557/input.txt", "sample_output_relpath": "derived/input_output/data/p03557/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03557/Fortran/s189828656.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189828656", "user_id": "u598073939"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "integer(16) N\ninteger(16),allocatable,dimension(:)::A,B,C,D\ninteger(16) ans,i,j,k\nread*,N\nallocate(A(N),B(N),C(N),D(N))\nread*,A\nread*,B\nread*,C\ncall heapsort(n,a)\ncall heapsort(n,b)\ncall heapsort(n,c)\n\nD=0\nj=1\ndo i = 1, n\n do while (j <= n .and. a(j) < b(i))\n j = j + 1\n end do\n D(i) = j - 1\nend do\nans=0\nk=0\nj=1\ndo i = 1, n\n do while (j <= n .and. b(j) < c(i))\n k = k + D(j)\n j = j + 1\n enddo\n ans = ans + K\nenddo\n\nprint\"(i0)\",ans\n\ncontains\n\nsubroutine heapsort(n,array)\n implicit none\n integer(16),intent(in) :: n\n integer(16),intent(inout) :: array(1:n)\n integer(16)::i,k,j,l\n integer(16):: t\n\n l=n/2+1\n k=n\n do while(k /= 1)\n if(l > 1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k == 1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j<=k)\n if(j < k)then\n if(array(j) < array(j+1))j=j+1\n endif\n if (t < array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n return\nend subroutine heapsort\n\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03557", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1197, "cpu_time_ms": 175, "memory_kb": 7040}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s196561928", "group_id": "codeNet:p03559", "input_text": "module merge_sort_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n private\n public:: merge_sort, double_merge_sort\n interface merge_sort\n module procedure ms32, ms64\n end interface\n\n interface double_merge_sort\n module procedure msd3232, msd6464\n end interface\n\ncontains\n recursive subroutine ms32(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap32(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms32(ar, fst, mdl)\n call ms32(ar, mdl+1, lst)\n call merge32(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge32(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap32(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n\n recursive subroutine ms64(ar, fst, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap64(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms64(ar, fst, mdl)\n call ms64(ar, mdl+1, lst)\n call merge64(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge64(ar, fst, mdl, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst, mdl, lst\n integer(int64),allocatable:: tmp(:)\n integer(int64):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap64(x,y)\n integer(int64),intent(inout):: x,y\n integer(int64):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n recursive subroutine msd3232(ar1, ar2, fst, lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap32(ar1(fst), ar1(lst))\n call swap32(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd3232(ar1,ar2,fst,mdl)\n call msd3232(ar1,ar2,mdl+1,lst)\n call merged3232(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged3232(ar1,ar2,fst,mdl,lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,mdl,lst\n integer(int32),allocatable:: t1(:),t2(:)\n integer(int32):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n\n recursive subroutine msd6464(ar1, ar2, fst, lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap64(ar1(fst), ar1(lst))\n call swap64(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd6464(ar1,ar2,fst,mdl)\n call msd6464(ar1,ar2,mdl+1,lst)\n call merged6464(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged6464(ar1,ar2,fst,mdl,lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,mdl,lst\n integer(int64),allocatable:: t1(:),t2(:)\n integer(int64):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\nend module\n\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use merge_sort_mod\n implicit none\n integer(int64):: n,i,j,ans\n integer(int64), allocatable:: a(:), b(:), c(:)\n integer(int64), allocatable:: ca(:), cb(:)\n\n read*, n\n allocate(a(n), b(n), c(n))\n allocate(ca(0:n), cb(0:n+1), source=0_8)\n read*, a(:)\n read*, b(:)\n read*, c(:)\n\n call merge_sort(a, 1_8, n)\n call merge_sort(b, 1_8, n)\n call merge_sort(c, 1_8, n)\n\n j=1\n cb(0) = n\n do i=1,n\n cb(i) = cb(i-1)\n if (j > n) cycle\n do while(b(i) >= c(j))\n j=j+1\n cb(i)=cb(i)-1\n if (j > n) exit\n end do\n end do\n j=1\n ca(0)=n\n do i=1,n\n ca(i) = ca(i-1)\n if (j > n) cycle\n do while(a(i) >= b(j))\n j=j+1\n ca(i)=ca(i)-1\n if (j > n) exit\n end do\n end do\n do i=n-1,1,-1\n cb(i)=cb(i)+cb(i+1)\n end do\n\n ans=0\n do i=1,n\n ans=ans+cb(n+1-ca(i))\n end do\n print'(i0)', ans\nend program main", "language": "Fortran", "metadata": {"date": 1591592321, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03559.html", "problem_id": "p03559", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03559/input.txt", "sample_output_relpath": "derived/input_output/data/p03559/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03559/Fortran/s196561928.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s196561928", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module merge_sort_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n private\n public:: merge_sort, double_merge_sort\n interface merge_sort\n module procedure ms32, ms64\n end interface\n\n interface double_merge_sort\n module procedure msd3232, msd6464\n end interface\n\ncontains\n recursive subroutine ms32(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap32(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms32(ar, fst, mdl)\n call ms32(ar, mdl+1, lst)\n call merge32(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge32(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap32(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n\n recursive subroutine ms64(ar, fst, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap64(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms64(ar, fst, mdl)\n call ms64(ar, mdl+1, lst)\n call merge64(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge64(ar, fst, mdl, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst, mdl, lst\n integer(int64),allocatable:: tmp(:)\n integer(int64):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap64(x,y)\n integer(int64),intent(inout):: x,y\n integer(int64):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n recursive subroutine msd3232(ar1, ar2, fst, lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap32(ar1(fst), ar1(lst))\n call swap32(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd3232(ar1,ar2,fst,mdl)\n call msd3232(ar1,ar2,mdl+1,lst)\n call merged3232(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged3232(ar1,ar2,fst,mdl,lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,mdl,lst\n integer(int32),allocatable:: t1(:),t2(:)\n integer(int32):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n\n recursive subroutine msd6464(ar1, ar2, fst, lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap64(ar1(fst), ar1(lst))\n call swap64(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd6464(ar1,ar2,fst,mdl)\n call msd6464(ar1,ar2,mdl+1,lst)\n call merged6464(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged6464(ar1,ar2,fst,mdl,lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,mdl,lst\n integer(int64),allocatable:: t1(:),t2(:)\n integer(int64):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\nend module\n\n\nprogram main\n use,intrinsic :: iso_fortran_env\n use merge_sort_mod\n implicit none\n integer(int64):: n,i,j,ans\n integer(int64), allocatable:: a(:), b(:), c(:)\n integer(int64), allocatable:: ca(:), cb(:)\n\n read*, n\n allocate(a(n), b(n), c(n))\n allocate(ca(0:n), cb(0:n+1), source=0_8)\n read*, a(:)\n read*, b(:)\n read*, c(:)\n\n call merge_sort(a, 1_8, n)\n call merge_sort(b, 1_8, n)\n call merge_sort(c, 1_8, n)\n\n j=1\n cb(0) = n\n do i=1,n\n cb(i) = cb(i-1)\n if (j > n) cycle\n do while(b(i) >= c(j))\n j=j+1\n cb(i)=cb(i)-1\n if (j > n) exit\n end do\n end do\n j=1\n ca(0)=n\n do i=1,n\n ca(i) = ca(i-1)\n if (j > n) cycle\n do while(a(i) >= b(j))\n j=j+1\n ca(i)=ca(i)-1\n if (j > n) exit\n end do\n end do\n do i=n-1,1,-1\n cb(i)=cb(i)+cb(i+1)\n end do\n\n ans=0\n do i=1,n\n ans=ans+cb(n+1-ca(i))\n end do\n print'(i0)', ans\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03559", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7198, "cpu_time_ms": 141, "memory_kb": 5812}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s334487046", "group_id": "codeNet:p03563", "input_text": "program main\n\timplicit none\n\tinteger r,g,a\n\tread(*,*)r,g\n\ta=2*g-r\n\twrite(*,*)a\nend program main\n", "language": "Fortran", "metadata": {"date": 1510795134, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03563.html", "problem_id": "p03563", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03563/input.txt", "sample_output_relpath": "derived/input_output/data/p03563/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03563/Fortran/s334487046.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334487046", "user_id": "u539011156"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger r,g,a\n\tread(*,*)r,g\n\ta=2*g-r\n\twrite(*,*)a\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "sample_input": "2002\n2017\n"}, "reference_outputs": ["2032\n"], "source_document_id": "p03563", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s255702436", "group_id": "codeNet:p03564", "input_text": "program main\n implicit none\n integer :: n, i, k, res\n read(*, *) n\n read(*, *) k\n res = 1\n do i = 1, n\n if (res > k) then\n res = res + k\n else\n res = res * 2\n end if\n end do\n write(*, \"(i0)\") res\nend program main\n", "language": "Fortran", "metadata": {"date": 1551117311, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03564.html", "problem_id": "p03564", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03564/input.txt", "sample_output_relpath": "derived/input_output/data/p03564/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03564/Fortran/s255702436.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s255702436", "user_id": "u388927326"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer :: n, i, k, res\n read(*, *) n\n read(*, *) k\n res = 1\n do i = 1, n\n if (res > k) then\n res = res + k\n else\n res = res * 2\n end if\n end do\n write(*, \"(i0)\") res\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "sample_input": "4\n3\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03564", "source_text": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 240, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s578406132", "group_id": "codeNet:p03567", "input_text": "program prob44\n implicit none\n character(5) :: s\n integer :: i\n read(*,*) s\n do i = 1, 4\n if(s(i:i+1) == \"AC\") then\n write(*,*) \"Yes\"\n stop \n end if\n end do\n write(*,*) \"No\"\n\n stop\ncontains\nend program prob44", "language": "Fortran", "metadata": {"date": 1592631125, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03567.html", "problem_id": "p03567", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03567/input.txt", "sample_output_relpath": "derived/input_output/data/p03567/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03567/Fortran/s578406132.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578406132", "user_id": "u478462004"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program prob44\n implicit none\n character(5) :: s\n integer :: i\n read(*,*) s\n do i = 1, 4\n if(s(i:i+1) == \"AC\") then\n write(*,*) \"Yes\"\n stop \n end if\n end do\n write(*,*) \"No\"\n\n stop\ncontains\nend program prob44", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke built an online judge to hold a programming contest.\n\nWhen a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.\n(The judge can return any two-character substring of S.)\n\nDetermine whether the judge can return the string AC as the verdict to a program.\n\nConstraints\n\n2 \\leq |S| \\leq 5\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.\n\nSample Input 1\n\nBACD\n\nSample Output 1\n\nYes\n\nThe string AC appears in BACD as a contiguous substring (the second and third characters).\n\nSample Input 2\n\nABCD\n\nSample Output 2\n\nNo\n\nAlthough the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.\n\nSample Input 3\n\nCABD\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nACACA\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nXX\n\nSample Output 5\n\nNo", "sample_input": "BACD\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03567", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke built an online judge to hold a programming contest.\n\nWhen a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.\n(The judge can return any two-character substring of S.)\n\nDetermine whether the judge can return the string AC as the verdict to a program.\n\nConstraints\n\n2 \\leq |S| \\leq 5\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf the judge can return the string AC as a verdict to a program, print Yes; if it cannot, print No.\n\nSample Input 1\n\nBACD\n\nSample Output 1\n\nYes\n\nThe string AC appears in BACD as a contiguous substring (the second and third characters).\n\nSample Input 2\n\nABCD\n\nSample Output 2\n\nNo\n\nAlthough the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.\n\nSample Input 3\n\nCABD\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nACACA\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nXX\n\nSample Output 5\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 2788}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s363386119", "group_id": "codeNet:p03568", "input_text": "program sample\n implicit none\n integer N, a, k, t, i\n integer, allocatable :: x(:)\n read(*,*) N\n allocate(x(N))\n k = 1\n t = 1\n do i = 1,N\n read(*,*) a\n x(i) = a\n if ( mod(x(i), 2) == 0) then\n k = k * 2\n endif\n if (x(i) /= 1) then\n t = t * 3\n else\n t = t * 2\n endif\n end do\n write(*,*) t - k\n \n stop\nend program sample ", "language": "Fortran", "metadata": {"date": 1590373905, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03568.html", "problem_id": "p03568", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03568/input.txt", "sample_output_relpath": "derived/input_output/data/p03568/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03568/Fortran/s363386119.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s363386119", "user_id": "u924860504"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program sample\n implicit none\n integer N, a, k, t, i\n integer, allocatable :: x(:)\n read(*,*) N\n allocate(x(N))\n k = 1\n t = 1\n do i = 1,N\n read(*,*) a\n x(i) = a\n if ( mod(x(i), 2) == 0) then\n k = k * 2\n endif\n if (x(i) /= 1) then\n t = t * 3\n else\n t = t * 2\n endif\n end do\n write(*,*) t - k\n \n stop\nend program sample ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "sample_input": "2\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03568", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s486959952", "group_id": "codeNet:p03568", "input_text": "program main\n implicit none\n integer::n,ans,i,t\n integer,allocatable::x(:)\n read(*,*) n\n allocate(x(n))\n read(*,*) x\n \n t=1\n \n do i=1,n\n if(mod(x(i),2)==0)then\n \tt=t*2\n end if\n end do\n \n ans=3**n-t\n \n write(*,*) ans\n deallocate(x)\n \n stop\nend program main\n \n ", "language": "Fortran", "metadata": {"date": 1590370755, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03568.html", "problem_id": "p03568", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03568/input.txt", "sample_output_relpath": "derived/input_output/data/p03568/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03568/Fortran/s486959952.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s486959952", "user_id": "u884601206"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program main\n implicit none\n integer::n,ans,i,t\n integer,allocatable::x(:)\n read(*,*) n\n allocate(x(n))\n read(*,*) x\n \n t=1\n \n do i=1,n\n if(mod(x(i),2)==0)then\n \tt=t*2\n end if\n end do\n \n ans=3**n-t\n \n write(*,*) ans\n deallocate(x)\n \n stop\nend program main\n \n ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "sample_input": "2\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03568", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s625089184", "group_id": "codeNet:p03569", "input_text": "program sample\n implicit none\n character(100000)::s,t\n character::top,las\n integer(8) :: i,j,m,n,a,b,c0,c1\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n n=len_trim(s)\n if(n==1)then\n write(*,*)0\n end if\n a=1\n b=n\n c0=0\n c1=0\n m=0\n\n do i=1,n\n do \n if(s(a:a) .eq. 'x' .and. a=b)then\n exit\n endif\n end do\n\n write(*,*) m\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1595646253, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03569.html", "problem_id": "p03569", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03569/input.txt", "sample_output_relpath": "derived/input_output/data/p03569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03569/Fortran/s625089184.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s625089184", "user_id": "u713568912"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n character(100000)::s,t\n character::top,las\n integer(8) :: i,j,m,n,a,b,c0,c1\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n n=len_trim(s)\n if(n==1)then\n write(*,*)0\n end if\n a=1\n b=n\n c0=0\n c1=0\n m=0\n\n do i=1,n\n do \n if(s(a:a) .eq. 'x' .and. a=b)then\n exit\n endif\n end do\n\n write(*,*) m\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "sample_input": "xabxa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03569", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1017, "cpu_time_ms": 6, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s798538221", "group_id": "codeNet:p03569", "input_text": "program prob5\n implicit none\n character(len=100005)::S\n integer, allocatable::l(:), r(:)\n integer::m, i, j, tmp, ans\n read(*,*) S\n m = len_trim(S)\n allocate(l(2*(m+1)), r(2*(m+1)))\n tmp = 200000\n l = 0\n r = 0\n j = 1\n do i = 1, m\n if(S(i:i) .eq. \"x\") then\n tmp = tmp + 1\n if(i == m) then\n l(j) = tmp\n end if\n else\n l(j) = tmp\n l(j+1) = ichar(S(i:i)) - ichar('a')\n tmp = 200000\n j = j+2\n end if\n end do\n\n tmp = 200000\n j = 1\n do i = 1, m\n if(S(m-i+1:m-i+1) .eq. \"x\") then\n tmp = tmp + 1\n if(i == m) then\n r(j) = tmp\n end if\n else\n r(j) = tmp\n r(j+1) = ichar(S(m-i+1:m-i+1)) - ichar('a')\n tmp = 200000\n j = j+2\n end if\n end do\n !write(*,*) j\n\n ans = 0\n do i = 1, j/2\n if(mod(i,2) == 1) then\n ans = ans + max(l(i),l(j-i+1)) - 200000\n else\n if(l(i) /= l(j-i+1)) then\n write(*,*) -1\n stop\n end if\n end if\n end do\n\n write(*,*) ans\n stop\nend program", "language": "Fortran", "metadata": {"date": 1595642024, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03569.html", "problem_id": "p03569", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03569/input.txt", "sample_output_relpath": "derived/input_output/data/p03569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03569/Fortran/s798538221.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s798538221", "user_id": "u841856382"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program prob5\n implicit none\n character(len=100005)::S\n integer, allocatable::l(:), r(:)\n integer::m, i, j, tmp, ans\n read(*,*) S\n m = len_trim(S)\n allocate(l(2*(m+1)), r(2*(m+1)))\n tmp = 200000\n l = 0\n r = 0\n j = 1\n do i = 1, m\n if(S(i:i) .eq. \"x\") then\n tmp = tmp + 1\n if(i == m) then\n l(j) = tmp\n end if\n else\n l(j) = tmp\n l(j+1) = ichar(S(i:i)) - ichar('a')\n tmp = 200000\n j = j+2\n end if\n end do\n\n tmp = 200000\n j = 1\n do i = 1, m\n if(S(m-i+1:m-i+1) .eq. \"x\") then\n tmp = tmp + 1\n if(i == m) then\n r(j) = tmp\n end if\n else\n r(j) = tmp\n r(j+1) = ichar(S(m-i+1:m-i+1)) - ichar('a')\n tmp = 200000\n j = j+2\n end if\n end do\n !write(*,*) j\n\n ans = 0\n do i = 1, j/2\n if(mod(i,2) == 1) then\n ans = ans + max(l(i),l(j-i+1)) - 200000\n else\n if(l(i) /= l(j-i+1)) then\n write(*,*) -1\n stop\n end if\n end if\n end do\n\n write(*,*) ans\n stop\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "sample_input": "xabxa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03569", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1220, "cpu_time_ms": 12, "memory_kb": 4712}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s448639510", "group_id": "codeNet:p03573", "input_text": "integer a,b,c\nread*, a,b,c\nprint*, a+b+c-2*(a+b+c-min(a,b,c)-max(a,b,c))\nend", "language": "Fortran", "metadata": {"date": 1571885665, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03573.html", "problem_id": "p03573", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03573/input.txt", "sample_output_relpath": "derived/input_output/data/p03573/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03573/Fortran/s448639510.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s448639510", "user_id": "u244203620"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "integer a,b,c\nread*, a,b,c\nprint*, a+b+c-2*(a+b+c-min(a,b,c)-max(a,b,c))\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "sample_input": "5 7 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03573", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s903544621", "group_id": "codeNet:p03575", "input_text": "program prob5\n implicit none\n integer, allocatable::c(:,:), dist(:), cnt(:), ct(:,:), disted(:), ans(:,:)\n integer::n, m, i, j, k, a, b\n read(*,*) n, m\n allocate(c(n,n),dist(n),cnt(n),ct(n,n),disted(n),ans(n,n))\n c = 0\n do i = 1, m\n read(*,*) a, b\n c(a,b) = 1\n c(b,a) = 1\n end do\n ans = c\n do i = 1, n\n dist = 0\n disted = 0\n disted(i) = 1\n cnt = 0\n ct = c\n do j = 1, n\n if(ct(i,j) == 1) then\n dist(j) = 1\n cnt(j) = 1\n ct(i,j) = 0\n ct(j,i) = 0\n disted(j) = 1\n end if\n end do\n do while(sum(ct) > 0)\n do j = 1, n\n if(dist(j) == 1) then\n do k = 1, n\n if(ct(j,k) == 1) then\n dist(k) = 1\n if(cnt(k) > 0) then\n ans(j,k) = 0\n ans(k,j) = 0\n end if\n disted(k) = 1\n cnt(k) = cnt(k) + 1\n ct(j,k) = 0\n ct(k,j) = 0\n end if\n end do\n end if\n dist(j) = 0\n end do\n end do\n end do\n write(*,*) sum(ans)/2\n stop\nend program", "language": "Fortran", "metadata": {"date": 1598066000, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03575.html", "problem_id": "p03575", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03575/input.txt", "sample_output_relpath": "derived/input_output/data/p03575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03575/Fortran/s903544621.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s903544621", "user_id": "u841856382"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program prob5\n implicit none\n integer, allocatable::c(:,:), dist(:), cnt(:), ct(:,:), disted(:), ans(:,:)\n integer::n, m, i, j, k, a, b\n read(*,*) n, m\n allocate(c(n,n),dist(n),cnt(n),ct(n,n),disted(n),ans(n,n))\n c = 0\n do i = 1, m\n read(*,*) a, b\n c(a,b) = 1\n c(b,a) = 1\n end do\n ans = c\n do i = 1, n\n dist = 0\n disted = 0\n disted(i) = 1\n cnt = 0\n ct = c\n do j = 1, n\n if(ct(i,j) == 1) then\n dist(j) = 1\n cnt(j) = 1\n ct(i,j) = 0\n ct(j,i) = 0\n disted(j) = 1\n end if\n end do\n do while(sum(ct) > 0)\n do j = 1, n\n if(dist(j) == 1) then\n do k = 1, n\n if(ct(j,k) == 1) then\n dist(k) = 1\n if(cnt(k) > 0) then\n ans(j,k) = 0\n ans(k,j) = 0\n end if\n disted(k) = 1\n cnt(k) = cnt(k) + 1\n ct(j,k) = 0\n ct(k,j) = 0\n end if\n end do\n end if\n dist(j) = 0\n end do\n end do\n end do\n write(*,*) sum(ans)/2\n stop\nend program", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected connected graph with N vertices and M edges that does not contain self-loops and double edges.\n\nThe i-th edge (1 \\leq i \\leq M) connects Vertex a_i and Vertex b_i.\n\nAn edge whose removal disconnects the graph is called a bridge.\n\nFind the number of the edges that are bridges among the M edges.\n\nNotes\n\nA self-loop is an edge i such that a_i=b_i (1 \\leq i \\leq M).\n\nDouble edges are a pair of edges i,j such that a_i=a_j and b_i=b_j (1 \\leq i=k) then\n k=a\n s=b\n endif\nenddo\nwrite(6,\"(i0)\") k+s\nend", "language": "Fortran", "metadata": {"date": 1506824768, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03588.html", "problem_id": "p03588", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03588/input.txt", "sample_output_relpath": "derived/input_output/data/p03588/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03588/Fortran/s224842600.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s224842600", "user_id": "u909643606"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "implicit none\ninteger:: n,a,b,i,k,s\nread(5,*) n\nk=0\ns=0\ndo i=1,n\n read(5,*) a,b\n if (a>=k) then\n k=a\n s=b\n endif\nenddo\nwrite(6,\"(i0)\") k+s\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "sample_input": "3\n4 7\n2 9\n6 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03588", "source_text": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 78, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s659936063", "group_id": "codeNet:p03589", "input_text": "implicit none\ninteger(8) :: i,j,k,n\nread(5,*) n\ndo i = 1,int(3*n/4)\n do j = int(3*n/4), 3500\n if (4*i*j-N*i-N*j<=0) then\n continue\n else if (mod(N*i*j,4*i*j-N*i-N*j)==0) then\n goto 100\n endif\nenddo\nenddo\n100 write(6,\"(i0,1x,i0,1x,i0)\") i,j,(N*i*j)/(4*i*j-N*i-N*j)\nend\n", "language": "Fortran", "metadata": {"date": 1506973682, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03589.html", "problem_id": "p03589", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03589/input.txt", "sample_output_relpath": "derived/input_output/data/p03589/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03589/Fortran/s659936063.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s659936063", "user_id": "u909643606"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "implicit none\ninteger(8) :: i,j,k,n\nread(5,*) n\ndo i = 1,int(3*n/4)\n do j = int(3*n/4), 3500\n if (4*i*j-N*i-N*j<=0) then\n continue\n else if (mod(N*i*j,4*i*j-N*i-N*j)==0) then\n goto 100\n endif\nenddo\nenddo\n100 write(6,\"(i0,1x,i0,1x,i0)\") i,j,(N*i*j)/(4*i*j-N*i-N*j)\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03589", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 315, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s189923201", "group_id": "codeNet:p03589", "input_text": "implicit none\ninteger(8) :: i,j,k,n\n\nread(5,*) n\n#do i = 1, int(3*n/4)\ndo i = int(3*n/4),1,-1\n do j = int(3*n/4), 3500\n do k = i, j\n if(4*i*j*k==n*(i*j+j*k+k*i)) then\n goto 100\n endif\nenddo\nenddo\nenddo\n\n100 write(6,\"(i0,1x,i0,1x,i0)\") i,j,k\nend", "language": "Fortran", "metadata": {"date": 1506823150, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03589.html", "problem_id": "p03589", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03589/input.txt", "sample_output_relpath": "derived/input_output/data/p03589/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03589/Fortran/s189923201.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189923201", "user_id": "u909643606"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "implicit none\ninteger(8) :: i,j,k,n\n\nread(5,*) n\n#do i = 1, int(3*n/4)\ndo i = int(3*n/4),1,-1\n do j = int(3*n/4), 3500\n do k = i, j\n if(4*i*j*k==n*(i*j+j*k+k*i)) then\n goto 100\n endif\nenddo\nenddo\nenddo\n\n100 write(6,\"(i0,1x,i0,1x,i0)\") i,j,k\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03589", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1084, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s219951292", "group_id": "codeNet:p03591", "input_text": "program main\n\timplicit none\n\tcharacter:: a*10\n\tread(*,*)a\n\tif(a(1:4)==\"YAKI\")then\n\t\twrite(*,*)\"YES\"\n\telse\n\t\twrite(*,*)\"NO\"\n\tendif\nend program main\n", "language": "Fortran", "metadata": {"date": 1509160300, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03591.html", "problem_id": "p03591", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03591/input.txt", "sample_output_relpath": "derived/input_output/data/p03591/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03591/Fortran/s219951292.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s219951292", "user_id": "u539011156"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n\timplicit none\n\tcharacter:: a*10\n\tread(*,*)a\n\tif(a(1:4)==\"YAKI\")then\n\t\twrite(*,*)\"YES\"\n\telse\n\t\twrite(*,*)\"NO\"\n\tendif\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nRingo is giving a present to Snuke.\n\nRingo has found out that Snuke loves yakiniku (a Japanese term meaning grilled meat. yaki: grilled, niku: meat). He supposes that Snuke likes grilled things starting with YAKI in Japanese, and does not like other things.\n\nYou are given a string S representing the Japanese name of Ringo's present to Snuke. Determine whether S starts with YAKI.\n\nConstraints\n\n1 \\leq |S| \\leq 10\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S starts with YAKI, print Yes; otherwise, print No.\n\nSample Input 1\n\nYAKINIKU\n\nSample Output 1\n\nYes\n\nYAKINIKU starts with YAKI.\n\nSample Input 2\n\nTAKOYAKI\n\nSample Output 2\n\nNo\n\nTAKOYAKI (a Japanese snack. tako: octopus) does not start with YAKI.\n\nSample Input 3\n\nYAK\n\nSample Output 3\n\nNo", "sample_input": "YAKINIKU\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03591", "source_text": "Score : 100 points\n\nProblem Statement\n\nRingo is giving a present to Snuke.\n\nRingo has found out that Snuke loves yakiniku (a Japanese term meaning grilled meat. yaki: grilled, niku: meat). He supposes that Snuke likes grilled things starting with YAKI in Japanese, and does not like other things.\n\nYou are given a string S representing the Japanese name of Ringo's present to Snuke. Determine whether S starts with YAKI.\n\nConstraints\n\n1 \\leq |S| \\leq 10\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S starts with YAKI, print Yes; otherwise, print No.\n\nSample Input 1\n\nYAKINIKU\n\nSample Output 1\n\nYes\n\nYAKINIKU starts with YAKI.\n\nSample Input 2\n\nTAKOYAKI\n\nSample Output 2\n\nNo\n\nTAKOYAKI (a Japanese snack. tako: octopus) does not start with YAKI.\n\nSample Input 3\n\nYAK\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 7, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s165865815", "group_id": "codeNet:p03593", "input_text": "program prob6\n implicit none\n integer::H, W, i, j, tmp\n character(len=100)::S\n integer::c(26)\n read(*,*) H, W\n c = 0\n do i = 1, H\n read(*,*) S\n do j = 1, W\n tmp = ichar(S(j:j)) - ichar('a') + 1\n c(tmp) = c(tmp) + 1\n end do\n end do\n if(mod(H*W,2) == 0) then\n \ttmp = 0\n do i = 1, 26\n if(mod(c(i),2) == 1) then\n write(*,'(a)') \"No\"\n stop\n else if(c(i) > 0) then\n \ttmp = tmp + 1\n end if\n end do\n if(mod(tmp,2) == 0) then\n \twrite(*,'(a)') \"No\"\n \tstop\n end if\n else\n tmp = 0\n do i = 1, 26\n if(mod(c(i),2) == 1) then\n tmp = tmp + 1\n end if\n end do\n if(tmp /= 1) then\n write(*,'(a)') \"No\"\n end if\n end if\n write(*,'(a)') \"Yes\"\n stop\nend program", "language": "Fortran", "metadata": {"date": 1596853355, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03593.html", "problem_id": "p03593", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03593/input.txt", "sample_output_relpath": "derived/input_output/data/p03593/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03593/Fortran/s165865815.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s165865815", "user_id": "u841856382"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program prob6\n implicit none\n integer::H, W, i, j, tmp\n character(len=100)::S\n integer::c(26)\n read(*,*) H, W\n c = 0\n do i = 1, H\n read(*,*) S\n do j = 1, W\n tmp = ichar(S(j:j)) - ichar('a') + 1\n c(tmp) = c(tmp) + 1\n end do\n end do\n if(mod(H*W,2) == 0) then\n \ttmp = 0\n do i = 1, 26\n if(mod(c(i),2) == 1) then\n write(*,'(a)') \"No\"\n stop\n else if(c(i) > 0) then\n \ttmp = tmp + 1\n end if\n end do\n if(mod(tmp,2) == 0) then\n \twrite(*,'(a)') \"No\"\n \tstop\n end if\n else\n tmp = 0\n do i = 1, 26\n if(mod(c(i),2) == 1) then\n tmp = tmp + 1\n end if\n end do\n if(tmp /= 1) then\n write(*,'(a)') \"No\"\n end if\n end if\n write(*,'(a)') \"Yes\"\n stop\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an H-by-W matrix.\nLet a_{ij} be the element at the i-th row from the top and j-th column from the left.\nIn this matrix, each a_{ij} is a lowercase English letter.\n\nSnuke is creating another H-by-W matrix, A', by freely rearranging the elements in A.\nHere, he wants to satisfy the following condition:\n\nEvery row and column in A' can be read as a palindrome.\n\nDetermine whether he can create a matrix satisfying the condition.\n\nNote\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are all palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf Snuke can create a matrix satisfying the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 4\naabb\naabb\naacc\n\nSample Output 1\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nabba\nacca\nabba\n\nSample Input 2\n\n2 2\naa\nbb\n\nSample Output 2\n\nNo\n\nIt is not possible to create a matrix satisfying the condition, no matter how we rearrange the elements in A.\n\nSample Input 3\n\n5 1\nt\nw\ne\ne\nt\n\nSample Output 3\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nt\ne\nw\ne\nt\n\nSample Input 4\n\n2 5\nabxba\nabyba\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n1 1\nz\n\nSample Output 5\n\nYes", "sample_input": "3 4\naabb\naabb\naacc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03593", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an H-by-W matrix.\nLet a_{ij} be the element at the i-th row from the top and j-th column from the left.\nIn this matrix, each a_{ij} is a lowercase English letter.\n\nSnuke is creating another H-by-W matrix, A', by freely rearranging the elements in A.\nHere, he wants to satisfy the following condition:\n\nEvery row and column in A' can be read as a palindrome.\n\nDetermine whether he can create a matrix satisfying the condition.\n\nNote\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are all palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf Snuke can create a matrix satisfying the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 4\naabb\naabb\naacc\n\nSample Output 1\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nabba\nacca\nabba\n\nSample Input 2\n\n2 2\naa\nbb\n\nSample Output 2\n\nNo\n\nIt is not possible to create a matrix satisfying the condition, no matter how we rearrange the elements in A.\n\nSample Input 3\n\n5 1\nt\nw\ne\ne\nt\n\nSample Output 3\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nt\ne\nw\ne\nt\n\nSample Input 4\n\n2 5\nabxba\nabyba\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n1 1\nz\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 921, "cpu_time_ms": 8, "memory_kb": 2928}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s319659656", "group_id": "codeNet:p03597", "input_text": "integer(8) :: n,a\nread*,n\nread*,a\nprint*,n*n-a\nend", "language": "Fortran", "metadata": {"date": 1580694710, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03597.html", "problem_id": "p03597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03597/input.txt", "sample_output_relpath": "derived/input_output/data/p03597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03597/Fortran/s319659656.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s319659656", "user_id": "u171356453"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "integer(8) :: n,a\nread*,n\nread*,a\nprint*,n*n-a\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s702251319", "group_id": "codeNet:p03597", "input_text": "program ABC074A\n implicit none\n integer(8)::N,A\n read(5,*)N,A\n print'(i0)',N**2-A\nend program ABC074A", "language": "Fortran", "metadata": {"date": 1578993216, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03597.html", "problem_id": "p03597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03597/input.txt", "sample_output_relpath": "derived/input_output/data/p03597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03597/Fortran/s702251319.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s702251319", "user_id": "u414699019"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program ABC074A\n implicit none\n integer(8)::N,A\n read(5,*)N,A\n print'(i0)',N**2-A\nend program ABC074A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s349603878", "group_id": "codeNet:p03598", "input_text": "program sample\n implicit none\n \n integer(8) :: a,b,c,i,j,m,n,k,a1,b1,c1\n integer(8), allocatable ::x(:) \n\n read(*,*) n\n \n read(*,*) k\n \n allocate(x(n))\n read(*,*) x\n m=0\n do i=1,n\n m=m+k-abs(k-2*x(i))\n end do\n write(*,*)m\n deallocate(x)\n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1592158312, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03598.html", "problem_id": "p03598", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03598/input.txt", "sample_output_relpath": "derived/input_output/data/p03598/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03598/Fortran/s349603878.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s349603878", "user_id": "u713568912"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: a,b,c,i,j,m,n,k,a1,b1,c1\n integer(8), allocatable ::x(:) \n\n read(*,*) n\n \n read(*,*) k\n \n allocate(x(n))\n read(*,*) x\n m=0\n do i=1,n\n m=m+k-abs(k-2*x(i))\n end do\n write(*,*)m\n deallocate(x)\n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i).\nThus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.\n\nIn order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B.\nThen, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i).\nThus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.\n\nWhen activated, each type of robot will operate as follows.\n\nWhen a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nWhen a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nSnuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n0 < x_i < K\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nK\nx_1 x_2 ... x_N\n\nOutputs\n\nPrint the minimum possible total distance covered by robots.\n\nSample Input 1\n\n1\n10\n2\n\nSample Output 1\n\n4\n\nThere are just one ball, one type-A robot and one type-B robot.\n\nIf the type-A robot is used to collect the ball, the distance from the robot to the ball is 2, and the distance from the ball to the original position of the robot is also 2, for a total distance of 4.\n\nSimilarly, if the type-B robot is used, the total distance covered will be 16.\n\nThus, the total distance covered will be minimized when the type-A robot is used. The output should be 4.\n\nSample Input 2\n\n2\n9\n3 6\n\nSample Output 2\n\n12\n\nThe total distance covered will be minimized when the first ball is collected by the type-A robot, and the second ball by the type-B robot.\n\nSample Input 3\n\n5\n20\n11 12 9 17 12\n\nSample Output 3\n\n74", "sample_input": "1\n10\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03598", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i).\nThus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.\n\nIn order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B.\nThen, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i).\nThus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.\n\nWhen activated, each type of robot will operate as follows.\n\nWhen a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nWhen a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nSnuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n0 < x_i < K\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nK\nx_1 x_2 ... x_N\n\nOutputs\n\nPrint the minimum possible total distance covered by robots.\n\nSample Input 1\n\n1\n10\n2\n\nSample Output 1\n\n4\n\nThere are just one ball, one type-A robot and one type-B robot.\n\nIf the type-A robot is used to collect the ball, the distance from the robot to the ball is 2, and the distance from the ball to the original position of the robot is also 2, for a total distance of 4.\n\nSimilarly, if the type-B robot is used, the total distance covered will be 16.\n\nThus, the total distance covered will be minimized when the type-A robot is used. The output should be 4.\n\nSample Input 2\n\n2\n9\n3 6\n\nSample Output 2\n\n12\n\nThe total distance covered will be minimized when the first ball is collected by the type-A robot, and the second ball by the type-B robot.\n\nSample Input 3\n\n5\n20\n11 12 9 17 12\n\nSample Output 3\n\n74", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s364887437", "group_id": "codeNet:p03599", "input_text": "program main\n integer :: A,B,C,D,E,F, asn1, ans2, ac=0, bc = 0, nw = 0, max_num, cc=0, dc=0, sg, agres, k=1\n logical :: flag = .true.\n integer :: water(1000) = 0\n\n read *, A,B,C,D,E,F\n do i = 0,1000\n do j = 0,1000\n if(A*i+B*j <= F/100) then\n water(k) = A*i+B*j\n k = k + 1\n else\n exit\n end if\n end do\n end do\n\n max_num = k-1\n ans1 = A*100\n ans2 = 0\n\n do i=2,max_num\n do j=0,(F/100)*E/C\n do l=0,E*F/100/D\n if(real(C*j+D*l) <= E*water(i) .and. water(i)*100 + C*j+D*l <= F) then\n sg = C*j+D*l\n else\n exit\n end if\n end do\n if(real(ans2)/real(ans1) < real(sg)/real(water(i)*100+sg)) then\n ans1 = water(i)*100 + sg\n ans2 = sg\n end if\n end do\n end do\n print *, int(ans1), ans2\nend program main", "language": "Fortran", "metadata": {"date": 1517512372, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03599.html", "problem_id": "p03599", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03599/input.txt", "sample_output_relpath": "derived/input_output/data/p03599/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03599/Fortran/s364887437.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s364887437", "user_id": "u085486962"}, "prompt_components": {"gold_output": "110 10\n", "input_to_evaluate": "program main\n integer :: A,B,C,D,E,F, asn1, ans2, ac=0, bc = 0, nw = 0, max_num, cc=0, dc=0, sg, agres, k=1\n logical :: flag = .true.\n integer :: water(1000) = 0\n\n read *, A,B,C,D,E,F\n do i = 0,1000\n do j = 0,1000\n if(A*i+B*j <= F/100) then\n water(k) = A*i+B*j\n k = k + 1\n else\n exit\n end if\n end do\n end do\n\n max_num = k-1\n ans1 = A*100\n ans2 = 0\n\n do i=2,max_num\n do j=0,(F/100)*E/C\n do l=0,E*F/100/D\n if(real(C*j+D*l) <= E*water(i) .and. water(i)*100 + C*j+D*l <= F) then\n sg = C*j+D*l\n else\n exit\n end if\n end do\n if(real(ans2)/real(ans1) < real(sg)/real(water(i)*100+sg)) then\n ans1 = water(i)*100 + sg\n ans2 = sg\n end if\n end do\n end do\n print *, int(ans1), ans2\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "sample_input": "1 2 10 20 15 200\n"}, "reference_outputs": ["110 10\n"], "source_document_id": "p03599", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 984, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s060431592", "group_id": "codeNet:p03605", "input_text": "program main\n\timplicit none\n\tinteger n,modn\n\tread(*,*)n\n\tmodn=mod(n,10)\n\tn=n-modn\n\tif(n==90 .or. modn==9)then\n\t\twrite(*,\"(a3)\")\"Yes\"\n\telse\n\t\twrite(*,\"(a2)\")\"No\"\n\tendif\nend program main\n", "language": "Fortran", "metadata": {"date": 1505426534, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03605.html", "problem_id": "p03605", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03605/input.txt", "sample_output_relpath": "derived/input_output/data/p03605/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03605/Fortran/s060431592.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s060431592", "user_id": "u539011156"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger n,modn\n\tread(*,*)n\n\tmodn=mod(n,10)\n\tn=n-modn\n\tif(n==90 .or. modn==9)then\n\t\twrite(*,\"(a3)\")\"Yes\"\n\telse\n\t\twrite(*,\"(a2)\")\"No\"\n\tendif\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "sample_input": "29\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03605", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 185, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s833364351", "group_id": "codeNet:p03607", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,b\n integer(8),allocatable :: a(:),y(:)\n \n read(*,*) n\n allocate(a(n))\n do i=1,n\n read(*,*)a(i)\n end do\n call msort(a)\n b=0\n m=0\n do i=1,n-1\n if(a(i)==a(i+1))then\n a(i)=0\n b=i+1\n else if(b==i)then\n a(i)=0\n b=0\n else\n m=m+1\n end if\n end do\n write(*,*)m\n stop\n contains\n\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n \n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1594594637, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03607.html", "problem_id": "p03607", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03607/input.txt", "sample_output_relpath": "derived/input_output/data/p03607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03607/Fortran/s833364351.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s833364351", "user_id": "u713568912"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,b\n integer(8),allocatable :: a(:),y(:)\n \n read(*,*) n\n allocate(a(n))\n do i=1,n\n read(*,*)a(i)\n end do\n call msort(a)\n b=0\n m=0\n do i=1,n-1\n if(a(i)==a(i+1))then\n a(i)=0\n b=i+1\n else if(b==i)then\n a(i)=0\n b=0\n else\n m=m+1\n end if\n end do\n write(*,*)m\n stop\n contains\n\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n \n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are playing the following game with Joisino.\n\nInitially, you have a blank sheet of paper.\n\nJoisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.\n\nThen, you are asked a question: How many numbers are written on the sheet now?\n\nThe numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?\n\nConstraints\n\n1≤N≤100000\n\n1≤A_i≤1000000000(=10^9)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint how many numbers will be written on the sheet at the end of the game.\n\nSample Input 1\n\n3\n6\n2\n6\n\nSample Output 1\n\n1\n\nThe game proceeds as follows:\n\n6 is not written on the sheet, so write 6.\n\n2 is not written on the sheet, so write 2.\n\n6 is written on the sheet, so erase 6.\n\nThus, the sheet contains only 2 in the end. The answer is 1.\n\nSample Input 2\n\n4\n2\n5\n5\n2\n\nSample Output 2\n\n0\n\nIt is possible that no number is written on the sheet in the end.\n\nSample Input 3\n\n6\n12\n22\n16\n22\n18\n12\n\nSample Output 3\n\n2", "sample_input": "3\n6\n2\n6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03607", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are playing the following game with Joisino.\n\nInitially, you have a blank sheet of paper.\n\nJoisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.\n\nThen, you are asked a question: How many numbers are written on the sheet now?\n\nThe numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?\n\nConstraints\n\n1≤N≤100000\n\n1≤A_i≤1000000000(=10^9)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint how many numbers will be written on the sheet at the end of the game.\n\nSample Input 1\n\n3\n6\n2\n6\n\nSample Output 1\n\n1\n\nThe game proceeds as follows:\n\n6 is not written on the sheet, so write 6.\n\n2 is not written on the sheet, so write 2.\n\n6 is written on the sheet, so erase 6.\n\nThus, the sheet contains only 2 in the end. The answer is 1.\n\nSample Input 2\n\n4\n2\n5\n5\n2\n\nSample Output 2\n\n0\n\nIt is possible that no number is written on the sheet in the end.\n\nSample Input 3\n\n6\n12\n22\n16\n22\n18\n12\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1748, "cpu_time_ms": 58, "memory_kb": 4308}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s337707453", "group_id": "codeNet:p03610", "input_text": "program ABC_072_B_OddString\n implicit none\n integer(8) i\n character(100000) s\n read(*, *) s\n do i = 2, len_trim(s)\n s(i:i)= s(2*i-1:2*i-1)\n end do\n write(*, *) trim(s)\nend program ABC_072_B_OddString", "language": "Fortran", "metadata": {"date": 1525928858, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03610/input.txt", "sample_output_relpath": "derived/input_output/data/p03610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03610/Fortran/s337707453.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s337707453", "user_id": "u728000113"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "program ABC_072_B_OddString\n implicit none\n integer(8) i\n character(100000) s\n read(*, *) s\n do i = 2, len_trim(s)\n s(i:i)= s(2*i-1:2*i-1)\n end do\n write(*, *) trim(s)\nend program ABC_072_B_OddString", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "sample_input": "atcoder\n"}, "reference_outputs": ["acdr\n"], "source_document_id": "p03610", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 219, "cpu_time_ms": 99, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s625375836", "group_id": "codeNet:p03610", "input_text": "program ABC_072_B_OddString\n implicit none\n integer i\n character(100000) s\n character(50000) ans\n read(*, *) s\n ans = ''\n do i = 2, len_trim(s)\n s(i:i)= s(2*i-1:2*i-1)\n end do\n write(*, *) trim(s)\nend program ABC_072_B_OddString", "language": "Fortran", "metadata": {"date": 1525928743, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03610/input.txt", "sample_output_relpath": "derived/input_output/data/p03610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03610/Fortran/s625375836.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s625375836", "user_id": "u728000113"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "program ABC_072_B_OddString\n implicit none\n integer i\n character(100000) s\n character(50000) ans\n read(*, *) s\n ans = ''\n do i = 2, len_trim(s)\n s(i:i)= s(2*i-1:2*i-1)\n end do\n write(*, *) trim(s)\nend program ABC_072_B_OddString", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "sample_input": "atcoder\n"}, "reference_outputs": ["acdr\n"], "source_document_id": "p03610", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 104, "memory_kb": 1276}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s972999597", "group_id": "codeNet:p03616", "input_text": "program sandglass\n implicit none\n integer :: x, k, q, a(100000), tt(200000,2), ans(100000), i\n integer :: tlft, trit, alft, arit, t0, t1, s\n logical :: rev\n a = 0\n tt = 0\n ans = 0\n read(*,*) x\n read(*,*) k\n read(*,*) tt(1:k,1)\n read(*,*) q\n do i = 1, q\n read(*,*) tt(k+i,1), a(i)\n tt(k+i,2) = i\n end do\n call merge_sort(tt(1:k+q,1:2))\n tlft = 0\n trit = x\n alft = 0\n arit = x\n rev = .false.\n t0 = 0\n do i = 1, k+q\n t1 = tt(i,1)\n s = tt(i,2)\n alft = alft-(t1-t0)\n if (alft.lt.0) then\n tlft = tlft-alft\n if (tlft.gt.x) tlft = x\n alft = 0\n end if\n arit = arit-(t1-t0)\n if (arit.lt.0) then\n trit = trit+arit\n if (trit.lt.0) trit = 0\n arit = 0\n end if\n if (tlft.ge.trit) then\n if (rev) then\n tlft = trit-1\n if (tlft.lt.0) tlft = 0\n else\n trit = tlft+1\n if (trit.gt.x) trit = x\n end if\n end if\n t0 = t1\n if (s.eq.0) then\n rev = .not.rev\n alft = x-alft\n arit = x-arit\n cycle\n end if\n if (a(s).le.tlft) then\n ans(s) = alft\n else if (a(s).ge.trit) then\n ans(s) = arit\n else\n ans(s) = a(s)-tlft+alft\n if (rev) ans(s) = -a(s)+tlft+alft\n end if\n if (rev) ans(s) = x-ans(s)\n end do\n do i = 1, q\n write(*,'(i0)') ans(i)\n end do\n stop\ncontains\n subroutine merge_sort(c)\n implicit none\n integer, intent(inout) :: c(:,:)\n integer :: n, m, l, u, i\n n = size(c(:,1))\n m = n\n l = 1\n do while (m.gt.1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(c(2*(i-1)*l+1:(2*i-1)*l,:),c((2*i-1)*l+1:u,:))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merger(c1,c2)\n implicit none\n integer, intent(inout) :: c1(:,:), c2(:,:)\n integer :: c(size(c1(:,1))+size(c2(:,1)),size(c2(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while ((i1.le.n1).and.(i2.le.n2))\n if (c1(i1,1).le.c2(i2,1)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2.le.n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merger\nend program sandglass", "language": "Fortran", "metadata": {"date": 1562436698, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03616.html", "problem_id": "p03616", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03616/input.txt", "sample_output_relpath": "derived/input_output/data/p03616/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03616/Fortran/s972999597.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972999597", "user_id": "u506403362"}, "prompt_components": {"gold_output": "60\n1\n120\n", "input_to_evaluate": "program sandglass\n implicit none\n integer :: x, k, q, a(100000), tt(200000,2), ans(100000), i\n integer :: tlft, trit, alft, arit, t0, t1, s\n logical :: rev\n a = 0\n tt = 0\n ans = 0\n read(*,*) x\n read(*,*) k\n read(*,*) tt(1:k,1)\n read(*,*) q\n do i = 1, q\n read(*,*) tt(k+i,1), a(i)\n tt(k+i,2) = i\n end do\n call merge_sort(tt(1:k+q,1:2))\n tlft = 0\n trit = x\n alft = 0\n arit = x\n rev = .false.\n t0 = 0\n do i = 1, k+q\n t1 = tt(i,1)\n s = tt(i,2)\n alft = alft-(t1-t0)\n if (alft.lt.0) then\n tlft = tlft-alft\n if (tlft.gt.x) tlft = x\n alft = 0\n end if\n arit = arit-(t1-t0)\n if (arit.lt.0) then\n trit = trit+arit\n if (trit.lt.0) trit = 0\n arit = 0\n end if\n if (tlft.ge.trit) then\n if (rev) then\n tlft = trit-1\n if (tlft.lt.0) tlft = 0\n else\n trit = tlft+1\n if (trit.gt.x) trit = x\n end if\n end if\n t0 = t1\n if (s.eq.0) then\n rev = .not.rev\n alft = x-alft\n arit = x-arit\n cycle\n end if\n if (a(s).le.tlft) then\n ans(s) = alft\n else if (a(s).ge.trit) then\n ans(s) = arit\n else\n ans(s) = a(s)-tlft+alft\n if (rev) ans(s) = -a(s)+tlft+alft\n end if\n if (rev) ans(s) = x-ans(s)\n end do\n do i = 1, q\n write(*,'(i0)') ans(i)\n end do\n stop\ncontains\n subroutine merge_sort(c)\n implicit none\n integer, intent(inout) :: c(:,:)\n integer :: n, m, l, u, i\n n = size(c(:,1))\n m = n\n l = 1\n do while (m.gt.1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(c(2*(i-1)*l+1:(2*i-1)*l,:),c((2*i-1)*l+1:u,:))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n return\n end subroutine merge_sort\n subroutine merger(c1,c2)\n implicit none\n integer, intent(inout) :: c1(:,:), c2(:,:)\n integer :: c(size(c1(:,1))+size(c2(:,1)),size(c2(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while ((i1.le.n1).and.(i2.le.n2))\n if (c1(i1,1).le.c2(i2,1)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1.le.n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2.le.n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n return\n end subroutine merger\nend program sandglass", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of sand.\nWhen we put the sandglass, either bulb A or B lies on top of the other and becomes the upper bulb. The other bulb becomes the lower bulb.\n\nThe sand drops from the upper bulb to the lower bulb at a rate of 1 gram per second.\nWhen the upper bulb no longer contains any sand, nothing happens.\n\nInitially at time 0, bulb A is the upper bulb and contains a grams of sand; bulb B contains X-a grams of sand (for a total of X grams).\n\nWe will turn over the sandglass at time r_1,r_2,..,r_K. Assume that this is an instantaneous action and takes no time. Here, time t refer to the time t seconds after time 0.\n\nYou are given Q queries.\nEach query is in the form of (t_i,a_i).\nFor each query, assume that a=a_i and find the amount of sand that would be contained in bulb A at time t_i.\n\nConstraints\n\n1≤X≤10^9\n\n1≤K≤10^5\n\n1≤r_1 null()\n contains\n procedure :: init => init_bit\n procedure :: release => release_bit\n procedure :: add => get_addition\n procedure :: sum => get_summation\n procedure :: range => get_partial_summation\n procedure :: val => get_value\n procedure :: lower_bound => get_lower_bound\n procedure :: update => get_updated\n procedure :: max => get_maximum\n end type t_fenwick_tree\ncontains\n subroutine init_bit(this,n)\n class(t_fenwick_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n this%n = n\n allocate(this%arr(n))\n this%arr = 0\n do while (lshift(p,1) <= n)\n p = lshift(p,1)\n end do\n this%p = p\n end\n subroutine release_bit(this)\n class(t_fenwick_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine get_addition(this,i,v)\n class(t_fenwick_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i\n do while (x <= this%n)\n this%arr(x) = this%arr(x)+v\n x = x+and(x,-x)\n end do\n end\n function get_summation(this,i) result(s)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: i\n integer :: x\n integer :: s\n s = -1\n if (i > this%n) return\n s = 0\n x = i\n do while (x > 0)\n s = s+this%arr(x)\n x = x-and(x,-x)\n end do\n end\n function get_partial_summation(this,l,r) result(s)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: l, r\n integer :: i, j\n integer :: s\n s = -1\n if (l > r) return\n s = 0\n i = l-1\n j = r\n do while (j > i)\n s = s+this%arr(j)\n j = j-and(j,-j)\n end do\n do while (i > j)\n s = s-this%arr(i)\n i = i-and(i,-i)\n end do\n end\n function get_value(this,i) result(v)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: i\n integer :: x\n integer :: v\n v = get_partial_summation(this,i,i)\n end\n function get_lower_bound(this,v) result(x)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: v\n integer :: x, k\n integer :: w\n x = 0\n if (v <= 0) return\n k = this%p\n w = v\n do while (k > 0)\n if (x+k <= this%n .and. this%arr(x+k) < w) then\n w = w-this%arr(x+k)\n x = x+k\n end if\n k = rshift(k,1)\n end do\n x = x+1\n end\n subroutine get_updated(this,i,v)\n class(t_fenwick_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i\n do while (x <= this%n)\n if (this%arr(x) < v) this%arr(x) = v\n x = x+and(x,-x)\n end do\n end\n function get_maximum(this,i) result(m)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: i\n integer :: x, m\n x = i\n m = 0\n do while (x > 0)\n m = max(m,this%arr(x))\n x = x-and(x,-x)\n end do\n end\nend module mod_fenwick_tree\nprogram fountain_walk\n implicit none\n real(8), parameter :: pi = 3.14159265358979d0\n real(8), parameter :: k1 = 100.d0, k2 = 20.d0-5.d0*pi, k3 = 10.d0*pi-20.d0\n integer :: n, i\n integer(8) :: x1, y1, x2, y2, x(200000) = 0_8, y(200000) = 0_8\n integer(8) :: s, p, q, k\n character(64) :: ans\n read(*,*) x1, y1, x2, y2\n read(*,*) n\n do i = 1, n\n read(*,*) x(i), y(i)\n end do\n if (x1 > x2) then\n call swap(x1,x2)\n call swap(y1,y2)\n end if\n if (y1 > y2) then\n y1 = -y1\n y2 = -y2\n y(1:n) = -y(1:n)\n end if\n s = x2-x1+y2-y1\n k = int(max(lis(x(1:n),y(1:n),x1,y1,x2,y2),lis(y(1:n),x(1:n),y1,x1,y2,x2)),8)\n if (k == min(x2-x1,y2-y1)+1_8) then\n p = k-1_8\n q = 1_8\n else\n p = k\n q = 0_8\n end if\n write(ans,'(f32.16)') k1*s-k2*p+k3*q\n write(*,'(a)') trim(adjustl(ans))\ncontains\n subroutine swap(a,b)\n integer(8), intent(inout) :: a, b\n a = xor(a,b)\n b = xor(a,b)\n a = xor(a,b)\n end\n integer function lis(x,y,x1,y1,x2,y2)\n use mod_fenwick_tree\n integer(8), intent(in) :: x(:), y(:), x1, y1, x2, y2\n integer(8) :: c(size(x),2)\n integer :: n, z(size(x)), t, i, j, k\n type(t_fenwick_tree) :: bit\n lis = 0\n n = size(x)\n c(:,1) = x\n c(:,2) = y\n call merge_sort(c)\n j = 1\n do while (j <= n .and. c(j,1) < x1)\n j = j+1\n end do\n if (j > n) return\n k = n\n do while (k >= 1 .and. c(k,1) > x2)\n k = k-1\n end do\n if (k < 1) return\n z = compress(c(:,2))\n call bit%init(n)\n do i = j, k\n if (c(i,2) <= y1 .or. y2 <= c(i,2)) cycle\n t = bit%max(z(i)-1)+1\n lis = max(lis,t)\n call bit%update(z(i),t)\n end do\n end\n function compress(x) result(ret)\n implicit none\n integer(8), intent(in) :: x(:)\n integer(8) :: y(size(x),2)\n integer :: n, i, k, ret(size(x))\n n = size(x)\n y(:,1) = x\n do i = 1, n\n y(i,2) = int(i,8)\n end do\n call merge_sort(y)\n k = 0\n ret(y(1,2)) = 1\n do i = 2, n\n if (y(i,1) == y(i-1,1)) k = k+1\n ret(y(i,2)) = i-k\n end do\n end\n subroutine merge_sort(c)\n integer(8), intent(inout) :: c(:,:)\n integer :: n, m, l, u, i\n n = size(c(:,1))\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(c(2*(i-1)*l+1:(2*i-1)*l,:),c((2*i-1)*l+1:u,:))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n end\n subroutine merger(c1,c2)\n integer(8), intent(inout) :: c1(:,:), c2(:,:)\n integer(8) :: c(size(c1(:,1))+size(c2(:,1)),size(c2(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while (i1 <= n1 .and. i2 <= n2)\n if (c1(i1,1) < c2(i2,1) .or. &\n & c1(i1,1) == c2(i2,1) .and. c1(i1,2) > c2(i2,2)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 <= n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n end\nend program fountain_walk", "language": "Fortran", "metadata": {"date": 1567829382, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03619.html", "problem_id": "p03619", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03619/input.txt", "sample_output_relpath": "derived/input_output/data/p03619/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03619/Fortran/s684403218.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s684403218", "user_id": "u506403362"}, "prompt_components": {"gold_output": "891.415926535897938\n", "input_to_evaluate": "module mod_fenwick_tree\n implicit none\n type t_fenwick_tree\n private\n integer :: n, p\n integer, pointer :: arr(:) => null()\n contains\n procedure :: init => init_bit\n procedure :: release => release_bit\n procedure :: add => get_addition\n procedure :: sum => get_summation\n procedure :: range => get_partial_summation\n procedure :: val => get_value\n procedure :: lower_bound => get_lower_bound\n procedure :: update => get_updated\n procedure :: max => get_maximum\n end type t_fenwick_tree\ncontains\n subroutine init_bit(this,n)\n class(t_fenwick_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n this%n = n\n allocate(this%arr(n))\n this%arr = 0\n do while (lshift(p,1) <= n)\n p = lshift(p,1)\n end do\n this%p = p\n end\n subroutine release_bit(this)\n class(t_fenwick_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine get_addition(this,i,v)\n class(t_fenwick_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i\n do while (x <= this%n)\n this%arr(x) = this%arr(x)+v\n x = x+and(x,-x)\n end do\n end\n function get_summation(this,i) result(s)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: i\n integer :: x\n integer :: s\n s = -1\n if (i > this%n) return\n s = 0\n x = i\n do while (x > 0)\n s = s+this%arr(x)\n x = x-and(x,-x)\n end do\n end\n function get_partial_summation(this,l,r) result(s)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: l, r\n integer :: i, j\n integer :: s\n s = -1\n if (l > r) return\n s = 0\n i = l-1\n j = r\n do while (j > i)\n s = s+this%arr(j)\n j = j-and(j,-j)\n end do\n do while (i > j)\n s = s-this%arr(i)\n i = i-and(i,-i)\n end do\n end\n function get_value(this,i) result(v)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: i\n integer :: x\n integer :: v\n v = get_partial_summation(this,i,i)\n end\n function get_lower_bound(this,v) result(x)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: v\n integer :: x, k\n integer :: w\n x = 0\n if (v <= 0) return\n k = this%p\n w = v\n do while (k > 0)\n if (x+k <= this%n .and. this%arr(x+k) < w) then\n w = w-this%arr(x+k)\n x = x+k\n end if\n k = rshift(k,1)\n end do\n x = x+1\n end\n subroutine get_updated(this,i,v)\n class(t_fenwick_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer, intent(in) :: v\n integer :: x\n x = i\n do while (x <= this%n)\n if (this%arr(x) < v) this%arr(x) = v\n x = x+and(x,-x)\n end do\n end\n function get_maximum(this,i) result(m)\n class(t_fenwick_tree), intent(in) :: this\n integer, intent(in) :: i\n integer :: x, m\n x = i\n m = 0\n do while (x > 0)\n m = max(m,this%arr(x))\n x = x-and(x,-x)\n end do\n end\nend module mod_fenwick_tree\nprogram fountain_walk\n implicit none\n real(8), parameter :: pi = 3.14159265358979d0\n real(8), parameter :: k1 = 100.d0, k2 = 20.d0-5.d0*pi, k3 = 10.d0*pi-20.d0\n integer :: n, i\n integer(8) :: x1, y1, x2, y2, x(200000) = 0_8, y(200000) = 0_8\n integer(8) :: s, p, q, k\n character(64) :: ans\n read(*,*) x1, y1, x2, y2\n read(*,*) n\n do i = 1, n\n read(*,*) x(i), y(i)\n end do\n if (x1 > x2) then\n call swap(x1,x2)\n call swap(y1,y2)\n end if\n if (y1 > y2) then\n y1 = -y1\n y2 = -y2\n y(1:n) = -y(1:n)\n end if\n s = x2-x1+y2-y1\n k = int(max(lis(x(1:n),y(1:n),x1,y1,x2,y2),lis(y(1:n),x(1:n),y1,x1,y2,x2)),8)\n if (k == min(x2-x1,y2-y1)+1_8) then\n p = k-1_8\n q = 1_8\n else\n p = k\n q = 0_8\n end if\n write(ans,'(f32.16)') k1*s-k2*p+k3*q\n write(*,'(a)') trim(adjustl(ans))\ncontains\n subroutine swap(a,b)\n integer(8), intent(inout) :: a, b\n a = xor(a,b)\n b = xor(a,b)\n a = xor(a,b)\n end\n integer function lis(x,y,x1,y1,x2,y2)\n use mod_fenwick_tree\n integer(8), intent(in) :: x(:), y(:), x1, y1, x2, y2\n integer(8) :: c(size(x),2)\n integer :: n, z(size(x)), t, i, j, k\n type(t_fenwick_tree) :: bit\n lis = 0\n n = size(x)\n c(:,1) = x\n c(:,2) = y\n call merge_sort(c)\n j = 1\n do while (j <= n .and. c(j,1) < x1)\n j = j+1\n end do\n if (j > n) return\n k = n\n do while (k >= 1 .and. c(k,1) > x2)\n k = k-1\n end do\n if (k < 1) return\n z = compress(c(:,2))\n call bit%init(n)\n do i = j, k\n if (c(i,2) <= y1 .or. y2 <= c(i,2)) cycle\n t = bit%max(z(i)-1)+1\n lis = max(lis,t)\n call bit%update(z(i),t)\n end do\n end\n function compress(x) result(ret)\n implicit none\n integer(8), intent(in) :: x(:)\n integer(8) :: y(size(x),2)\n integer :: n, i, k, ret(size(x))\n n = size(x)\n y(:,1) = x\n do i = 1, n\n y(i,2) = int(i,8)\n end do\n call merge_sort(y)\n k = 0\n ret(y(1,2)) = 1\n do i = 2, n\n if (y(i,1) == y(i-1,1)) k = k+1\n ret(y(i,2)) = i-k\n end do\n end\n subroutine merge_sort(c)\n integer(8), intent(inout) :: c(:,:)\n integer :: n, m, l, u, i\n n = size(c(:,1))\n m = n\n l = 1\n do while (m > 1)\n do i = 1, m/2\n u = min(2*i*l,n)\n call merger(c(2*(i-1)*l+1:(2*i-1)*l,:),c((2*i-1)*l+1:u,:))\n end do\n l = 2*l\n m = (m+1)/2\n end do\n end\n subroutine merger(c1,c2)\n integer(8), intent(inout) :: c1(:,:), c2(:,:)\n integer(8) :: c(size(c1(:,1))+size(c2(:,1)),size(c2(1,:)))\n integer :: i1, i2, n1, n2\n i1 = 1\n i2 = 1\n n1 = size(c1(:,1))\n n2 = size(c2(:,1))\n do while (i1 <= n1 .and. i2 <= n2)\n if (c1(i1,1) < c2(i2,1) .or. &\n & c1(i1,1) == c2(i2,1) .and. c1(i1,2) > c2(i2,2)) then\n c(i1+i2-1,:) = c1(i1,:)\n i1 = i1+1\n else\n c(i1+i2-1,:) = c2(i2,:)\n i2 = i2+1\n end if\n end do\n if (i1 <= n1) then\n c(i1+i2-1:n1+n2,:) = c1(i1:n1,:)\n else if (i2 <= n2) then\n c(i1+i2-1:n1+n2,:) = c2(i2:n2,:)\n end if\n c1 = c(1:n1,:)\n c2 = c(n1+1:n1+n2,:)\n end\nend program fountain_walk", "problem_context": "Score : 900 points\n\nProblem Statement\n\nIn the city of Nevermore, there are 10^8 streets and 10^8 avenues, both numbered from 0 to 10^8-1.\nAll streets run straight from west to east, and all avenues run straight from south to north.\nThe distance between neighboring streets and between neighboring avenues is exactly 100 meters.\n\nEvery street intersects every avenue. Every intersection can be described by pair (x, y), where x is avenue ID and y is street ID.\n\nThere are N fountains in the city, situated at intersections (X_i, Y_i).\nUnlike normal intersections, there's a circle with radius 10 meters centered at the intersection, and there are no road parts inside this circle.\n\nThe picture below shows an example of how a part of the city with roads and fountains may look like.\n\nCity governors don't like encountering more than one fountain while moving along the same road.\nTherefore, every street contains at most one fountain on it, as well as every avenue.\n\nCitizens can move along streets, avenues and fountain perimeters.\nWhat is the shortest distance one needs to cover in order to get from intersection (x_1, y_1) to intersection (x_2, y_2)?\n\nConstraints\n\n0 \\leq x_1, y_1, x_2, y_2 < 10^8\n\n1 \\leq N \\leq 200,000\n\n0 \\leq X_i, Y_i < 10^8\n\nX_i \\neq X_j for i \\neq j\n\nY_i \\neq Y_j for i \\neq j\n\nIntersections (x_1, y_1) and (x_2, y_2) are different and don't contain fountains.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\nN\nX_1 Y_1\nX_2 Y_2\n:\nX_N Y_N\n\nOutput\n\nPrint the shortest possible distance one needs to cover in order to get from intersection (x_1, y_1) to intersection (x_2, y_2), in meters.\nYour answer will be considered correct if its absolute or relative error doesn't exceed 10^{-11}.\n\nSample Input 1\n\n1 1 6 5\n3\n3 2\n5 3\n2 4\n\nSample Output 1\n\n891.415926535897938\n\nOne possible shortest path is shown on the picture below. The path starts at the blue point, finishes at the purple point and follows along the red line.\n\nSample Input 2\n\n3 5 6 4\n3\n3 2\n5 3\n2 4\n\nSample Output 2\n\n400.000000000000000\n\nSample Input 3\n\n4 2 2 2\n3\n3 2\n5 3\n2 4\n\nSample Output 3\n\n211.415926535897938", "sample_input": "1 1 6 5\n3\n3 2\n5 3\n2 4\n"}, "reference_outputs": ["891.415926535897938\n"], "source_document_id": "p03619", "source_text": "Score : 900 points\n\nProblem Statement\n\nIn the city of Nevermore, there are 10^8 streets and 10^8 avenues, both numbered from 0 to 10^8-1.\nAll streets run straight from west to east, and all avenues run straight from south to north.\nThe distance between neighboring streets and between neighboring avenues is exactly 100 meters.\n\nEvery street intersects every avenue. Every intersection can be described by pair (x, y), where x is avenue ID and y is street ID.\n\nThere are N fountains in the city, situated at intersections (X_i, Y_i).\nUnlike normal intersections, there's a circle with radius 10 meters centered at the intersection, and there are no road parts inside this circle.\n\nThe picture below shows an example of how a part of the city with roads and fountains may look like.\n\nCity governors don't like encountering more than one fountain while moving along the same road.\nTherefore, every street contains at most one fountain on it, as well as every avenue.\n\nCitizens can move along streets, avenues and fountain perimeters.\nWhat is the shortest distance one needs to cover in order to get from intersection (x_1, y_1) to intersection (x_2, y_2)?\n\nConstraints\n\n0 \\leq x_1, y_1, x_2, y_2 < 10^8\n\n1 \\leq N \\leq 200,000\n\n0 \\leq X_i, Y_i < 10^8\n\nX_i \\neq X_j for i \\neq j\n\nY_i \\neq Y_j for i \\neq j\n\nIntersections (x_1, y_1) and (x_2, y_2) are different and don't contain fountains.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\nN\nX_1 Y_1\nX_2 Y_2\n:\nX_N Y_N\n\nOutput\n\nPrint the shortest possible distance one needs to cover in order to get from intersection (x_1, y_1) to intersection (x_2, y_2), in meters.\nYour answer will be considered correct if its absolute or relative error doesn't exceed 10^{-11}.\n\nSample Input 1\n\n1 1 6 5\n3\n3 2\n5 3\n2 4\n\nSample Output 1\n\n891.415926535897938\n\nOne possible shortest path is shown on the picture below. The path starts at the blue point, finishes at the purple point and follows along the red line.\n\nSample Input 2\n\n3 5 6 4\n3\n3 2\n5 3\n2 4\n\nSample Output 2\n\n400.000000000000000\n\nSample Input 3\n\n4 2 2 2\n3\n3 2\n5 3\n2 4\n\nSample Output 3\n\n211.415926535897938", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6139, "cpu_time_ms": 316, "memory_kb": 14216}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s353142960", "group_id": "codeNet:p03622", "input_text": "module mod_modint\n implicit none\n integer(8) :: modulus = 998244353\n type modint\n private\n integer(8) :: num\n contains\n procedure :: get => getnum\n end type\n\n interface assignment(=)\n module procedure :: setm, seti64, seti32\n end interface assignment(=)\n\n interface operator(+)\n module procedure :: posm, addmm, addmi64, addmi32, addi64m, addi32m\n end interface operator(+)\n\n interface operator(-)\n module procedure :: negm, submm, submi64, submi32, subi64m, subi32m\n end interface operator(-)\n\n interface operator(*)\n module procedure :: mulmm, mulmi64, mulmi32, muli64m, muli32m\n end interface operator(*)\n\n interface operator(/)\n module procedure :: divmm, divmi64, divmi32, divi64m, divi32m\n end interface operator(/)\n\n interface operator(**)\n module procedure :: powmi64, powmi32\n end interface operator(**)\n\n interface inv\n module procedure :: invm\n end interface inv\n\ncontains\n\n integer(8) function getnum(this)\n class(modint), intent(in) :: this\n getnum = this%num\n end\n\n pure elemental type(modint) function newm()\n newm%num = 0_8\n end\n\n pure elemental subroutine setm(x,y)\n type(modint), intent(inout) :: x\n type(modint), intent(in) :: y\n x%num = y%num\n end\n\n pure elemental function posm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = x%num\n end\n\n pure elemental function negm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = modulus-x%num\n end\n\n pure elemental function addmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num+y%num\n if (n%num >= modulus) n%num = n%num-modulus\n end\n\n pure elemental function submm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num-y%num\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n pure elemental function mulmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = mod(x%num*y%num,modulus)\n end\n\n impure elemental function invm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n integer(8) :: a, b, c, q, r, v\n a = x%num\n if (a == 0_8) then\n write(*,'(a)') \"Error: Division by zero (x == 0). (modint, invm)\"\n stop\n end if\n b = modulus\n c = 0_8\n v = 1_8\n do while (b /= 0_8)\n q = a/b\n r = mod(a,b)\n a = b\n b = r\n r = c\n c = v-c*q\n v = r\n end do\n n%num = mod(v,modulus)\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n impure elemental function divmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n = mulmm(x,invm(y))\n end\n\n impure elemental type(modint) function newi(i)\n class(*), intent(in) :: i\n select type(i)\n type is (integer(8))\n newi%num = i\n type is (integer)\n newi%num = int(i,8)\n type is (integer(2))\n newi%num = int(i,8)\n type is (integer(1))\n newi%num = int(i,8)\n class default\n write(*,'(a)') \"Error: Invalid value (i is not integer). (modint, newi)\"\n stop\n end select\n newi%num = mod(newi%num,modulus)\n if (newi%num < 0_8) newi%num = newi%num+modulus\n end\n\n impure elemental subroutine seti64(x,i)\n type(modint), intent(inout) :: x\n integer(8), intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental subroutine seti32(x,i)\n type(modint), intent(inout) :: x\n integer, intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental function addmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function addi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function submi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function submi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function subi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function subi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function mulmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function mulmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function muli64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function muli32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function divmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function divi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function powmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n, p\n integer(8) :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0_8) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0_8)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\n impure elemental function powmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n, p\n integer :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\nend module mod_modint\nprogram A\n use mod_modint\n implicit none\n integer::N,M,i\n type(modint),allocatable,dimension(:)::Fact,i_Fact\n type(modint)::ans\n read*,N,M\n if(N getnum\n end type\n\n interface assignment(=)\n module procedure :: setm, seti64, seti32\n end interface assignment(=)\n\n interface operator(+)\n module procedure :: posm, addmm, addmi64, addmi32, addi64m, addi32m\n end interface operator(+)\n\n interface operator(-)\n module procedure :: negm, submm, submi64, submi32, subi64m, subi32m\n end interface operator(-)\n\n interface operator(*)\n module procedure :: mulmm, mulmi64, mulmi32, muli64m, muli32m\n end interface operator(*)\n\n interface operator(/)\n module procedure :: divmm, divmi64, divmi32, divi64m, divi32m\n end interface operator(/)\n\n interface operator(**)\n module procedure :: powmi64, powmi32\n end interface operator(**)\n\n interface inv\n module procedure :: invm\n end interface inv\n\ncontains\n\n integer(8) function getnum(this)\n class(modint), intent(in) :: this\n getnum = this%num\n end\n\n pure elemental type(modint) function newm()\n newm%num = 0_8\n end\n\n pure elemental subroutine setm(x,y)\n type(modint), intent(inout) :: x\n type(modint), intent(in) :: y\n x%num = y%num\n end\n\n pure elemental function posm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = x%num\n end\n\n pure elemental function negm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n n%num = modulus-x%num\n end\n\n pure elemental function addmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num+y%num\n if (n%num >= modulus) n%num = n%num-modulus\n end\n\n pure elemental function submm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = x%num-y%num\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n pure elemental function mulmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n%num = mod(x%num*y%num,modulus)\n end\n\n impure elemental function invm(x) result(n)\n type(modint), intent(in) :: x\n type(modint) :: n\n integer(8) :: a, b, c, q, r, v\n a = x%num\n if (a == 0_8) then\n write(*,'(a)') \"Error: Division by zero (x == 0). (modint, invm)\"\n stop\n end if\n b = modulus\n c = 0_8\n v = 1_8\n do while (b /= 0_8)\n q = a/b\n r = mod(a,b)\n a = b\n b = r\n r = c\n c = v-c*q\n v = r\n end do\n n%num = mod(v,modulus)\n if (n%num < 0_8) n%num = n%num+modulus\n end\n\n impure elemental function divmm(x,y) result(n)\n type(modint), intent(in) :: x, y\n type(modint) :: n\n n = mulmm(x,invm(y))\n end\n\n impure elemental type(modint) function newi(i)\n class(*), intent(in) :: i\n select type(i)\n type is (integer(8))\n newi%num = i\n type is (integer)\n newi%num = int(i,8)\n type is (integer(2))\n newi%num = int(i,8)\n type is (integer(1))\n newi%num = int(i,8)\n class default\n write(*,'(a)') \"Error: Invalid value (i is not integer). (modint, newi)\"\n stop\n end select\n newi%num = mod(newi%num,modulus)\n if (newi%num < 0_8) newi%num = newi%num+modulus\n end\n\n impure elemental subroutine seti64(x,i)\n type(modint), intent(inout) :: x\n integer(8), intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental subroutine seti32(x,i)\n type(modint), intent(inout) :: x\n integer, intent(in) :: i\n call setm(x,newi(i))\n end\n\n impure elemental function addmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = addmm(x,newi(i))\n end\n\n impure elemental function addi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function addi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = addmm(newi(i),y)\n end\n\n impure elemental function submi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function submi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = submm(x,newi(i))\n end\n\n impure elemental function subi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function subi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = submm(newi(i),y)\n end\n\n impure elemental function mulmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function mulmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = mulmm(x,newi(i))\n end\n\n impure elemental function muli64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function muli32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = mulmm(newi(i),y)\n end\n\n impure elemental function divmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n\n n = divmm(x,newi(i))\n end\n\n impure elemental function divi64m(i,y) result(n)\n integer(8), intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function divi32m(i,y) result(n)\n integer, intent(in) :: i\n type(modint), intent(in) :: y\n type(modint) :: n\n n = divmm(newi(i),y)\n end\n\n impure elemental function powmi64(x,i) result(n)\n type(modint), intent(in) :: x\n integer(8), intent(in) :: i\n type(modint) :: n, p\n integer(8) :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0_8) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0_8)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\n impure elemental function powmi32(x,i) result(n)\n type(modint), intent(in) :: x\n integer, intent(in) :: i\n type(modint) :: n, p\n integer :: m\n n = newi(1_8)\n p = x\n m = i\n if (i < 0) then\n p = invm(x)\n m = abs(i)\n end if\n do while (m > 0)\n if (btest(m,0)) n = mulmm(p,n)\n p = mulmm(p,p)\n m = rshift(m,1)\n end do\n end\n\nend module mod_modint\nprogram A\n use mod_modint\n implicit none\n integer::N,M,i\n type(modint),allocatable,dimension(:)::Fact,i_Fact\n type(modint)::ans\n read*,N,M\n if(N p)), pack(a, a == p), quick(pack(a(2:), a(2:) < p))]\n end if\n end function quick\nend program main", "language": "Fortran", "metadata": {"date": 1517077472, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03625.html", "problem_id": "p03625", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03625/input.txt", "sample_output_relpath": "derived/input_output/data/p03625/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03625/Fortran/s784968490.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s784968490", "user_id": "u085486962"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main\n integer n\n integer :: a(10**5)\n integer, allocatable :: str_a(:)\n integer, allocatable :: ans(:)\n integer :: first=0, second=0\n integer(8) :: answer\n integer restart\n \n read *, n\n read *, (a(i), i=1,n)\n str_a = a(1:n)\n ans = quick(str_a)\n \n do i=1,n-1\n if(ans(i)==ans(i+1)) then\n first = ans(i)\n restart = i+2\n exit\n end if\n end do\n \n if (result < n) then\n do i=restart,n-1\n if(ans(i)==ans(i+1)) then\n second = ans(i)\n exit\n end if\n end do\n end if\n \n answer = first * second\n print *, answer\n \ncontains\n recursive function quick(a) result(r)\n integer, intent(in) :: a(:)\n integer, allocatable :: r(:)\n integer :: p\n if(size(a) < 2) then\n r = a\n else\n p = a(1)\n r = [quick(pack(a(2:), a(2:) > p)), pack(a, a == p), quick(pack(a(2:), a(2:) < p))]\n end if\n end function quick\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03625", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1054, "cpu_time_ms": 106, "memory_kb": 4096}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s259782989", "group_id": "codeNet:p03626", "input_text": "program main\n integer(8) :: answer = 1\n integer(8) :: m = 1000000007\n integer :: num\n character (52) :: s1, s2\n character :: s(52) = '_'\n integer :: a = 0, start = 1\n logical :: flag = .true.\n\n read *, num\n read *, s1\n read *, s2\n s1 = trim(s1)\n s2 = trim(s2)\n\n if(s1(1:1) /= s2(1:1)) then\n answer = 6\n start = start + 2\n flag = .true.\n else\n answer = 3\n start = start + 1\n flag = .false.\n end if\n\n do i=start,num-1\n if (i+a >= num) then\n exit\n end if\n\n if (flag) then\n if (s1(i + a:i + a) /= s2(i+a:i+a)) then\n a = a + 1\n answer = mod(answer*3, m)\n flag = .true.\n else\n flag = .false.\n end if\n else\n if (s1(i + a:i + a) /= s2(i+a:i+a)) then\n a = a + 1\n answer = mod(answer*2, m)\n flag = .true.\n else\n answer = mod(answer*2, m)\n flag = .false.\n end if\n end if\n end do\n\n print *, answer\nend program main", "language": "Fortran", "metadata": {"date": 1517197183, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03626.html", "problem_id": "p03626", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03626/input.txt", "sample_output_relpath": "derived/input_output/data/p03626/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03626/Fortran/s259782989.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s259782989", "user_id": "u085486962"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program main\n integer(8) :: answer = 1\n integer(8) :: m = 1000000007\n integer :: num\n character (52) :: s1, s2\n character :: s(52) = '_'\n integer :: a = 0, start = 1\n logical :: flag = .true.\n\n read *, num\n read *, s1\n read *, s2\n s1 = trim(s1)\n s2 = trim(s2)\n\n if(s1(1:1) /= s2(1:1)) then\n answer = 6\n start = start + 2\n flag = .true.\n else\n answer = 3\n start = start + 1\n flag = .false.\n end if\n\n do i=start,num-1\n if (i+a >= num) then\n exit\n end if\n\n if (flag) then\n if (s1(i + a:i + a) /= s2(i+a:i+a)) then\n a = a + 1\n answer = mod(answer*3, m)\n flag = .true.\n else\n flag = .false.\n end if\n else\n if (s1(i + a:i + a) /= s2(i+a:i+a)) then\n a = a + 1\n answer = mod(answer*2, m)\n flag = .true.\n else\n answer = mod(answer*2, m)\n flag = .false.\n end if\n end if\n end do\n\n print *, answer\nend program main", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "sample_input": "3\naab\nccb\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03626", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1145, "cpu_time_ms": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s249587917", "group_id": "codeNet:p03627", "input_text": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,k,a,b\n \n integer(8),allocatable :: x(:)\n integer(8)::y(4)\n \n read(*,*) n\n allocate(x(n))\n read(*,*)x\n \n call msort(x)\n a=0\n b=0\n do i=n,1,-1\n \n if(x(i)==x(i-1))then\n if (a==1)then\n a=0\n cycle\n end if\n a=1\n b=b+1\n if (b==1)then\n m=x(i)\n a=1\n else\n m=m*x(i)\n exit\n end if\n else\n a=0\n end if\n end do\n if (b==2)then\n write(*,*)m\n else\n write(*,*)0\n end if\n\n stop\n \n contains\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n \n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\n \nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1592619683, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03627.html", "problem_id": "p03627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03627/input.txt", "sample_output_relpath": "derived/input_output/data/p03627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03627/Fortran/s249587917.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249587917", "user_id": "u713568912"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n \n integer(8) :: i,j,m,n,k,a,b\n \n integer(8),allocatable :: x(:)\n integer(8)::y(4)\n \n read(*,*) n\n allocate(x(n))\n read(*,*)x\n \n call msort(x)\n a=0\n b=0\n do i=n,1,-1\n \n if(x(i)==x(i-1))then\n if (a==1)then\n a=0\n cycle\n end if\n a=1\n b=b+1\n if (b==1)then\n m=x(i)\n a=1\n else\n m=m*x(i)\n exit\n end if\n else\n a=0\n end if\n end do\n if (b==2)then\n write(*,*)m\n else\n write(*,*)0\n end if\n\n stop\n \n contains\n recursive subroutine msort(x)\n implicit none\n integer(8), intent(inout) :: x(:)\n \n integer(8) :: n, mid, i, j, k\n integer(8), allocatable :: tmp(:)\n \n n = size(x)\n \n if(n == 1) then\n return\n end if\n \n !\n ! 前半と後半に分けてソート\n ! 1~midとmid+1~nをそれぞれソート済みにする\n !\n mid = n / 2\n call msort(x(:mid))\n call msort(x(mid+1:))\n \n !\n ! tmpという配列にxを一時的に保管\n ! マージソートは外部ソート\n !\n allocate(tmp(n))\n tmp = x\n \n ! tmpの後半部分を左右反転\n do k = n, mid+1, -1\n tmp(k) = x(mid + n - k + 1)\n end do\n \n ! iは前半のリストのうちまだ見ていないものの最小値\n ! jは後半のリストのうちまだ見ていないものの最小値\n ! kは見た回数の合計\n i = 1\n j = n\n \n do k = 1, n\n !\n ! 一番左と一番右のうち小さい方をxに入れていく\n ! ここが等号つき不等号なので、安定ソートとなる\n !\n if(tmp(i) <= tmp(j)) then\n x(k) = tmp(i)\n i = i + 1\n else\n x(k) = tmp(j)\n j = j - 1\n end if\n end do\n \n deallocate(tmp)\n return\n end subroutine msort\n \nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03627", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1994, "cpu_time_ms": 50, "memory_kb": 4880}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s451724631", "group_id": "codeNet:p03628", "input_text": "program arc081_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,i,j,ans\n integer(int64),parameter:: md=1000000007\n character(:),allocatable:: s(:)\n\n read*, n\n allocate(character(n):: s(2))\n read*, s(1)\n read*, s(2)\n\n i=1\n if (s(1)(1:1) == s(2)(1:1)) then\n ans = 3\n else\n ans = 6\n end if\n\n do while (i <= n)\n if (s(1)(i:i) == s(2)(i:i)) then\n if (i+1 <= n) ans=mod(ans*2,md)\n i=i+1\n else\n if (i+2 <= n) then \n j = i+2\n if (s(1)(j:j) /= s(2)(j:j)) ans=mod(ans*3,md)\n end if\n i=i+2\n end if\n end do\n\n print'(i0)', ans\nend program arc081_d", "language": "Fortran", "metadata": {"date": 1595040037, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03628.html", "problem_id": "p03628", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03628/input.txt", "sample_output_relpath": "derived/input_output/data/p03628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03628/Fortran/s451724631.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s451724631", "user_id": "u234636620"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program arc081_d\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,i,j,ans\n integer(int64),parameter:: md=1000000007\n character(:),allocatable:: s(:)\n\n read*, n\n allocate(character(n):: s(2))\n read*, s(1)\n read*, s(2)\n\n i=1\n if (s(1)(1:1) == s(2)(1:1)) then\n ans = 3\n else\n ans = 6\n end if\n\n do while (i <= n)\n if (s(1)(i:i) == s(2)(i:i)) then\n if (i+1 <= n) ans=mod(ans*2,md)\n i=i+1\n else\n if (i+2 <= n) then \n j = i+2\n if (s(1)(j:j) /= s(2)(j:j)) ans=mod(ans*3,md)\n end if\n i=i+2\n end if\n end do\n\n print'(i0)', ans\nend program arc081_d", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "sample_input": "3\naab\nccb\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03628", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 724, "cpu_time_ms": 11, "memory_kb": 2928}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s953293790", "group_id": "codeNet:p03631", "input_text": "program ABC070A\n implicit none\n integer(8)::N\n read(5,*)N\n\n if(N/100==mod(N,10))then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\nend program ABC070A", "language": "Fortran", "metadata": {"date": 1580340595, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03631.html", "problem_id": "p03631", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03631/input.txt", "sample_output_relpath": "derived/input_output/data/p03631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03631/Fortran/s953293790.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s953293790", "user_id": "u414699019"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC070A\n implicit none\n integer(8)::N\n read(5,*)N\n\n if(N/100==mod(N,10))then\n print'(A)',\"Yes\"\n else\n print'(A)',\"No\"\n end if\nend program ABC070A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "sample_input": "575\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03631", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 185, "cpu_time_ms": 7, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s768072839", "group_id": "codeNet:p03631", "input_text": " program main\n read(*,*) i\n if (mod(i,10) .eq. i/100) then\n write(*,*) \"Yes\"\n else\n write(*,*) \"No\"\n end if\n end", "language": "Fortran", "metadata": {"date": 1504458183, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03631.html", "problem_id": "p03631", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03631/input.txt", "sample_output_relpath": "derived/input_output/data/p03631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03631/Fortran/s768072839.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s768072839", "user_id": "u857484987"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " program main\n read(*,*) i\n if (mod(i,10) .eq. i/100) then\n write(*,*) \"Yes\"\n else\n write(*,*) \"No\"\n end if\n end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "sample_input": "575\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03631", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 164, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s846062676", "group_id": "codeNet:p03633", "input_text": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n\n integer(8)::a,b,c,d\n integer(8),allocatable::x(:),y(:)\n \n read(*,*) n\n allocate(x(n))\n do i=1,n\n read(*,*)x(i)\n end do\n a=x(1)\n m=a\n do i=2,n\n b=max(a,x(i))\n a=min(a,x(i))\n do j=1,10000000\n if(mod(b,a)==0)then\n exit\n else\n c=mod(b,a)\n b=a\n a=c\n end if\n end do\n m=m*(x(i)/a)\n write(*,*)m,'m'\n a=m\n end do\n\n write(*,*)m\n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1598664737, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03633.html", "problem_id": "p03633", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03633/input.txt", "sample_output_relpath": "derived/input_output/data/p03633/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03633/Fortran/s846062676.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s846062676", "user_id": "u713568912"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,k,m,n\n integer(8)::a,b,c,d\n integer(8),allocatable::x(:),y(:)\n \n read(*,*) n\n allocate(x(n))\n do i=1,n\n read(*,*)x(i)\n end do\n a=x(1)\n m=a\n do i=2,n\n b=max(a,x(i))\n a=min(a,x(i))\n do j=1,10000000\n if(mod(b,a)==0)then\n exit\n else\n c=mod(b,a)\n b=a\n a=c\n end if\n end do\n m=m*(x(i)/a)\n write(*,*)m,'m'\n a=m\n end do\n\n write(*,*)m\n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "sample_input": "2\n2\n3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03633", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly T_i seconds.\n\nInitially, the hand of every clock stands still, pointing directly upward.\n\nNow, Dolphin starts all the clocks simultaneously.\n\nIn how many seconds will the hand of every clock point directly upward again?\n\nConstraints\n\n1≤N≤100\n\n1≤T_i≤10^{18}\n\nAll input values are integers.\n\nThe correct answer is at most 10^{18} seconds.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT_1\n:\nT_N\n\nOutput\n\nPrint the number of seconds after which the hand of every clock point directly upward again.\n\nSample Input 1\n\n2\n2\n3\n\nSample Output 1\n\n6\n\nWe have two clocks. The time when the hand of each clock points upward is as follows:\n\nClock 1: 2, 4, 6, ... seconds after the beginning\n\nClock 2: 3, 6, 9, ... seconds after the beginning\n\nTherefore, it takes 6 seconds until the hands of both clocks point directly upward.\n\nSample Input 2\n\n5\n2\n5\n10\n1000000000000000000\n1000000000000000000\n\nSample Output 2\n\n1000000000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 615, "cpu_time_ms": 6, "memory_kb": 2812}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s264851871", "group_id": "codeNet:p03635", "input_text": "read*,i,j\nprint*,(i-1)*(j-1)\nend", "language": "Fortran", "metadata": {"date": 1580695992, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03635.html", "problem_id": "p03635", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03635/input.txt", "sample_output_relpath": "derived/input_output/data/p03635/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03635/Fortran/s264851871.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s264851871", "user_id": "u171356453"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "read*,i,j\nprint*,(i-1)*(j-1)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 32, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s291027548", "group_id": "codeNet:p03637", "input_text": "program ABC_069_C_4adjacent\n implicit none\n integer N, i, countN2, countN4\n integer(8), allocatable :: a(:)\n read(*, *) N\n allocate(a(1: N))\n read(*, *) a(1: N)\n countN2 = 0\n countN4 = 0\n do i = 1, N\n if(mod(a(i), 2) == 0) then\n\t countN2 = countN2 + 1\n\t end if\n\t if(mod(a(i), 4) == 0) then\n\t countN4 = countN4 + 1\n\t end if\n end do\n if(N/2 <= countN4) then\n write(*, *) 'Yes' \n else if(N - 2*countN4 <= countN2 - countN4) then\n write(*, *) 'Yes'\n else\n write(*, *) 'No'\n end if\nend program ABC_069_C_4adjacent", "language": "Fortran", "metadata": {"date": 1525422239, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03637.html", "problem_id": "p03637", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03637/input.txt", "sample_output_relpath": "derived/input_output/data/p03637/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03637/Fortran/s291027548.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s291027548", "user_id": "u728000113"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC_069_C_4adjacent\n implicit none\n integer N, i, countN2, countN4\n integer(8), allocatable :: a(:)\n read(*, *) N\n allocate(a(1: N))\n read(*, *) a(1: N)\n countN2 = 0\n countN4 = 0\n do i = 1, N\n if(mod(a(i), 2) == 0) then\n\t countN2 = countN2 + 1\n\t end if\n\t if(mod(a(i), 4) == 0) then\n\t countN4 = countN4 + 1\n\t end if\n end do\n if(N/2 <= countN4) then\n write(*, *) 'Yes' \n else if(N - 2*countN4 <= countN2 - countN4) then\n write(*, *) 'Yes'\n else\n write(*, *) 'No'\n end if\nend program ABC_069_C_4adjacent", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03637", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 1536}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s606872621", "group_id": "codeNet:p03638", "input_text": "program main\n implicit none\n integer :: n\n integer :: h, w\n integer, allocatable :: an(:)\n integer, allocatable :: masu(:)\n integer :: i, j, cnt\n\n read *, h, w\n read *, n\n\n allocate(an(n))\n allocate(masu(h*w))\n\n read *, an(1:n)\n\n cnt = 1\n do i = 1, n\n masu(cnt:cnt+an(i)-1) = i\n cnt = cnt + an(i)\n enddo\n\n do i = 1, h\n if(mod(i,2)==1)then\n print *, (masu(w*(i-1)+j), j = 1,w,1)\n else\n print *, (masu(w*(i-1)+j), j = w,1,-1)\n endif\n enddo\n\nend program", "language": "Fortran", "metadata": {"date": 1595904268, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03638.html", "problem_id": "p03638", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03638/input.txt", "sample_output_relpath": "derived/input_output/data/p03638/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03638/Fortran/s606872621.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s606872621", "user_id": "u310855433"}, "prompt_components": {"gold_output": "1 1\n2 3\n", "input_to_evaluate": "program main\n implicit none\n integer :: n\n integer :: h, w\n integer, allocatable :: an(:)\n integer, allocatable :: masu(:)\n integer :: i, j, cnt\n\n read *, h, w\n read *, n\n\n allocate(an(n))\n allocate(masu(h*w))\n\n read *, an(1:n)\n\n cnt = 1\n do i = 1, n\n masu(cnt:cnt+an(i)-1) = i\n cnt = cnt + an(i)\n enddo\n\n do i = 1, h\n if(mod(i,2)==1)then\n print *, (masu(w*(i-1)+j), j = 1,w,1)\n else\n print *, (masu(w*(i-1)+j), j = w,1,-1)\n endif\n enddo\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nSnuke is painting these squares in colors 1, 2, ..., N.\nHere, the following conditions should be satisfied:\n\nFor each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.\n\nFor each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.\n\nFind a way to paint the squares so that the conditions are satisfied.\nIt can be shown that a solution always exists.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\n1 ≤ N ≤ H W\n\na_i ≥ 1\n\na_1 + a_2 + ... + a_N = H W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint one way to paint the squares that satisfies the conditions.\nOutput in the following format:\n\nc_{1 1} ... c_{1 W}\n:\nc_{H 1} ... c_{H W}\n\nHere, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.\n\nSample Input 1\n\n2 2\n3\n2 1 1\n\nSample Output 1\n\n1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color 1 are not 4-connected.\n\nSample Input 2\n\n3 5\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3\n\nSample Input 3\n\n1 1\n1\n1\n\nSample Output 3\n\n1", "sample_input": "2 2\n3\n2 1 1\n"}, "reference_outputs": ["1 1\n2 3\n"], "source_document_id": "p03638", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nSnuke is painting these squares in colors 1, 2, ..., N.\nHere, the following conditions should be satisfied:\n\nFor each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.\n\nFor each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.\n\nFind a way to paint the squares so that the conditions are satisfied.\nIt can be shown that a solution always exists.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\n1 ≤ N ≤ H W\n\na_i ≥ 1\n\na_1 + a_2 + ... + a_N = H W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint one way to paint the squares that satisfies the conditions.\nOutput in the following format:\n\nc_{1 1} ... c_{1 W}\n:\nc_{H 1} ... c_{H W}\n\nHere, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.\n\nSample Input 1\n\n2 2\n3\n2 1 1\n\nSample Output 1\n\n1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color 1 are not 4-connected.\n\nSample Input 2\n\n3 5\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3\n\nSample Input 3\n\n1 1\n1\n1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 491, "cpu_time_ms": 15, "memory_kb": 2892}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s717875973", "group_id": "codeNet:p03643", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n character(3):: n\n\n read*, n\n print'(a)', 'ABC'//n\nend program main", "language": "Fortran", "metadata": {"date": 1591402736, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03643.html", "problem_id": "p03643", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03643/input.txt", "sample_output_relpath": "derived/input_output/data/p03643/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03643/Fortran/s717875973.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717875973", "user_id": "u234636620"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n character(3):: n\n\n read*, n\n print'(a)', 'ABC'//n\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "sample_input": "100\n"}, "reference_outputs": ["ABC100\n"], "source_document_id": "p03643", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 144, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s775371890", "group_id": "codeNet:p03643", "input_text": "program main\n\timplicit none\n\tinteger n\n\tread(*,*)n\n\twrite(*,'(a3,i3)')\"ABC\",n\nend program main\n", "language": "Fortran", "metadata": {"date": 1501708086, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03643.html", "problem_id": "p03643", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03643/input.txt", "sample_output_relpath": "derived/input_output/data/p03643/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03643/Fortran/s775371890.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s775371890", "user_id": "u539011156"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "program main\n\timplicit none\n\tinteger n\n\tread(*,*)n\n\twrite(*,'(a3,i3)')\"ABC\",n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "sample_input": "100\n"}, "reference_outputs": ["ABC100\n"], "source_document_id": "p03643", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s302348787", "group_id": "codeNet:p03644", "input_text": "integer N,a\nread*,N\na=1\ndo while (a*2<=N)\n a=a*2\nend do\nprint\"(I0)\",a\nend", "language": "Fortran", "metadata": {"date": 1551752091, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03644.html", "problem_id": "p03644", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03644/input.txt", "sample_output_relpath": "derived/input_output/data/p03644/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03644/Fortran/s302348787.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s302348787", "user_id": "u598073939"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "integer N,a\nread*,N\na=1\ndo while (a*2<=N)\n a=a*2\nend do\nprint\"(I0)\",a\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "sample_input": "7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03644", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 73, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s534943465", "group_id": "codeNet:p03649", "input_text": "program decrease\n implicit none\n integer :: n, i\n integer(8) :: a(50), m, t\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n t = 0_8\n do\n m = maxval(a(1:n))\n if (m.lt.int(n,8)) exit\n do i = 1, n\n if (a(i).eq.m) then\n a(i) = a(i) - int(n+1,8)\n exit\n end if\n end do\n a(1:n) = a(1:n) + 1_8\n t = t + 1_8\n end do\n write(*,'(i0)') t\n stop\nend program decrease", "language": "Fortran", "metadata": {"date": 1558157765, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03649.html", "problem_id": "p03649", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03649/input.txt", "sample_output_relpath": "derived/input_output/data/p03649/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03649/Fortran/s534943465.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s534943465", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "program decrease\n implicit none\n integer :: n, i\n integer(8) :: a(50), m, t\n a = 0_8\n read(*,*) n\n read(*,*) a(1:n)\n t = 0_8\n do\n m = maxval(a(1:n))\n if (m.lt.int(n,8)) exit\n do i = 1, n\n if (a(i).eq.m) then\n a(i) = a(i) - int(n+1,8)\n exit\n end if\n end do\n a(1:n) = a(1:n) + 1_8\n t = t + 1_8\n end do\n write(*,'(i0)') t\n stop\nend program decrease", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller. (The operation is the same as the one in Problem D.)\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given the sequence a_i. Find the number of times we will perform the above operation.\n\nConstraints\n\n2 ≤ N ≤ 50\n\n0 ≤ a_i ≤ 10^{16} + 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of times the operation will be performed.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n0\n\nSample Input 2\n\n3\n1 0 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2\n2 2\n\nSample Output 3\n\n2\n\nSample Input 4\n\n7\n27 0 0 0 0 0 0\n\nSample Output 4\n\n3\n\nSample Input 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425\n\nSample Output 5\n\n1234567894848", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03649", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller. (The operation is the same as the one in Problem D.)\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given the sequence a_i. Find the number of times we will perform the above operation.\n\nConstraints\n\n2 ≤ N ≤ 50\n\n0 ≤ a_i ≤ 10^{16} + 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of times the operation will be performed.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n0\n\nSample Input 2\n\n3\n1 0 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2\n2 2\n\nSample Output 3\n\n2\n\nSample Input 4\n\n7\n27 0 0 0 0 0 0\n\nSample Output 4\n\n3\n\nSample Input 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425\n\nSample Output 5\n\n1234567894848", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s783606150", "group_id": "codeNet:p03657", "input_text": " program main\n read(*,*) i, j\n \n if (i.eq.0) then\n write(*,*) \"Impossible\"\n else if(j.eq.0) then\n write(*,*) \"Impossible\"\n else\n if (mod(i,3).eq.0) then\n write(*,*) \"Possible\"\n else if (mod(j,3).eq.0) then\n write(*,*) \"Possible\"\n else if (mod(i+j,3).eq.0) then\n write(*,*) \"Possible\"\n else\n write(*,*) \"Impossible\"\n end if\n end if\n end", "language": "Fortran", "metadata": {"date": 1506377932, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03657.html", "problem_id": "p03657", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03657/input.txt", "sample_output_relpath": "derived/input_output/data/p03657/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03657/Fortran/s783606150.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s783606150", "user_id": "u857484987"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": " program main\n read(*,*) i, j\n \n if (i.eq.0) then\n write(*,*) \"Impossible\"\n else if(j.eq.0) then\n write(*,*) \"Impossible\"\n else\n if (mod(i,3).eq.0) then\n write(*,*) \"Possible\"\n else if (mod(j,3).eq.0) then\n write(*,*) \"Possible\"\n else if (mod(i+j,3).eq.0) then\n write(*,*) \"Possible\"\n else\n write(*,*) \"Impossible\"\n end if\n end if\n end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is giving cookies to his three goats.\n\nHe has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).\n\nYour task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.\n\nConstraints\n\n1 \\leq A,B \\leq 100\n\nBoth A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf it is possible to give cookies so that each of the three goats can have the same number of cookies, print Possible; otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nPossible\n\nIf Snuke gives nine cookies, each of the three goats can have three cookies.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nImpossible\n\nSince there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.", "sample_input": "4 5\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03657", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is giving cookies to his three goats.\n\nHe has two cookie tins. One contains A cookies, and the other contains B cookies. He can thus give A cookies, B cookies or A+B cookies to his goats (he cannot open the tins).\n\nYour task is to determine whether Snuke can give cookies to his three goats so that each of them can have the same number of cookies.\n\nConstraints\n\n1 \\leq A,B \\leq 100\n\nBoth A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf it is possible to give cookies so that each of the three goats can have the same number of cookies, print Possible; otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nPossible\n\nIf Snuke gives nine cookies, each of the three goats can have three cookies.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nImpossible\n\nSince there are only two cookies, the three goats cannot have the same number of cookies no matter what Snuke gives to them.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 460, "cpu_time_ms": 9, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s990007624", "group_id": "codeNet:p03658", "input_text": "program main\n implicit none\n \n integer :: i,j,t,n,k,l(50)=0,s=0\n \n read(*,*)n,k\n read(*,*)(l(i),i=1,n)\n \n do i=1,N-1\n do j=i+1,N\n if(l(i) .gt. l(j))then\n t=l(i)\n l(i)=l(j)\n l(j)=t\n end if\n end do\n end do\n \n do i = n, n-k+1, -1\n s = s + l(i)\n end do\n \n write(*,*)s\nend program main", "language": "Fortran", "metadata": {"date": 1571669266, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03658.html", "problem_id": "p03658", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03658/input.txt", "sample_output_relpath": "derived/input_output/data/p03658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03658/Fortran/s990007624.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990007624", "user_id": "u287431190"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: i,j,t,n,k,l(50)=0,s=0\n \n read(*,*)n,k\n read(*,*)(l(i),i=1,n)\n \n do i=1,N-1\n do j=i+1,N\n if(l(i) .gt. l(j))then\n t=l(i)\n l(i)=l(j)\n l(j)=t\n end if\n end do\n end do\n \n do i = n, n-k+1, -1\n s = s + l(i)\n end do\n \n write(*,*)s\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "sample_input": "5 3\n1 2 3 4 5\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03658", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s559508211", "group_id": "codeNet:p03671", "input_text": "program abc066a\n implicit none\n integer :: bell(3)\n read *, bell\n print *, sum(bell) - maxval(bell)\nend program abc066a\n", "language": "Fortran", "metadata": {"date": 1558575306, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03671.html", "problem_id": "p03671", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03671/input.txt", "sample_output_relpath": "derived/input_output/data/p03671/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03671/Fortran/s559508211.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559508211", "user_id": "u081445141"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "program abc066a\n implicit none\n integer :: bell(3)\n read *, bell\n print *, sum(bell) - maxval(bell)\nend program abc066a\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "sample_input": "700 600 780\n"}, "reference_outputs": ["1300\n"], "source_document_id": "p03671", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 8, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s479065605", "group_id": "codeNet:p03673", "input_text": "module deque_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n type deque\n integer(int32),pointer:: v(:)\n integer(int32):: l,r\n integer(int32):: lmax, rmax\n end type\n private\n public:: deque\n public:: init_deque\n public:: append, appendleft\n public:: pop, popleft\n public:: right, left\n public:: remaining_elements\n public:: remain\n\ncontains\n subroutine init_deque(dq)\n ! 初期化\n type(deque):: dq\n dq%r=0; dq%rmax=1\n dq%l=1; dq%lmax=-1\n allocate(dq%v(dq%lmax:dq%rmax))\n end subroutine\n\n\n subroutine append(dq,num)\n ! 右端に挿入\n type(deque):: dq\n integer(int32):: num\n if (dq%r+1 > dq%rmax) call add_(dq)\n dq%r=dq%r+1\n dq%v(dq%r) = num\n end subroutine\n\n subroutine appendleft(dq,num)\n ! 左端に挿入\n type(deque):: dq\n integer(int32):: num\n if (dq%l-1 < dq%lmax) call add_(dq)\n dq%l=dq%l-1\n dq%v(dq%l) = num\n end subroutine\n\n subroutine add_(dq)\n ! arrayの延長\n type(deque):: dq\n integer(int32):: l\n integer(int32),pointer:: tmp(:)\n l = size(dq%v)\n allocate(tmp(l))\n tmp(:) = dq%v(:)\n deallocate(dq%v)\n allocate(dq%v(4*dq%lmax:4*dq%rmax))\n dq%v(dq%lmax:dq%rmax) = tmp(:)\n dq%lmax = 4*dq%lmax\n dq%rmax = 4*dq%rmax\n end subroutine\n\n\n function pop(dq) result(ret)\n ! 右端から取り出し\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n dq%r=dq%r-1\n end function\n\n function popleft(dq) result(ret)\n ! 左端から取り出し\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n dq%l=dq%l+1\n end function\n\n\n function right(dq) result(ret)\n ! 右端を確認\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n end function\n\n function left(dq) result(ret)\n ! 左端を確認\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n end function\n\n function remaining_elements(dq) result(ret)\n ! 残りの要素数\n type(deque):: dq\n integer(int32):: ret \n ret = dq%r - dq%l + 1\n end function\n\n function remain(dq) result(ret)\n ! 要素が残っているかどうか\n type(deque):: dq\n logical:: ret\n ret = remaining_elements(dq) > 0\n end function\nend module\n\n\nprogram name\n use,intrinsic :: iso_fortran_env\n use deque_mod\n implicit none\n integer(int32):: n,i\n integer(int32), allocatable:: a(:), ans(:)\n type(deque):: b\n\n call init_deque(b)\n read*, n\n allocate(a(n),ans(n))\n read*, a(:)\n\n do i=1,n\n if (mod(i,2) == 1) then\n call append(b,a(i))\n else\n call appendleft(b,a(i))\n end if\n end do\n\n if (mod(n,2) /= 0) then\n do i=1,n\n ans(i) = pop(b)\n end do\n else\n do i=1,n\n ans(i) = popleft(b)\n end do\n end if\n\n print'(100000(i0,1x))', ans(:)\n\n\n\n\nend program name", "language": "Fortran", "metadata": {"date": 1587086079, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03673.html", "problem_id": "p03673", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03673/input.txt", "sample_output_relpath": "derived/input_output/data/p03673/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03673/Fortran/s479065605.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s479065605", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "module deque_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n type deque\n integer(int32),pointer:: v(:)\n integer(int32):: l,r\n integer(int32):: lmax, rmax\n end type\n private\n public:: deque\n public:: init_deque\n public:: append, appendleft\n public:: pop, popleft\n public:: right, left\n public:: remaining_elements\n public:: remain\n\ncontains\n subroutine init_deque(dq)\n ! 初期化\n type(deque):: dq\n dq%r=0; dq%rmax=1\n dq%l=1; dq%lmax=-1\n allocate(dq%v(dq%lmax:dq%rmax))\n end subroutine\n\n\n subroutine append(dq,num)\n ! 右端に挿入\n type(deque):: dq\n integer(int32):: num\n if (dq%r+1 > dq%rmax) call add_(dq)\n dq%r=dq%r+1\n dq%v(dq%r) = num\n end subroutine\n\n subroutine appendleft(dq,num)\n ! 左端に挿入\n type(deque):: dq\n integer(int32):: num\n if (dq%l-1 < dq%lmax) call add_(dq)\n dq%l=dq%l-1\n dq%v(dq%l) = num\n end subroutine\n\n subroutine add_(dq)\n ! arrayの延長\n type(deque):: dq\n integer(int32):: l\n integer(int32),pointer:: tmp(:)\n l = size(dq%v)\n allocate(tmp(l))\n tmp(:) = dq%v(:)\n deallocate(dq%v)\n allocate(dq%v(4*dq%lmax:4*dq%rmax))\n dq%v(dq%lmax:dq%rmax) = tmp(:)\n dq%lmax = 4*dq%lmax\n dq%rmax = 4*dq%rmax\n end subroutine\n\n\n function pop(dq) result(ret)\n ! 右端から取り出し\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n dq%r=dq%r-1\n end function\n\n function popleft(dq) result(ret)\n ! 左端から取り出し\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n dq%l=dq%l+1\n end function\n\n\n function right(dq) result(ret)\n ! 右端を確認\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%r)\n end function\n\n function left(dq) result(ret)\n ! 左端を確認\n type(deque):: dq\n integer(int32):: ret\n ret = dq%v(dq%l)\n end function\n\n function remaining_elements(dq) result(ret)\n ! 残りの要素数\n type(deque):: dq\n integer(int32):: ret \n ret = dq%r - dq%l + 1\n end function\n\n function remain(dq) result(ret)\n ! 要素が残っているかどうか\n type(deque):: dq\n logical:: ret\n ret = remaining_elements(dq) > 0\n end function\nend module\n\n\nprogram name\n use,intrinsic :: iso_fortran_env\n use deque_mod\n implicit none\n integer(int32):: n,i\n integer(int32), allocatable:: a(:), ans(:)\n type(deque):: b\n\n call init_deque(b)\n read*, n\n allocate(a(n),ans(n))\n read*, a(:)\n\n do i=1,n\n if (mod(i,2) == 1) then\n call append(b,a(i))\n else\n call appendleft(b,a(i))\n end if\n end do\n\n if (mod(n,2) /= 0) then\n do i=1,n\n ans(i) = pop(b)\n end do\n else\n do i=1,n\n ans(i) = popleft(b)\n end do\n end if\n\n print'(100000(i0,1x))', ans(:)\n\n\n\n\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length n, a_1, ..., a_n.\nLet us consider performing the following n operations on an empty sequence b.\n\nThe i-th operation is as follows:\n\nAppend a_i to the end of b.\n\nReverse the order of the elements in b.\n\nFind the sequence b obtained after these n operations.\n\nConstraints\n\n1 \\leq n \\leq 2\\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\nn and a_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint n integers in a line with spaces in between.\nThe i-th integer should be b_i.\n\nSample Input 1\n\n4\n1 2 3 4\n\nSample Output 1\n\n4 2 1 3\n\nAfter step 1 of the first operation, b becomes: 1.\n\nAfter step 2 of the first operation, b becomes: 1.\n\nAfter step 1 of the second operation, b becomes: 1, 2.\n\nAfter step 2 of the second operation, b becomes: 2, 1.\n\nAfter step 1 of the third operation, b becomes: 2, 1, 3.\n\nAfter step 2 of the third operation, b becomes: 3, 1, 2.\n\nAfter step 1 of the fourth operation, b becomes: 3, 1, 2, 4.\n\nAfter step 2 of the fourth operation, b becomes: 4, 2, 1, 3.\n\nThus, the answer is 4 2 1 3.\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n3 1 2\n\nAs shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.\n\nSample Input 3\n\n1\n1000000000\n\nSample Output 3\n\n1000000000\n\nSample Input 4\n\n6\n0 6 7 6 7 0\n\nSample Output 4\n\n0 6 6 0 7 7", "sample_input": "4\n1 2 3 4\n"}, "reference_outputs": ["4 2 1 3\n"], "source_document_id": "p03673", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length n, a_1, ..., a_n.\nLet us consider performing the following n operations on an empty sequence b.\n\nThe i-th operation is as follows:\n\nAppend a_i to the end of b.\n\nReverse the order of the elements in b.\n\nFind the sequence b obtained after these n operations.\n\nConstraints\n\n1 \\leq n \\leq 2\\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\nn and a_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint n integers in a line with spaces in between.\nThe i-th integer should be b_i.\n\nSample Input 1\n\n4\n1 2 3 4\n\nSample Output 1\n\n4 2 1 3\n\nAfter step 1 of the first operation, b becomes: 1.\n\nAfter step 2 of the first operation, b becomes: 1.\n\nAfter step 1 of the second operation, b becomes: 1, 2.\n\nAfter step 2 of the second operation, b becomes: 2, 1.\n\nAfter step 1 of the third operation, b becomes: 2, 1, 3.\n\nAfter step 2 of the third operation, b becomes: 3, 1, 2.\n\nAfter step 1 of the fourth operation, b becomes: 3, 1, 2, 4.\n\nAfter step 2 of the fourth operation, b becomes: 4, 2, 1, 3.\n\nThus, the answer is 4 2 1 3.\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n3 1 2\n\nAs shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.\n\nSample Input 3\n\n1\n1000000000\n\nSample Output 3\n\n1000000000\n\nSample Input 4\n\n6\n0 6 7 6 7 0\n\nSample Output 4\n\n0 6 6 0 7 7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3143, "cpu_time_ms": 129, "memory_kb": 7288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s499181158", "group_id": "codeNet:p03680", "input_text": "program sample\n implicit none\n integer(8) :: n,i,b\ninteger(8),allocatable :: a(:)\n \nread(*,*) n\nallocate(a(n))\ndo i=1,n\nread(*,*) a(i)\nend do\n \nb=1\ndo i=1,n\n a(b)=b\n if(a(b)==2)then\n write(*,*) i\n stop\n endif \nend do\n \nwrite(*,*) -1\n \nend program sample", "language": "Fortran", "metadata": {"date": 1599486793, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03680/input.txt", "sample_output_relpath": "derived/input_output/data/p03680/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03680/Fortran/s499181158.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s499181158", "user_id": "u943740059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program sample\n implicit none\n integer(8) :: n,i,b\ninteger(8),allocatable :: a(:)\n \nread(*,*) n\nallocate(a(n))\ndo i=1,n\nread(*,*) a(i)\nend do\n \nb=1\ndo i=1,n\n a(b)=b\n if(a(b)==2)then\n write(*,*) i\n stop\n endif \nend do\n \nwrite(*,*) -1\n \nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "sample_input": "3\n3\n1\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03680", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 46, "memory_kb": 3632}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s051239967", "group_id": "codeNet:p03680", "input_text": "implicit none\ninteger(8) :: n,i,count,bo,bn\ninteger(8),allocatable :: a(:)\n \nread(*,*) n\nallocate(a(n))\ndo i=1,n\nread(*,*) a(i)\nend do\n \ncount=1\nbo=a(1)\nbn=0\ndo while(bn/=2.or.bo>0)\nbn=a(bo)\ncount=count+1\na(bo)=-1\nbo=bn\nend do\n \nif(bn<0)then\nwrite(*,*) bn\nelse\nwrite(*,*) count\nendif\n \nend", "language": "Fortran", "metadata": {"date": 1599485638, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03680/input.txt", "sample_output_relpath": "derived/input_output/data/p03680/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03680/Fortran/s051239967.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s051239967", "user_id": "u943740059"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "implicit none\ninteger(8) :: n,i,count,bo,bn\ninteger(8),allocatable :: a(:)\n \nread(*,*) n\nallocate(a(n))\ndo i=1,n\nread(*,*) a(i)\nend do\n \ncount=1\nbo=a(1)\nbn=0\ndo while(bn/=2.or.bo>0)\nbn=a(bo)\ncount=count+1\na(bo)=-1\nbo=bn\nend do\n \nif(bn<0)then\nwrite(*,*) bn\nelse\nwrite(*,*) count\nendif\n \nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "sample_input": "3\n3\n1\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03680", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 289, "cpu_time_ms": 2205, "memory_kb": 3392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s199069625", "group_id": "codeNet:p03681", "input_text": "program reconciled\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8) :: n, m, i, x = 1_8\n read(*,*) n, m\n if (abs(n-m) > 1_8) then\n write(*,'(i0)') 0\n else\n if (n == m) x = 2_8\n do i = 1_8, min(n,m)\n x = mod(mod(i*i,md)*x,md)\n end do\n do i = min(n,m)+1_8, max(n,m)\n x = mod(i*x,md)\n end do\n write(*,'(i0)') x\n end if\nend program reconciled", "language": "Fortran", "metadata": {"date": 1570413535, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03681.html", "problem_id": "p03681", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03681/input.txt", "sample_output_relpath": "derived/input_output/data/p03681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03681/Fortran/s199069625.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199069625", "user_id": "u506403362"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program reconciled\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer(8) :: n, m, i, x = 1_8\n read(*,*) n, m\n if (abs(n-m) > 1_8) then\n write(*,'(i0)') 0\n else\n if (n == m) x = 2_8\n do i = 1_8, min(n,m)\n x = mod(mod(i*i,md)*x,md)\n end do\n do i = min(n,m)+1_8, max(n,m)\n x = mod(i*x,md)\n end do\n write(*,'(i0)') x\n end if\nend program reconciled", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "sample_input": "2 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03681", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s635619152", "group_id": "codeNet:p03687", "input_text": "program sample\n implicit none\n character(100)::s\n integer(8) :: i,j,m,n,x(26),y(26),z(26),a,b\n \n read(*,*) s\n n=len_trim(s)\n x(:)=0\n y(:)=-1\n do i=1,n\n x(:)=x(:)+1\n a=ichar(s(i:i))-96 \n x(a)=x(a)-1\n y(a)=max(x(a),y(a))\n x(a)=0\n end do\n do i=1,26\n y(i)=max(x(i),y(i))\n end do\n write(*,*)minval(y)\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1597518214, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03687.html", "problem_id": "p03687", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03687/input.txt", "sample_output_relpath": "derived/input_output/data/p03687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03687/Fortran/s635619152.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s635619152", "user_id": "u713568912"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s\n integer(8) :: i,j,m,n,x(26),y(26),z(26),a,b\n \n read(*,*) s\n n=len_trim(s)\n x(:)=0\n y(:)=-1\n do i=1,n\n x(:)=x(:)+1\n a=ichar(s(i:i))-96 \n x(a)=x(a)-1\n y(a)=max(x(a),y(a))\n x(a)=0\n end do\n do i=1,26\n y(i)=max(x(i),y(i))\n end do\n write(*,*)minval(y)\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke can change a string t of length N into a string t' of length N - 1 under the following rule:\n\nFor each i (1 ≤ i ≤ N - 1), the i-th character of t' must be either the i-th or (i + 1)-th character of t.\n\nThere is a string s consisting of lowercase English letters.\nSnuke's objective is to apply the above operation to s repeatedly so that all the characters in s are the same.\nFind the minimum necessary number of operations.\n\nConstraints\n\n1 ≤ |s| ≤ 100\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum necessary number of operations to achieve the objective.\n\nSample Input 1\n\nserval\n\nSample Output 1\n\n3\n\nOne solution is: serval → srvvl → svvv → vvv.\n\nSample Input 2\n\njackal\n\nSample Output 2\n\n2\n\nOne solution is: jackal → aacaa → aaaa.\n\nSample Input 3\n\nzzz\n\nSample Output 3\n\n0\n\nAll the characters in s are the same from the beginning.\n\nSample Input 4\n\nwhbrjpjyhsrywlqjxdbrbaomnw\n\nSample Output 4\n\n8\n\nIn 8 operations, he can change s to rrrrrrrrrrrrrrrrrr.", "sample_input": "serval\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03687", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke can change a string t of length N into a string t' of length N - 1 under the following rule:\n\nFor each i (1 ≤ i ≤ N - 1), the i-th character of t' must be either the i-th or (i + 1)-th character of t.\n\nThere is a string s consisting of lowercase English letters.\nSnuke's objective is to apply the above operation to s repeatedly so that all the characters in s are the same.\nFind the minimum necessary number of operations.\n\nConstraints\n\n1 ≤ |s| ≤ 100\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum necessary number of operations to achieve the objective.\n\nSample Input 1\n\nserval\n\nSample Output 1\n\n3\n\nOne solution is: serval → srvvl → svvv → vvv.\n\nSample Input 2\n\njackal\n\nSample Output 2\n\n2\n\nOne solution is: jackal → aacaa → aaaa.\n\nSample Input 3\n\nzzz\n\nSample Output 3\n\n0\n\nAll the characters in s are the same from the beginning.\n\nSample Input 4\n\nwhbrjpjyhsrywlqjxdbrbaomnw\n\nSample Output 4\n\n8\n\nIn 8 operations, he can change s to rrrrrrrrrrrrrrrrrr.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 14, "memory_kb": 2836}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s725662059", "group_id": "codeNet:p03689", "input_text": "program plus_minus_rectangle\n implicit none\n integer :: h, w, x, y, a(500,500), i, j\n a = 0\n read(*,*) h, w, x, y\n if (mod(h,x).eq.0.and.mod(w,y).eq.0) then\n write(*,'(a)') \"No\"\n stop\n end if\n write(*,'(a)') \"Yes\"\n do i = 1, h, x\n do j = 1, w, y\n a(i,j) = 999999\n if (i+x-1.le.h.and.j+y-1.le.w) a(i+x-1,j+y-1) = -1000000\n end do\n end do\n do i = 1, h\n call output(a(i,1:w))\n end do\n stop\ncontains\n subroutine output(a)\n implicit none\n integer, intent(in) :: a(:)\n integer :: n, i\n n = size(a)\n do i = 1, n\n write(*,'(i0,x)',advance='no') a(i)\n end do\n write(*,*)\n return\n end subroutine output\nend program plus_minus_rectangle", "language": "Fortran", "metadata": {"date": 1562638974, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03689.html", "problem_id": "p03689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03689/input.txt", "sample_output_relpath": "derived/input_output/data/p03689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03689/Fortran/s725662059.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s725662059", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n1 1 1\n1 -4 1\n1 1 1\n", "input_to_evaluate": "program plus_minus_rectangle\n implicit none\n integer :: h, w, x, y, a(500,500), i, j\n a = 0\n read(*,*) h, w, x, y\n if (mod(h,x).eq.0.and.mod(w,y).eq.0) then\n write(*,'(a)') \"No\"\n stop\n end if\n write(*,'(a)') \"Yes\"\n do i = 1, h, x\n do j = 1, w, y\n a(i,j) = 999999\n if (i+x-1.le.h.and.j+y-1.le.w) a(i+x-1,j+y-1) = -1000000\n end do\n end do\n do i = 1, h\n call output(a(i,1:w))\n end do\n stop\ncontains\n subroutine output(a)\n implicit none\n integer, intent(in) :: a(:)\n integer :: n, i\n n = size(a)\n do i = 1, n\n write(*,'(i0,x)',advance='no') a(i)\n end do\n write(*,*)\n return\n end subroutine output\nend program plus_minus_rectangle", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W).\nDetermine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:\n\nThe matrix has H rows and W columns.\n\nEach element of the matrix is an integer between -10^9 and 10^9 (inclusive).\n\nThe sum of all the elements of the matrix is positive.\n\nThe sum of all the elements within every subrectangle with h rows and w columns in the matrix is negative.\n\nConstraints\n\n1 ≤ h ≤ H ≤ 500\n\n1 ≤ w ≤ W ≤ 500\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W h w\n\nOutput\n\nIf there does not exist a matrix that satisfies all of the conditions, print No.\n\nOtherwise, print Yes in the first line, and print a matrix in the subsequent lines in the following format:\n\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nHere, a_{ij} represents the (i,\\ j) element of the matrix.\n\nSample Input 1\n\n3 3 2 2\n\nSample Output 1\n\nYes\n1 1 1\n1 -4 1\n1 1 1\n\nThe sum of all the elements of this matrix is 4, which is positive.\nAlso, in this matrix, there are four subrectangles with 2 rows and 2 columns as shown below. For each of them, the sum of all the elements inside is -1, which is negative.\n\nSample Input 2\n\n2 4 1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 4 2 3\n\nSample Output 3\n\nYes\n2 -5 8 7\n3 -5 -4 -5\n2 1 -1 7", "sample_input": "3 3 2 2\n"}, "reference_outputs": ["Yes\n1 1 1\n1 -4 1\n1 1 1\n"], "source_document_id": "p03689", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given four integers: H, W, h and w (1 ≤ h ≤ H, 1 ≤ w ≤ W).\nDetermine whether there exists a matrix such that all of the following conditions are held, and construct one such matrix if the answer is positive:\n\nThe matrix has H rows and W columns.\n\nEach element of the matrix is an integer between -10^9 and 10^9 (inclusive).\n\nThe sum of all the elements of the matrix is positive.\n\nThe sum of all the elements within every subrectangle with h rows and w columns in the matrix is negative.\n\nConstraints\n\n1 ≤ h ≤ H ≤ 500\n\n1 ≤ w ≤ W ≤ 500\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W h w\n\nOutput\n\nIf there does not exist a matrix that satisfies all of the conditions, print No.\n\nOtherwise, print Yes in the first line, and print a matrix in the subsequent lines in the following format:\n\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nHere, a_{ij} represents the (i,\\ j) element of the matrix.\n\nSample Input 1\n\n3 3 2 2\n\nSample Output 1\n\nYes\n1 1 1\n1 -4 1\n1 1 1\n\nThe sum of all the elements of this matrix is 4, which is positive.\nAlso, in this matrix, there are four subrectangles with 2 rows and 2 columns as shown below. For each of them, the sum of all the elements inside is -1, which is negative.\n\nSample Input 2\n\n2 4 1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 4 2 3\n\nSample Output 3\n\nYes\n2 -5 8 7\n3 -5 -4 -5\n2 1 -1 7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 113, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s418568177", "group_id": "codeNet:p03694", "input_text": "program ABC064B\n implicit none\n integer(8)::N,i\n integer(8),allocatable,dimension(:)::A\n read(5,*)N\n allocate(A(N))\n read(5,*)(A(i),i=1,N)\n print'(i0)',maxval(A)-minval(A)\nend program ABC064B", "language": "Fortran", "metadata": {"date": 1580475840, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03694.html", "problem_id": "p03694", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03694/input.txt", "sample_output_relpath": "derived/input_output/data/p03694/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03694/Fortran/s418568177.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s418568177", "user_id": "u414699019"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program ABC064B\n implicit none\n integer(8)::N,i\n integer(8),allocatable,dimension(:)::A\n read(5,*)N\n allocate(A(N))\n read(5,*)(A(i),i=1,N)\n print'(i0)',maxval(A)-minval(A)\nend program ABC064B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.\n\nThere are N houses along TopCoDeer street. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses.\n\nFind the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n0 ≤ a_i ≤ 1000\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum distance to be traveled.\n\nSample Input 1\n\n4\n2 3 7 9\n\nSample Output 1\n\n7\n\nThe travel distance of 7 can be achieved by starting at coordinate 9 and traveling straight to coordinate 2.\n\nIt is not possible to do with a travel distance of less than 7, and thus 7 is the minimum distance to be traveled.\n\nSample Input 2\n\n8\n3 1 4 1 5 9 2 6\n\nSample Output 2\n\n8\n\nThere may be more than one house at a position.", "sample_input": "4\n2 3 7 9\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03694", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.\n\nThere are N houses along TopCoDeer street. The i-th house is located at coordinate a_i. He has decided to deliver gifts to all these houses.\n\nFind the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n0 ≤ a_i ≤ 1000\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum distance to be traveled.\n\nSample Input 1\n\n4\n2 3 7 9\n\nSample Output 1\n\n7\n\nThe travel distance of 7 can be achieved by starting at coordinate 9 and traveling straight to coordinate 2.\n\nIt is not possible to do with a travel distance of less than 7, and thus 7 is the minimum distance to be traveled.\n\nSample Input 2\n\n8\n3 1 4 1 5 9 2 6\n\nSample Output 2\n\n8\n\nThere may be more than one house at a position.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s629264376", "group_id": "codeNet:p03695", "input_text": "program name\n implicit none\n integer(4):: n\n integer(4),allocatable:: a(:)\n integer(4):: over\n integer(4):: i,j\n logical:: iro(8)\n\n read*, n\n allocate(a(n))\n read*, a(:)\n iro(:) = .false.\n over = 0\n\n do i=1,n\n do j=0,4800\n if (j*400 <= a(i) .and. a(i) < (j+1)*400) then\n if (j < 8) then\n iro(j+1) = .true.\n else\n over=over+1\n end if\n end if\n end do\n end do\n\n\n print*, tsum(iro)\n print*, min(tsum(iro)+over, 8)\n\n\ncontains\n function tsum(larr) result(ret)\n logical:: larr(:)\n integer(4):: ret\n integer(4):: i\n ret=0\n do i=1,size(larr)\n if (larr(i)) ret=ret+1\n end do\n end function\nend program name", "language": "Fortran", "metadata": {"date": 1586662645, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03695.html", "problem_id": "p03695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03695/input.txt", "sample_output_relpath": "derived/input_output/data/p03695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03695/Fortran/s629264376.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s629264376", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "program name\n implicit none\n integer(4):: n\n integer(4),allocatable:: a(:)\n integer(4):: over\n integer(4):: i,j\n logical:: iro(8)\n\n read*, n\n allocate(a(n))\n read*, a(:)\n iro(:) = .false.\n over = 0\n\n do i=1,n\n do j=0,4800\n if (j*400 <= a(i) .and. a(i) < (j+1)*400) then\n if (j < 8) then\n iro(j+1) = .true.\n else\n over=over+1\n end if\n end if\n end do\n end do\n\n\n print*, tsum(iro)\n print*, min(tsum(iro)+over, 8)\n\n\ncontains\n function tsum(larr) result(ret)\n logical:: larr(:)\n integer(4):: ret\n integer(4):: i\n ret=0\n do i=1,size(larr)\n if (larr(i)) ret=ret+1\n end do\n end function\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "sample_input": "4\n2100 2500 2700 2700\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p03695", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s410113043", "group_id": "codeNet:p03695", "input_text": "program main\nimplicit none\ninteger :: i, j, k\ninteger :: n, b(8)\ninteger , allocatable :: a(:)\n\nread(*,*) n\nallocate( a(n) )\nread(*,*) a\na = a/400\nb = 0\nk = 0\ndo i = 1, n\n do j = 0, 7\n if( a(i) == j ) then\n b( j+1 ) = 1\n end if\n end do\n if( a(i) .ge. 8 ) then\n k = k + 1\n end if\nend do\nwrite(*,'(i0)') sum(b), min(8,sum(b)+k)\nend program main\n", "language": "Fortran", "metadata": {"date": 1563467409, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03695.html", "problem_id": "p03695", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03695/input.txt", "sample_output_relpath": "derived/input_output/data/p03695/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03695/Fortran/s410113043.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s410113043", "user_id": "u696547932"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, k\ninteger :: n, b(8)\ninteger , allocatable :: a(:)\n\nread(*,*) n\nallocate( a(n) )\nread(*,*) a\na = a/400\nb = 0\nk = 0\ndo i = 1, n\n do j = 0, 7\n if( a(i) == j ) then\n b( j+1 ) = 1\n end if\n end do\n if( a(i) .ge. 8 ) then\n k = k + 1\n end if\nend do\nwrite(*,'(i0)') sum(b), min(8,sum(b)+k)\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "sample_input": "4\n2100 2500 2700 2700\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p03695", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s126686077", "group_id": "codeNet:p03696", "input_text": "program prob5\n implicit none\n character(105) :: s\n integer :: n\n integer :: m, i, tmp, q, w\n\n read(*,*) n,s\n\n m = 0\n tmp = 0\n q = 0\n w = 0\n do i = 1, n\n if(s(i:i) == '(') then\n tmp = tmp + 1\n q = q + 1\n else\n tmp = tmp - 1\n w = w + 1\n end if\n m = min(m, tmp)\n end do\n \n do i = 1, -m\n write(*,'(a)',advance='no') '('\n end do\n\n q = q - m\n write(*,'(a)',advance='no') trim(adjustl(s))\n do i = 1, q - w\n write(*,'(a)',advance='no') ')'\n end do\n write(*,*) \n\n\n stop\ncontains\nend program prob5", "language": "Fortran", "metadata": {"date": 1596245509, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03696.html", "problem_id": "p03696", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03696/input.txt", "sample_output_relpath": "derived/input_output/data/p03696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03696/Fortran/s126686077.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126686077", "user_id": "u478462004"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "program prob5\n implicit none\n character(105) :: s\n integer :: n\n integer :: m, i, tmp, q, w\n\n read(*,*) n,s\n\n m = 0\n tmp = 0\n q = 0\n w = 0\n do i = 1, n\n if(s(i:i) == '(') then\n tmp = tmp + 1\n q = q + 1\n else\n tmp = tmp - 1\n w = w + 1\n end if\n m = min(m, tmp)\n end do\n \n do i = 1, -m\n write(*,'(a)',advance='no') '('\n end do\n\n q = q - m\n write(*,'(a)',advance='no') trim(adjustl(s))\n do i = 1, q - w\n write(*,'(a)',advance='no') ')'\n end do\n write(*,*) \n\n\n stop\ncontains\nend program prob5", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "sample_input": "3\n())\n"}, "reference_outputs": ["(())\n"], "source_document_id": "p03696", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 633, "cpu_time_ms": 5, "memory_kb": 2900}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s796354411", "group_id": "codeNet:p03697", "input_text": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: a,b\n read*, a,b\n if (a+b >= 10) then\n print'(a)', 'error'\n else\n print'(i0)', a+b\n end if\n \nend program main", "language": "Fortran", "metadata": {"date": 1591403801, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03697.html", "problem_id": "p03697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03697/input.txt", "sample_output_relpath": "derived/input_output/data/p03697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03697/Fortran/s796354411.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796354411", "user_id": "u234636620"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: a,b\n read*, a,b\n if (a+b >= 10) then\n print'(a)', 'error'\n else\n print'(i0)', a+b\n end if\n \nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "sample_input": "6 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03697", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s781670398", "group_id": "codeNet:p03697", "input_text": "program ABC063A\n implicit none\n integer(8)::A,B\n read(5,*)A,B\n\n if(A+B>=10)then\n print'(A)',\"error\"\n else\n print'(i0)',A+B\n end if\nend program ABC063A", "language": "Fortran", "metadata": {"date": 1580575437, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03697.html", "problem_id": "p03697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03697/input.txt", "sample_output_relpath": "derived/input_output/data/p03697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03697/Fortran/s781670398.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s781670398", "user_id": "u414699019"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program ABC063A\n implicit none\n integer(8)::A,B\n read(5,*)A,B\n\n if(A+B>=10)then\n print'(A)',\"error\"\n else\n print'(i0)',A+B\n end if\nend program ABC063A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "sample_input": "6 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03697", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s901312243", "group_id": "codeNet:p03698", "input_text": "program sample\n implicit none\n character(100)::s\n integer(8) :: i,j,m,n,a,b\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n allocate(x(26))\n n=len_trim(s)\n x(:)=0\n do i=1,n\n a=ichar(s(i:i))-96\n x(a)=x(a)+1\n end do\n if(maxval(x)>1)then\n write(*,*)'no'\n else\n write(*,*)'yes'\n end if\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1597455264, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/Fortran/s901312243.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s901312243", "user_id": "u713568912"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s\n integer(8) :: i,j,m,n,a,b\n integer(8),allocatable :: x(:),y(:)\n \n read(*,*) s\n allocate(x(26))\n n=len_trim(s)\n x(:)=0\n do i=1,n\n a=ichar(s(i:i))-96\n x(a)=x(a)+1\n end do\n if(maxval(x)>1)then\n write(*,*)'no'\n else\n write(*,*)'yes'\n end if\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |S| denotes the length of S.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 390, "cpu_time_ms": 6, "memory_kb": 2824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s493488991", "group_id": "codeNet:p03701", "input_text": "program bugged\nimplicit none\ninteger :: N\ninteger, allocatable, dimension(:, :) :: score\ninteger :: i, k\ninteger :: max_score\n\n\n\nread *, N\n\nallocate(score(N, 2))\ndo i = 1, N\n \n score(i, 1) = i\n read *, score(i, 2)\n\nend do\n\n\n\ncall heap_sort(score, N)\nmax_score = 0\n\n\ndo i = 1, N\n\n max_score = max_score + score(i, 2)\n\nend do\n\n\nk = 1\n\ndo while (mod(max_score, 10) == 0 .and. max_score > 0)\n\n max_score = max_score - score(k, 2)\n k = k + 1 \n\n\nend do\n\nif (max_score < 0) then\n\n max_score = max_score + score(k-1, 2)\n\nend if\n\n\n\nprint '(I0)', max_score\n\n\n\nend program bugged\n\n! heap sort\nsubroutine heap_sort( list, n )\nimplicit none\n\ninteger :: n \ninteger, dimension( n, 2 ) :: list\n\n\ninteger :: i, k\ninteger, dimension( 2 ) :: temporary\n\n\ndo k = n/2, 1, -1\n\n temporary( 1 ) = list( k, 1 )\n temporary( 2 ) = list( k, 2 )\n\n call make_heap( n, list, k, n, temporary )\n\n\n\nend do\n\n\ndo k = n, 2, -1\n\n \n temporary( 1 ) = list( k, 1 )\n temporary( 2 ) = list( k, 2 )\n \n list( k, 1 ) = list( 1, 1 )\n list( k, 2 ) = list( 1, 2 ) \n\n\n call make_heap( n, list, 1, k-1, temporary )\n\n\n\nend do\n\n\n\n!-----------------------------------------------------------------------------------\ncontains\n subroutine make_heap( n, list, root, leaf, var )\n implicit none\n \n integer :: n, root, leaf\n integer, dimension( n, 2 ) :: list\n integer, dimension( 2 ) :: var \n \n \n ! local\n integer :: i, j\n\n i = root\n j = i * 2\n \n \n ! 条件を満たすまで無限ループ\n do\n if ( j > leaf ) exit\n \n if ( j < leaf ) then\n\n if ( list( j, 2 ) < list( j + 1, 2 ) ) j = j + 1\n \n \n end if\n\n\n if ( list( j, 2 ) > var( 2 ) ) then\n\n list( i, 1 ) = list( j, 1 )\n list( i, 2 ) = list( j, 2 )\n \n i = j\n j = i * 2\n \n \n else\n \n j = leaf + 1\n \n \n endif\n \n \n end do\n \n \n list( i, 1 ) = var( 1 )\n list( i, 2 ) = var( 2 )\n \n end subroutine make_heap\n\n\n\n!----------------------------------------------------------------------------------\n\nend subroutine heap_sort", "language": "Fortran", "metadata": {"date": 1496542085, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03701.html", "problem_id": "p03701", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03701/input.txt", "sample_output_relpath": "derived/input_output/data/p03701/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03701/Fortran/s493488991.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s493488991", "user_id": "u887524368"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "program bugged\nimplicit none\ninteger :: N\ninteger, allocatable, dimension(:, :) :: score\ninteger :: i, k\ninteger :: max_score\n\n\n\nread *, N\n\nallocate(score(N, 2))\ndo i = 1, N\n \n score(i, 1) = i\n read *, score(i, 2)\n\nend do\n\n\n\ncall heap_sort(score, N)\nmax_score = 0\n\n\ndo i = 1, N\n\n max_score = max_score + score(i, 2)\n\nend do\n\n\nk = 1\n\ndo while (mod(max_score, 10) == 0 .and. max_score > 0)\n\n max_score = max_score - score(k, 2)\n k = k + 1 \n\n\nend do\n\nif (max_score < 0) then\n\n max_score = max_score + score(k-1, 2)\n\nend if\n\n\n\nprint '(I0)', max_score\n\n\n\nend program bugged\n\n! heap sort\nsubroutine heap_sort( list, n )\nimplicit none\n\ninteger :: n \ninteger, dimension( n, 2 ) :: list\n\n\ninteger :: i, k\ninteger, dimension( 2 ) :: temporary\n\n\ndo k = n/2, 1, -1\n\n temporary( 1 ) = list( k, 1 )\n temporary( 2 ) = list( k, 2 )\n\n call make_heap( n, list, k, n, temporary )\n\n\n\nend do\n\n\ndo k = n, 2, -1\n\n \n temporary( 1 ) = list( k, 1 )\n temporary( 2 ) = list( k, 2 )\n \n list( k, 1 ) = list( 1, 1 )\n list( k, 2 ) = list( 1, 2 ) \n\n\n call make_heap( n, list, 1, k-1, temporary )\n\n\n\nend do\n\n\n\n!-----------------------------------------------------------------------------------\ncontains\n subroutine make_heap( n, list, root, leaf, var )\n implicit none\n \n integer :: n, root, leaf\n integer, dimension( n, 2 ) :: list\n integer, dimension( 2 ) :: var \n \n \n ! local\n integer :: i, j\n\n i = root\n j = i * 2\n \n \n ! 条件を満たすまで無限ループ\n do\n if ( j > leaf ) exit\n \n if ( j < leaf ) then\n\n if ( list( j, 2 ) < list( j + 1, 2 ) ) j = j + 1\n \n \n end if\n\n\n if ( list( j, 2 ) > var( 2 ) ) then\n\n list( i, 1 ) = list( j, 1 )\n list( i, 2 ) = list( j, 2 )\n \n i = j\n j = i * 2\n \n \n else\n \n j = leaf + 1\n \n \n endif\n \n \n end do\n \n \n list( i, 1 ) = var( 1 )\n list( i, 2 ) = var( 2 )\n \n end subroutine make_heap\n\n\n\n!----------------------------------------------------------------------------------\n\nend subroutine heap_sort", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "sample_input": "3\n5\n10\n15\n"}, "reference_outputs": ["25\n"], "source_document_id": "p03701", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2218, "cpu_time_ms": 7, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s142628931", "group_id": "codeNet:p03707", "input_text": "program nuske_vs_phantom_thnook\n implicit none\n integer :: n, m, q, a(0:2000,0:2000), x1, y1, x2, y2, i, j, k\n integer :: x(0:2000,0:2000), y(0:2000,0:2000), z(0:2000,0:2000)\n character(2000) :: s\n a = 0\n x = 0\n y = 0\n z = 0\n read(*,*) n, m, q\n do i = 1, n\n read(*,*) s\n s = trim(adjustl(s))\n do j = 1, m\n if (s(j:j).eq.\"1\") a(i,j) = 1\n end do\n end do\n do i = 1, n\n do j = 1, m\n x(i,j) = x(i,j-1)+x(i-1,j)-x(i-1,j-1)+a(i,j)\n y(i,j) = y(i,j-1)+y(i-1,j)-y(i-1,j-1)+a(i,j)*a(i,j-1)\n z(i,j) = z(i,j-1)+z(i-1,j)-z(i-1,j-1)+a(i,j)*a(i-1,j)\n end do\n end do\n do k = 1, q\n read(*,*) x1, y1, x2, y2\n write(*,'(i0)') f(x,x1,y1,x2,y2)-f(y,x1,y1+1,x2,y2)-f(z,x1+1,y1,x2,y2)\n end do\n stop\ncontains\n integer function f(x,i1,j1,i2,j2)\n implicit none\n integer, intent(in) :: x(0:2000,0:2000), i1, j1, i2, j2\n f = x(i2,j2)-x(i2,j1-1)-x(i1-1,j2)+x(i1-1,j1-1)\n return\n end function f\nend program nuske_vs_phantom_thnook", "language": "Fortran", "metadata": {"date": 1562635302, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03707.html", "problem_id": "p03707", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03707/input.txt", "sample_output_relpath": "derived/input_output/data/p03707/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03707/Fortran/s142628931.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s142628931", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n2\n2\n2\n", "input_to_evaluate": "program nuske_vs_phantom_thnook\n implicit none\n integer :: n, m, q, a(0:2000,0:2000), x1, y1, x2, y2, i, j, k\n integer :: x(0:2000,0:2000), y(0:2000,0:2000), z(0:2000,0:2000)\n character(2000) :: s\n a = 0\n x = 0\n y = 0\n z = 0\n read(*,*) n, m, q\n do i = 1, n\n read(*,*) s\n s = trim(adjustl(s))\n do j = 1, m\n if (s(j:j).eq.\"1\") a(i,j) = 1\n end do\n end do\n do i = 1, n\n do j = 1, m\n x(i,j) = x(i,j-1)+x(i-1,j)-x(i-1,j-1)+a(i,j)\n y(i,j) = y(i,j-1)+y(i-1,j)-y(i-1,j-1)+a(i,j)*a(i,j-1)\n z(i,j) = z(i,j-1)+z(i-1,j)-z(i-1,j-1)+a(i,j)*a(i-1,j)\n end do\n end do\n do k = 1, q\n read(*,*) x1, y1, x2, y2\n write(*,'(i0)') f(x,x1,y1,x2,y2)-f(y,x1,y1+1,x2,y2)-f(z,x1+1,y1,x2,y2)\n end do\n stop\ncontains\n integer function f(x,i1,j1,i2,j2)\n implicit none\n integer, intent(in) :: x(0:2000,0:2000), i1, j1, i2, j2\n f = x(i2,j2)-x(i2,j1-1)-x(i1-1,j2)+x(i1-1,j1-1)\n return\n end function f\nend program nuske_vs_phantom_thnook", "problem_context": "Score : 700 points\n\nProblem Statement\n\nNuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right.\nEach square in the grid is painted in either blue or white. If S_{i,j} is 1, the square at the i-th row and j-th column is blue; if S_{i,j} is 0, the square is white.\nFor every pair of two blue square a and b, there is at most one path that starts from a, repeatedly proceeds to an adjacent (side by side) blue square and finally reaches b, without traversing the same square more than once.\n\nPhantom Thnook, Nuske's eternal rival, gives Q queries to Nuske. The i-th query consists of four integers x_{i,1}, y_{i,1}, x_{i,2} and y_{i,2} and asks him the following: when the rectangular region of the grid bounded by (and including) the x_{i,1}-th row, x_{i,2}-th row, y_{i,1}-th column and y_{i,2}-th column is cut out, how many connected components consisting of blue squares there are in the region?\n\nProcess all the queries.\n\nConstraints\n\n1 ≤ N,M ≤ 2000\n\n1 ≤ Q ≤ 200000\n\nS_{i,j} is either 0 or 1.\n\nS_{i,j} satisfies the condition explained in the statement.\n\n1 ≤ x_{i,1} ≤ x_{i,2} ≤ N(1 ≤ i ≤ Q)\n\n1 ≤ y_{i,1} ≤ y_{i,2} ≤ M(1 ≤ i ≤ Q)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M Q\nS_{1,1}..S_{1,M}\n:\nS_{N,1}..S_{N,M}\nx_{1,1} y_{i,1} x_{i,2} y_{i,2}\n:\nx_{Q,1} y_{Q,1} x_{Q,2} y_{Q,2}\n\nOutput\n\nFor each query, print the number of the connected components consisting of blue squares in the region.\n\nSample Input 1\n\n3 4 4\n1101\n0110\n1101\n1 1 3 4\n1 1 3 1\n2 2 3 4\n1 2 2 4\n\nSample Output 1\n\n3\n2\n2\n2\n\nIn the first query, the whole grid is specified. There are three components consisting of blue squares, and thus 3 should be printed.\n\nIn the second query, the region within the red frame is specified. There are two components consisting of blue squares, and thus 2 should be printed.\nNote that squares that belong to the same component in the original grid may belong to different components.\n\nSample Input 2\n\n5 5 6\n11010\n01110\n10101\n11101\n01010\n1 1 5 5\n1 2 4 5\n2 3 3 4\n3 3 3 3\n3 1 3 5\n1 1 3 4\n\nSample Output 2\n\n3\n2\n1\n1\n3\n2", "sample_input": "3 4 4\n1101\n0110\n1101\n1 1 3 4\n1 1 3 1\n2 2 3 4\n1 2 2 4\n"}, "reference_outputs": ["3\n2\n2\n2\n"], "source_document_id": "p03707", "source_text": "Score : 700 points\n\nProblem Statement\n\nNuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the columns are numbered 1 through M from left to right.\nEach square in the grid is painted in either blue or white. If S_{i,j} is 1, the square at the i-th row and j-th column is blue; if S_{i,j} is 0, the square is white.\nFor every pair of two blue square a and b, there is at most one path that starts from a, repeatedly proceeds to an adjacent (side by side) blue square and finally reaches b, without traversing the same square more than once.\n\nPhantom Thnook, Nuske's eternal rival, gives Q queries to Nuske. The i-th query consists of four integers x_{i,1}, y_{i,1}, x_{i,2} and y_{i,2} and asks him the following: when the rectangular region of the grid bounded by (and including) the x_{i,1}-th row, x_{i,2}-th row, y_{i,1}-th column and y_{i,2}-th column is cut out, how many connected components consisting of blue squares there are in the region?\n\nProcess all the queries.\n\nConstraints\n\n1 ≤ N,M ≤ 2000\n\n1 ≤ Q ≤ 200000\n\nS_{i,j} is either 0 or 1.\n\nS_{i,j} satisfies the condition explained in the statement.\n\n1 ≤ x_{i,1} ≤ x_{i,2} ≤ N(1 ≤ i ≤ Q)\n\n1 ≤ y_{i,1} ≤ y_{i,2} ≤ M(1 ≤ i ≤ Q)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M Q\nS_{1,1}..S_{1,M}\n:\nS_{N,1}..S_{N,M}\nx_{1,1} y_{i,1} x_{i,2} y_{i,2}\n:\nx_{Q,1} y_{Q,1} x_{Q,2} y_{Q,2}\n\nOutput\n\nFor each query, print the number of the connected components consisting of blue squares in the region.\n\nSample Input 1\n\n3 4 4\n1101\n0110\n1101\n1 1 3 4\n1 1 3 1\n2 2 3 4\n1 2 2 4\n\nSample Output 1\n\n3\n2\n2\n2\n\nIn the first query, the whole grid is specified. There are three components consisting of blue squares, and thus 3 should be printed.\n\nIn the second query, the region within the red frame is specified. There are two components consisting of blue squares, and thus 2 should be printed.\nNote that squares that belong to the same component in the original grid may belong to different components.\n\nSample Input 2\n\n5 5 6\n11010\n01110\n10101\n11101\n01010\n1 1 5 5\n1 2 4 5\n2 3 3 4\n3 3 3 3\n3 1 3 5\n1 1 3 4\n\nSample Output 2\n\n3\n2\n1\n1\n3\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 973, "cpu_time_ms": 433, "memory_kb": 64384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s728369708", "group_id": "codeNet:p03711", "input_text": "read*,i,j;print'(a)',merge(' No','Yes',i==2.or.j==2);end", "language": "Fortran", "metadata": {"date": 1552617248, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03711.html", "problem_id": "p03711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03711/input.txt", "sample_output_relpath": "derived/input_output/data/p03711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03711/Fortran/s728369708.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s728369708", "user_id": "u394482932"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "read*,i,j;print'(a)',merge(' No','Yes',i==2.or.j==2);end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "sample_input": "1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03711", "source_text": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 56, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s642536895", "group_id": "codeNet:p03711", "input_text": "integer x(12)\ninteger a,b\nx=(/1,2,1,3,1,3,1,1,3,1,3,1/)\nread*,a,b\nif(x(a)==x(b))then\n\tprint\"(A)\",\"Yes\"\nelse\n\tprint\"(A)\",\"No\"\nendif\nend", "language": "Fortran", "metadata": {"date": 1551423294, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03711.html", "problem_id": "p03711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03711/input.txt", "sample_output_relpath": "derived/input_output/data/p03711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03711/Fortran/s642536895.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s642536895", "user_id": "u598073939"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "integer x(12)\ninteger a,b\nx=(/1,2,1,3,1,3,1,1,3,1,3,1/)\nread*,a,b\nif(x(a)==x(b))then\n\tprint\"(A)\",\"Yes\"\nelse\n\tprint\"(A)\",\"No\"\nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "sample_input": "1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03711", "source_text": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s874347250", "group_id": "codeNet:p03712", "input_text": "CHARACTER(150) JOGE\nCHARACTER(150) BUTSUGIRI_PICTURE\nINTEGER H,W\nREAD*,H,W\n\nJOGE=\"\"\nDO I=1,W+2\n JOGE=TRIM(JOGE)//\"#\"\nEND DO\n\nPRINT\"(A)\",TRIM(JOGE)\nDO I=1,H\n READ*,BUTSUGIRI_PICTURE\n PRINT\"(A)\",\"#\"//TRIM(BUTSUGIRI_PICTURE)//\"#\"\nEND DO\nPRINT\"(A)\",TRIM(JOGE)\nEND", "language": "Fortran", "metadata": {"date": 1551747485, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03712.html", "problem_id": "p03712", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03712/input.txt", "sample_output_relpath": "derived/input_output/data/p03712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03712/Fortran/s874347250.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s874347250", "user_id": "u598073939"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "CHARACTER(150) JOGE\nCHARACTER(150) BUTSUGIRI_PICTURE\nINTEGER H,W\nREAD*,H,W\n\nJOGE=\"\"\nDO I=1,W+2\n JOGE=TRIM(JOGE)//\"#\"\nEND DO\n\nPRINT\"(A)\",TRIM(JOGE)\nDO I=1,H\n READ*,BUTSUGIRI_PICTURE\n PRINT\"(A)\",\"#\"//TRIM(BUTSUGIRI_PICTURE)//\"#\"\nEND DO\nPRINT\"(A)\",TRIM(JOGE)\nEND", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "sample_input": "2 3\nabc\narc\n"}, "reference_outputs": ["#####\n#abc#\n#arc#\n#####\n"], "source_document_id": "p03712", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s881797365", "group_id": "codeNet:p03712", "input_text": "program main\n implicit none\n integer :: h, w, i, j\n character(102) :: line\n character(1), allocatable :: tab(:, :)\n read(*, *) h, w\n allocate(tab(0:w + 1, 0:h + 1))\n tab(:, :) = \"#\"\n do i = 1, h\n read(*, *) line\n do j = 1, w\n tab(j, i) = line(j:j)\n end do\n end do\n do i = 0, h + 1\n do j = 0, w + 1\n line(j + 1:j + 1) = tab(j, i)\n end do\n write(*, \"(a)\") trim(line)\n end do\nend program main\n", "language": "Fortran", "metadata": {"date": 1551198762, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03712.html", "problem_id": "p03712", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03712/input.txt", "sample_output_relpath": "derived/input_output/data/p03712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03712/Fortran/s881797365.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s881797365", "user_id": "u388927326"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "program main\n implicit none\n integer :: h, w, i, j\n character(102) :: line\n character(1), allocatable :: tab(:, :)\n read(*, *) h, w\n allocate(tab(0:w + 1, 0:h + 1))\n tab(:, :) = \"#\"\n do i = 1, h\n read(*, *) line\n do j = 1, w\n tab(j, i) = line(j:j)\n end do\n end do\n do i = 0, h + 1\n do j = 0, w + 1\n line(j + 1:j + 1) = tab(j, i)\n end do\n write(*, \"(a)\") trim(line)\n end do\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "sample_input": "2 3\nabc\narc\n"}, "reference_outputs": ["#####\n#abc#\n#arc#\n#####\n"], "source_document_id": "p03712", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 429, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s991754652", "group_id": "codeNet:p03719", "input_text": "program between\n implicit none\n integer :: a,b,c\n\n read(*,*) a, b, c\n if ( c<=b .and. c>=a) then\n write(*,*) 'Yes'\n else\n write(*,*) 'No'\n end if\n stop\nend program between\n", "language": "Fortran", "metadata": {"date": 1592010156, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03719.html", "problem_id": "p03719", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03719/input.txt", "sample_output_relpath": "derived/input_output/data/p03719/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03719/Fortran/s991754652.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991754652", "user_id": "u961266059"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program between\n implicit none\n integer :: a,b,c\n\n read(*,*) a, b, c\n if ( c<=b .and. c>=a) then\n write(*,*) 'Yes'\n else\n write(*,*) 'No'\n end if\n stop\nend program between\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "sample_input": "1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03719", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s745466934", "group_id": "codeNet:p03721", "input_text": "program main\n integer(8) N, K, i\n integer(8), allocatable :: a(:), b(:)\n read(*, *) N, K\n allocate(a(1: N))\n allocate(b(1: N))\n do i = 1, N\n read(*, *) a(i), b(i)\n end do\n call heapsort(N,a,b)\n\n do i = 1, N\n if(1 <= K .and. K <= b(i)) then\n\t write(*, *) a(i)\n\t exit\n\t else\n\t K = K - b(i)\n\t end if\n end do\nend program main\n\n\nsubroutine heapsort(n,array,arrayb)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array(1:n),arrayb(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t, tb\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n\t\ttb=arrayb(L)\n else\n t=array(k)\n\t\ttb=arrayb(L)\n array(k)=array(1)\n\t\tarrayb(k)=arrayb(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n\t\t arrayb(1)=tb\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n\t\t arrayb(i)=arrayb(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n\t arrayb(i)=tb\n enddo\n\n return\nend subroutine heapsort", "language": "Fortran", "metadata": {"date": 1523943523, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03721.html", "problem_id": "p03721", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03721/input.txt", "sample_output_relpath": "derived/input_output/data/p03721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03721/Fortran/s745466934.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745466934", "user_id": "u728000113"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n integer(8) N, K, i\n integer(8), allocatable :: a(:), b(:)\n read(*, *) N, K\n allocate(a(1: N))\n allocate(b(1: N))\n do i = 1, N\n read(*, *) a(i), b(i)\n end do\n call heapsort(N,a,b)\n\n do i = 1, N\n if(1 <= K .and. K <= b(i)) then\n\t write(*, *) a(i)\n\t exit\n\t else\n\t K = K - b(i)\n\t end if\n end do\nend program main\n\n\nsubroutine heapsort(n,array,arrayb)\n implicit none\n integer(8),intent(in) :: n\n integer(8),intent(inout) :: array(1:n),arrayb(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t, tb\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n\n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n\t\ttb=arrayb(L)\n else\n t=array(k)\n\t\ttb=arrayb(L)\n array(k)=array(1)\n\t\tarrayb(k)=arrayb(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n\t\t arrayb(1)=tb\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n\t\t arrayb(i)=arrayb(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n\t arrayb(i)=tb\n enddo\n\n return\nend subroutine heapsort", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1330, "cpu_time_ms": 72, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s847026232", "group_id": "codeNet:p03722", "input_text": "integer N,M\ninteger(16),allocatable::a(:),b(:),c(:)\ninteger(16),allocatable::dist(:)\ninteger(16) ans\n\nlogical,allocatable::negative(:)\n\n\nread*,N,M\nallocate( a(M),b(M),c(M) )\ndo i=1,M\n read*,a(i),b(i),c(i)\n c(i)=-c(i)\nend do\n\nallocate(dist(N))\ndist=huge(a(J))/2\ndist(1)=0\ndo i=1,N\n do j=1,M\n if(dist(a(j))==huge(a(j))/2)cycle\n if (dist(b(j)) > dist(a(j))+c(j) )dist(b(j))= dist(a(j))+ c(j)\n end do\nend do\nans=dist(N)\n\nallocate(negative(N))\nnegative=.false.\ndo i=1,N\n do j=1,M\n if (dist(a(j)) == INF)cycle\n if (dist(b(j)) > dist(a(j)) + c(j) )then\n dist(b(j)) = dist(a(j)) + c(j)\n negative(b(j)) = .true.\n endif\n if (negative(a(j)) ) negative(b(j)) =.true.\n end do\nend do\n\nif(negative(N))then\n print\"(A)\",\"inf\"\nelse\n print\"(i0)\",-ans\nend if\nend", "language": "Fortran", "metadata": {"date": 1569443079, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03722.html", "problem_id": "p03722", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03722/input.txt", "sample_output_relpath": "derived/input_output/data/p03722/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03722/Fortran/s847026232.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s847026232", "user_id": "u598073939"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "integer N,M\ninteger(16),allocatable::a(:),b(:),c(:)\ninteger(16),allocatable::dist(:)\ninteger(16) ans\n\nlogical,allocatable::negative(:)\n\n\nread*,N,M\nallocate( a(M),b(M),c(M) )\ndo i=1,M\n read*,a(i),b(i),c(i)\n c(i)=-c(i)\nend do\n\nallocate(dist(N))\ndist=huge(a(J))/2\ndist(1)=0\ndo i=1,N\n do j=1,M\n if(dist(a(j))==huge(a(j))/2)cycle\n if (dist(b(j)) > dist(a(j))+c(j) )dist(b(j))= dist(a(j))+ c(j)\n end do\nend do\nans=dist(N)\n\nallocate(negative(N))\nnegative=.false.\ndo i=1,N\n do j=1,M\n if (dist(a(j)) == INF)cycle\n if (dist(b(j)) > dist(a(j)) + c(j) )then\n dist(b(j)) = dist(a(j)) + c(j)\n negative(b(j)) = .true.\n endif\n if (negative(a(j)) ) negative(b(j)) =.true.\n end do\nend do\n\nif(negative(N))then\n print\"(A)\",\"inf\"\nelse\n print\"(i0)\",-ans\nend if\nend", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i=b .and. a>=c ) then\n d = b*c\n else if( b>=a .and. b>=c ) then\n d = a*c\n else if( c>=a .and. c>=b ) then\n d = b*a\n end if\n\n write(*,*) d\n\n stop\nend program contest", "language": "Fortran", "metadata": {"date": 1590806008, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03723.html", "problem_id": "p03723", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03723/input.txt", "sample_output_relpath": "derived/input_output/data/p03723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03723/Fortran/s782881528.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s782881528", "user_id": "u642280675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program contest\n implicit none\n\n integer :: a, b, c, d\n\n read(*,*) a, b, c\n\n if( mod(a,2)==0 ) then\n d = 0\n else if( mod(b,2)==0 ) then\n d = 0\n else if( mod(c,2)==0 ) then\n d = 0\n else if( a>=b .and. a>=c ) then\n d = b*c\n else if( b>=a .and. b>=c ) then\n d = a*c\n else if( c>=a .and. c>=b ) then\n d = b*a\n end if\n\n write(*,*) d\n\n stop\nend program contest", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "sample_input": "4 12 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03723", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 390, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s708980718", "group_id": "codeNet:p03723", "input_text": " program agc014\n implicit none\n integer(8)::a,b,c\n integer(8)::aa,bb,cc\n integer(8)::count\n logical::check=.true.\n \n read *, a,b,c\n \n if (a==b .and. b==c .and. c==a) then\n print *, '-1'\n stop\n end if\n \n aa=a;bb=b;cc=c\n count=0\n do while (mod(a,2)/=0 .or. mod(b,2)/=0 .or. mod(c,2)/=0)\n a=a+bb/2+cc/2\n b=b+cc/2+aa/2\n c=c+aa/2+bb/2\n count=count+1\n aa=a;bb=b;cc=c\n end do\n \n print *, count\n \n end program agc014", "language": "Fortran", "metadata": {"date": 1589862416, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03723.html", "problem_id": "p03723", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03723/input.txt", "sample_output_relpath": "derived/input_output/data/p03723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03723/Fortran/s708980718.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s708980718", "user_id": "u792534719"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": " program agc014\n implicit none\n integer(8)::a,b,c\n integer(8)::aa,bb,cc\n integer(8)::count\n logical::check=.true.\n \n read *, a,b,c\n \n if (a==b .and. b==c .and. c==a) then\n print *, '-1'\n stop\n end if\n \n aa=a;bb=b;cc=c\n count=0\n do while (mod(a,2)/=0 .or. mod(b,2)/=0 .or. mod(c,2)/=0)\n a=a+bb/2+cc/2\n b=b+cc/2+aa/2\n c=c+aa/2+bb/2\n count=count+1\n aa=a;bb=b;cc=c\n end do\n \n print *, count\n \n end program agc014", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "sample_input": "4 12 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03723", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 609, "cpu_time_ms": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s175008279", "group_id": "codeNet:p03723", "input_text": "implicit none\n\ninteger :: n\nlogical :: flg_a, flg_b, flg_c\ninteger :: tmp_a, tmp_b, tmp_c\ninteger :: a,b,c\n\nread *,a,b,c\n\nflg_a = isOdd(a)\nflg_b = isOdd(b)\nflg_c = isOdd(c)\nif (flg_a .or. flg_b .or. flg_c) then\n print '(i0)',0\nendif\n\nif (a == b .and. b == c .and. c == a) then\n print '(i0)',-1\nendif\n\nflg_a = .false.\nflg_b = .false.\nflg_c = .false.\n\nn = 0\ndo while (.true.)\n flg_a = isOdd(a)\n flg_b = isOdd(b)\n flg_c = isOdd(c)\n if (flg_a .or. flg_b .or. flg_c) then\n exit\n endif\n n = n + 1\n tmp_a = a\n tmp_b = b\n tmp_c = c\n a = (tmp_b+tmp_c)/2\n b = (tmp_c+tmp_a)/2\n c = (tmp_a+tmp_b)/2\nenddo\n\nwrite(6,'(i0)') n\nstop\n\ncontains\n\n logical function isOdd(n)\n integer,intent(in) :: n\n isOdd = mod(n,2) == 1\n end function isOdd\n\nend", "language": "Fortran", "metadata": {"date": 1565689026, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03723.html", "problem_id": "p03723", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03723/input.txt", "sample_output_relpath": "derived/input_output/data/p03723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03723/Fortran/s175008279.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s175008279", "user_id": "u193540507"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "implicit none\n\ninteger :: n\nlogical :: flg_a, flg_b, flg_c\ninteger :: tmp_a, tmp_b, tmp_c\ninteger :: a,b,c\n\nread *,a,b,c\n\nflg_a = isOdd(a)\nflg_b = isOdd(b)\nflg_c = isOdd(c)\nif (flg_a .or. flg_b .or. flg_c) then\n print '(i0)',0\nendif\n\nif (a == b .and. b == c .and. c == a) then\n print '(i0)',-1\nendif\n\nflg_a = .false.\nflg_b = .false.\nflg_c = .false.\n\nn = 0\ndo while (.true.)\n flg_a = isOdd(a)\n flg_b = isOdd(b)\n flg_c = isOdd(c)\n if (flg_a .or. flg_b .or. flg_c) then\n exit\n endif\n n = n + 1\n tmp_a = a\n tmp_b = b\n tmp_c = c\n a = (tmp_b+tmp_c)/2\n b = (tmp_c+tmp_a)/2\n c = (tmp_a+tmp_b)/2\nenddo\n\nwrite(6,'(i0)') n\nstop\n\ncontains\n\n logical function isOdd(n)\n integer,intent(in) :: n\n isOdd = mod(n,2) == 1\n end function isOdd\n\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "sample_input": "4 12 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03723", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 774, "cpu_time_ms": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s063467473", "group_id": "codeNet:p03726", "input_text": "module mod_graph\n implicit none\n integer(8), parameter :: inf = 1000000000000000000_8\n\n type item\n integer :: id = 0\n integer(8) :: wt = 0_8\n end type\n\n type priorityqueue\n integer :: num = 0\n type(item), pointer :: heap(:) => null()\n contains\n !final :: finalizei\n end type\n\n type edge\n integer :: fm = 0, to = 0, cp = 0, rv = 0\n integer(8) :: wt = 0_8\n end type\n\n type arraylist\n integer :: num = 0\n type(edge), pointer :: arr(:) => null()\n contains\n procedure :: add => adde\n procedure :: bellman_ford => bellman_ford\n !final :: finalizee\n end type\n\n type graph\n type(arraylist), pointer :: egs(:) => null()\n logical, pointer :: used(:) => null()\n contains\n procedure :: add => add\n procedure :: dijkstra => dijkstra\n procedure :: ford_fulkerson => ford_fulkerson\n !final :: finalize\n end type\n\n interface graph\n module procedure :: newg\n end interface graph\n\ncontains\n\n function newi(id,wt) result(ret)\n integer, intent(in) :: id\n integer(8), intent(in) :: wt\n type(item) :: ret\n ret%id = id\n ret%wt = wt\n end\n\n subroutine swapi(a,b)\n type(item), intent(inout) :: a, b\n type(item) :: c\n c = a\n a = b\n b = c\n end\n\n subroutine appendi(a)\n type(item), pointer, intent(inout) :: a(:)\n integer :: n\n type(item), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lessi(a,b) result(ret)\n type(item), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizei(pq)\n type(priorityqueue), intent(inout) :: pq\n if (associated(pq%heap)) deallocate(pq%heap)\n pq%num = 0\n end\n\n subroutine offer(pq,it)\n type(priorityqueue), intent(inout) :: pq\n type(item), intent(in) :: it\n integer :: i, j\n if (.not.associated(pq%heap)) allocate(pq%heap(1))\n if (pq%num == size(pq%heap)) call appendi(pq%heap)\n pq%num = pq%num+1\n pq%heap(pq%num) = it\n i = pq%num\n do while (i > 1)\n j = i/2\n if (lessi(pq%heap(i),pq%heap(j))) call swapi(pq%heap(i),pq%heap(j))\n i = j\n end do\n end\n\n function poll(pq) result(ret)\n type(priorityqueue), intent(inout) :: pq\n type(item) :: ret\n integer :: n, i, j\n n = pq%num\n ret = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. lessi(pq%heap(j+1),pq%heap(j))) j = j+1\n if (lessi(pq%heap(j),pq%heap(i))) call swapi(pq%heap(j),pq%heap(i))\n i = j\n end do\n end\n\n function newe(to,wt,fm,cp,rv) result(ret)\n integer, intent(in) :: to\n integer(8), intent(in) :: wt\n integer, intent(in), optional :: fm, cp, rv\n type(edge) :: ret\n if (present(fm)) ret%fm = fm\n ret%to = to\n ret%wt = wt\n if (present(cp) .and. present(rv)) then\n ret%cp = cp\n ret%rv = rv\n end if\n end\n\n subroutine appende(a)\n type(edge), pointer, intent(inout) :: a(:)\n integer :: n\n type(edge), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lesse(a,b) result(ret)\n type(edge), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizee(list)\n type(arraylist), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n list%num = 0\n end\n\n subroutine adde(list,e)\n class(arraylist), intent(inout) :: list\n type(edge), intent(in) :: e\n if (.not.associated(list%arr)) allocate(list%arr(1))\n if (list%num == size(list%arr)) call appende(list%arr)\n list%num = list%num+1\n list%arr(list%num) = e\n end\n\n function newg(n) result(ret)\n integer, intent(in) :: n\n type(graph) :: ret\n allocate(ret%egs(n))\n end\n\n subroutine add(g,fm,to,wt,cp)\n class(graph), intent(inout) :: g\n integer, intent(in) :: fm, to\n integer, intent(in), optional :: cp\n integer(8) :: wt\n if (present(cp)) then\n call adde(g%egs(fm),newe(to,wt,cp=cp,rv=g%egs(to)%num))\n call adde(g%egs(to),newe(fm,wt,cp=0,rv=g%egs(fm)%num-1))\n else\n call adde(g%egs(fm),newe(to,wt))\n end if\n end\n\n subroutine finalize(g)\n type(graph), intent(inout) :: g\n integer :: i\n if (associated(g%used)) deallocate(g%used)\n if (.not.associated(g%egs)) return\n do i = 1, size(g%egs)\n call finalizee(g%egs(i))\n end do\n deallocate(g%egs)\n end\n\n function dijkstra(g,s) result(ret)\n class(graph), intent(in) :: g\n integer, intent(in) :: s\n integer(8) :: ret(size(g%egs))\n type(priorityqueue) :: pq\n type(item) :: it\n type(edge) :: e\n integer :: i\n ret = inf\n ret(s) = 0_8\n call offer(pq,newi(s,ret(s)))\n do while (pq%num > 0)\n it = poll(pq)\n if (it%wt > ret(it%id)) cycle\n do i = 1, g%egs(it%id)%num\n e = g%egs(it%id)%arr(i)\n if (ret(e%to) > ret(it%id)+e%wt) then\n ret(e%to) = ret(it%id)+e%wt\n call offer(pq,newi(e%to,ret(e%to)))\n end if\n end do\n end do\n call finalizei(pq)\n end\n\n recursive subroutine dfs_bf(g,u)\n type(graph), intent(inout) :: g\n integer, intent(in) :: u\n integer :: i, v\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n if (g%used(v)) cycle\n call dfs_bf(g,v)\n end do\n end\n\n function bellman_ford(es,s,t) result(ret)\n class(arraylist), intent(in) :: es\n integer, intent(in) :: s, t\n integer(8) :: ret\n integer :: n, i, fm, to, step\n integer(8) :: wt\n logical :: updated\n integer(8), allocatable :: tmp(:)\n type(graph) :: gs, gt\n type(arraylist) :: reach\n n = 0\n do i = 1, es%num\n n = max(n,es%arr(i)%fm,es%arr(i)%to)\n end do\n gs = newg(n)\n gt = newg(n)\n allocate(gs%used(n),gt%used(n))\n gs%used = .false.\n gt%used = .false.\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n wt = es%arr(i)%wt\n call add(gs,fm,to,wt)\n call add(gt,to,fm,wt)\n end do\n call dfs_bf(gs,s)\n call dfs_bf(gt,t)\n n = 0\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n if (gs%used(fm) .and. gt%used(fm) .and. gs%used(to) .and. gt%used(to)) then\n call adde(reach,es%arr(i))\n n = max(n,fm,to)\n end if\n end do\n call finalize(gs)\n call finalize(gt)\n allocate(tmp(n))\n tmp = inf\n tmp(s) = 0_8\n step = 0\n updated = .true.\n ret = inf\n do while (updated)\n updated = .false.\n do i = 1, reach%num\n fm = reach%arr(i)%fm\n to = reach%arr(i)%to\n wt = reach%arr(i)%wt\n if (tmp(to) > tmp(fm)+wt) then\n tmp(to) = tmp(fm)+wt\n updated = .true.\n end if\n end do\n step = step+1\n if (step > n) then\n ret = -inf\n exit\n end if\n end do\n if (ret == inf) ret = tmp(t)\n deallocate(tmp)\n call finalizee(reach)\n end\n\n recursive function dfs_ff(g,u,t,f) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: u, t, f\n integer :: ret\n integer :: i, v, cp, rv\n ret = f\n if (u == t) return\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n cp = g%egs(u)%arr(i)%cp\n if (g%used(v) .or. cp <= 0) cycle\n ret = dfs_ff(g,v,t,min(f,cp))\n rv = g%egs(u)%arr(i)%rv\n if (ret > 0) then\n g%egs(u)%arr(i)%cp = g%egs(u)%arr(i)%cp-ret\n g%egs(v)%arr(rv)%cp = g%egs(v)%arr(rv)%cp+ret\n return\n end if\n end do\n ret = 0\n end\n\n function ford_fulkerson(g,s,t) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: s, t\n integer :: ret\n integer :: f\n ret = 0\n if (associated(g%used) .and. size(g%used) /= size(g%egs)) deallocate(g%used)\n if (.not.associated(g%used)) allocate(g%used(size(g%egs)))\n do\n g%used = .false.\n f = dfs_ff(g,s,t,1000000000)\n if (f == 0) then\n deallocate(g%used)\n return\n end if\n ret = ret+f\n end do\n end\n\nend module mod_graph\n\nprogram black_and_white_tree\n use mod_graph\n implicit none\n type(graph) :: g\n integer :: n, a, b, i\n read(*,*) n\n g = graph(n)\n do i = 1, n-1\n read(*,*) a, b\n call g%add(a,b,0_8)\n call g%add(b,a,0_8)\n end do\n if (dfs(1,-1) == 0) then\n write(*,'(a)') \"Second\"\n else\n write(*,'(a)') \"First\"\n end if\ncontains\n recursive function dfs(u,p) result(ret)\n integer, intent(in) :: u, p\n integer :: ret, tmp, i, v\n ret = 0\n tmp = 0\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n if (v == p) cycle\n tmp = tmp+dfs(v,u)\n end do\n if (tmp >= 2) then\n write(*,'(a)') \"First\"\n stop\n end if\n if (tmp == 0) ret = 1\n end\nend program black_and_white_tree", "language": "Fortran", "metadata": {"date": 1567484450, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03726.html", "problem_id": "p03726", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03726/input.txt", "sample_output_relpath": "derived/input_output/data/p03726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03726/Fortran/s063467473.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s063467473", "user_id": "u506403362"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "module mod_graph\n implicit none\n integer(8), parameter :: inf = 1000000000000000000_8\n\n type item\n integer :: id = 0\n integer(8) :: wt = 0_8\n end type\n\n type priorityqueue\n integer :: num = 0\n type(item), pointer :: heap(:) => null()\n contains\n !final :: finalizei\n end type\n\n type edge\n integer :: fm = 0, to = 0, cp = 0, rv = 0\n integer(8) :: wt = 0_8\n end type\n\n type arraylist\n integer :: num = 0\n type(edge), pointer :: arr(:) => null()\n contains\n procedure :: add => adde\n procedure :: bellman_ford => bellman_ford\n !final :: finalizee\n end type\n\n type graph\n type(arraylist), pointer :: egs(:) => null()\n logical, pointer :: used(:) => null()\n contains\n procedure :: add => add\n procedure :: dijkstra => dijkstra\n procedure :: ford_fulkerson => ford_fulkerson\n !final :: finalize\n end type\n\n interface graph\n module procedure :: newg\n end interface graph\n\ncontains\n\n function newi(id,wt) result(ret)\n integer, intent(in) :: id\n integer(8), intent(in) :: wt\n type(item) :: ret\n ret%id = id\n ret%wt = wt\n end\n\n subroutine swapi(a,b)\n type(item), intent(inout) :: a, b\n type(item) :: c\n c = a\n a = b\n b = c\n end\n\n subroutine appendi(a)\n type(item), pointer, intent(inout) :: a(:)\n integer :: n\n type(item), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lessi(a,b) result(ret)\n type(item), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizei(pq)\n type(priorityqueue), intent(inout) :: pq\n if (associated(pq%heap)) deallocate(pq%heap)\n pq%num = 0\n end\n\n subroutine offer(pq,it)\n type(priorityqueue), intent(inout) :: pq\n type(item), intent(in) :: it\n integer :: i, j\n if (.not.associated(pq%heap)) allocate(pq%heap(1))\n if (pq%num == size(pq%heap)) call appendi(pq%heap)\n pq%num = pq%num+1\n pq%heap(pq%num) = it\n i = pq%num\n do while (i > 1)\n j = i/2\n if (lessi(pq%heap(i),pq%heap(j))) call swapi(pq%heap(i),pq%heap(j))\n i = j\n end do\n end\n\n function poll(pq) result(ret)\n type(priorityqueue), intent(inout) :: pq\n type(item) :: ret\n integer :: n, i, j\n n = pq%num\n ret = pq%heap(1)\n pq%heap(1) = pq%heap(n)\n pq%num = pq%num-1\n i = 1\n do while (2*i < n)\n j = 2*i\n if (j+1 < n .and. lessi(pq%heap(j+1),pq%heap(j))) j = j+1\n if (lessi(pq%heap(j),pq%heap(i))) call swapi(pq%heap(j),pq%heap(i))\n i = j\n end do\n end\n\n function newe(to,wt,fm,cp,rv) result(ret)\n integer, intent(in) :: to\n integer(8), intent(in) :: wt\n integer, intent(in), optional :: fm, cp, rv\n type(edge) :: ret\n if (present(fm)) ret%fm = fm\n ret%to = to\n ret%wt = wt\n if (present(cp) .and. present(rv)) then\n ret%cp = cp\n ret%rv = rv\n end if\n end\n\n subroutine appende(a)\n type(edge), pointer, intent(inout) :: a(:)\n integer :: n\n type(edge), allocatable :: tmp(:)\n n = size(a)\n allocate(tmp(n))\n tmp = a\n deallocate(a)\n allocate(a(2*n))\n a(1:n) = tmp\n deallocate(tmp)\n end\n\n function lesse(a,b) result(ret)\n type(edge), intent(in) :: a, b\n logical :: ret\n ret = a%wt < b%wt\n end\n\n subroutine finalizee(list)\n type(arraylist), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n list%num = 0\n end\n\n subroutine adde(list,e)\n class(arraylist), intent(inout) :: list\n type(edge), intent(in) :: e\n if (.not.associated(list%arr)) allocate(list%arr(1))\n if (list%num == size(list%arr)) call appende(list%arr)\n list%num = list%num+1\n list%arr(list%num) = e\n end\n\n function newg(n) result(ret)\n integer, intent(in) :: n\n type(graph) :: ret\n allocate(ret%egs(n))\n end\n\n subroutine add(g,fm,to,wt,cp)\n class(graph), intent(inout) :: g\n integer, intent(in) :: fm, to\n integer, intent(in), optional :: cp\n integer(8) :: wt\n if (present(cp)) then\n call adde(g%egs(fm),newe(to,wt,cp=cp,rv=g%egs(to)%num))\n call adde(g%egs(to),newe(fm,wt,cp=0,rv=g%egs(fm)%num-1))\n else\n call adde(g%egs(fm),newe(to,wt))\n end if\n end\n\n subroutine finalize(g)\n type(graph), intent(inout) :: g\n integer :: i\n if (associated(g%used)) deallocate(g%used)\n if (.not.associated(g%egs)) return\n do i = 1, size(g%egs)\n call finalizee(g%egs(i))\n end do\n deallocate(g%egs)\n end\n\n function dijkstra(g,s) result(ret)\n class(graph), intent(in) :: g\n integer, intent(in) :: s\n integer(8) :: ret(size(g%egs))\n type(priorityqueue) :: pq\n type(item) :: it\n type(edge) :: e\n integer :: i\n ret = inf\n ret(s) = 0_8\n call offer(pq,newi(s,ret(s)))\n do while (pq%num > 0)\n it = poll(pq)\n if (it%wt > ret(it%id)) cycle\n do i = 1, g%egs(it%id)%num\n e = g%egs(it%id)%arr(i)\n if (ret(e%to) > ret(it%id)+e%wt) then\n ret(e%to) = ret(it%id)+e%wt\n call offer(pq,newi(e%to,ret(e%to)))\n end if\n end do\n end do\n call finalizei(pq)\n end\n\n recursive subroutine dfs_bf(g,u)\n type(graph), intent(inout) :: g\n integer, intent(in) :: u\n integer :: i, v\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n if (g%used(v)) cycle\n call dfs_bf(g,v)\n end do\n end\n\n function bellman_ford(es,s,t) result(ret)\n class(arraylist), intent(in) :: es\n integer, intent(in) :: s, t\n integer(8) :: ret\n integer :: n, i, fm, to, step\n integer(8) :: wt\n logical :: updated\n integer(8), allocatable :: tmp(:)\n type(graph) :: gs, gt\n type(arraylist) :: reach\n n = 0\n do i = 1, es%num\n n = max(n,es%arr(i)%fm,es%arr(i)%to)\n end do\n gs = newg(n)\n gt = newg(n)\n allocate(gs%used(n),gt%used(n))\n gs%used = .false.\n gt%used = .false.\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n wt = es%arr(i)%wt\n call add(gs,fm,to,wt)\n call add(gt,to,fm,wt)\n end do\n call dfs_bf(gs,s)\n call dfs_bf(gt,t)\n n = 0\n do i = 1, es%num\n fm = es%arr(i)%fm\n to = es%arr(i)%to\n if (gs%used(fm) .and. gt%used(fm) .and. gs%used(to) .and. gt%used(to)) then\n call adde(reach,es%arr(i))\n n = max(n,fm,to)\n end if\n end do\n call finalize(gs)\n call finalize(gt)\n allocate(tmp(n))\n tmp = inf\n tmp(s) = 0_8\n step = 0\n updated = .true.\n ret = inf\n do while (updated)\n updated = .false.\n do i = 1, reach%num\n fm = reach%arr(i)%fm\n to = reach%arr(i)%to\n wt = reach%arr(i)%wt\n if (tmp(to) > tmp(fm)+wt) then\n tmp(to) = tmp(fm)+wt\n updated = .true.\n end if\n end do\n step = step+1\n if (step > n) then\n ret = -inf\n exit\n end if\n end do\n if (ret == inf) ret = tmp(t)\n deallocate(tmp)\n call finalizee(reach)\n end\n\n recursive function dfs_ff(g,u,t,f) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: u, t, f\n integer :: ret\n integer :: i, v, cp, rv\n ret = f\n if (u == t) return\n g%used(u) = .true.\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n cp = g%egs(u)%arr(i)%cp\n if (g%used(v) .or. cp <= 0) cycle\n ret = dfs_ff(g,v,t,min(f,cp))\n rv = g%egs(u)%arr(i)%rv\n if (ret > 0) then\n g%egs(u)%arr(i)%cp = g%egs(u)%arr(i)%cp-ret\n g%egs(v)%arr(rv)%cp = g%egs(v)%arr(rv)%cp+ret\n return\n end if\n end do\n ret = 0\n end\n\n function ford_fulkerson(g,s,t) result(ret)\n class(graph), intent(inout) :: g\n integer, intent(in) :: s, t\n integer :: ret\n integer :: f\n ret = 0\n if (associated(g%used) .and. size(g%used) /= size(g%egs)) deallocate(g%used)\n if (.not.associated(g%used)) allocate(g%used(size(g%egs)))\n do\n g%used = .false.\n f = dfs_ff(g,s,t,1000000000)\n if (f == 0) then\n deallocate(g%used)\n return\n end if\n ret = ret+f\n end do\n end\n\nend module mod_graph\n\nprogram black_and_white_tree\n use mod_graph\n implicit none\n type(graph) :: g\n integer :: n, a, b, i\n read(*,*) n\n g = graph(n)\n do i = 1, n-1\n read(*,*) a, b\n call g%add(a,b,0_8)\n call g%add(b,a,0_8)\n end do\n if (dfs(1,-1) == 0) then\n write(*,'(a)') \"Second\"\n else\n write(*,'(a)') \"First\"\n end if\ncontains\n recursive function dfs(u,p) result(ret)\n integer, intent(in) :: u, p\n integer :: ret, tmp, i, v\n ret = 0\n tmp = 0\n do i = 1, g%egs(u)%num\n v = g%egs(u)%arr(i)%to\n if (v == p) cycle\n tmp = tmp+dfs(v,u)\n end do\n if (tmp >= 2) then\n write(*,'(a)') \"First\"\n stop\n end if\n if (tmp == 0) ret = 1\n end\nend program black_and_white_tree", "problem_context": "Score : 900 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 through N.\nThe i-th of the N-1 edges connects vertices a_i and b_i.\n\nInitially, each vertex is uncolored.\n\nTakahashi and Aoki is playing a game by painting the vertices. In this game, they alternately perform the following operation, starting from Takahashi:\n\nSelect a vertex that is not painted yet.\n\nIf it is Takahashi who is performing this operation, paint the vertex white; paint it black if it is Aoki.\n\nThen, after all the vertices are colored, the following procedure takes place:\n\nRepaint every white vertex that is adjacent to a black vertex, in black.\n\nNote that all such white vertices are repainted simultaneously, not one at a time.\n\nIf there are still one or more white vertices remaining, Takahashi wins; if all the vertices are now black, Aoki wins.\nDetermine the winner of the game, assuming that both persons play optimally.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i,b_i ≤ N\n\na_i ≠ b_i\n\nThe input graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint First if Takahashi wins; print Second if Aoki wins.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\nFirst\n\nBelow is a possible progress of the game:\n\nFirst, Takahashi paint vertex 2 white.\n\nThen, Aoki paint vertex 1 black.\n\nLastly, Takahashi paint vertex 3 white.\n\nIn this case, the colors of vertices 1, 2 and 3 after the final procedure are black, black and white, resulting in Takahashi's victory.\n\nSample Input 2\n\n4\n1 2\n2 3\n2 4\n\nSample Output 2\n\nFirst\n\nSample Input 3\n\n6\n1 2\n2 3\n3 4\n2 5\n5 6\n\nSample Output 3\n\nSecond", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03726", "source_text": "Score : 900 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 through N.\nThe i-th of the N-1 edges connects vertices a_i and b_i.\n\nInitially, each vertex is uncolored.\n\nTakahashi and Aoki is playing a game by painting the vertices. In this game, they alternately perform the following operation, starting from Takahashi:\n\nSelect a vertex that is not painted yet.\n\nIf it is Takahashi who is performing this operation, paint the vertex white; paint it black if it is Aoki.\n\nThen, after all the vertices are colored, the following procedure takes place:\n\nRepaint every white vertex that is adjacent to a black vertex, in black.\n\nNote that all such white vertices are repainted simultaneously, not one at a time.\n\nIf there are still one or more white vertices remaining, Takahashi wins; if all the vertices are now black, Aoki wins.\nDetermine the winner of the game, assuming that both persons play optimally.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i,b_i ≤ N\n\na_i ≠ b_i\n\nThe input graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint First if Takahashi wins; print Second if Aoki wins.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\nFirst\n\nBelow is a possible progress of the game:\n\nFirst, Takahashi paint vertex 2 white.\n\nThen, Aoki paint vertex 1 black.\n\nLastly, Takahashi paint vertex 3 white.\n\nIn this case, the colors of vertices 1, 2 and 3 after the final procedure are black, black and white, resulting in Takahashi's victory.\n\nSample Input 2\n\n4\n1 2\n2 3\n2 4\n\nSample Output 2\n\nFirst\n\nSample Input 3\n\n6\n1 2\n2 3\n3 4\n2 5\n5 6\n\nSample Output 3\n\nSecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8798, "cpu_time_ms": 102, "memory_kb": 12416}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s743523157", "group_id": "codeNet:p03729", "input_text": "character(9)a,b,c;read*,a,b,c;i=len_trim(a);j=len_trim(b);print*,merge(\"YES\",\" NO\",a(i:i)//c(1:1)==b(1:1)//b(j:j));end", "language": "Fortran", "metadata": {"date": 1552616521, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03729.html", "problem_id": "p03729", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03729/input.txt", "sample_output_relpath": "derived/input_output/data/p03729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03729/Fortran/s743523157.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s743523157", "user_id": "u394482932"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "character(9)a,b,c;read*,a,b,c;i=len_trim(a);j=len_trim(b);print*,merge(\"YES\",\" NO\",a(i:i)//c(1:1)==b(1:1)//b(j:j));end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "sample_input": "rng gorilla apple\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03729", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s606735272", "group_id": "codeNet:p03731", "input_text": "program main\n integer(8) N, Time, total, i\n integer(8), allocatable :: t(:)\n read(*, *) N, Time\n allocate(t(1: N+1))\n read(*, *) t(1: N)\n t(N+1) = t(N) + Time\n total = 0\n do i = 1, N\n if( t(i+1)-t(i) <= Time) then\n\t total = total + (t(i+1)-t(i))\n\t else \n\t total = total + Time\n\t end if\n end do\n write(*, *) total \nend program main", "language": "Fortran", "metadata": {"date": 1523941585, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03731.html", "problem_id": "p03731", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03731/input.txt", "sample_output_relpath": "derived/input_output/data/p03731/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03731/Fortran/s606735272.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s606735272", "user_id": "u728000113"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program main\n integer(8) N, Time, total, i\n integer(8), allocatable :: t(:)\n read(*, *) N, Time\n allocate(t(1: N+1))\n read(*, *) t(1: N)\n t(N+1) = t(N) + Time\n total = 0\n do i = 1, N\n if( t(i+1)-t(i) <= Time) then\n\t total = total + (t(i+1)-t(i))\n\t else \n\t total = total + Time\n\t end if\n end do\n write(*, *) total \nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "sample_input": "2 4\n0 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03731", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 372, "cpu_time_ms": 65, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s985848586", "group_id": "codeNet:p03731", "input_text": "program main\n integer(8) N, Time, total, i\n integer(8), allocatable :: t(:)\n read(*, *) N, Time\n allocate(t(1: N))\n read(*, *) t(1: N)\n total = 0\n do i = 1, N\n if( t(i+1)-t(i) <= Time) then\n\t total = total + t(i+1)-t(i)\n\t else \n\t total = total + Time\n\t end if\n end do\n write(*, *) total\nend program main", "language": "Fortran", "metadata": {"date": 1523939466, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03731.html", "problem_id": "p03731", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03731/input.txt", "sample_output_relpath": "derived/input_output/data/p03731/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03731/Fortran/s985848586.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s985848586", "user_id": "u728000113"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program main\n integer(8) N, Time, total, i\n integer(8), allocatable :: t(:)\n read(*, *) N, Time\n allocate(t(1: N))\n read(*, *) t(1: N)\n total = 0\n do i = 1, N\n if( t(i+1)-t(i) <= Time) then\n\t total = total + t(i+1)-t(i)\n\t else \n\t total = total + Time\n\t end if\n end do\n write(*, *) total\nend program main", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "sample_input": "2 4\n0 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03731", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a public bath, there is a shower which emits water for T seconds when the switch is pushed.\n\nIf the switch is pushed when the shower is already emitting water, from that moment it will be emitting water for T seconds.\nNote that it does not mean that the shower emits water for T additional seconds.\n\nN people will push the switch while passing by the shower.\nThe i-th person will push the switch t_i seconds after the first person pushes it.\n\nHow long will the shower emit water in total?\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ T ≤ 10^9\n\n0 = t_1 < t_2 < t_3 < , ..., < t_{N-1} < t_N ≤ 10^9\n\nT and each t_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nt_1 t_2 ... t_N\n\nOutput\n\nAssume that the shower will emit water for a total of X seconds. Print X.\n\nSample Input 1\n\n2 4\n0 3\n\nSample Output 1\n\n7\n\nThree seconds after the first person pushes the water, the switch is pushed again and the shower emits water for four more seconds, for a total of seven seconds.\n\nSample Input 2\n\n2 4\n0 5\n\nSample Output 2\n\n8\n\nOne second after the shower stops emission of water triggered by the first person, the switch is pushed again.\n\nSample Input 3\n\n4 1000000000\n0 1000 1000000 1000000000\n\nSample Output 3\n\n2000000000\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n1\n\nSample Input 5\n\n9 10\n0 3 5 7 100 110 200 300 311\n\nSample Output 5\n\n67", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 65, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s326137284", "group_id": "codeNet:p03734", "input_text": "program ARC073D\n implicit none\n integer(8)::N,W,i,j,k,l,a,b,c,d,Vall(100,4),wi,w1,vi,vcount(4),ans,wall,v\n read*,N,W\n vcount=0\n Vall=0\n ans=0\n do i=1,N\n read*,wi,vi\n if(i==1)w1=wi\n vcount(wi-w1+1)=vcount(wi-w1+1)+1\n Vall(vcount(wi-w1+1),wi-w1+1)=vi\n end do\n\n do i=1,4\n call heapsort(100,Vall(:,i))\n end do\n\n do i=0,vcount(1)\n do j=0,vcount(2)\n do k=0,vcount(3)\n do l=0,vcount(4)\n wall=i*w1+j*(w1+1)+k*(w1+2)+l*(w1+3)\n if(wall<=W)then\n v=0\n do a=0,i-1\n v=v+Vall(100-a,1)\n end do\n\n do b=0,j-1\n v=v+Vall(100-b,2)\n end do\n\n do c=0,k-1\n v=v+Vall(100-c,3)\n end do\n\n do d=0,l-1\n v=v+Vall(100-d,4)\n end do\n ans=max(ans,v)\n end if\n end do\n end do\n end do\n end do\n\n print'(i0)',ans\nend program ARC073D\n\nsubroutine heapsort(n,array)\n implicit none\n integer,intent(in) :: n\n integer(8),intent(inout) :: array(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t\n \n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort", "language": "Fortran", "metadata": {"date": 1588284097, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03734.html", "problem_id": "p03734", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03734/input.txt", "sample_output_relpath": "derived/input_output/data/p03734/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03734/Fortran/s326137284.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326137284", "user_id": "u414699019"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "program ARC073D\n implicit none\n integer(8)::N,W,i,j,k,l,a,b,c,d,Vall(100,4),wi,w1,vi,vcount(4),ans,wall,v\n read*,N,W\n vcount=0\n Vall=0\n ans=0\n do i=1,N\n read*,wi,vi\n if(i==1)w1=wi\n vcount(wi-w1+1)=vcount(wi-w1+1)+1\n Vall(vcount(wi-w1+1),wi-w1+1)=vi\n end do\n\n do i=1,4\n call heapsort(100,Vall(:,i))\n end do\n\n do i=0,vcount(1)\n do j=0,vcount(2)\n do k=0,vcount(3)\n do l=0,vcount(4)\n wall=i*w1+j*(w1+1)+k*(w1+2)+l*(w1+3)\n if(wall<=W)then\n v=0\n do a=0,i-1\n v=v+Vall(100-a,1)\n end do\n\n do b=0,j-1\n v=v+Vall(100-b,2)\n end do\n\n do c=0,k-1\n v=v+Vall(100-c,3)\n end do\n\n do d=0,l-1\n v=v+Vall(100-d,4)\n end do\n ans=max(ans,v)\n end if\n end do\n end do\n end do\n end do\n\n print'(i0)',ans\nend program ARC073D\n\nsubroutine heapsort(n,array)\n implicit none\n integer,intent(in) :: n\n integer(8),intent(inout) :: array(1:n)\n \n integer(8) ::i,k,j,l\n integer(8) :: t\n \n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(L)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\n end subroutine heapsort", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N items and a bag of strength W.\nThe i-th item has a weight of w_i and a value of v_i.\n\nYou will select some of the items and put them in the bag.\nHere, the total weight of the selected items needs to be at most W.\n\nYour objective is to maximize the total value of the selected items.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ W ≤ 10^9\n\n1 ≤ w_i ≤ 10^9\n\nFor each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.\n\n1 ≤ v_i ≤ 10^7\n\nW, each w_i and v_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible total value of the selected items.\n\nSample Input 1\n\n4 6\n2 1\n3 4\n4 10\n3 4\n\nSample Output 1\n\n11\n\nThe first and third items should be selected.\n\nSample Input 2\n\n4 6\n2 1\n3 7\n4 10\n3 6\n\nSample Output 2\n\n13\n\nThe second and fourth items should be selected.\n\nSample Input 3\n\n4 10\n1 100\n1 100\n1 100\n1 100\n\nSample Output 3\n\n400\n\nYou can take everything.\n\nSample Input 4\n\n4 1\n10 100\n10 100\n10 100\n10 100\n\nSample Output 4\n\n0\n\nYou can take nothing.", "sample_input": "4 6\n2 1\n3 4\n4 10\n3 4\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03734", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N items and a bag of strength W.\nThe i-th item has a weight of w_i and a value of v_i.\n\nYou will select some of the items and put them in the bag.\nHere, the total weight of the selected items needs to be at most W.\n\nYour objective is to maximize the total value of the selected items.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ W ≤ 10^9\n\n1 ≤ w_i ≤ 10^9\n\nFor each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.\n\n1 ≤ v_i ≤ 10^7\n\nW, each w_i and v_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible total value of the selected items.\n\nSample Input 1\n\n4 6\n2 1\n3 4\n4 10\n3 4\n\nSample Output 1\n\n11\n\nThe first and third items should be selected.\n\nSample Input 2\n\n4 6\n2 1\n3 7\n4 10\n3 6\n\nSample Output 2\n\n13\n\nThe second and fourth items should be selected.\n\nSample Input 3\n\n4 10\n1 100\n1 100\n1 100\n1 100\n\nSample Output 3\n\n400\n\nYou can take everything.\n\nSample Input 4\n\n4 1\n10 100\n10 100\n10 100\n10 100\n\nSample Output 4\n\n0\n\nYou can take nothing.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2061, "cpu_time_ms": 7, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s218276203", "group_id": "codeNet:p03736", "input_text": "module mod_segment_tree\n implicit none\n integer(8), parameter :: inf = 100000000000_8\n type t_segment_tree\n private\n integer(8) :: deflt = inf\n integer :: n, p\n integer(8), pointer :: arr(:) => null()\n contains\n procedure :: init => init_segtree\n procedure :: release => release_segtree\n procedure :: update => update\n procedure :: query => query\n procedure :: default => set_default\n procedure :: change => change_default\n end type\ncontains\n integer function op(x,y)\n integer(8), intent(in) :: x, y\n op = min(x,y)\n end\n subroutine init_segtree(this,n)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n this%n = n\n this%p = p\n allocate(this%arr(2*p-1))\n this%arr = this%deflt\n end\n subroutine release_segtree(this)\n class(t_segment_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine set_default(this,i)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer :: x\n x = i+this%p-1\n this%arr(x) = this%deflt\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n subroutine change_default(this,deflt)\n class(t_segment_tree), intent(inout) :: this\n integer(8), intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine update(this,i,v)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer(8), intent(in) :: v\n integer :: x\n x = i+this%p-1\n this%arr(x) = v\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n integer(8) function query(this,a,b)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: a, b\n integer :: l, r\n query = this%deflt\n l = a+this%p-1\n r = b+this%p-1\n do while (l <= r)\n if (mod(l,2) == 1) then\n query = op(query,this%arr(l))\n l = l+1\n end if\n if (mod(r,2) == 0) then\n query = op(query,this%arr(r))\n r = r-1\n end if\n l = l/2\n r = r/2\n end do\n end\nend module mod_segment_tree\nprogram many_moves\n use mod_segment_tree\n implicit none\n type(t_segment_tree) :: plus, minus\n integer :: n, q, a, b, x(200000) = 0, i, j\n integer(8) :: ans = 1000000_8*inf, offset = 0_8, tmp, v1, v2\n read(*,*) n, q, a, b\n read(*,*) x(1:q)\n call plus%init(n)\n call minus%init(n)\n call set(a,0_8)\n do i = 1, q\n tmp = int(abs(x(i)-b),8)\n v1 = rmq(x(i))\n v2 = get(b)+tmp\n call set(b,min(v1,v2)-tmp)\n offset = offset+tmp\n b = x(i)\n end do\n do i = 1, n\n ans = min(ans,get(i))\n end do\n write(*,'(i0)') ans\ncontains\n subroutine set(i,v)\n integer, intent(in) :: i\n integer(8), intent(in) :: v\n call plus%update(i,v+int(i,8))\n call minus%update(i,v-int(i,8))\n end\n integer(8) function get(i)\n integer, intent(in) :: i\n get = plus%query(i,i)-int(i,8)+offset\n end\n integer(8) function rmq(i)\n integer, intent(in) :: i\n rmq = min(minus%query(1,i-1)+int(i,8),plus%query(i,n)-int(i,8))\n end\nend program many_moves", "language": "Fortran", "metadata": {"date": 1570680969, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03736.html", "problem_id": "p03736", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03736/input.txt", "sample_output_relpath": "derived/input_output/data/p03736/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03736/Fortran/s218276203.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s218276203", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "module mod_segment_tree\n implicit none\n integer(8), parameter :: inf = 100000000000_8\n type t_segment_tree\n private\n integer(8) :: deflt = inf\n integer :: n, p\n integer(8), pointer :: arr(:) => null()\n contains\n procedure :: init => init_segtree\n procedure :: release => release_segtree\n procedure :: update => update\n procedure :: query => query\n procedure :: default => set_default\n procedure :: change => change_default\n end type\ncontains\n integer function op(x,y)\n integer(8), intent(in) :: x, y\n op = min(x,y)\n end\n subroutine init_segtree(this,n)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: n\n integer :: p\n p = 1\n do while (p < n)\n p = 2*p\n end do\n this%n = n\n this%p = p\n allocate(this%arr(2*p-1))\n this%arr = this%deflt\n end\n subroutine release_segtree(this)\n class(t_segment_tree), intent(inout) :: this\n if (associated(this%arr)) deallocate(this%arr)\n end\n subroutine set_default(this,i)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer :: x\n x = i+this%p-1\n this%arr(x) = this%deflt\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n subroutine change_default(this,deflt)\n class(t_segment_tree), intent(inout) :: this\n integer(8), intent(in) :: deflt\n this%deflt = deflt\n end\n subroutine update(this,i,v)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: i\n integer(8), intent(in) :: v\n integer :: x\n x = i+this%p-1\n this%arr(x) = v\n do while (x > 1)\n x = x/2\n this%arr(x) = op(this%arr(2*x),this%arr(2*x+1))\n end do\n end\n integer(8) function query(this,a,b)\n class(t_segment_tree), intent(inout) :: this\n integer, intent(in) :: a, b\n integer :: l, r\n query = this%deflt\n l = a+this%p-1\n r = b+this%p-1\n do while (l <= r)\n if (mod(l,2) == 1) then\n query = op(query,this%arr(l))\n l = l+1\n end if\n if (mod(r,2) == 0) then\n query = op(query,this%arr(r))\n r = r-1\n end if\n l = l/2\n r = r/2\n end do\n end\nend module mod_segment_tree\nprogram many_moves\n use mod_segment_tree\n implicit none\n type(t_segment_tree) :: plus, minus\n integer :: n, q, a, b, x(200000) = 0, i, j\n integer(8) :: ans = 1000000_8*inf, offset = 0_8, tmp, v1, v2\n read(*,*) n, q, a, b\n read(*,*) x(1:q)\n call plus%init(n)\n call minus%init(n)\n call set(a,0_8)\n do i = 1, q\n tmp = int(abs(x(i)-b),8)\n v1 = rmq(x(i))\n v2 = get(b)+tmp\n call set(b,min(v1,v2)-tmp)\n offset = offset+tmp\n b = x(i)\n end do\n do i = 1, n\n ans = min(ans,get(i))\n end do\n write(*,'(i0)') ans\ncontains\n subroutine set(i,v)\n integer, intent(in) :: i\n integer(8), intent(in) :: v\n call plus%update(i,v+int(i,8))\n call minus%update(i,v-int(i,8))\n end\n integer(8) function get(i)\n integer, intent(in) :: i\n get = plus%query(i,i)-int(i,8)+offset\n end\n integer(8) function rmq(i)\n integer, intent(in) :: i\n rmq = min(minus%query(1,i-1)+int(i,8),plus%query(i,n)-int(i,8))\n end\nend program many_moves", "problem_context": "Score : 900 points\n\nProblem Statement\n\nThere are N squares in a row. The squares are numbered 1, 2, ..., N from left to right.\n\nYou have two pieces, initially placed on square A and B, respectively.\nYou will be asked to process Q queries of the following kind, in the order received:\n\nGiven an integer x_i, move one of the two pieces of your choice to square x_i.\n\nHere, it takes you one second to move a piece one square.\nThat is, the time it takes to move a piece from square X to Y is |X-Y| seconds.\n\nYour objective is to process all the queries in the shortest possible time.\n\nYou may only move the pieces in response to queries, and you may not move both pieces at the same time.\nAlso, it is not allowed to rearrange the order in which queries are given.\nIt is, however, allowed to have both pieces in the same square at the same time.\n\nConstraints\n\n1 ≤ N, Q ≤ 200,000\n\n1 ≤ A, B ≤ N\n\n1 ≤ x_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q A B\nx_1 x_2 ... x_Q\n\nOutput\n\nLet the shortest possible time to process all the queries be X seconds. Print X.\n\nSample Input 1\n\n8 3 1 8\n3 5 1\n\nSample Output 1\n\n7\n\nAll the queries can be processed in seven seconds, by:\n\nmoving the piece at square 1 to 3\n\nmoving the piece at square 8 to 5\n\nmoving the piece at square 3 to 1\n\nSample Input 2\n\n9 2 1 9\n5 1\n\nSample Output 2\n\n4\n\nThe piece at square 9 should be moved first.\n\nSample Input 3\n\n9 2 1 9\n5 9\n\nSample Output 3\n\n4\n\nThe piece at square 1 should be moved first.\n\nSample Input 4\n\n11 16 8 1\n1 1 5 1 11 4 5 2 5 3 3 3 5 5 6 7\n\nSample Output 4\n\n21", "sample_input": "8 3 1 8\n3 5 1\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03736", "source_text": "Score : 900 points\n\nProblem Statement\n\nThere are N squares in a row. The squares are numbered 1, 2, ..., N from left to right.\n\nYou have two pieces, initially placed on square A and B, respectively.\nYou will be asked to process Q queries of the following kind, in the order received:\n\nGiven an integer x_i, move one of the two pieces of your choice to square x_i.\n\nHere, it takes you one second to move a piece one square.\nThat is, the time it takes to move a piece from square X to Y is |X-Y| seconds.\n\nYour objective is to process all the queries in the shortest possible time.\n\nYou may only move the pieces in response to queries, and you may not move both pieces at the same time.\nAlso, it is not allowed to rearrange the order in which queries are given.\nIt is, however, allowed to have both pieces in the same square at the same time.\n\nConstraints\n\n1 ≤ N, Q ≤ 200,000\n\n1 ≤ A, B ≤ N\n\n1 ≤ x_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q A B\nx_1 x_2 ... x_Q\n\nOutput\n\nLet the shortest possible time to process all the queries be X seconds. Print X.\n\nSample Input 1\n\n8 3 1 8\n3 5 1\n\nSample Output 1\n\n7\n\nAll the queries can be processed in seven seconds, by:\n\nmoving the piece at square 1 to 3\n\nmoving the piece at square 8 to 5\n\nmoving the piece at square 3 to 1\n\nSample Input 2\n\n9 2 1 9\n5 1\n\nSample Output 2\n\n4\n\nThe piece at square 9 should be moved first.\n\nSample Input 3\n\n9 2 1 9\n5 9\n\nSample Output 3\n\n4\n\nThe piece at square 1 should be moved first.\n\nSample Input 4\n\n11 16 8 1\n1 1 5 1 11 4 5 2 5 3 3 3 5 5 6 7\n\nSample Output 4\n\n21", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3172, "cpu_time_ms": 139, "memory_kb": 9728}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s123816540", "group_id": "codeNet:p03737", "input_text": "program prob1\n implicit none\n integer::i, j\n character(len=10)::s1, s2, s3\n read(*,*) s1, s2, s3\n\n write(*,'(3a)') char(ichar(s1(1:1)) - 32), char(ichar(s2(1:1)) - 32), char(ichar(s3(1:1)) - 32)\n stop\nend program", "language": "Fortran", "metadata": {"date": 1596243721, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03737.html", "problem_id": "p03737", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03737/input.txt", "sample_output_relpath": "derived/input_output/data/p03737/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03737/Fortran/s123816540.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s123816540", "user_id": "u841856382"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program prob1\n implicit none\n integer::i, j\n character(len=10)::s1, s2, s3\n read(*,*) s1, s2, s3\n\n write(*,'(3a)') char(ichar(s1(1:1)) - 32), char(ichar(s2(1:1)) - 32), char(ichar(s3(1:1)) - 32)\n stop\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "sample_input": "atcoder beginner contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03737", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 6, "memory_kb": 2860}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s576953635", "group_id": "codeNet:p03738", "input_text": "program main\n implicit none\n \n integer(16)::a,b\n \n read(*,*)a\n read(*,*)b\n if ((a-b) > 0) then\n write(*,*)\"GREATER\"\n else if ((a-b) < 0) then\n write(*,*)\"LESS\"\n else\n write(*,*)\"EQUAL\"\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1571786261, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03738.html", "problem_id": "p03738", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03738/input.txt", "sample_output_relpath": "derived/input_output/data/p03738/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03738/Fortran/s576953635.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s576953635", "user_id": "u287431190"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "program main\n implicit none\n \n integer(16)::a,b\n \n read(*,*)a\n read(*,*)b\n if ((a-b) > 0) then\n write(*,*)\"GREATER\"\n else if ((a-b) < 0) then\n write(*,*)\"LESS\"\n else\n write(*,*)\"EQUAL\"\n end if\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "sample_input": "36\n24\n"}, "reference_outputs": ["GREATER\n"], "source_document_id": "p03738", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s633916835", "group_id": "codeNet:p03743", "input_text": "program alice_in_linear_land\n implicit none\n integer :: n, d, x(500000) = 0, q, p(500000) = 0, i\n integer :: a(500001) = 0, b(500001) = 0\n logical :: ok(500000) = .false.\n read(*,*) n, d\n read(*,*) x(1:n)\n read(*,*) q\n read(*,*) p(1:q)\n a(1) = d\n do i = 1, n\n a(i+1) = min(a(i),abs(a(i)-x(i)))\n end do\n b(n+1) = 1\n do i = n, 1, -1\n b(i) = b(i+1)\n if (b(i+1) > x(i)/2) b(i) = b(i+1)+x(i)\n ok(i) = a(i) >= b(i+1)\n end do\n do i = 1, q\n if (ok(p(i))) then\n write(*,'(a)') \"YES\"\n else\n write(*,'(a)') \"NO\"\n end if\n end do\nend program alice_in_linear_land", "language": "Fortran", "metadata": {"date": 1569124842, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03743.html", "problem_id": "p03743", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03743/input.txt", "sample_output_relpath": "derived/input_output/data/p03743/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03743/Fortran/s633916835.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633916835", "user_id": "u506403362"}, "prompt_components": {"gold_output": "NO\nYES\n", "input_to_evaluate": "program alice_in_linear_land\n implicit none\n integer :: n, d, x(500000) = 0, q, p(500000) = 0, i\n integer :: a(500001) = 0, b(500001) = 0\n logical :: ok(500000) = .false.\n read(*,*) n, d\n read(*,*) x(1:n)\n read(*,*) q\n read(*,*) p(1:q)\n a(1) = d\n do i = 1, n\n a(i+1) = min(a(i),abs(a(i)-x(i)))\n end do\n b(n+1) = 1\n do i = n, 1, -1\n b(i) = b(i+1)\n if (b(i+1) > x(i)/2) b(i) = b(i+1)+x(i)\n ok(i) = a(i) >= b(i+1)\n end do\n do i = 1, q\n if (ok(p(i))) then\n write(*,'(a)') \"YES\"\n else\n write(*,'(a)') \"NO\"\n end if\n end do\nend program alice_in_linear_land", "problem_context": "Score : 900 points\n\nProblem Statement\n\nAlice lives on a line. Today, she will travel to some place in a mysterious vehicle.\nInitially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a distance of x if this move would shorten the distance between the vehicle and the destination, and it will stay at its position otherwise. Note that the vehicle may go past the destination when the distance between the vehicle and the destination is less than x.\n\nAlice made a list of N numbers. The i-th number in this list is d_i. She will insert these numbers to the vehicle one by one.\n\nHowever, a mischievous witch appeared. She is thinking of rewriting one number in the list so that Alice will not reach the destination after N moves.\n\nShe has Q plans to do this, as follows:\n\nRewrite only the q_i-th number in the list with some integer so that Alice will not reach the destination.\n\nWrite a program to determine whether each plan is feasible.\n\nConstraints\n\n1≤ N ≤ 5*10^5\n\n1≤ Q ≤ 5*10^5\n\n1≤ D ≤ 10^9\n\n1≤ d_i ≤ 10^9(1≤i≤N)\n\n1≤ q_i ≤ N(1≤i≤Q)\n\nD and each d_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nd_1 d_2 ... d_N\nQ\nq_1 q_2 ... q_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain YES if the i-th plan is feasible, and NO otherwise.\n\nSample Input 1\n\n4 10\n3 4 3 3\n2\n4 3\n\nSample Output 1\n\nNO\nYES\n\nFor the first plan, Alice will already arrive at the destination by the first three moves, and therefore the answer is NO.\nFor the second plan, rewriting the third number in the list with 5 will prevent Alice from reaching the destination as shown in the following figure, and thus the answer is YES.\n\nSample Input 2\n\n5 9\n4 4 2 3 2\n5\n1 4 2 3 5\n\nSample Output 2\n\nYES\nYES\nYES\nYES\nYES\n\nAlice will not reach the destination as it is, and therefore all the plans are feasible.\n\nSample Input 3\n\n6 15\n4 3 5 4 2 1\n6\n1 2 3 4 5 6\n\nSample Output 3\n\nNO\nNO\nYES\nNO\nNO\nYES", "sample_input": "4 10\n3 4 3 3\n2\n4 3\n"}, "reference_outputs": ["NO\nYES\n"], "source_document_id": "p03743", "source_text": "Score : 900 points\n\nProblem Statement\n\nAlice lives on a line. Today, she will travel to some place in a mysterious vehicle.\nInitially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a distance of x if this move would shorten the distance between the vehicle and the destination, and it will stay at its position otherwise. Note that the vehicle may go past the destination when the distance between the vehicle and the destination is less than x.\n\nAlice made a list of N numbers. The i-th number in this list is d_i. She will insert these numbers to the vehicle one by one.\n\nHowever, a mischievous witch appeared. She is thinking of rewriting one number in the list so that Alice will not reach the destination after N moves.\n\nShe has Q plans to do this, as follows:\n\nRewrite only the q_i-th number in the list with some integer so that Alice will not reach the destination.\n\nWrite a program to determine whether each plan is feasible.\n\nConstraints\n\n1≤ N ≤ 5*10^5\n\n1≤ Q ≤ 5*10^5\n\n1≤ D ≤ 10^9\n\n1≤ d_i ≤ 10^9(1≤i≤N)\n\n1≤ q_i ≤ N(1≤i≤Q)\n\nD and each d_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nd_1 d_2 ... d_N\nQ\nq_1 q_2 ... q_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain YES if the i-th plan is feasible, and NO otherwise.\n\nSample Input 1\n\n4 10\n3 4 3 3\n2\n4 3\n\nSample Output 1\n\nNO\nYES\n\nFor the first plan, Alice will already arrive at the destination by the first three moves, and therefore the answer is NO.\nFor the second plan, rewriting the third number in the list with 5 will prevent Alice from reaching the destination as shown in the following figure, and thus the answer is YES.\n\nSample Input 2\n\n5 9\n4 4 2 3 2\n5\n1 4 2 3 5\n\nSample Output 2\n\nYES\nYES\nYES\nYES\nYES\n\nAlice will not reach the destination as it is, and therefore all the plans are feasible.\n\nSample Input 3\n\n6 15\n4 3 5 4 2 1\n6\n1 2 3 4 5 6\n\nSample Output 3\n\nNO\nNO\nYES\nNO\nNO\nYES", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 596, "cpu_time_ms": 369, "memory_kb": 12288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s921542490", "group_id": "codeNet:p03759", "input_text": "program beautiful\n implicit none\n\n integer :: a, b, c\n\n read(*,*) a, b, c\n\n if ( b-a == c-b) then\n write(*,*) 'YES'\n else if ( b-a /= c-b) then\n write(*,*) 'NO'\n end if\n\nend program beautiful", "language": "Fortran", "metadata": {"date": 1590372588, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03759.html", "problem_id": "p03759", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03759/input.txt", "sample_output_relpath": "derived/input_output/data/p03759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03759/Fortran/s921542490.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s921542490", "user_id": "u642280675"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program beautiful\n implicit none\n\n integer :: a, b, c\n\n read(*,*) a, b, c\n\n if ( b-a == c-b) then\n write(*,*) 'YES'\n else if ( b-a /= c-b) then\n write(*,*) 'NO'\n end if\n\nend program beautiful", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "sample_input": "2 4 6\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03759", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 205, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s746493439", "group_id": "codeNet:p03769", "input_text": "program tautonym_puzzle\n implicit none\n integer(8) :: n\n integer :: k = 0, l = 1, i\n integer, allocatable :: p(:)\n read(*,*) n\n do while (rshift(n,k) > 0_8)\n k = k+1\n end do\n k = k-2\n p = [integer::]\n do i = k, 0, -1\n p = [p,l]\n l = l+1\n if (btest(n,i)) then\n p = [l,p]\n l = l+1\n end if\n end do\n write(*,'(i0)') 2*(l-1)\n write(*,'(i0)',advance='no') 1\n do i = 2, l-1\n write(*,'(x,i0)',advance='no') i\n end do\n do i = 1, l-1\n write(*,'(x,i0)',advance='no') p(i)\n end do\n write(*,*)\nend program tautonym_puzzle", "language": "Fortran", "metadata": {"date": 1568468991, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03769.html", "problem_id": "p03769", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03769/input.txt", "sample_output_relpath": "derived/input_output/data/p03769/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03769/Fortran/s746493439.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s746493439", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n1 1 1 1\n", "input_to_evaluate": "program tautonym_puzzle\n implicit none\n integer(8) :: n\n integer :: k = 0, l = 1, i\n integer, allocatable :: p(:)\n read(*,*) n\n do while (rshift(n,k) > 0_8)\n k = k+1\n end do\n k = k-2\n p = [integer::]\n do i = k, 0, -1\n p = [p,l]\n l = l+1\n if (btest(n,i)) then\n p = [l,p]\n l = l+1\n end if\n end do\n write(*,'(i0)') 2*(l-1)\n write(*,'(i0)',advance='no') 1\n do i = 2, l-1\n write(*,'(x,i0)',advance='no') i\n end do\n do i = 1, l-1\n write(*,'(x,i0)',advance='no') p(i)\n end do\n write(*,*)\nend program tautonym_puzzle", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nWe will call a string x good if it satisfies the following condition:\n\nCondition: x can be represented as a concatenation of two copies of another string y of length at least 1.\n\nFor example, aa and bubobubo are good; an empty string, a, abcabcabc and abba are not good.\n\nEagle and Owl created a puzzle on good strings.\nFind one string s that satisfies the following conditions. It can be proved that such a string always exists under the constraints in this problem.\n\n1 ≤ |s| ≤ 200\n\nEach character of s is one of the 100 characters represented by the integers 1 through 100.\n\nAmong the 2^{|s|} subsequences of s, exactly N are good strings.\n\nConstraints\n\n1 ≤ N ≤ 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print |s|, the length of s.\nIn the second line, print the elements in s in order, with spaces in between. Any string that satisfies the above conditions will be accepted.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n1 1 1 1\n\nThere are two good strings that appear as subsequences of s: (1,1) and (1,1,1,1). There are six occurrences of (1,1) and one occurrence of (1,1,1,1), for a total of seven.\n\nSample Input 2\n\n299\n\nSample Output 2\n\n23\n32 11 11 73 45 8 11 83 83 8 45 32 32 10 100 73 32 83 45 73 32 11 10", "sample_input": "7\n"}, "reference_outputs": ["4\n1 1 1 1\n"], "source_document_id": "p03769", "source_text": "Score : 1000 points\n\nProblem Statement\n\nWe will call a string x good if it satisfies the following condition:\n\nCondition: x can be represented as a concatenation of two copies of another string y of length at least 1.\n\nFor example, aa and bubobubo are good; an empty string, a, abcabcabc and abba are not good.\n\nEagle and Owl created a puzzle on good strings.\nFind one string s that satisfies the following conditions. It can be proved that such a string always exists under the constraints in this problem.\n\n1 ≤ |s| ≤ 200\n\nEach character of s is one of the 100 characters represented by the integers 1 through 100.\n\nAmong the 2^{|s|} subsequences of s, exactly N are good strings.\n\nConstraints\n\n1 ≤ N ≤ 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print |s|, the length of s.\nIn the second line, print the elements in s in order, with spaces in between. Any string that satisfies the above conditions will be accepted.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n1 1 1 1\n\nThere are two good strings that appear as subsequences of s: (1,1) and (1,1,1,1). There are six occurrences of (1,1) and one occurrence of (1,1,1,1), for a total of seven.\n\nSample Input 2\n\n299\n\nSample Output 2\n\n23\n32 11 11 73 45 8 11 83 83 8 45 32 32 10 100 73 32 83 45 73 32 11 10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 557, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s820491592", "group_id": "codeNet:p03773", "input_text": "program ABC057A\n\tinteger(8)::A,B\n read(5,*)A,B\n print'(i0)',mod(A+B,24)\nend program ABC057A", "language": "Fortran", "metadata": {"date": 1577238484, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03773.html", "problem_id": "p03773", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03773/input.txt", "sample_output_relpath": "derived/input_output/data/p03773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03773/Fortran/s820491592.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820491592", "user_id": "u414699019"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "program ABC057A\n\tinteger(8)::A,B\n read(5,*)A,B\n print'(i0)',mod(A+B,24)\nend program ABC057A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 97, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s727686529", "group_id": "codeNet:p03773", "input_text": "program main\nInteger :: a,b,c\nread(*,*) a,b\nprint '(I2)', mod(a+b,24)\nend program", "language": "Fortran", "metadata": {"date": 1490764021, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03773.html", "problem_id": "p03773", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03773/input.txt", "sample_output_relpath": "derived/input_output/data/p03773/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03773/Fortran/s727686529.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s727686529", "user_id": "u231540466"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "program main\nInteger :: a,b,c\nread(*,*) a,b\nprint '(I2)', mod(a+b,24)\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s219577776", "group_id": "codeNet:p03775", "input_text": "integer,parameter :: p = 8\ninteger(p) :: n,i\n\nread*,n\n\ndo i = ceiling(sqrt(real(n))),1,-1\n if( mod(n,i)==0 ) exit\nend do\n\nprint*,max(digit(i),digit(n/i))\n\ncontains\nfunction digit( n ) result( i )\n integer(p) :: i,n\n i = 0\n do while( n/=0 )\n n = n / 10\n i = i + 1\n end do\nend function\n \n\nend\n", "language": "Fortran", "metadata": {"date": 1601233926, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Fortran/s219577776.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219577776", "user_id": "u171356453"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "integer,parameter :: p = 8\ninteger(p) :: n,i\n\nread*,n\n\ndo i = ceiling(sqrt(real(n))),1,-1\n if( mod(n,i)==0 ) exit\nend do\n\nprint*,max(digit(i),digit(n/i))\n\ncontains\nfunction digit( n ) result( i )\n integer(p) :: i,n\n i = 0\n do while( n/=0 )\n n = n / 10\n i = i + 1\n end do\nend function\n \n\nend\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 305, "cpu_time_ms": 3, "memory_kb": 2844}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s337195193", "group_id": "codeNet:p03775", "input_text": "program digits_in_multiplication\n implicit none\n integer(8) :: n, m, h, l, i\n read(*,*) n\n m = int(ceiling(sqrt(real(n,8))),8)\n h = n/2_8\n l = 0_8\n do i = m, 1_8, -1_8\n if (mod(n,i).eq.0_8) then\n l = n/i\n exit\n end if\n end do\n if (l.eq.0_8) then\n write(*,'(i0)') int(log10(real(n,8))) + 1\n else\n write(*,'(i0)') int(log10(real(l,8))) + 1\n end if\nend program digits_in_multiplication", "language": "Fortran", "metadata": {"date": 1552543938, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Fortran/s337195193.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s337195193", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program digits_in_multiplication\n implicit none\n integer(8) :: n, m, h, l, i\n read(*,*) n\n m = int(ceiling(sqrt(real(n,8))),8)\n h = n/2_8\n l = 0_8\n do i = m, 1_8, -1_8\n if (mod(n,i).eq.0_8) then\n l = n/i\n exit\n end if\n end do\n if (l.eq.0_8) then\n write(*,'(i0)') int(log10(real(n,8))) + 1\n else\n write(*,'(i0)') int(log10(real(l,8))) + 1\n end if\nend program digits_in_multiplication", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 415, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s255777819", "group_id": "codeNet:p03776", "input_text": "program main\n implicit none\n integer:: n,a,b, i,j,k, c1,c2\n double precision, allocatable:: v(:)\n double precision:: ave, mnum\n character(1000):: cmnum\n\n read*, n, a, b\n allocate(v(n))\n read*, v(1:n)\n ! print*, \"#1\"\n call sort(v(1:n))\n ! print*, \"#2\"\n\n ave = dble(sum(v(n-a+1:n)))/dble(a)\n ! print*, \"#3\"\n \n c1 = count(v(1:n) == v(n-a+1))\n\n if (v(n) /= v(n-a)) then\n ! print*, \"#4.1\"\n c2 = count(v(n-a+1:n) == v(n-a+1))\n mnum = comb(c1,c2)\n else\n ! print*, \"#4.2\"\n c2 = min(c1,b)\n mnum = 0.d0\n do i = a, c2\n mnum = mnum + comb(c1,i)\n end do\n end if\n \n ! print*, c1,c2\n print'(f0.7)', ave\n write(cmnum,'(f0.0)') mnum\n ! print*, mnum\n print'(A)', cmnum(1:len_trim(cmnum)-1)\n\n \n\ncontains\nfunction comb(n,m) result(ret)\n implicit none\n integer, intent(in):: n,m\n integer::i, end\n double precision, allocatable:: dp(:), ndp(:)\n double precision:: ret\n end = n + 1\n allocate(dp(0:end), ndp(0:end))\n dp(:) = 0.d0; ndp(:) = 0.d0\n dp(1) = 1.d0; ndp(1) = 1.d0\n do i = 1, n\n ndp(1:end) = ndp(1:end) + dp(0:end-1) \n dp(1:end) = ndp(1:end)\n end do\n ret = dp(m+1)\nend function\n\n\nsubroutine sort(arr)\n implicit none\n integer:: i,j\n double precision,intent(inout):: arr(:)\n\n do i = 1,size(arr)\n do j = i, size(arr)\n if (arr(j) >= arr(i)) cycle\n call swap(arr(i), arr(j))\n end do\n end do\nend subroutine\n\nsubroutine swap(a,b)\n implicit none\n double precision, intent(inout):: a,b\n double precision:: c\n c=a; a=b; b=c\nend subroutine\n\nend program", "language": "Fortran", "metadata": {"date": 1568262585, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03776.html", "problem_id": "p03776", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03776/input.txt", "sample_output_relpath": "derived/input_output/data/p03776/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03776/Fortran/s255777819.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s255777819", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4.500000\n1\n", "input_to_evaluate": "program main\n implicit none\n integer:: n,a,b, i,j,k, c1,c2\n double precision, allocatable:: v(:)\n double precision:: ave, mnum\n character(1000):: cmnum\n\n read*, n, a, b\n allocate(v(n))\n read*, v(1:n)\n ! print*, \"#1\"\n call sort(v(1:n))\n ! print*, \"#2\"\n\n ave = dble(sum(v(n-a+1:n)))/dble(a)\n ! print*, \"#3\"\n \n c1 = count(v(1:n) == v(n-a+1))\n\n if (v(n) /= v(n-a)) then\n ! print*, \"#4.1\"\n c2 = count(v(n-a+1:n) == v(n-a+1))\n mnum = comb(c1,c2)\n else\n ! print*, \"#4.2\"\n c2 = min(c1,b)\n mnum = 0.d0\n do i = a, c2\n mnum = mnum + comb(c1,i)\n end do\n end if\n \n ! print*, c1,c2\n print'(f0.7)', ave\n write(cmnum,'(f0.0)') mnum\n ! print*, mnum\n print'(A)', cmnum(1:len_trim(cmnum)-1)\n\n \n\ncontains\nfunction comb(n,m) result(ret)\n implicit none\n integer, intent(in):: n,m\n integer::i, end\n double precision, allocatable:: dp(:), ndp(:)\n double precision:: ret\n end = n + 1\n allocate(dp(0:end), ndp(0:end))\n dp(:) = 0.d0; ndp(:) = 0.d0\n dp(1) = 1.d0; ndp(1) = 1.d0\n do i = 1, n\n ndp(1:end) = ndp(1:end) + dp(0:end-1) \n dp(1:end) = ndp(1:end)\n end do\n ret = dp(m+1)\nend function\n\n\nsubroutine sort(arr)\n implicit none\n integer:: i,j\n double precision,intent(inout):: arr(:)\n\n do i = 1,size(arr)\n do j = i, size(arr)\n if (arr(j) >= arr(i)) cycle\n call swap(arr(i), arr(j))\n end do\n end do\nend subroutine\n\nsubroutine swap(a,b)\n implicit none\n double precision, intent(inout):: a,b\n double precision:: c\n c=a; a=b; b=c\nend subroutine\n\nend program", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "sample_input": "5 2 2\n1 2 3 4 5\n"}, "reference_outputs": ["4.500000\n1\n"], "source_document_id": "p03776", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1681, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s624749842", "group_id": "codeNet:p03777", "input_text": "program main\nimplicit none\ncharacter(1) :: a,b\nlogical :: t\n read(*,*) a,b\n t = a=='H'\n if(t)then\n t = b=='H'\n else\n t = .not.b=='H'\n endif\n if(t)then\n print*,'H'\n else\n print*,'D'\n endif\nend program main\n", "language": "Fortran", "metadata": {"date": 1571257905, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03777.html", "problem_id": "p03777", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03777/input.txt", "sample_output_relpath": "derived/input_output/data/p03777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03777/Fortran/s624749842.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624749842", "user_id": "u075763649"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "program main\nimplicit none\ncharacter(1) :: a,b\nlogical :: t\n read(*,*) a,b\n t = a=='H'\n if(t)then\n t = b=='H'\n else\n t = .not.b=='H'\n endif\n if(t)then\n print*,'H'\n else\n print*,'D'\n endif\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "sample_input": "H H\n"}, "reference_outputs": ["H\n"], "source_document_id": "p03777", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s721568081", "group_id": "codeNet:p03778", "input_text": "program ABC056B\n implicit none\n integer(8)::a,b,W,c,d\n read(5,*)W,a,b\n c=min(a,b)\n d=max(a,b)\n\n print'(i0)',max(d-c-W,0)\nend program ABC056B", "language": "Fortran", "metadata": {"date": 1580712960, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03778.html", "problem_id": "p03778", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03778/input.txt", "sample_output_relpath": "derived/input_output/data/p03778/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03778/Fortran/s721568081.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s721568081", "user_id": "u414699019"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ABC056B\n implicit none\n integer(8)::a,b,W,c,d\n read(5,*)W,a,b\n c=min(a,b)\n d=max(a,b)\n\n print'(i0)',max(d-c-W,0)\nend program ABC056B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "sample_input": "3 2 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03778", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 158, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s990219918", "group_id": "codeNet:p03779", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: x,i\n\n read*, x\n\n do i=1,100000\n if (((i-1)*i)/2 + 1 <= x .and. x <= (i*(i+1))/2) then\n print'(i0)', i\n stop\n end if\n end do\nend program name", "language": "Fortran", "metadata": {"date": 1587080217, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03779.html", "problem_id": "p03779", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03779/input.txt", "sample_output_relpath": "derived/input_output/data/p03779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03779/Fortran/s990219918.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990219918", "user_id": "u234636620"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: x,i\n\n read*, x\n\n do i=1,100000\n if (((i-1)*i)/2 + 1 <= x .and. x <= (i*(i+1))/2) then\n print'(i0)', i\n stop\n end if\n end do\nend program name", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a kangaroo at coordinate 0 on an infinite number line that runs from left to right, at time 0.\nDuring the period between time i-1 and time i, the kangaroo can either stay at his position, or perform a jump of length exactly i to the left or to the right.\nThat is, if his coordinate at time i-1 is x, he can be at coordinate x-i, x or x+i at time i.\nThe kangaroo's nest is at coordinate X, and he wants to travel to coordinate X as fast as possible.\nFind the earliest possible time to reach coordinate X.\n\nConstraints\n\nX is an integer.\n\n1≤X≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the earliest possible time for the kangaroo to reach coordinate X.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThe kangaroo can reach his nest at time 3 by jumping to the right three times, which is the earliest possible time.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nHe can reach his nest at time 2 by staying at his position during the first second, and jumping to the right at the next second.\n\nSample Input 3\n\n11\n\nSample Output 3\n\n5", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03779", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a kangaroo at coordinate 0 on an infinite number line that runs from left to right, at time 0.\nDuring the period between time i-1 and time i, the kangaroo can either stay at his position, or perform a jump of length exactly i to the left or to the right.\nThat is, if his coordinate at time i-1 is x, he can be at coordinate x-i, x or x+i at time i.\nThe kangaroo's nest is at coordinate X, and he wants to travel to coordinate X as fast as possible.\nFind the earliest possible time to reach coordinate X.\n\nConstraints\n\nX is an integer.\n\n1≤X≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the earliest possible time for the kangaroo to reach coordinate X.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThe kangaroo can reach his nest at time 3 by jumping to the right three times, which is the earliest possible time.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nHe can reach his nest at time 2 by staying at his position during the first second, and jumping to the right at the next second.\n\nSample Input 3\n\n11\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s387270409", "group_id": "codeNet:p03779", "input_text": "program ABC_056_C_GoHome\n implicit none\n integer(8) X, i ,S\n read(*, *) X\n do i = 1, 100000\n S = i * (i + 1) / 2\n\t if(S >= X) then\n\t write(*, *) i\n\t\t exit\n\t end if\n end do\nend program ABC_056_C_GoHome", "language": "Fortran", "metadata": {"date": 1523079612, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03779.html", "problem_id": "p03779", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03779/input.txt", "sample_output_relpath": "derived/input_output/data/p03779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03779/Fortran/s387270409.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s387270409", "user_id": "u728000113"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ABC_056_C_GoHome\n implicit none\n integer(8) X, i ,S\n read(*, *) X\n do i = 1, 100000\n S = i * (i + 1) / 2\n\t if(S >= X) then\n\t write(*, *) i\n\t\t exit\n\t end if\n end do\nend program ABC_056_C_GoHome", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a kangaroo at coordinate 0 on an infinite number line that runs from left to right, at time 0.\nDuring the period between time i-1 and time i, the kangaroo can either stay at his position, or perform a jump of length exactly i to the left or to the right.\nThat is, if his coordinate at time i-1 is x, he can be at coordinate x-i, x or x+i at time i.\nThe kangaroo's nest is at coordinate X, and he wants to travel to coordinate X as fast as possible.\nFind the earliest possible time to reach coordinate X.\n\nConstraints\n\nX is an integer.\n\n1≤X≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the earliest possible time for the kangaroo to reach coordinate X.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThe kangaroo can reach his nest at time 3 by jumping to the right three times, which is the earliest possible time.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nHe can reach his nest at time 2 by staying at his position during the first second, and jumping to the right at the next second.\n\nSample Input 3\n\n11\n\nSample Output 3\n\n5", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03779", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a kangaroo at coordinate 0 on an infinite number line that runs from left to right, at time 0.\nDuring the period between time i-1 and time i, the kangaroo can either stay at his position, or perform a jump of length exactly i to the left or to the right.\nThat is, if his coordinate at time i-1 is x, he can be at coordinate x-i, x or x+i at time i.\nThe kangaroo's nest is at coordinate X, and he wants to travel to coordinate X as fast as possible.\nFind the earliest possible time to reach coordinate X.\n\nConstraints\n\nX is an integer.\n\n1≤X≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the earliest possible time for the kangaroo to reach coordinate X.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\nThe kangaroo can reach his nest at time 3 by jumping to the right three times, which is the earliest possible time.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nHe can reach his nest at time 2 by staying at his position during the first second, and jumping to the right at the next second.\n\nSample Input 3\n\n11\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s936736136", "group_id": "codeNet:p03786", "input_text": "module merge_sort_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n private\n public:: merge_sort, double_merge_sort\n interface merge_sort\n module procedure ms32, ms64\n end interface\n\n interface double_merge_sort\n module procedure msd3232, msd6464\n end interface\ncontains\n recursive subroutine ms32(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap32(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms32(ar, fst, mdl)\n call ms32(ar, mdl+1, lst)\n call merge32(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge32(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap32(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n\n recursive subroutine ms64(ar, fst, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap64(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms64(ar, fst, mdl)\n call ms64(ar, mdl+1, lst)\n call merge64(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge64(ar, fst, mdl, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst, mdl, lst\n integer(int64),allocatable:: tmp(:)\n integer(int64):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap64(x,y)\n integer(int64),intent(inout):: x,y\n integer(int64):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n recursive subroutine msd3232(ar1, ar2, fst, lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap32(ar1(fst), ar1(lst))\n call swap32(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd3232(ar1,ar2,fst,mdl)\n call msd3232(ar1,ar2,mdl+1,lst)\n call merged3232(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged3232(ar1,ar2,fst,mdl,lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,mdl,lst\n integer(int32),allocatable:: t1(:),t2(:)\n integer(int32):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n\n recursive subroutine msd6464(ar1, ar2, fst, lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap64(ar1(fst), ar1(lst))\n call swap64(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd6464(ar1,ar2,fst,mdl)\n call msd6464(ar1,ar2,mdl+1,lst)\n call merged6464(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged6464(ar1,ar2,fst,mdl,lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,mdl,lst\n integer(int64),allocatable:: t1(:),t2(:)\n integer(int64):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\nend module\n\n\nprogram agc011\n use,intrinsic :: iso_fortran_env\n use merge_sort_mod\n implicit none\n integer(int32):: n,i\n integer(int64),allocatable:: a(:), cnt(:)\n\n read*, n\n allocate(a(n))\n allocate(cnt(n), source=1_8)\n read*, a(:)\n\n call merge_sort(a,1_8,int(n,kind=int64))\n\n do i=1,n-1\n if (a(i)*2 >= a(i+1)) cnt(i+1) = cnt(i)+cnt(i+1)\n a(i+1)=a(i+1)+a(i)\n end do\n print'(i0)', cnt(n)\nend program agc011", "language": "Fortran", "metadata": {"date": 1591058531, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03786.html", "problem_id": "p03786", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03786/input.txt", "sample_output_relpath": "derived/input_output/data/p03786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03786/Fortran/s936736136.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s936736136", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module merge_sort_mod\n use,intrinsic :: iso_fortran_env\n implicit none\n private\n public:: merge_sort, double_merge_sort\n interface merge_sort\n module procedure ms32, ms64\n end interface\n\n interface double_merge_sort\n module procedure msd3232, msd6464\n end interface\ncontains\n recursive subroutine ms32(ar, fst, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap32(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms32(ar, fst, mdl)\n call ms32(ar, mdl+1, lst)\n call merge32(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge32(ar, fst, mdl, lst)\n integer(int32),intent(inout):: ar(:)\n integer(int32),intent(in):: fst, mdl, lst\n integer(int32),allocatable:: tmp(:)\n integer(int32):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap32(x,y)\n integer(int32),intent(inout):: x,y\n integer(int32):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n\n recursive subroutine ms64(ar, fst, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst-fst < 2) then\n if (ar(fst) > ar(lst)) call swap64(ar(fst),ar(lst))\n return\n end if\n\n mdl = (fst+lst)/2\n call ms64(ar, fst, mdl)\n call ms64(ar, mdl+1, lst)\n call merge64(ar, fst, mdl, lst)\n end subroutine\n\n\n subroutine merge64(ar, fst, mdl, lst)\n integer(int64),intent(inout):: ar(:)\n integer(int64),intent(in):: fst, mdl, lst\n integer(int64),allocatable:: tmp(:)\n integer(int64):: li, ri, ti\n\n allocate(tmp(lst-fst+1))\n\n li=fst\n ri=mdl+1 \n ti=1\n\n do while (li <= mdl .and. ri <= lst)\n if (ar(li) <= ar(ri)) then\n tmp(ti) = ar(li)\n li=li+1\n else\n tmp(ti) = ar(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n tmp(ti:) = ar(li:mdl)\n else\n tmp(ti:) = ar(ri:lst)\n end if\n\n ar(fst:lst) = tmp(:)\n deallocate(tmp)\n end subroutine\n\n\n subroutine swap64(x,y)\n integer(int64),intent(inout):: x,y\n integer(int64):: tmp\n tmp = x\n x = y\n y = tmp\n end subroutine\n\n recursive subroutine msd3232(ar1, ar2, fst, lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,lst\n integer(int32):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap32(ar1(fst), ar1(lst))\n call swap32(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd3232(ar1,ar2,fst,mdl)\n call msd3232(ar1,ar2,mdl+1,lst)\n call merged3232(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged3232(ar1,ar2,fst,mdl,lst)\n integer(int32),intent(inout):: ar1(:),ar2(:)\n integer(int32),intent(in):: fst,mdl,lst\n integer(int32),allocatable:: t1(:),t2(:)\n integer(int32):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\n\n\n recursive subroutine msd6464(ar1, ar2, fst, lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,lst\n integer(int64):: mdl\n\n if (lst - fst < 2) then\n if (ar1(fst) > ar1(lst)) then\n call swap64(ar1(fst), ar1(lst))\n call swap64(ar2(fst), ar2(lst))\n end if\n return\n end if\n\n mdl = (fst+lst)/2\n\n call msd6464(ar1,ar2,fst,mdl)\n call msd6464(ar1,ar2,mdl+1,lst)\n call merged6464(ar1,ar2,fst,mdl,lst)\n end subroutine\n\n\n subroutine merged6464(ar1,ar2,fst,mdl,lst)\n integer(int64),intent(inout):: ar1(:),ar2(:)\n integer(int64),intent(in):: fst,mdl,lst\n integer(int64),allocatable:: t1(:),t2(:)\n integer(int64):: li,ri,ti\n\n allocate(t1(lst-fst+1), t2(lst-fst+1))\n\n li=fst\n ri=mdl+1\n ti=1\n\n do while(li <= mdl .and. ri <= lst)\n if (ar1(li) <= ar1(ri)) then\n t1(ti) = ar1(li) \n t2(ti) = ar2(li)\n li=li+1\n else\n t1(ti) = ar1(ri)\n t2(ti) = ar2(ri)\n ri=ri+1\n end if\n ti=ti+1\n end do\n\n if (li <= mdl) then\n t1(ti:) = ar1(li:mdl)\n t2(ti:) = ar2(li:mdl)\n else\n t1(ti:) = ar1(ri:lst)\n t2(ti:) = ar2(ri:lst)\n end if\n\n ar1(fst:lst) = t1(:)\n ar2(fst:lst) = t2(:)\n\n deallocate(t1,t2)\n end subroutine\nend module\n\n\nprogram agc011\n use,intrinsic :: iso_fortran_env\n use merge_sort_mod\n implicit none\n integer(int32):: n,i\n integer(int64),allocatable:: a(:), cnt(:)\n\n read*, n\n allocate(a(n))\n allocate(cnt(n), source=1_8)\n read*, a(:)\n\n call merge_sort(a,1_8,int(n,kind=int64))\n\n do i=1,n-1\n if (a(i)*2 >= a(i+1)) cnt(i+1) = cnt(i)+cnt(i+1)\n a(i+1)=a(i+1)+a(i)\n end do\n print'(i0)', cnt(n)\nend program agc011", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "sample_input": "3\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03786", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6606, "cpu_time_ms": 48, "memory_kb": 3508}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s978939747", "group_id": "codeNet:p03796", "input_text": "implicit none\ninteger :: n,i,k\nread(*,*) n\nk=1\ndo i=1,n\nk=mod(k*i,10**9+7)\nend do\nwrite(*,'(i0)') k\nend", "language": "Fortran", "metadata": {"date": 1599471857, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03796.html", "problem_id": "p03796", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03796/input.txt", "sample_output_relpath": "derived/input_output/data/p03796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03796/Fortran/s978939747.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s978939747", "user_id": "u943740059"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "implicit none\ninteger :: n,i,k\nread(*,*) n\nk=1\ndo i=1,n\nk=mod(k*i,10**9+7)\nend do\nwrite(*,'(i0)') k\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2928}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s620048494", "group_id": "codeNet:p03798", "input_text": "program main\nimplicit none\ninteger :: n\n read(*,*) n\n call wolv_or_sheep(n)\ncontains\n subroutine wolv_or_sheep(n)\n integer,intent(in) :: n\n character(n) :: s\n logical :: t(n),sw(n)\n integer :: i\n read(*,'(A)') s\n t(:) = [(s(i:i)=='x',i=1,n)]\n if(n<2)then\n if(t(1))then\n print*,'S'\n else\n print*,-1\n endif\n RETURN\n endif\n\n sw(1) = .TRUE.\n\n if(t(1))then\n sw(2) = sw(1)\n else\n sw(2) = .not.sw(1)\n endif\n\n do i=2,n-1\n if(t(i))then\n sw(i+1) = sw(i)\n else\n sw(i+1) = .not.sw(i)\n endif\n enddo\n\n if(sw(1).eqv.sw(N).and..not.t(N))then\n do i=1,n\n if(sw(i))then\n write(*,'(A)',advance='NO') 'S'\n else\n write(*,'(A)',advance='NO') 'W'\n endif\n enddo\n else\n print*,-1\n endif\n end subroutine wolv_or_sheep\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1571262299, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03798.html", "problem_id": "p03798", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03798/input.txt", "sample_output_relpath": "derived/input_output/data/p03798/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03798/Fortran/s620048494.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s620048494", "user_id": "u075763649"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: n\n read(*,*) n\n call wolv_or_sheep(n)\ncontains\n subroutine wolv_or_sheep(n)\n integer,intent(in) :: n\n character(n) :: s\n logical :: t(n),sw(n)\n integer :: i\n read(*,'(A)') s\n t(:) = [(s(i:i)=='x',i=1,n)]\n if(n<2)then\n if(t(1))then\n print*,'S'\n else\n print*,-1\n endif\n RETURN\n endif\n\n sw(1) = .TRUE.\n\n if(t(1))then\n sw(2) = sw(1)\n else\n sw(2) = .not.sw(1)\n endif\n\n do i=2,n-1\n if(t(i))then\n sw(i+1) = sw(i)\n else\n sw(i+1) = .not.sw(i)\n endif\n enddo\n\n if(sw(1).eqv.sw(N).and..not.t(N))then\n do i=1,n\n if(sw(i))then\n write(*,'(A)',advance='NO') 'S'\n else\n write(*,'(A)',advance='NO') 'W'\n endif\n enddo\n else\n print*,-1\n endif\n end subroutine wolv_or_sheep\n\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "sample_input": "6\nooxoox\n"}, "reference_outputs": ["SSSWWS\n"], "source_document_id": "p03798", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 911, "cpu_time_ms": 23, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s923181996", "group_id": "codeNet:p03799", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,m\n\n read*, n,m\n\n m=m+2*n\n print'(i0)', m/4\nend program name", "language": "Fortran", "metadata": {"date": 1587086648, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03799.html", "problem_id": "p03799", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03799/input.txt", "sample_output_relpath": "derived/input_output/data/p03799/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03799/Fortran/s923181996.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s923181996", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: n,m\n\n read*, n,m\n\n m=m+2*n\n print'(i0)', m/4\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03799", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 159, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s090884258", "group_id": "codeNet:p03803", "input_text": "read*,i,j\n\nif( i==j )then\n print*,'Draw'\n stop\nend if\n\nif( i>j .or.i==1 )then\n print*,'Alice'\nelseif( j>i .or. j==1 )then\n print*,'Bob'\nend if\nend", "language": "Fortran", "metadata": {"date": 1579420330, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03803.html", "problem_id": "p03803", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03803/input.txt", "sample_output_relpath": "derived/input_output/data/p03803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03803/Fortran/s090884258.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s090884258", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "read*,i,j\n\nif( i==j )then\n print*,'Draw'\n stop\nend if\n\nif( i>j .or.i==1 )then\n print*,'Alice'\nelseif( j>i .or. j==1 )then\n print*,'Bob'\nend if\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "sample_input": "8 6\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03803", "source_text": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 150, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s688643503", "group_id": "codeNet:p03804", "input_text": " program piyo\n integer,parameter :: p=8\n integer(p) :: n,m, i,j, offsetR,offsetC\n character(:),allocatable :: a,b\n integer(p),allocatable :: imA(:,:),imB(:,:),tempA(:,:)\n \n read*,n,m\n allocate( character(n)::a )\n allocate( character(m)::b )\n allocate( imA(N,N), imB(M,M), tempA(M,M) )\n do i = 1,n\n read*,a\n do j = 1,n\n if(a(j:j)=='.')then\n imA(i,j) = 1\n else\n imA(i,j) = 0\n end if\n end do\n end do\n do i = 1,m\n read*,b\n do j = 1,m\n if(b(j:j)=='.')then\n imB(i,j) = 1\n else\n imB(i,j) = 0\n end if\n end do\n end do\n \n do offsetR = 0,(N-M)\n do offsetC = 0,(N-M)\n tempA = imA(1+offsetR:M+offsetR,1+offsetC:M+offsetC)\n tempA = abs(tempA(:,:) - imB(:,:))\n if( sum(tempA(:,:))==0 )then\n print*,'Yes'\n stop\n end if\n end do\n end do\n \n print*,'No'\n \n stop\n \n do i = 1,n\n print'(*(i1,x))',ima(i,:)\n end do\n do i = 1,m\n print'(*(i1,x))',imb(i,:)\n end do\n \n \n \n end", "language": "Fortran", "metadata": {"date": 1597513362, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03804.html", "problem_id": "p03804", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03804/input.txt", "sample_output_relpath": "derived/input_output/data/p03804/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03804/Fortran/s688643503.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688643503", "user_id": "u171356453"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": " program piyo\n integer,parameter :: p=8\n integer(p) :: n,m, i,j, offsetR,offsetC\n character(:),allocatable :: a,b\n integer(p),allocatable :: imA(:,:),imB(:,:),tempA(:,:)\n \n read*,n,m\n allocate( character(n)::a )\n allocate( character(m)::b )\n allocate( imA(N,N), imB(M,M), tempA(M,M) )\n do i = 1,n\n read*,a\n do j = 1,n\n if(a(j:j)=='.')then\n imA(i,j) = 1\n else\n imA(i,j) = 0\n end if\n end do\n end do\n do i = 1,m\n read*,b\n do j = 1,m\n if(b(j:j)=='.')then\n imB(i,j) = 1\n else\n imB(i,j) = 0\n end if\n end do\n end do\n \n do offsetR = 0,(N-M)\n do offsetC = 0,(N-M)\n tempA = imA(1+offsetR:M+offsetR,1+offsetC:M+offsetC)\n tempA = abs(tempA(:,:) - imB(:,:))\n if( sum(tempA(:,:))==0 )then\n print*,'Yes'\n stop\n end if\n end do\n end do\n \n print*,'No'\n \n stop\n \n do i = 1,n\n print'(*(i1,x))',ima(i,:)\n end do\n do i = 1,m\n print'(*(i1,x))',imb(i,:)\n end do\n \n \n \n end", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "sample_input": "3 2\n#.#\n.#.\n#.#\n#.\n.#\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03804", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 10, "memory_kb": 2888}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s292221586", "group_id": "codeNet:p03807", "input_text": "integer N\ninteger,allocatable,dimension(:)::A\ninteger oddcnt,evencnt\nread*,N\nallocate(A(N))\nread*,A\n\noddcnt=0\ndo i=1,N\n if(and(A(i),1)==1)oddcnt=oddcnt+1\nend do\nevencnt=N-oddcnt\nprint\"(A)\",merge(\"YES\",\"NO \",mod(oddcnt,2)==0 .and. mod(evencnt+oddcnt/2,2)==0)\nend", "language": "Fortran", "metadata": {"date": 1559142487, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03807.html", "problem_id": "p03807", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03807/input.txt", "sample_output_relpath": "derived/input_output/data/p03807/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03807/Fortran/s292221586.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s292221586", "user_id": "u598073939"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "integer N\ninteger,allocatable,dimension(:)::A\ninteger oddcnt,evencnt\nread*,N\nallocate(A(N))\nread*,A\n\noddcnt=0\ndo i=1,N\n if(and(A(i),1)==1)oddcnt=oddcnt+1\nend do\nevencnt=N-oddcnt\nprint\"(A)\",merge(\"YES\",\"NO \",mod(oddcnt,2)==0 .and. mod(evencnt+oddcnt/2,2)==0)\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03807", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 33, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s358311324", "group_id": "codeNet:p03813", "input_text": "integer a\nread*, a\nif(a .lt. 1200) then\n\tprint*, 'ABC'\nelse \n\tprint*, 'ARC'\nend if\nend", "language": "Fortran", "metadata": {"date": 1571780109, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03813.html", "problem_id": "p03813", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03813/input.txt", "sample_output_relpath": "derived/input_output/data/p03813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03813/Fortran/s358311324.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s358311324", "user_id": "u244203620"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "integer a\nread*, a\nif(a .lt. 1200) then\n\tprint*, 'ABC'\nelse \n\tprint*, 'ARC'\nend if\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "sample_input": "1000\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03813", "source_text": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s105862766", "group_id": "codeNet:p03813", "input_text": "program main\n\timplicit none\n integer x\n\tread(*, *) x\n\tif(x < 1200) then\n\t\twrite(*, *) 'ABC'\n\telse\n\t\twrite(*, *) 'ARC'\n\tend if\nend program main", "language": "Fortran", "metadata": {"date": 1530047982, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03813.html", "problem_id": "p03813", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03813/input.txt", "sample_output_relpath": "derived/input_output/data/p03813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03813/Fortran/s105862766.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s105862766", "user_id": "u728000113"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program main\n\timplicit none\n integer x\n\tread(*, *) x\n\tif(x < 1200) then\n\t\twrite(*, *) 'ABC'\n\telse\n\t\twrite(*, *) 'ARC'\n\tend if\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "sample_input": "1000\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03813", "source_text": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s593415504", "group_id": "codeNet:p03817", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: x,mx\n\n read*, x\n mx = mod(x,11_8)\n print'(i0)', 2_8*(x/11_8)+and(mx,1_8)+and(mx/6_8,1_8)\nend program name", "language": "Fortran", "metadata": {"date": 1588718229, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03817.html", "problem_id": "p03817", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03817/input.txt", "sample_output_relpath": "derived/input_output/data/p03817/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03817/Fortran/s593415504.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s593415504", "user_id": "u234636620"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: x,mx\n\n read*, x\n mx = mod(x,11_8)\n print'(i0)', 2_8*(x/11_8)+and(mx,1_8)+and(mx/6_8,1_8)\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "sample_input": "7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03817", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 203, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s797981498", "group_id": "codeNet:p03819", "input_text": "module mod_binary_indexed_tree\n implicit none\n type fenwick_tree\n integer :: n\n integer, pointer :: arr(:)\n end type fenwick_tree\n private\n public :: fenwick_tree, init_bit, release_bit\n public :: add, summate, update, maximum\ncontains\n subroutine init_bit(bit,n)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: n\n bit%n = n\n allocate(bit%arr(n))\n bit%arr = 0\n return\n end subroutine init_bit\n subroutine release_bit(bit)\n implicit none\n type(fenwick_tree) :: bit\n if (associated(bit%arr)) deallocate(bit%arr)\n return\n end subroutine release_bit\n subroutine add(bit,i,v)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i, v\n integer :: x\n if (i.eq.0) return\n x = i\n do while (x.le.bit%n)\n bit%arr(x) = bit%arr(x)+v\n x = x+and(x,-x)\n end do\n return\n end subroutine add\n function summate(bit,i) result(s)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i\n integer :: x, s\n x = i\n s = 0\n do while (x.gt.0)\n s = s+bit%arr(x)\n x = x-and(x,-x)\n end do\n return\n end function summate\n subroutine update(bit,i,v)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i, v\n integer :: x\n x = i\n do while (x.le.bit%n)\n if (bit%arr(x).lt.v) bit%arr(x) = v\n x = x+and(x,-x)\n end do\n return\n end subroutine update\n function maximum(bit,i) result(m)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i\n integer :: x, m\n x = i\n m = 0\n do while (x.gt.0)\n m = max(m,bit%arr(x))\n x = x-and(x,-x)\n end do\n return\n end function maximum\nend module mod_binary_indexed_tree\nprogram snuke_line\n use mod_binary_indexed_tree\n implicit none\n type(fenwick_tree) :: bit\n integer :: n, m, a(300000,3), ans(100000), i, j, k, x\n a = 0\n ans = 0\n read(*,*) n, m\n do i = 1, n\n read(*,*) a(i,1), a(i,2)\n a(i,3) = a(i,2)-a(i,1)+1\n end do\n call quick_sort(a(1:n,1:3),3)\n call init_bit(bit,m+1)\n ans(1) = n\n j = 1\n do i = 2, m\n do while (j.le.n)\n if (a(j,3).gt.i) exit\n call add(bit,a(j,1),1)\n call add(bit,a(j,2)+1,-1)\n j = j+1\n end do\n x = n-j+1\n do k = i, m, i\n x = x+summate(bit,k)\n end do\n ans(i) = x\n end do\n do i = 1, m\n write(*,'(i0)') ans(i)\n end do\n stop\ncontains\n recursive subroutine quick_sort(a,i)\n implicit none\n integer, intent(inout) :: a(:,:)\n integer, intent(in) :: i\n integer :: p, c(size(a(1,:)))\n integer :: n, l, r, m\n n = size(a(:,1))\n l = 1\n r = n\n m = (l+r)/2\n p = a(l,i)+a(m,i)+a(r,i)-max(a(l,i),a(m,i),a(r,i))-min(a(l,i),a(m,i),a(r,i))\n do\n do while (a(l,i).lt.p)\n l = l+1\n end do\n do while (a(r,i).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l,:)\n a(l,:) = a(r,:)\n a(r,:) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1,:),i)\n if (n.gt.r+1) call quick_sort(a(r+1:n,:),i)\n return\n end subroutine quick_sort\nend program snuke_line", "language": "Fortran", "metadata": {"date": 1562302887, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03819.html", "problem_id": "p03819", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03819/input.txt", "sample_output_relpath": "derived/input_output/data/p03819/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03819/Fortran/s797981498.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797981498", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n2\n2\n", "input_to_evaluate": "module mod_binary_indexed_tree\n implicit none\n type fenwick_tree\n integer :: n\n integer, pointer :: arr(:)\n end type fenwick_tree\n private\n public :: fenwick_tree, init_bit, release_bit\n public :: add, summate, update, maximum\ncontains\n subroutine init_bit(bit,n)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: n\n bit%n = n\n allocate(bit%arr(n))\n bit%arr = 0\n return\n end subroutine init_bit\n subroutine release_bit(bit)\n implicit none\n type(fenwick_tree) :: bit\n if (associated(bit%arr)) deallocate(bit%arr)\n return\n end subroutine release_bit\n subroutine add(bit,i,v)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i, v\n integer :: x\n if (i.eq.0) return\n x = i\n do while (x.le.bit%n)\n bit%arr(x) = bit%arr(x)+v\n x = x+and(x,-x)\n end do\n return\n end subroutine add\n function summate(bit,i) result(s)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i\n integer :: x, s\n x = i\n s = 0\n do while (x.gt.0)\n s = s+bit%arr(x)\n x = x-and(x,-x)\n end do\n return\n end function summate\n subroutine update(bit,i,v)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i, v\n integer :: x\n x = i\n do while (x.le.bit%n)\n if (bit%arr(x).lt.v) bit%arr(x) = v\n x = x+and(x,-x)\n end do\n return\n end subroutine update\n function maximum(bit,i) result(m)\n implicit none\n type(fenwick_tree) :: bit\n integer, intent(in) :: i\n integer :: x, m\n x = i\n m = 0\n do while (x.gt.0)\n m = max(m,bit%arr(x))\n x = x-and(x,-x)\n end do\n return\n end function maximum\nend module mod_binary_indexed_tree\nprogram snuke_line\n use mod_binary_indexed_tree\n implicit none\n type(fenwick_tree) :: bit\n integer :: n, m, a(300000,3), ans(100000), i, j, k, x\n a = 0\n ans = 0\n read(*,*) n, m\n do i = 1, n\n read(*,*) a(i,1), a(i,2)\n a(i,3) = a(i,2)-a(i,1)+1\n end do\n call quick_sort(a(1:n,1:3),3)\n call init_bit(bit,m+1)\n ans(1) = n\n j = 1\n do i = 2, m\n do while (j.le.n)\n if (a(j,3).gt.i) exit\n call add(bit,a(j,1),1)\n call add(bit,a(j,2)+1,-1)\n j = j+1\n end do\n x = n-j+1\n do k = i, m, i\n x = x+summate(bit,k)\n end do\n ans(i) = x\n end do\n do i = 1, m\n write(*,'(i0)') ans(i)\n end do\n stop\ncontains\n recursive subroutine quick_sort(a,i)\n implicit none\n integer, intent(inout) :: a(:,:)\n integer, intent(in) :: i\n integer :: p, c(size(a(1,:)))\n integer :: n, l, r, m\n n = size(a(:,1))\n l = 1\n r = n\n m = (l+r)/2\n p = a(l,i)+a(m,i)+a(r,i)-max(a(l,i),a(m,i),a(r,i))-min(a(l,i),a(m,i),a(r,i))\n do\n do while (a(l,i).lt.p)\n l = l+1\n end do\n do while (a(r,i).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l,:)\n a(l,:) = a(r,:)\n a(r,:) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1,:),i)\n if (n.gt.r+1) call quick_sort(a(r+1:n,:),i)\n return\n end subroutine quick_sort\nend program snuke_line", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has decided to play a game, where the player runs a railway company.\nThere are M+1 stations on Snuke Line, numbered 0 through M.\nA train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.\nFor example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.\n\nThere are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.\n\nThere are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.\nFor each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.\nHere, assume that it is not allowed to change trains.\n\nConstraints\n\n1 ≦ N ≦ 3 × 10^{5}\n\n1 ≦ M ≦ 10^{5}\n\n1 ≦ l_i ≦ r_i ≦ M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nl_1 r_1\n:\nl_{N} r_{N}\n\nOutput\n\nPrint the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.\n\nSample Input 1\n\n3 3\n1 2\n2 3\n3 3\n\nSample Output 1\n\n3\n2\n2\n\nIf one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.\n\nIf one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.\n\nIf one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.\n\nSample Input 2\n\n7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4\n\nSample Output 2\n\n7\n6\n6\n5\n4\n5\n5\n3\n2", "sample_input": "3 3\n1 2\n2 3\n3 3\n"}, "reference_outputs": ["3\n2\n2\n"], "source_document_id": "p03819", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has decided to play a game, where the player runs a railway company.\nThere are M+1 stations on Snuke Line, numbered 0 through M.\nA train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.\nFor example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.\n\nThere are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.\n\nThere are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.\nFor each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.\nHere, assume that it is not allowed to change trains.\n\nConstraints\n\n1 ≦ N ≦ 3 × 10^{5}\n\n1 ≦ M ≦ 10^{5}\n\n1 ≦ l_i ≦ r_i ≦ M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nl_1 r_1\n:\nl_{N} r_{N}\n\nOutput\n\nPrint the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.\n\nSample Input 1\n\n3 3\n1 2\n2 3\n3 3\n\nSample Output 1\n\n3\n2\n2\n\nIf one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.\n\nIf one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.\n\nIf one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.\n\nSample Input 2\n\n7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4\n\nSample Output 2\n\n7\n6\n6\n5\n4\n5\n5\n3\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3105, "cpu_time_ms": 269, "memory_kb": 5248}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s566917714", "group_id": "codeNet:p03826", "input_text": "read*,i,j,k,l;print'(i0)',max(i*j,k*l);end", "language": "Fortran", "metadata": {"date": 1551376135, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03826.html", "problem_id": "p03826", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03826/input.txt", "sample_output_relpath": "derived/input_output/data/p03826/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03826/Fortran/s566917714.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s566917714", "user_id": "u394482932"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "read*,i,j,k,l;print'(i0)',max(i*j,k*l);end", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "sample_input": "3 5 2 7\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03826", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 42, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s900087523", "group_id": "codeNet:p03827", "input_text": "program answer\n implicit none\n integer :: N, j, ans, count\n character(len=100) :: S\n character(len=1) :: ss\n\n ss='I'\n\n read(*,*) N\n read(*,*) S\n\n count=0\n ans=0\n\n do j = 1, N\n if(S(j:j)==ss(1:1)) then\n count=count+1\n else\n count=count-1\n end if\n\n if(count>ans) then\n ans=count\n end if\n end do\n\n write(*,*) ans\n\n stop\n end program answer", "language": "Fortran", "metadata": {"date": 1596246317, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03827.html", "problem_id": "p03827", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03827/input.txt", "sample_output_relpath": "derived/input_output/data/p03827/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03827/Fortran/s900087523.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900087523", "user_id": "u873780029"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program answer\n implicit none\n integer :: N, j, ans, count\n character(len=100) :: S\n character(len=1) :: ss\n\n ss='I'\n\n read(*,*) N\n read(*,*) S\n\n count=0\n ans=0\n\n do j = 1, N\n if(S(j:j)==ss(1:1)) then\n count=count+1\n else\n count=count-1\n end if\n\n if(count>ans) then\n ans=count\n end if\n end do\n\n write(*,*) ans\n\n stop\n end program answer", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "sample_input": "5\nIIDID\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03827", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 390, "cpu_time_ms": 6, "memory_kb": 2784}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s610663667", "group_id": "codeNet:p03828", "input_text": "integer N,tmp\ninteger(8)ans\ninteger NumOfPrime(168),primenumbers(168)\nread*,N\nNumOfPrime=0\ncall getprime(1000,primenumbers)\ndo i=2,N\n tmp=i\n do j=1,168\n do while(mod(tmp,primenumbers(j))==0)\n NumOfPrime(j)=NumOfPrime(j)+1\n tmp=tmp/primenumbers(j)\n end do\n end do\nend do\nans=1\ndo i=1,168\n ans=mod(ans*(NumOfPrime(i)+1),10**9+7)\nend do\nprint\"(i0)\",ans\ncontains\nsubroutine getprime(N,array)\n integer N\n integer,dimension(:)::array\n integer ind\n logical pr\n array(1)=2;ind=1\n do i=3,N\n pr=.true.\n do j=1,ind\n if(mod(i,array(j))==0)then\n pr=.false.\n exit\n endif\n end do\n if(pr)then\n array(ind+1)=i;ind=ind+1\n endif\n end do\nend subroutine\nend", "language": "Fortran", "metadata": {"date": 1564776284, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03828.html", "problem_id": "p03828", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03828/input.txt", "sample_output_relpath": "derived/input_output/data/p03828/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03828/Fortran/s610663667.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s610663667", "user_id": "u598073939"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "integer N,tmp\ninteger(8)ans\ninteger NumOfPrime(168),primenumbers(168)\nread*,N\nNumOfPrime=0\ncall getprime(1000,primenumbers)\ndo i=2,N\n tmp=i\n do j=1,168\n do while(mod(tmp,primenumbers(j))==0)\n NumOfPrime(j)=NumOfPrime(j)+1\n tmp=tmp/primenumbers(j)\n end do\n end do\nend do\nans=1\ndo i=1,168\n ans=mod(ans*(NumOfPrime(i)+1),10**9+7)\nend do\nprint\"(i0)\",ans\ncontains\nsubroutine getprime(N,array)\n integer N\n integer,dimension(:)::array\n integer ind\n logical pr\n array(1)=2;ind=1\n do i=3,N\n pr=.true.\n do j=1,ind\n if(mod(i,array(j))==0)then\n pr=.false.\n exit\n endif\n end do\n if(pr)then\n array(ind+1)=i;ind=ind+1\n endif\n end do\nend subroutine\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "sample_input": "3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03828", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 707, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s099994995", "group_id": "codeNet:p03834", "input_text": "program main\n implicit none\n integer, parameter:: inf = 10000\n integer, allocatable:: dist(:,:), a(:), b(:), c(:) \n integer:: n, m, i, j, k\n integer:: ans\n\n read*, n, m\n allocate(dist(m,m), a(m),b(m),c(m))\n\n do i = 1, m\n read*, a(i), b(i), c(i)\n end do\n\n dist(:,:) = inf\n \n do i = 1, m\n dist(i,i) = 0\n end do\n\n do i = 1, m\n dist(a(i),b(i)) = min(dist(a(i),b(i)),c(i))\n dist(b(i),a(i)) = min(dist(b(i),a(i)),c(i))\n\n end do\n\n\n do k = 1, m\n do i =1, m\n do j = 1, m\n dist(i, j) = min(dist(i,j), dist(i,k) + dist(k,j))\n end do\n end do\n end do\n\n ans = m\n\n do i = 1, m\n do j = 1, m\n if (dist(i,b(j)) == dist(i,a(j)) + c(j)) then\n ans = ans - 1\n exit\n end if\n end do\n end do\n\n print'(i0)', ans\n\nend program", "language": "Fortran", "metadata": {"date": 1568140552, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03834.html", "problem_id": "p03834", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03834/input.txt", "sample_output_relpath": "derived/input_output/data/p03834/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03834/Fortran/s099994995.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s099994995", "user_id": "u234636620"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "program main\n implicit none\n integer, parameter:: inf = 10000\n integer, allocatable:: dist(:,:), a(:), b(:), c(:) \n integer:: n, m, i, j, k\n integer:: ans\n\n read*, n, m\n allocate(dist(m,m), a(m),b(m),c(m))\n\n do i = 1, m\n read*, a(i), b(i), c(i)\n end do\n\n dist(:,:) = inf\n \n do i = 1, m\n dist(i,i) = 0\n end do\n\n do i = 1, m\n dist(a(i),b(i)) = min(dist(a(i),b(i)),c(i))\n dist(b(i),a(i)) = min(dist(b(i),a(i)),c(i))\n\n end do\n\n\n do k = 1, m\n do i =1, m\n do j = 1, m\n dist(i, j) = min(dist(i,j), dist(i,k) + dist(k,j))\n end do\n end do\n end do\n\n ans = m\n\n do i = 1, m\n do j = 1, m\n if (dist(i,b(j)) == dist(i,a(j)) + c(j)) then\n ans = ans - 1\n exit\n end if\n end do\n end do\n\n print'(i0)', ans\n\nend program", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s924192019", "group_id": "codeNet:p03836", "input_text": "program main\nimplicit none\ninteger :: sx, sy, tx, ty\ninteger :: ix, iy, i, j, k\ncharacter :: res*20000\n\nread(*,*) sx, sy, tx, ty\n\ni = tx -sx\nj = ty -sy\nk = 1\ndo ix = k, k+i-1\n res(ix:ix) = 'R'\nend do\nk = k+i\ndo iy = k, k+j-1\n res(iy:iy) = 'U'\nend do\nk = k+j\ndo ix = k, k+i-1\n res(ix:ix) = 'L'\nend do\nk = k+i\ndo iy = k, k+j-1 \n res(iy:iy) = 'D'\nend do\nk = k+j\nres(k:k) = 'D'\nk = k+1\ndo ix = k, k+i\n res(ix:ix) = 'R'\nend do\nk = k+i+1\ndo iy = k, k+j\n res(iy:iy) = 'U'\nend do\nk = k+j+1\nres(k:k+1) = 'LU'\nk = k+2\ndo ix = k, k+i\n res(ix:ix) = 'L'\nend do\nk = k+i+1\ndo iy = k, k+j\n res(iy:iy) = 'D'\nend do\nk = k +j+1\nres(k:k) = 'R'\nwrite(*,*) res(1:k)\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1563237887, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03836.html", "problem_id": "p03836", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03836/input.txt", "sample_output_relpath": "derived/input_output/data/p03836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03836/Fortran/s924192019.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924192019", "user_id": "u696547932"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: sx, sy, tx, ty\ninteger :: ix, iy, i, j, k\ncharacter :: res*20000\n\nread(*,*) sx, sy, tx, ty\n\ni = tx -sx\nj = ty -sy\nk = 1\ndo ix = k, k+i-1\n res(ix:ix) = 'R'\nend do\nk = k+i\ndo iy = k, k+j-1\n res(iy:iy) = 'U'\nend do\nk = k+j\ndo ix = k, k+i-1\n res(ix:ix) = 'L'\nend do\nk = k+i\ndo iy = k, k+j-1 \n res(iy:iy) = 'D'\nend do\nk = k+j\nres(k:k) = 'D'\nk = k+1\ndo ix = k, k+i\n res(ix:ix) = 'R'\nend do\nk = k+i+1\ndo iy = k, k+j\n res(iy:iy) = 'U'\nend do\nk = k+j+1\nres(k:k+1) = 'LU'\nk = k+2\ndo ix = k, k+i\n res(ix:ix) = 'L'\nend do\nk = k+i+1\ndo iy = k, k+j\n res(iy:iy) = 'D'\nend do\nk = k +j+1\nres(k:k) = 'R'\nwrite(*,*) res(1:k)\n\n\nend program main\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "sample_input": "0 0 1 2\n"}, "reference_outputs": ["UURDDLLUUURRDRDDDLLU\n"], "source_document_id": "p03836", "source_text": "Score : 300 points\n\nProblem Statement\n\nDolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.\n\nCurrently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.\n\nHere, both the x- and y-coordinates before and after each movement must be integers.\n\nHe will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).\n\nHere, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).\n\nUnder this condition, find a shortest path for him.\n\nConstraints\n\n-1000 ≤ sx < tx ≤ 1000\n\n-1000 ≤ sy < ty ≤ 1000\n\nsx,sy,tx and ty are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nsx sy tx ty\n\nOutput\n\nPrint a string S that represents a shortest path for Dolphin.\n\nThe i-th character in S should correspond to his i-th movement.\n\nThe directions of the movements should be indicated by the following characters:\n\nU: Up\n\nD: Down\n\nL: Left\n\nR: Right\n\nIf there exist multiple shortest paths under the condition, print any of them.\n\nSample Input 1\n\n0 0 1 2\n\nSample Output 1\n\nUURDDLLUUURRDRDDDLLU\n\nOne possible shortest path is:\n\nGoing from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)\n\nGoing from (sx,sy) to (tx,ty) for the second time: (0,0) → (-1,0) → (-1,1) → (-1,2) → (-1,3) → (0,3) → (1,3) → (1,2)\n\nGoing from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,-1) → (1,-1) → (0,-1) → (0,0)\n\nSample Input 2\n\n-2 -2 1 1\n\nSample Output 2\n\nUURRURRDDDLLDLLULUUURRURRDDDLLDL", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 679, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s297309654", "group_id": "codeNet:p03838", "input_text": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: x,y,ans\n\n read*, x,y\n ans = 2000000000\n if (y-x >= 0) then\n ans=min(ans,y-x)\n end if\n\n if (y-(-x) >= 0) then\n ans = min(ans,y-(-x)+1)\n end if\n\n if ((-y) - x >= 0)then\n ans = min(ans,(-y)-x+1)\n end if\n\n if ((-y)-(-x) >= 0) then\n ans = min(ans,(-y)-(-x)+2)\n end if\n\n print'(i0)', ans\nend program name", "language": "Fortran", "metadata": {"date": 1587662349, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03838.html", "problem_id": "p03838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03838/input.txt", "sample_output_relpath": "derived/input_output/data/p03838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03838/Fortran/s297309654.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s297309654", "user_id": "u234636620"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program name\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int64):: x,y,ans\n\n read*, x,y\n ans = 2000000000\n if (y-x >= 0) then\n ans=min(ans,y-x)\n end if\n\n if (y-(-x) >= 0) then\n ans = min(ans,y-(-x)+1)\n end if\n\n if ((-y) - x >= 0)then\n ans = min(ans,(-y)-x+1)\n end if\n\n if ((-y)-(-x) >= 0) then\n ans = min(ans,(-y)-(-x)+2)\n end if\n\n print'(i0)', ans\nend program name", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "sample_input": "10 20\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03838", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 448, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s093879668", "group_id": "codeNet:p03844", "input_text": "implicit none\ninteger (8):: a,b,c\ncharacter(1) :: s\nread(*,*) a, s, b\n\nif (s==\"+\" ) then\n write(*,*) a+b\nelse\n write(*,*) a-b \nendif\nend", "language": "Fortran", "metadata": {"date": 1525442623, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/Fortran/s093879668.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093879668", "user_id": "u909643606"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "implicit none\ninteger (8):: a,b,c\ncharacter(1) :: s\nread(*,*) a, s, b\n\nif (s==\"+\" ) then\n write(*,*) a+b\nelse\n write(*,*) a-b \nendif\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s409745944", "group_id": "codeNet:p03845", "input_text": "program prob2\n implicit none\n integer :: N, M\n integer, allocatable, dimension(:) :: T, P, X\n integer :: ans, i, j\n read(*,*) N\n allocate(T(N))\n read(*,*) T\n read(*,*) M\n allocate(P(M))\n allocate(X(M))\n do i = 1, M\n read(*,*) P(i), X(i)\n end do\n do i = 1, M\n ans = 0\n do j = 1, N\n if(j == P(i)) then\n ans = ans + X(i)\n else\n ans = ans + T(j)\n end if\n end do\n write(*,*) ans\n end do\n\n deallocate(T, P, X)\n\n\n stop\ncontains\nend program prob2", "language": "Fortran", "metadata": {"date": 1594431842, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03845.html", "problem_id": "p03845", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03845/input.txt", "sample_output_relpath": "derived/input_output/data/p03845/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03845/Fortran/s409745944.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409745944", "user_id": "u478462004"}, "prompt_components": {"gold_output": "6\n9\n", "input_to_evaluate": "program prob2\n implicit none\n integer :: N, M\n integer, allocatable, dimension(:) :: T, P, X\n integer :: ans, i, j\n read(*,*) N\n allocate(T(N))\n read(*,*) T\n read(*,*) M\n allocate(P(M))\n allocate(X(M))\n do i = 1, M\n read(*,*) P(i), X(i)\n end do\n do i = 1, M\n ans = 0\n do j = 1, N\n if(j == P(i)) then\n ans = ans + X(i)\n else\n ans = ans + T(j)\n end if\n end do\n write(*,*) ans\n end do\n\n deallocate(T, P, X)\n\n\n stop\ncontains\nend program prob2", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "sample_input": "3\n2 1 4\n2\n1 1\n2 3\n"}, "reference_outputs": ["6\n9\n"], "source_document_id": "p03845", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 2836}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s185710682", "group_id": "codeNet:p03846", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: n,i,ans\ninteger(16),allocatable :: a(:)\n\nread*, n\nallocate(a(n))\nread*, a(1:n)\n\ncall hs(n,a)\n\ndo i = n-1, 0, -2\n if ( i == 0 ) then\n if ( a(1) /= 0 ) stop\n exit\n end if\n if ( 2*i /= a(i)+a(i+1) ) then\n print'(i0)', 0\n stop\n end if\nend do\n\nans = 1\ndo i = 1, n/2\n ans = mod(ans*2,10**9+7)\nend do\n\nprint'(i0)', ans \n\ncontains\n!!!!!! サブルーチンは↓\nsubroutine hs(n,array)\n implicit none\n integer(16),intent(in)::n\n integer(16),intent(inout)::array(1:n)\n \n integer(16)::i,k,j,l,m\n integer(16)::t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(l)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine hs\n!!!!!!\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1553549811, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03846.html", "problem_id": "p03846", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03846/input.txt", "sample_output_relpath": "derived/input_output/data/p03846/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03846/Fortran/s185710682.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185710682", "user_id": "u454557108"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: n,i,ans\ninteger(16),allocatable :: a(:)\n\nread*, n\nallocate(a(n))\nread*, a(1:n)\n\ncall hs(n,a)\n\ndo i = n-1, 0, -2\n if ( i == 0 ) then\n if ( a(1) /= 0 ) stop\n exit\n end if\n if ( 2*i /= a(i)+a(i+1) ) then\n print'(i0)', 0\n stop\n end if\nend do\n\nans = 1\ndo i = 1, n/2\n ans = mod(ans*2,10**9+7)\nend do\n\nprint'(i0)', ans \n\ncontains\n!!!!!! サブルーチンは↓\nsubroutine hs(n,array)\n implicit none\n integer(16),intent(in)::n\n integer(16),intent(inout)::array(1:n)\n \n integer(16)::i,k,j,l,m\n integer(16)::t\n \n if(n.le.0)then\n write(6,*)\"Error, at heapsort\"; stop\n endif\n if(n.eq.1)return\n \n l=n/2+1\n k=n\n do while(k.ne.1)\n if(l.gt.1)then\n l=l-1\n t=array(l)\n else\n t=array(k)\n array(k)=array(1)\n k=k-1\n if(k.eq.1) then\n array(1)=t\n exit\n endif\n endif\n i=l\n j=l+l\n do while(j.le.k)\n if(j.lt.k)then\n if(array(j).lt.array(j+1))j=j+1\n endif\n if (t.lt.array(j))then\n array(i)=array(j)\n i=j\n j=j+j\n else\n j=k+1\n endif\n enddo\n array(i)=t\n enddo\n \n return\nend subroutine hs\n!!!!!!\n\nEND PROGRAM ATCODER", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "sample_input": "5\n2 4 4 0 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03846", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1254, "cpu_time_ms": 51, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s517480321", "group_id": "codeNet:p03852", "input_text": "program ABC049A\n implicit none\n character(1)::c\n read(5,*)c\n if(c==\"a\".or.c==\"e\".or.c==\"i\".or.c==\"o\".or.c==\"u\")then\n print'(A)',\"vowel\"\n else\n print'(A)',\"consonant\"\n end if\nend program ABC049A", "language": "Fortran", "metadata": {"date": 1580963808, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03852.html", "problem_id": "p03852", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03852/input.txt", "sample_output_relpath": "derived/input_output/data/p03852/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03852/Fortran/s517480321.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517480321", "user_id": "u414699019"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "program ABC049A\n implicit none\n character(1)::c\n read(5,*)c\n if(c==\"a\".or.c==\"e\".or.c==\"i\".or.c==\"o\".or.c==\"u\")then\n print'(A)',\"vowel\"\n else\n print'(A)',\"consonant\"\n end if\nend program ABC049A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "sample_input": "a\n"}, "reference_outputs": ["vowel\n"], "source_document_id": "p03852", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s559801253", "group_id": "codeNet:p03853", "input_text": "program main\nimplicit none\ninteger :: i, j, k\ncharacter :: c*100\ninteger :: h, w\n\nread(*,*) h, w\ndo i = 1, h\n read(*,*) c(1:w)\n write(*,*) c(1:w)\n write(*,*) c(1:w)\nend do\n\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1563467006, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03853/input.txt", "sample_output_relpath": "derived/input_output/data/p03853/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03853/Fortran/s559801253.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559801253", "user_id": "u696547932"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, k\ncharacter :: c*100\ninteger :: h, w\n\nread(*,*) h, w\ndo i = 1, h\n read(*,*) c(1:w)\n write(*,*) c(1:w)\n write(*,*) c(1:w)\nend do\n\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "sample_input": "2 2\n*.\n.*\n"}, "reference_outputs": ["*.\n*.\n.*\n.*\n"], "source_document_id": "p03853", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 197, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s200716109", "group_id": "codeNet:p03859", "input_text": "program shuffling\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer :: n, m, i, j, k, l, r, x(0:3001) = 0, c(0:3001) = 0\n character(3001) :: s\n integer(8) :: dp(0:3001,0:3001) = 0_8\n read(*,*) n, m\n read(*,*) s\n s(n+1:n+1) = \"0\"\n do i = 1, m\n read(*,*) l, r\n x(l) = max(x(l),r)\n end do\n do i = 1, n+1\n x(i) = max(x(i-1),x(i),i)\n c(i) = c(i-1)+ichar(s(i:i))-48\n end do\n dp(1,c(x(1))) = 1_8\n do i = 1, n\n k = c(x(i+1))-c(x(i))\n dp(i+1,k) = mod(dp(i+1,k)+dp(i,0),md)\n do j = 1, n-k\n dp(i+1,k+j-1) = mod(dp(i+1,k+j-1)+dp(i,j),md)\n if (x(i)-i >= j) dp(i+1,k+j) = mod(dp(i+1,k+j)+dp(i,j),md)\n end do\n end do\n write(*,'(i0)') dp(n+1,0)\nend program shuffling", "language": "Fortran", "metadata": {"date": 1569302856, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03859.html", "problem_id": "p03859", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03859/input.txt", "sample_output_relpath": "derived/input_output/data/p03859/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03859/Fortran/s200716109.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s200716109", "user_id": "u506403362"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program shuffling\n implicit none\n integer(8), parameter :: md = 1000000007_8\n integer :: n, m, i, j, k, l, r, x(0:3001) = 0, c(0:3001) = 0\n character(3001) :: s\n integer(8) :: dp(0:3001,0:3001) = 0_8\n read(*,*) n, m\n read(*,*) s\n s(n+1:n+1) = \"0\"\n do i = 1, m\n read(*,*) l, r\n x(l) = max(x(l),r)\n end do\n do i = 1, n+1\n x(i) = max(x(i-1),x(i),i)\n c(i) = c(i-1)+ichar(s(i:i))-48\n end do\n dp(1,c(x(1))) = 1_8\n do i = 1, n\n k = c(x(i+1))-c(x(i))\n dp(i+1,k) = mod(dp(i+1,k)+dp(i,0),md)\n do j = 1, n-k\n dp(i+1,k+j-1) = mod(dp(i+1,k+j-1)+dp(i,j),md)\n if (x(i)-i >= j) dp(i+1,k+j) = mod(dp(i+1,k+j)+dp(i,j),md)\n end do\n end do\n write(*,'(i0)') dp(n+1,0)\nend program shuffling", "problem_context": "Score : 900 points\n\nProblem Statement\n\nThere is a string S of length N consisting of characters 0 and 1. You will perform the following operation for each i = 1, 2, ..., m:\n\nArbitrarily permute the characters within the substring of S starting at the l_i-th character from the left and extending through the r_i-th character.\n\nHere, the sequence l_i is non-decreasing.\n\nHow many values are possible for S after the M operations, modulo 1000000007(= 10^9+7)?\n\nConstraints\n\n2≦N≦3000\n\n1≦M≦3000\n\nS consists of characters 0 and 1.\n\nThe length of S equals N.\n\n1≦l_i < r_i≦N\n\nl_i ≦ l_{i+1}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nS\nl_1 r_1\n:\nl_M r_M\n\nOutput\n\nPrint the number of the possible values for S after the M operations, modulo 1000000007.\n\nSample Input 1\n\n5 2\n01001\n2 4\n3 5\n\nSample Output 1\n\n6\n\nAfter the first operation, S can be one of the following three: 01001, 00101 and 00011.\n\nAfter the second operation, S can be one of the following six: 01100, 01010, 01001, 00011, 00101 and 00110.\n\nSample Input 2\n\n9 3\n110111110\n1 4\n4 6\n6 9\n\nSample Output 2\n\n26\n\nSample Input 3\n\n11 6\n00101000110\n2 4\n2 3\n4 7\n5 6\n6 10\n10 11\n\nSample Output 3\n\n143", "sample_input": "5 2\n01001\n2 4\n3 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03859", "source_text": "Score : 900 points\n\nProblem Statement\n\nThere is a string S of length N consisting of characters 0 and 1. You will perform the following operation for each i = 1, 2, ..., m:\n\nArbitrarily permute the characters within the substring of S starting at the l_i-th character from the left and extending through the r_i-th character.\n\nHere, the sequence l_i is non-decreasing.\n\nHow many values are possible for S after the M operations, modulo 1000000007(= 10^9+7)?\n\nConstraints\n\n2≦N≦3000\n\n1≦M≦3000\n\nS consists of characters 0 and 1.\n\nThe length of S equals N.\n\n1≦l_i < r_i≦N\n\nl_i ≦ l_{i+1}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nS\nl_1 r_1\n:\nl_M r_M\n\nOutput\n\nPrint the number of the possible values for S after the M operations, modulo 1000000007.\n\nSample Input 1\n\n5 2\n01001\n2 4\n3 5\n\nSample Output 1\n\n6\n\nAfter the first operation, S can be one of the following three: 01001, 00101 and 00011.\n\nAfter the second operation, S can be one of the following six: 01100, 01010, 01001, 00011, 00101 and 00110.\n\nSample Input 2\n\n9 3\n110111110\n1 4\n4 6\n6 9\n\nSample Output 2\n\n26\n\nSample Input 3\n\n11 6\n00101000110\n2 4\n2 3\n4 7\n5 6\n6 10\n10 11\n\nSample Output 3\n\n143", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 718, "cpu_time_ms": 76, "memory_kb": 70656}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s022307854", "group_id": "codeNet:p03860", "input_text": "program ABC048A\n implicit none\n character(100)::s1,s2,s3\n read(5,*)s1,s2,s3\n print'(A,A,A)',s1(1:1),s2(1:1),s3(1:1)\nend program ABC048A", "language": "Fortran", "metadata": {"date": 1581016071, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03860.html", "problem_id": "p03860", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03860/input.txt", "sample_output_relpath": "derived/input_output/data/p03860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03860/Fortran/s022307854.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s022307854", "user_id": "u414699019"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program ABC048A\n implicit none\n character(100)::s1,s2,s3\n read(5,*)s1,s2,s3\n print'(A,A,A)',s1(1:1),s2(1:1),s3(1:1)\nend program ABC048A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s626286747", "group_id": "codeNet:p03860", "input_text": "program main\nimplicit none\ninteger :: i, j, k\ncharacter :: s*100, t*3\n\nread(*,*) s\nt = 'A'//s(1:1)//'C'\nwrite(*,*) t\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1563289248, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03860.html", "problem_id": "p03860", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03860/input.txt", "sample_output_relpath": "derived/input_output/data/p03860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03860/Fortran/s626286747.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s626286747", "user_id": "u696547932"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, k\ncharacter :: s*100, t*3\n\nread(*,*) s\nt = 'A'//s(1:1)//'C'\nwrite(*,*) t\n\nend program main\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s652139242", "group_id": "codeNet:p03861", "input_text": "program main\n implicit none\n integer(8) :: a, b, x\n read *, a, b, x\n a = max(0_8, a)\n print \"(i0)\", b / x - (a - 1) / x\nend program main\n", "language": "Fortran", "metadata": {"date": 1587811149, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Fortran/s652139242.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s652139242", "user_id": "u388927326"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: a, b, x\n read *, a, b, x\n a = max(0_8, a)\n print \"(i0)\", b / x - (a - 1) / x\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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:Fortran:s067029195", "group_id": "codeNet:p03861", "input_text": "program ABC048B\n implicit none\n integer(8)::a,b,x\n read(5,*)a,b,x\n if(a==0)then\n print'(i0)',b/x\n else\n print'(i0)',b/x-(a-1)/x\n end if\nend program ABC048B", "language": "Fortran", "metadata": {"date": 1581050922, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Fortran/s067029195.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s067029195", "user_id": "u414699019"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ABC048B\n implicit none\n integer(8)::a,b,x\n read(5,*)a,b,x\n if(a==0)then\n print'(i0)',b/x\n else\n print'(i0)',b/x-(a-1)/x\n end if\nend program ABC048B", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s961342724", "group_id": "codeNet:p03861", "input_text": "program main\n implicit none\n \n integer(16) :: a,b,x,aa,bb\n \n read(*,*)a,b,x\n if (a == b) then\n write(*,*)0\n stop\n end if\n aa = a/x\n bb = b/x\n if (mod(a,x) == 0) then\n write(*,'(i0)')bb-aa+1\n else\n write(*,'(i0)')bb-aa\n end if\nend program main\n", "language": "Fortran", "metadata": {"date": 1573149422, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Fortran/s961342724.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s961342724", "user_id": "u287431190"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main\n implicit none\n \n integer(16) :: a,b,x,aa,bb\n \n read(*,*)a,b,x\n if (a == b) then\n write(*,*)0\n stop\n end if\n aa = a/x\n bb = b/x\n if (mod(a,x) == 0) then\n write(*,'(i0)')bb-aa+1\n else\n write(*,'(i0)')bb-aa\n end if\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 267, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s054318839", "group_id": "codeNet:p03861", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: a,b,x\n\nread(*,*) a,b,x\n\nif(a == 0)then\n write(*,'(i0)') b/x+1\nelse\n write(*,'(i0)') (b/x+1)-((a-1)/x+1)\nend if\n\ncontains\n!!!!!! サブルーチンは↓\n!!!!!!\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1553282726, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03861.html", "problem_id": "p03861", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03861/input.txt", "sample_output_relpath": "derived/input_output/data/p03861/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03861/Fortran/s054318839.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s054318839", "user_id": "u454557108"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger(16) :: a,b,x\n\nread(*,*) a,b,x\n\nif(a == 0)then\n write(*,'(i0)') b/x+1\nelse\n write(*,'(i0)') (b/x+1)-((a-1)/x+1)\nend if\n\ncontains\n!!!!!! サブルーチンは↓\n!!!!!!\n\nEND PROGRAM ATCODER", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 228, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s295273868", "group_id": "codeNet:p03890", "input_text": "program kode_festival\n implicit none\n integer :: n , a(262144), b(131072), m, i, k\n a = 0\n b = 0\n read(*,*) n\n m = 2**n\n do i = 1, m\n read(*,*) a(i)\n end do\n do k = 1, n\n m = m/2\n do i = 1, m\n if (a(2*i-1).eq.a(2*i)) then\n b(i) = a(2*i-1)\n else\n b(i) = max(a(2*i-1),a(2*i))-min(a(2*i-1),a(2*i))\n end if\n end do\n a(1:m) = b(1:m)\n end do\n write(*,'(i0)') a(1)\n stop\nend program kode_festival", "language": "Fortran", "metadata": {"date": 1555190981, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03890.html", "problem_id": "p03890", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03890/input.txt", "sample_output_relpath": "derived/input_output/data/p03890/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03890/Fortran/s295273868.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s295273868", "user_id": "u506403362"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program kode_festival\n implicit none\n integer :: n , a(262144), b(131072), m, i, k\n a = 0\n b = 0\n read(*,*) n\n m = 2**n\n do i = 1, m\n read(*,*) a(i)\n end do\n do k = 1, n\n m = m/2\n do i = 1, m\n if (a(2*i-1).eq.a(2*i)) then\n b(i) = a(2*i-1)\n else\n b(i) = max(a(2*i-1),a(2*i))-min(a(2*i-1),a(2*i))\n end if\n end do\n a(1:m) = b(1:m)\n end do\n write(*,'(i0)') a(1)\n stop\nend program kode_festival", "problem_context": "Score : 100 points\n\nProblem Statement\n\nKode Festival is an anual contest where the hardest stone in the world is determined. (Kode is a Japanese word for \"hardness\".)\n\nThis year, 2^N stones participated. The hardness of the i-th stone is A_i.\n\nIn the contest, stones are thrown at each other in a knockout tournament.\n\nWhen two stones with hardness X and Y are thrown at each other, the following will happen:\n\nWhen X > Y:\nThe stone with hardness Y will be destroyed and eliminated.\nThe hardness of the stone with hardness X will become X-Y.\n\nWhen X = Y:\nOne of the stones will be destroyed and eliminated.\nThe hardness of the other stone will remain the same.\n\nWhen X < Y:\nThe stone with hardness X will be destroyed and eliminated.\nThe hardness of the stone with hardness Y will become Y-X.\n\nThe 2^N stones will fight in a knockout tournament as follows:\n\nThe following pairs will fight: (the 1-st stone versus the 2-nd stone), (the 3-rd stone versus the 4-th stone), ...\n\nThe following pairs will fight: (the winner of (1-st versus 2-nd) versus the winner of (3-rd versus 4-th)), (the winner of (5-th versus 6-th) versus the winner of (7-th versus 8-th)), ...\n\nAnd so forth, until there is only one stone remaining.\n\nDetermine the eventual hardness of the last stone remaining.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1\nA_2\n:\nA_{2^N}\n\nOutput\n\nPrint the eventual hardness of the last stone remaining.\n\nSample Input 1\n\n2\n1\n3\n10\n19\n\nSample Output 1\n\n7\n\nSample Input 2\n\n3\n1\n3\n2\n4\n6\n8\n100\n104\n\nSample Output 2\n\n2", "sample_input": "2\n1\n3\n10\n19\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03890", "source_text": "Score : 100 points\n\nProblem Statement\n\nKode Festival is an anual contest where the hardest stone in the world is determined. (Kode is a Japanese word for \"hardness\".)\n\nThis year, 2^N stones participated. The hardness of the i-th stone is A_i.\n\nIn the contest, stones are thrown at each other in a knockout tournament.\n\nWhen two stones with hardness X and Y are thrown at each other, the following will happen:\n\nWhen X > Y:\nThe stone with hardness Y will be destroyed and eliminated.\nThe hardness of the stone with hardness X will become X-Y.\n\nWhen X = Y:\nOne of the stones will be destroyed and eliminated.\nThe hardness of the other stone will remain the same.\n\nWhen X < Y:\nThe stone with hardness X will be destroyed and eliminated.\nThe hardness of the stone with hardness Y will become Y-X.\n\nThe 2^N stones will fight in a knockout tournament as follows:\n\nThe following pairs will fight: (the 1-st stone versus the 2-nd stone), (the 3-rd stone versus the 4-th stone), ...\n\nThe following pairs will fight: (the winner of (1-st versus 2-nd) versus the winner of (3-rd versus 4-th)), (the winner of (5-th versus 6-th) versus the winner of (7-th versus 8-th)), ...\n\nAnd so forth, until there is only one stone remaining.\n\nDetermine the eventual hardness of the last stone remaining.\n\nConstraints\n\n1 \\leq N \\leq 18\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1\nA_2\n:\nA_{2^N}\n\nOutput\n\nPrint the eventual hardness of the last stone remaining.\n\nSample Input 1\n\n2\n1\n3\n10\n19\n\nSample Output 1\n\n7\n\nSample Input 2\n\n3\n1\n3\n2\n4\n6\n8\n100\n104\n\nSample Output 2\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 113, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s272374301", "group_id": "codeNet:p03892", "input_text": "program segment_on_grid_paper\n implicit none\n integer :: a, b, c, d, x, y, y0, y1, i\n integer(8) :: m\n read(*,*) a, b, c, d\n x = abs(c-a)\n y = abs(d-b)\n y0 = 0\n m = 0_8\n do i = 1, x\n y1 = ceiling(real(y,8)*real(i,8)/real(x,8))\n m = m+int(y1-y0,8)\n y0 = floor(real(y,8)*real(i,8)/real(x,8))\n end do\n write(*,'(i0)') m\n stop\nend program segment_on_grid_paper", "language": "Fortran", "metadata": {"date": 1560468773, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03892.html", "problem_id": "p03892", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03892/input.txt", "sample_output_relpath": "derived/input_output/data/p03892/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03892/Fortran/s272374301.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s272374301", "user_id": "u506403362"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program segment_on_grid_paper\n implicit none\n integer :: a, b, c, d, x, y, y0, y1, i\n integer(8) :: m\n read(*,*) a, b, c, d\n x = abs(c-a)\n y = abs(d-b)\n y0 = 0\n m = 0_8\n do i = 1, x\n y1 = ceiling(real(y,8)*real(i,8)/real(x,8))\n m = m+int(y1-y0,8)\n y0 = floor(real(y,8)*real(i,8)/real(x,8))\n end do\n write(*,'(i0)') m\n stop\nend program segment_on_grid_paper", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is drawing a segment on grid paper.\n\nFrom a certain square, a square that is x squares to the right and y squares above, is denoted as square (x, y).\n\nWhen Takahashi draws a segment connecting the lower left corner of square (A, B) and the lower left corner of square (C, D), find the number of the squares crossed by the segment.\n\nHere, the segment is said to cross a square if the segment has non-empty intersection with the region within the square, excluding the boundary.\n\nConstraints\n\n1 \\leq A, B, C, D \\leq 10^9\n\nAt least one of A \\neq C and B \\neq D holds.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the number of the squares crossed by the segment.\n\nSample Input 1\n\n1 1 3 4\n\nSample Output 1\n\n4\n\nSample Input 2\n\n2 3 10 7\n\nSample Output 2\n\n8", "sample_input": "1 1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03892", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is drawing a segment on grid paper.\n\nFrom a certain square, a square that is x squares to the right and y squares above, is denoted as square (x, y).\n\nWhen Takahashi draws a segment connecting the lower left corner of square (A, B) and the lower left corner of square (C, D), find the number of the squares crossed by the segment.\n\nHere, the segment is said to cross a square if the segment has non-empty intersection with the region within the square, excluding the boundary.\n\nConstraints\n\n1 \\leq A, B, C, D \\leq 10^9\n\nAt least one of A \\neq C and B \\neq D holds.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the number of the squares crossed by the segment.\n\nSample Input 1\n\n1 1 3 4\n\nSample Output 1\n\n4\n\nSample Input 2\n\n2 3 10 7\n\nSample Output 2\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 377, "cpu_time_ms": 2103, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s319775060", "group_id": "codeNet:p03899", "input_text": "program struck_out\n implicit none\n integer :: n, m, k, i, j, l\n integer(8) :: a(100000), dp(0:100000,300)\n a = 0_8\n dp = 0_8\n read(*,*) n, m, k\n read(*,*) a(1:n)\n dp(1:n,1) = a(1:n)\n do j = 2, k\n do i = 1, n\n l = max(0,i-m)\n dp(i,j) = int(j,8)*a(i)+maxval(dp(l:i-1,j-1))\n end do\n end do\n write(*,'(i0)') maxval(dp(1:n,k))\n stop\nend program struck_out", "language": "Fortran", "metadata": {"date": 1562729386, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03899.html", "problem_id": "p03899", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03899/input.txt", "sample_output_relpath": "derived/input_output/data/p03899/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03899/Fortran/s319775060.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319775060", "user_id": "u506403362"}, "prompt_components": {"gold_output": "56\n", "input_to_evaluate": "program struck_out\n implicit none\n integer :: n, m, k, i, j, l\n integer(8) :: a(100000), dp(0:100000,300)\n a = 0_8\n dp = 0_8\n read(*,*) n, m, k\n read(*,*) a(1:n)\n dp(1:n,1) = a(1:n)\n do j = 2, k\n do i = 1, n\n l = max(0,i-m)\n dp(i,j) = int(j,8)*a(i)+maxval(dp(l:i-1,j-1))\n end do\n end do\n write(*,'(i0)') maxval(dp(1:n,k))\n stop\nend program struck_out", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N panels arranged in a row in Takahashi's house, numbered 1 through N. The i-th panel has a number A_i written on it. Takahashi is playing by throwing balls at these panels.\n\nTakahashi threw a ball K times. Let the panel hit by a boll in the i-th throw be panel p_i. He set the score for the i-th throw as i \\times A_{p_i}.\n\nHe was about to calculate the total score for his throws, when he realized that he forgot the panels hit by balls, p_1,p_2,...,p_K. The only fact he remembers is that for every i (1 ≦ i ≦ K-1), 1 ≦ p_{i+1}-p_i ≦ M holds. Based on this fact, find the maximum possible total score for his throws.\n\nConstraints\n\n1 ≦ M ≦ N ≦ 100,000\n\n1 ≦ K ≦ min(300,N)\n\n1 ≦ A_i ≦ 10^{9}\n\nPartial Scores\n\nIn the test set worth 100 points, M = N.\n\nIn the test set worth another 200 points, N ≦ 300 and K ≦ 30.\n\nIn the test set worth another 300 points, K ≦ 30.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 … A_N\n\nOutput\n\nPrint the maximum possible total score for Takahashi's throws.\n\nSample Input 1\n\n5 2 3\n10 2 8 10 2\n\nSample Output 1\n\n56\n\nThe total score is maximized when panels 1,3 and 4 are hit, in this order.\n\nSample Input 2\n\n5 5 2\n5 2 10 5 9\n\nSample Output 2\n\n28\n\nThis case satisfies the additional constraint M = N for a partial score.\n\nSample Input 3\n\n10 3 5\n3 7 2 6 9 4 8 5 1 1000000000\n\nSample Output 3\n\n5000000078", "sample_input": "5 2 3\n10 2 8 10 2\n"}, "reference_outputs": ["56\n"], "source_document_id": "p03899", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N panels arranged in a row in Takahashi's house, numbered 1 through N. The i-th panel has a number A_i written on it. Takahashi is playing by throwing balls at these panels.\n\nTakahashi threw a ball K times. Let the panel hit by a boll in the i-th throw be panel p_i. He set the score for the i-th throw as i \\times A_{p_i}.\n\nHe was about to calculate the total score for his throws, when he realized that he forgot the panels hit by balls, p_1,p_2,...,p_K. The only fact he remembers is that for every i (1 ≦ i ≦ K-1), 1 ≦ p_{i+1}-p_i ≦ M holds. Based on this fact, find the maximum possible total score for his throws.\n\nConstraints\n\n1 ≦ M ≦ N ≦ 100,000\n\n1 ≦ K ≦ min(300,N)\n\n1 ≦ A_i ≦ 10^{9}\n\nPartial Scores\n\nIn the test set worth 100 points, M = N.\n\nIn the test set worth another 200 points, N ≦ 300 and K ≦ 30.\n\nIn the test set worth another 300 points, K ≦ 30.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M K\nA_1 A_2 … A_N\n\nOutput\n\nPrint the maximum possible total score for Takahashi's throws.\n\nSample Input 1\n\n5 2 3\n10 2 8 10 2\n\nSample Output 1\n\n56\n\nThe total score is maximized when panels 1,3 and 4 are hit, in this order.\n\nSample Input 2\n\n5 5 2\n5 2 10 5 9\n\nSample Output 2\n\n28\n\nThis case satisfies the additional constraint M = N for a partial score.\n\nSample Input 3\n\n10 3 5\n3 7 2 6 9 4 8 5 1 1000000000\n\nSample Output 3\n\n5000000078", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 2104, "memory_kb": 235904}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s608868112", "group_id": "codeNet:p03916", "input_text": "module mod_linked_list\n implicit none\n\n type t_node\n private\n integer :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n\n type t_linked_list\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: add_first => add_first\n procedure :: add_last => add_last\n procedure :: poll_first => poll_first\n procedure :: poll_last => poll_last\n procedure :: peek_first => peek_first\n procedure :: peek_last => peek_last\n procedure :: clear => clear\n procedure :: get => get\n procedure :: remove => remove\n procedure :: replace => replace\n procedure :: first_index_of => first_index_of\n procedure :: last_index_of => last_index_of\n procedure :: size => size_of\n end type t_linked_list\n\ncontains\n\n function new_node(item) result(node)\n integer, intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n\n subroutine add_first(this,item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%tail)) then\n node%next => this%head\n this%head%prev => node\n else\n this%tail => node\n end if\n this%head => node\n this%num = this%num+1\n end\n\n subroutine add_last(this,item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n\n function poll_first(this) result(item)\n class(t_linked_list), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n item = this%head%item\n node => this%head%next\n deallocate(this%head)\n this%head => node\n if (associated(node)) then\n node%prev => null()\n else\n this%tail => null()\n end if\n this%num = this%num-1\n end\n\n function poll_last(this) result(item)\n class(t_linked_list), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n item = this%tail%item\n node => this%tail%prev\n deallocate(this%tail)\n this%tail => node\n if (associated(node)) then\n node%next => null()\n else\n this%head => null()\n end if\n this%num = this%num-1\n end\n\n function peek_first(this) result(item)\n class(t_linked_list), intent(in) :: this\n integer :: item\n item = this%head%item\n end\n\n function peek_last(this) result(item)\n class(t_linked_list), intent(in) :: this\n integer :: item\n item = this%tail%item\n end\n\n subroutine clear(this)\n class(t_linked_list), intent(inout) :: this\n type(t_node), pointer :: node, next\n if (.not.associated(this%head)) return\n node => this%head\n do while (associated(node%next))\n next => node%next\n deallocate(node)\n node => next\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n\n function get(this,i) result(item)\n class(t_linked_list), intent(in) :: this\n integer, intent(in) :: i\n integer :: item, idx\n type(t_node), pointer :: node\n if (i <= (this%num+1)/2) then\n idx = 1\n node => this%head\n do while (idx < i)\n node => node%next\n idx = idx+1\n end do\n else\n idx = this%num\n node => this%tail\n do while (idx > i)\n node => node%prev\n idx = idx-1\n end do\n end if\n item = node%item\n end\n\n function remove(this,i) result(item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: i\n integer :: item, idx\n type(t_node), pointer :: node\n if (i == 1) then\n item = poll_first(this)\n return\n end if\n if (i == this%num) then\n item = poll_last(this)\n return\n end if\n if (i <= (this%num+1)/2) then\n idx = 1\n node => this%head\n do while (idx < i)\n node => node%next\n idx = idx+1\n end do\n else\n idx = this%num\n node => this%tail\n do while (idx > i)\n node => node%prev\n idx = idx-1\n end do\n end if\n item = node%item\n node%prev%next => node%next\n node%next%prev => node%prev\n deallocate(node)\n this%num = this%num-1\n end\n\n subroutine replace(this,i,item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: i, item\n integer :: idx\n type(t_node), pointer :: node\n if (i <= (this%num+1)/2) then\n idx = 1\n node => this%head\n do while (idx < i)\n node => node%next\n idx = idx+1\n end do\n else\n idx = this%num\n node => this%tail\n do while (idx > i)\n node => node%prev\n idx = idx-1\n end do\n end if\n node%item = item\n end\n\n subroutine show_all(this)\n type(t_linked_list), intent(in) :: this\n type(t_node), pointer :: node, next\n if (.not.associated(this%head)) return\n node => this%head\n write(*,'(i0)',advance='no') node%item\n do while (associated(node%next))\n node => node%next\n write(*,'(x,i0)',advance='no') node%item\n end do\n write(*,*)\n end\n\n function first_index_of(this,item) result(idx)\n class(t_linked_list), intent(in) :: this\n integer, intent(in) :: item\n integer :: idx\n type(t_node), pointer :: node\n idx = 1\n node => this%head\n do while (associated(node))\n if (node%item == item) return\n node => node%next\n idx = idx+1\n end do\n idx = -1\n end\n\n function last_index_of(this,item) result(idx)\n class(t_linked_list), intent(in) :: this\n integer, intent(in) :: item\n integer :: idx\n type(t_node), pointer :: node\n idx = this%num\n node => this%tail\n do while (associated(node))\n if (node%item == item) return\n node => node%prev\n idx = idx-1\n end do\n idx = -1\n end\n\n integer function size_of(this)\n class(t_linked_list), intent(in) :: this\n size_of = this%num\n end\n\nend module mod_linked_list\n\nprogram tokaido\n use mod_linked_list\n implicit none\n integer :: n, m, a(200000) = 0, x, s = 0, d, i, j\n integer :: dp(0:1000000) = 0, tmp\n type(t_linked_list) :: deque, tmp1, tmp2\n read(*,*) n\n read(*,*) a(1:n-1)\n if (n > 3) s = sum(a(3:n-1))\n d = a(1)-a(2)\n do i = 0, s-1\n call deque%add_last(i)\n end do\n do i = 3, n-1\n do j = 0, a(i)\n call tmp1%add_last(deque%peek_first())\n call tmp2%add_last(deque%poll_first())\n end do\n do j = 0, a(i)\n call deque%add_first(tmp1%poll_last())\n end do\n tmp = tmp2%poll_first()\n do j = 1, a(i)\n call deque%add_first(tmp2%poll_first())\n tmp = deque%poll_last()\n end do\n end do\n do i = 0, s-1\n dp(i) = deque%poll_first()\n end do\n read(*,*) m\n do i = 1, m\n read(*,*) x\n if (x >= s) then\n write(*,'(i0)') x-s+d\n cycle\n end if\n write(*,'(i0)') dp(x)+d\n end do\nend program tokaido", "language": "Fortran", "metadata": {"date": 1567656774, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03916.html", "problem_id": "p03916", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03916/input.txt", "sample_output_relpath": "derived/input_output/data/p03916/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03916/Fortran/s608868112.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s608868112", "user_id": "u506403362"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "module mod_linked_list\n implicit none\n\n type t_node\n private\n integer :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n\n type t_linked_list\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: add_first => add_first\n procedure :: add_last => add_last\n procedure :: poll_first => poll_first\n procedure :: poll_last => poll_last\n procedure :: peek_first => peek_first\n procedure :: peek_last => peek_last\n procedure :: clear => clear\n procedure :: get => get\n procedure :: remove => remove\n procedure :: replace => replace\n procedure :: first_index_of => first_index_of\n procedure :: last_index_of => last_index_of\n procedure :: size => size_of\n end type t_linked_list\n\ncontains\n\n function new_node(item) result(node)\n integer, intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n\n subroutine add_first(this,item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%tail)) then\n node%next => this%head\n this%head%prev => node\n else\n this%tail => node\n end if\n this%head => node\n this%num = this%num+1\n end\n\n subroutine add_last(this,item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n\n function poll_first(this) result(item)\n class(t_linked_list), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n item = this%head%item\n node => this%head%next\n deallocate(this%head)\n this%head => node\n if (associated(node)) then\n node%prev => null()\n else\n this%tail => null()\n end if\n this%num = this%num-1\n end\n\n function poll_last(this) result(item)\n class(t_linked_list), intent(inout) :: this\n integer :: item\n type(t_node), pointer :: node\n item = this%tail%item\n node => this%tail%prev\n deallocate(this%tail)\n this%tail => node\n if (associated(node)) then\n node%next => null()\n else\n this%head => null()\n end if\n this%num = this%num-1\n end\n\n function peek_first(this) result(item)\n class(t_linked_list), intent(in) :: this\n integer :: item\n item = this%head%item\n end\n\n function peek_last(this) result(item)\n class(t_linked_list), intent(in) :: this\n integer :: item\n item = this%tail%item\n end\n\n subroutine clear(this)\n class(t_linked_list), intent(inout) :: this\n type(t_node), pointer :: node, next\n if (.not.associated(this%head)) return\n node => this%head\n do while (associated(node%next))\n next => node%next\n deallocate(node)\n node => next\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n\n function get(this,i) result(item)\n class(t_linked_list), intent(in) :: this\n integer, intent(in) :: i\n integer :: item, idx\n type(t_node), pointer :: node\n if (i <= (this%num+1)/2) then\n idx = 1\n node => this%head\n do while (idx < i)\n node => node%next\n idx = idx+1\n end do\n else\n idx = this%num\n node => this%tail\n do while (idx > i)\n node => node%prev\n idx = idx-1\n end do\n end if\n item = node%item\n end\n\n function remove(this,i) result(item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: i\n integer :: item, idx\n type(t_node), pointer :: node\n if (i == 1) then\n item = poll_first(this)\n return\n end if\n if (i == this%num) then\n item = poll_last(this)\n return\n end if\n if (i <= (this%num+1)/2) then\n idx = 1\n node => this%head\n do while (idx < i)\n node => node%next\n idx = idx+1\n end do\n else\n idx = this%num\n node => this%tail\n do while (idx > i)\n node => node%prev\n idx = idx-1\n end do\n end if\n item = node%item\n node%prev%next => node%next\n node%next%prev => node%prev\n deallocate(node)\n this%num = this%num-1\n end\n\n subroutine replace(this,i,item)\n class(t_linked_list), intent(inout) :: this\n integer, intent(in) :: i, item\n integer :: idx\n type(t_node), pointer :: node\n if (i <= (this%num+1)/2) then\n idx = 1\n node => this%head\n do while (idx < i)\n node => node%next\n idx = idx+1\n end do\n else\n idx = this%num\n node => this%tail\n do while (idx > i)\n node => node%prev\n idx = idx-1\n end do\n end if\n node%item = item\n end\n\n subroutine show_all(this)\n type(t_linked_list), intent(in) :: this\n type(t_node), pointer :: node, next\n if (.not.associated(this%head)) return\n node => this%head\n write(*,'(i0)',advance='no') node%item\n do while (associated(node%next))\n node => node%next\n write(*,'(x,i0)',advance='no') node%item\n end do\n write(*,*)\n end\n\n function first_index_of(this,item) result(idx)\n class(t_linked_list), intent(in) :: this\n integer, intent(in) :: item\n integer :: idx\n type(t_node), pointer :: node\n idx = 1\n node => this%head\n do while (associated(node))\n if (node%item == item) return\n node => node%next\n idx = idx+1\n end do\n idx = -1\n end\n\n function last_index_of(this,item) result(idx)\n class(t_linked_list), intent(in) :: this\n integer, intent(in) :: item\n integer :: idx\n type(t_node), pointer :: node\n idx = this%num\n node => this%tail\n do while (associated(node))\n if (node%item == item) return\n node => node%prev\n idx = idx-1\n end do\n idx = -1\n end\n\n integer function size_of(this)\n class(t_linked_list), intent(in) :: this\n size_of = this%num\n end\n\nend module mod_linked_list\n\nprogram tokaido\n use mod_linked_list\n implicit none\n integer :: n, m, a(200000) = 0, x, s = 0, d, i, j\n integer :: dp(0:1000000) = 0, tmp\n type(t_linked_list) :: deque, tmp1, tmp2\n read(*,*) n\n read(*,*) a(1:n-1)\n if (n > 3) s = sum(a(3:n-1))\n d = a(1)-a(2)\n do i = 0, s-1\n call deque%add_last(i)\n end do\n do i = 3, n-1\n do j = 0, a(i)\n call tmp1%add_last(deque%peek_first())\n call tmp2%add_last(deque%poll_first())\n end do\n do j = 0, a(i)\n call deque%add_first(tmp1%poll_last())\n end do\n tmp = tmp2%poll_first()\n do j = 1, a(i)\n call deque%add_first(tmp2%poll_first())\n tmp = deque%poll_last()\n end do\n end do\n do i = 0, s-1\n dp(i) = deque%poll_first()\n end do\n read(*,*) m\n do i = 1, m\n read(*,*) x\n if (x >= s) then\n write(*,'(i0)') x-s+d\n cycle\n end if\n write(*,'(i0)') dp(x)+d\n end do\nend program tokaido", "problem_context": "Score : 1600 points\n\nProblem Statement\n\nThere are N squares in a row, numbered 1 through N from left to right.\nSnuke and Rng are playing a board game using these squares, described below:\n\nFirst, Snuke writes an integer into each square.\n\nEach of the two players possesses one piece. Snuke places his piece onto square 1, and Rng places his onto square 2.\n\nThe player whose piece is to the left of the opponent's, moves his piece. The destination must be a square to the right of the square where the piece is currently placed, and must not be a square where the opponent's piece is placed.\n\nRepeat step 3. When the pieces cannot be moved any more, the game ends.\n\nThe score of each player is calculated as the sum of the integers written in the squares where the player has placed his piece before the end of the game.\n\nSnuke has already written an integer A_i into square i (1≦i≦N-1), but not into square N yet.\nHe has decided to calculate for each of M integers X_1,X_2,...,X_M, if he writes it into square N and the game is played, what the value \"(Snuke's score) - (Rng's score)\" will be.\nHere, it is assumed that each player moves his piece to maximize the value \"(the player's score) - (the opponent's score)\".\n\nConstraints\n\n3≦N≦200,000\n\n0≦A_i≦10^6\n\nThe sum of all A_i is at most 10^6.\n\n1≦M≦200,000\n\n0≦X_i≦10^9\n\nPartial Scores\n\n700 points will be awarded for passing the test set satisfying M=1.\n\nAdditional 900 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N-1}\nM\nX_1\nX_2\n:\nX_M\n\nOutput\n\nFor each of the M integers X_1, ..., X_M, print the value \"(Snuke's score) - (Rng's score)\" if it is written into square N, one per line.\n\nSample Input 1\n\n5\n2 7 1 8\n1\n2\n\nSample Output 1\n\n0\n\nThe game proceeds as follows, where S represents Snuke's piece, and R represents Rng's.\n\nBoth player scores 10, thus \"(Snuke's score) - (Rng's score)\" is 0.\n\nSample Input 2\n\n9\n2 0 1 6 1 1 2 6\n5\n2016\n1\n1\n2\n6\n\nSample Output 2\n\n2001\n6\n6\n7\n7", "sample_input": "5\n2 7 1 8\n1\n2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03916", "source_text": "Score : 1600 points\n\nProblem Statement\n\nThere are N squares in a row, numbered 1 through N from left to right.\nSnuke and Rng are playing a board game using these squares, described below:\n\nFirst, Snuke writes an integer into each square.\n\nEach of the two players possesses one piece. Snuke places his piece onto square 1, and Rng places his onto square 2.\n\nThe player whose piece is to the left of the opponent's, moves his piece. The destination must be a square to the right of the square where the piece is currently placed, and must not be a square where the opponent's piece is placed.\n\nRepeat step 3. When the pieces cannot be moved any more, the game ends.\n\nThe score of each player is calculated as the sum of the integers written in the squares where the player has placed his piece before the end of the game.\n\nSnuke has already written an integer A_i into square i (1≦i≦N-1), but not into square N yet.\nHe has decided to calculate for each of M integers X_1,X_2,...,X_M, if he writes it into square N and the game is played, what the value \"(Snuke's score) - (Rng's score)\" will be.\nHere, it is assumed that each player moves his piece to maximize the value \"(the player's score) - (the opponent's score)\".\n\nConstraints\n\n3≦N≦200,000\n\n0≦A_i≦10^6\n\nThe sum of all A_i is at most 10^6.\n\n1≦M≦200,000\n\n0≦X_i≦10^9\n\nPartial Scores\n\n700 points will be awarded for passing the test set satisfying M=1.\n\nAdditional 900 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N-1}\nM\nX_1\nX_2\n:\nX_M\n\nOutput\n\nFor each of the M integers X_1, ..., X_M, print the value \"(Snuke's score) - (Rng's score)\" if it is written into square N, one per line.\n\nSample Input 1\n\n5\n2 7 1 8\n1\n2\n\nSample Output 1\n\n0\n\nThe game proceeds as follows, where S represents Snuke's piece, and R represents Rng's.\n\nBoth player scores 10, thus \"(Snuke's score) - (Rng's score)\" is 0.\n\nSample Input 2\n\n9\n2 0 1 6 1 1 2 6\n5\n2016\n1\n1\n2\n6\n\nSample Output 2\n\n2001\n6\n6\n7\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7066, "cpu_time_ms": 433, "memory_kb": 66136}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s971882483", "group_id": "codeNet:p03943", "input_text": "program main\nread*,i,j,k\nif(mod(i+j+k,2)==0)then\nprint*,\"Yes\"\nelse\nprint*,\"No\"\nendif\nend program main", "language": "Fortran", "metadata": {"date": 1575406698, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03943.html", "problem_id": "p03943", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03943/input.txt", "sample_output_relpath": "derived/input_output/data/p03943/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03943/Fortran/s971882483.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971882483", "user_id": "u952130512"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\nread*,i,j,k\nif(mod(i+j+k,2)==0)then\nprint*,\"Yes\"\nelse\nprint*,\"No\"\nendif\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s530402060", "group_id": "codeNet:p03944", "input_text": "program main\n implicit none\n \n integer :: h,w,n,xmin=200,xmax=0,ymin=200,ymax=0,i,x,y,a\n \n read(*,*)w,h,n\n do i = 1, n\n read(*,*)x,y,a\n if (a == 1) then\n if (x < xmin) then\n xmin = x\n end if\n else if (a == 2) then\n if (x > xmax) then\n xmax = x\n end if\n else if (a == 3) then\n if (y < ymin) then\n ymin = y\n end if\n else if (a == 4) then\n if (y > ymax) then\n ymax = y\n end if\n end if\n end do\n \n if ((xmin > xmax) .or. (ymin > ymax)) then\n write(*,*)0\n else\n write(*,*)(xmax - xmin)*(ymax - ymin)\n end if\nend program main", "language": "Fortran", "metadata": {"date": 1572455926, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03944.html", "problem_id": "p03944", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03944/input.txt", "sample_output_relpath": "derived/input_output/data/p03944/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03944/Fortran/s530402060.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s530402060", "user_id": "u287431190"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n \n integer :: h,w,n,xmin=200,xmax=0,ymin=200,ymax=0,i,x,y,a\n \n read(*,*)w,h,n\n do i = 1, n\n read(*,*)x,y,a\n if (a == 1) then\n if (x < xmin) then\n xmin = x\n end if\n else if (a == 2) then\n if (x > xmax) then\n xmax = x\n end if\n else if (a == 3) then\n if (y < ymin) then\n ymin = y\n end if\n else if (a == 4) then\n if (y > ymax) then\n ymax = y\n end if\n end if\n end do\n \n if ((xmin > xmax) .or. (ymin > ymax)) then\n write(*,*)0\n else\n write(*,*)(xmax - xmin)*(ymax - ymin)\n end if\nend program main", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "sample_input": "5 4 2\n2 1 1\n3 3 4\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03944", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s972758453", "group_id": "codeNet:p03944", "input_text": "program main\n implicit none\n integer w,h,n,x,y,a,i\n integer,allocatable::m(:,:)\n read*,w,h,n\n allocate(m(w,h))\n m=1;\n do i=1,n\n read*,x,y,a\n if(a==1) then\n m(1:x,:)=0\n elseif(a==2)then\n\tm(x+1:w,:)=0\n elseif(a==3)then\n\tm(:,1:y)=0\n else\n m(:,y+1:h)=0\n end if\n\n end do\n print*,sum(m)\nend program main\n", "language": "Fortran", "metadata": {"date": 1478485424, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03944.html", "problem_id": "p03944", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03944/input.txt", "sample_output_relpath": "derived/input_output/data/p03944/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03944/Fortran/s972758453.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972758453", "user_id": "u017744950"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n integer w,h,n,x,y,a,i\n integer,allocatable::m(:,:)\n read*,w,h,n\n allocate(m(w,h))\n m=1;\n do i=1,n\n read*,x,y,a\n if(a==1) then\n m(1:x,:)=0\n elseif(a==2)then\n\tm(x+1:w,:)=0\n elseif(a==3)then\n\tm(:,1:y)=0\n else\n m(:,y+1:h)=0\n end if\n\n end do\n print*,sum(m)\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "sample_input": "5 4 2\n2 1 1\n3 3 4\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03944", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 9, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s633437136", "group_id": "codeNet:p03946", "input_text": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,t,i,num,dp,ans=0\ninteger,allocatable :: a(:)\n\nread(*,*) n,t\nallocate(a(n))\nread(*,*) (a(i), i=1,n)\n\ndp = 0\nnum = 1\ndo i = 1,n\n call chmax(dp,maxval(a(i:n))-a(i),num,i)\nend do\n\ndo i = 1,n\n if(maxval(a(i:n))-a(i) == dp)then\n ans = ans + 1\n end if\nend do\n\nwrite(*,'(i0)') ans\n\ncontains\n!!!!!! サブルーチンは↓\nsubroutine chmax(dp,x,num,i)\nimplicit none\ninteger :: dp, x, num, i\n\nif (dp < x) then\n dp = x\n num = i\n return\nend if\n\nend subroutine\n!!!!!!\n\nEND PROGRAM ATCODER", "language": "Fortran", "metadata": {"date": 1553280408, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03946.html", "problem_id": "p03946", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03946/input.txt", "sample_output_relpath": "derived/input_output/data/p03946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03946/Fortran/s633437136.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s633437136", "user_id": "u454557108"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "PROGRAM ATCODER\n\nimplicit none\ninteger :: n,t,i,num,dp,ans=0\ninteger,allocatable :: a(:)\n\nread(*,*) n,t\nallocate(a(n))\nread(*,*) (a(i), i=1,n)\n\ndp = 0\nnum = 1\ndo i = 1,n\n call chmax(dp,maxval(a(i:n))-a(i),num,i)\nend do\n\ndo i = 1,n\n if(maxval(a(i:n))-a(i) == dp)then\n ans = ans + 1\n end if\nend do\n\nwrite(*,'(i0)') ans\n\ncontains\n!!!!!! サブルーチンは↓\nsubroutine chmax(dp,x,num,i)\nimplicit none\ninteger :: dp, x, num, i\n\nif (dp < x) then\n dp = x\n num = i\n return\nend if\n\nend subroutine\n!!!!!!\n\nEND PROGRAM ATCODER", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "sample_input": "3 2\n100 50 200\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03946", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.\n\nTakahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:\n\nMove: When at town i (i < N), move to town i + 1.\n\nMerchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.\n\nFor some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)\n\nDuring the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.\n\nAoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.\n\nAoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nA_i are distinct.\n\n2 ≦ T ≦ 10^9\n\nIn the initial state, Takahashi's expected profit is at least 1 yen.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN T\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.\n\nSample Input 1\n\n3 2\n100 50 200\n\nSample Output 1\n\n1\n\nIn the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:\n\nMove from town 1 to town 2.\n\nBuy one apple for 50 yen at town 2.\n\nMove from town 2 to town 3.\n\nSell one apple for 200 yen at town 3.\n\nIf, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.\n\nThere are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.\n\nSample Input 2\n\n5 8\n50 30 40 10 20\n\nSample Output 2\n\n2\n\nSample Input 3\n\n10 100\n7 10 4 5 9 3 6 8 2 1\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 529, "cpu_time_ms": 2103, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s396235614", "group_id": "codeNet:p03951", "input_text": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,m,n\n \n \n read(*,*) n\n read(*,*)s\n read(*,*)t\n \n do i=1,n,-1\n if(s(n+1-i:n) .eq. t(1:i))then\n m=2*n-i\n write(*,*) m\n stop\n end if\n enddo\n write(*,*) n\n \n stop\nend program sample\n \n\n", "language": "Fortran", "metadata": {"date": 1595456619, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03951.html", "problem_id": "p03951", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03951/input.txt", "sample_output_relpath": "derived/input_output/data/p03951/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03951/Fortran/s396235614.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s396235614", "user_id": "u713568912"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program sample\n implicit none\n character(100)::s,t\n integer(8) :: i,j,m,n\n \n \n read(*,*) n\n read(*,*)s\n read(*,*)t\n \n do i=1,n,-1\n if(s(n+1-i:n) .eq. t(1:i))then\n m=2*n-i\n write(*,*) m\n stop\n end if\n enddo\n write(*,*) n\n \n stop\nend program sample\n \n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke is interested in strings that satisfy the following conditions:\n\nThe length of the string is at least N.\n\nThe first N characters equal to the string s.\n\nThe last N characters equal to the string t.\n\nFind the length of the shortest string that satisfies the conditions.\n\nConstraints\n\n1≤N≤100\n\nThe lengths of s and t are both N.\n\ns and t consist of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\nt\n\nOutput\n\nPrint the length of the shortest string that satisfies the conditions.\n\nSample Input 1\n\n3\nabc\ncde\n\nSample Output 1\n\n5\n\nThe shortest string is abcde.\n\nSample Input 2\n\n1\na\nz\n\nSample Output 2\n\n2\n\nThe shortest string is az.\n\nSample Input 3\n\n4\nexpr\nexpr\n\nSample Output 3\n\n4\n\nThe shortest string is expr.", "sample_input": "3\nabc\ncde\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03951", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke is interested in strings that satisfy the following conditions:\n\nThe length of the string is at least N.\n\nThe first N characters equal to the string s.\n\nThe last N characters equal to the string t.\n\nFind the length of the shortest string that satisfies the conditions.\n\nConstraints\n\n1≤N≤100\n\nThe lengths of s and t are both N.\n\ns and t consist of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\nt\n\nOutput\n\nPrint the length of the shortest string that satisfies the conditions.\n\nSample Input 1\n\n3\nabc\ncde\n\nSample Output 1\n\n5\n\nThe shortest string is abcde.\n\nSample Input 2\n\n1\na\nz\n\nSample Output 2\n\n2\n\nThe shortest string is az.\n\nSample Input 3\n\n4\nexpr\nexpr\n\nSample Output 3\n\n4\n\nThe shortest string is expr.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 5, "memory_kb": 2768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s513457822", "group_id": "codeNet:p03952", "input_text": "program\tmain\n implicit none\n integer n,x,i\n read*,n,x\n if(x= a+b) then\n yes = .false.\n else if (s(i:i) == 'a') then\n yes = .true.\n qualifier=qualifier+1\n else if (s(i:i) == 'b') then\n if (foregin_qualifier >= b) then\n yes = .false.\n else\n yes = .true.\n qualifier=qualifier+1\n foregin_qualifier=foregin_qualifier+1\n end if\n else\n yes = .false.\n end if\n\n if (yes) then\n print'(a)', 'Yes'\n else\n print'(a)', 'No'\n end if\n end do\nend program codefestival2016qualb", "language": "Fortran", "metadata": {"date": 1589507740, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03971.html", "problem_id": "p03971", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03971/input.txt", "sample_output_relpath": "derived/input_output/data/p03971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03971/Fortran/s048016940.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s048016940", "user_id": "u234636620"}, "prompt_components": {"gold_output": "Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "program codefestival2016qualb\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: n,a,b,i\n integer(int32):: qualifier, foregin_qualifier\n character(:),allocatable:: s\n logical:: yes\n\n read*, n,a,b\n allocate(character(n):: s)\n read*, s\n qualifier = 0\n foregin_qualifier = 0\n\n do i=1,n\n if (qualifier >= a+b) then\n yes = .false.\n else if (s(i:i) == 'a') then\n yes = .true.\n qualifier=qualifier+1\n else if (s(i:i) == 'b') then\n if (foregin_qualifier >= b) then\n yes = .false.\n else\n yes = .true.\n qualifier=qualifier+1\n foregin_qualifier=foregin_qualifier+1\n end if\n else\n yes = .false.\n end if\n\n if (yes) then\n print'(a)', 'Yes'\n else\n print'(a)', 'No'\n end if\n end do\nend program codefestival2016qualb", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nNo", "sample_input": "10 2 3\nabccabaabb\n"}, "reference_outputs": ["Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n"], "source_document_id": "p03971", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s449744604", "group_id": "codeNet:p03986", "input_text": "program agc005_a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: i,n,ans\n integer(int32), allocatable:: cnt(:)\n character(200000):: x\n\n read*, x\n n = len_trim(x)\n allocate(cnt(0:n), source=0)\n ans = n\n do i=1, n\n if (x(i:i) == 'S') then\n cnt(i)=cnt(i-1)+1\n else\n cnt(i)=max(cnt(i-1)-1,0)\n if (cnt(i-1) >= 1) ans=ans-2\n end if\n end do\n ! print'(*(i0,1x))', cnt(:)\n print'(i0)', ans\nend program agc005_a", "language": "Fortran", "metadata": {"date": 1591317415, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03986.html", "problem_id": "p03986", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03986/input.txt", "sample_output_relpath": "derived/input_output/data/p03986/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03986/Fortran/s449744604.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s449744604", "user_id": "u234636620"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program agc005_a\n use,intrinsic :: iso_fortran_env\n implicit none\n integer(int32):: i,n,ans\n integer(int32), allocatable:: cnt(:)\n character(200000):: x\n\n read*, x\n n = len_trim(x)\n allocate(cnt(0:n), source=0)\n ans = n\n do i=1, n\n if (x(i:i) == 'S') then\n cnt(i)=cnt(i-1)+1\n else\n cnt(i)=max(cnt(i-1)-1,0)\n if (cnt(i-1) >= 1) ans=ans-2\n end if\n end do\n ! print'(*(i0,1x))', cnt(:)\n print'(i0)', ans\nend program agc005_a", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a string X, which has an even number of characters. Half the characters are S, and the other half are T.\n\nTakahashi, who hates the string ST, will perform the following operation 10^{10000} times:\n\nAmong the occurrences of ST in X as (contiguous) substrings, remove the leftmost one. If there is no occurrence, do nothing.\n\nFind the eventual length of X.\n\nConstraints\n\n2 ≦ |X| ≦ 200,000\n\nThe length of X is even.\n\nHalf the characters in X are S, and the other half are T.\n\nPartial Scores\n\nIn test cases worth 200 points, |X| ≦ 200.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the eventual length of X.\n\nSample Input 1\n\nTSTTSS\n\nSample Output 1\n\n4\n\nIn the 1-st operation, the 2-nd and 3-rd characters of TSTTSS are removed.\nX becomes TTSS, and since it does not contain ST anymore, nothing is done in the remaining 10^{10000}-1 operations.\nThus, the answer is 4.\n\nSample Input 2\n\nSSTTST\n\nSample Output 2\n\n0\n\nX will eventually become an empty string: SSTTST ⇒ STST ⇒ ST ⇒ ``.\n\nSample Input 3\n\nTSSTTTSS\n\nSample Output 3\n\n4\n\nX will become: TSSTTTSS ⇒ TSTTSS ⇒ TTSS.", "sample_input": "TSTTSS\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03986", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a string X, which has an even number of characters. Half the characters are S, and the other half are T.\n\nTakahashi, who hates the string ST, will perform the following operation 10^{10000} times:\n\nAmong the occurrences of ST in X as (contiguous) substrings, remove the leftmost one. If there is no occurrence, do nothing.\n\nFind the eventual length of X.\n\nConstraints\n\n2 ≦ |X| ≦ 200,000\n\nThe length of X is even.\n\nHalf the characters in X are S, and the other half are T.\n\nPartial Scores\n\nIn test cases worth 200 points, |X| ≦ 200.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the eventual length of X.\n\nSample Input 1\n\nTSTTSS\n\nSample Output 1\n\n4\n\nIn the 1-st operation, the 2-nd and 3-rd characters of TSTTSS are removed.\nX becomes TTSS, and since it does not contain ST anymore, nothing is done in the remaining 10^{10000}-1 operations.\nThus, the answer is 4.\n\nSample Input 2\n\nSSTTST\n\nSample Output 2\n\n0\n\nX will eventually become an empty string: SSTTST ⇒ STST ⇒ ST ⇒ ``.\n\nSample Input 3\n\nTSSTTTSS\n\nSample Output 3\n\n4\n\nX will become: TSSTTTSS ⇒ TSTTSS ⇒ TTSS.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 513, "cpu_time_ms": 5, "memory_kb": 1548}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s818977500", "group_id": "codeNet:p03988", "input_text": "program tree_restoring\n implicit none\n integer :: n, a(100), i\n a = 0\n read(*,*) n\n if (n.eq.2) then\n write(*,'(a)') \"Possible\"\n stop\n end if\n read(*,*) a(1:n)\n call quick_sort(a(1:n))\n do i = 2, n\n if (a(i).ne.a(i-1).and.a(i).ne.a(i-1)+1) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n end do\n if (a(n).ne.a(n-1)) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n if (a(1).ne.(a(n)+1)/2) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n if (mod(a(n),2).eq.0) then\n if (a(1).eq.a(2)) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n else\n if (a(1).ne.a(2)) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n end if\n write(*,'(a)') \"Possible\"\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: n, l, r, p, c\n n = size(a)\n l = 1\n r = n\n p = a((l+r)/2)+a(l)+a(r)-max(a((l+r)/2),a(l),a(r))-min(a((l+r)/2),a(l),a(r))\n do\n do while (a(l).lt.p)\n l = l+1\n end do\n do while (a(r).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1))\n if (n.gt.r+1) call quick_sort(a(r+1:n))\n return\n end subroutine quick_sort\nend program tree_restoring", "language": "Fortran", "metadata": {"date": 1562600424, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03988.html", "problem_id": "p03988", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03988/input.txt", "sample_output_relpath": "derived/input_output/data/p03988/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03988/Fortran/s818977500.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s818977500", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "program tree_restoring\n implicit none\n integer :: n, a(100), i\n a = 0\n read(*,*) n\n if (n.eq.2) then\n write(*,'(a)') \"Possible\"\n stop\n end if\n read(*,*) a(1:n)\n call quick_sort(a(1:n))\n do i = 2, n\n if (a(i).ne.a(i-1).and.a(i).ne.a(i-1)+1) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n end do\n if (a(n).ne.a(n-1)) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n if (a(1).ne.(a(n)+1)/2) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n if (mod(a(n),2).eq.0) then\n if (a(1).eq.a(2)) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n else\n if (a(1).ne.a(2)) then\n write(*,'(a)') \"Impossible\"\n stop\n end if\n end if\n write(*,'(a)') \"Possible\"\n stop\ncontains\n recursive subroutine quick_sort(a)\n implicit none\n integer, intent(inout) :: a(:)\n integer :: n, l, r, p, c\n n = size(a)\n l = 1\n r = n\n p = a((l+r)/2)+a(l)+a(r)-max(a((l+r)/2),a(l),a(r))-min(a((l+r)/2),a(l),a(r))\n do\n do while (a(l).lt.p)\n l = l+1\n end do\n do while (a(r).gt.p)\n r = r-1\n end do\n if (l.ge.r) exit\n c = a(l)\n a(l) = a(r)\n a(r) = c\n l = l+1\n r = r-1\n end do\n if (l.gt.2) call quick_sort(a(1:l-1))\n if (n.gt.r+1) call quick_sort(a(r+1:n))\n return\n end subroutine quick_sort\nend program tree_restoring", "problem_context": "Score : 700 points\n\nProblem Statement\n\nAoki loves numerical sequences and trees.\n\nOne day, Takahashi gave him an integer sequence of length N, a_1, a_2, ..., a_N, which made him want to construct a tree.\n\nAoki wants to construct a tree with N vertices numbered 1 through N, such that for each i = 1,2,...,N, the distance between vertex i and the farthest vertex from it is a_i, assuming that the length of each edge is 1.\n\nDetermine whether such a tree exists.\n\nConstraints\n\n2 ≦ N ≦ 100\n\n1 ≦ a_i ≦ N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf there exists a tree that satisfies the condition, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n5\n3 2 2 3 3\n\nSample Output 1\n\nPossible\n\nThe diagram above shows an example of a tree that satisfies the conditions. The red arrows show paths from each vertex to the farthest vertex from it.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n10\n1 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\nPossible\n\nSample Input 4\n\n10\n1 1 2 2 2 2 2 2 2 2\n\nSample Output 4\n\nImpossible\n\nSample Input 5\n\n6\n1 1 1 1 1 5\n\nSample Output 5\n\nImpossible\n\nSample Input 6\n\n5\n4 3 2 3 4\n\nSample Output 6\n\nPossible", "sample_input": "5\n3 2 2 3 3\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03988", "source_text": "Score : 700 points\n\nProblem Statement\n\nAoki loves numerical sequences and trees.\n\nOne day, Takahashi gave him an integer sequence of length N, a_1, a_2, ..., a_N, which made him want to construct a tree.\n\nAoki wants to construct a tree with N vertices numbered 1 through N, such that for each i = 1,2,...,N, the distance between vertex i and the farthest vertex from it is a_i, assuming that the length of each edge is 1.\n\nDetermine whether such a tree exists.\n\nConstraints\n\n2 ≦ N ≦ 100\n\n1 ≦ a_i ≦ N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf there exists a tree that satisfies the condition, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n5\n3 2 2 3 3\n\nSample Output 1\n\nPossible\n\nThe diagram above shows an example of a tree that satisfies the conditions. The red arrows show paths from each vertex to the farthest vertex from it.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n10\n1 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\nPossible\n\nSample Input 4\n\n10\n1 1 2 2 2 2 2 2 2 2\n\nSample Output 4\n\nImpossible\n\nSample Input 5\n\n6\n1 1 1 1 1 5\n\nSample Output 5\n\nImpossible\n\nSample Input 6\n\n5\n4 3 2 3 4\n\nSample Output 6\n\nPossible", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1357, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s361767211", "group_id": "codeNet:p03992", "input_text": "program sample\nimplicit none\ncharacter(len=13) :: x,y\ninteger(8) :: i,j\nreal(8),allocatable :: a(:),b(:)\n\nread(*,*) x\n\ndo i=13,6,-1\nx(i:i)=x(i-1:i-1)\nend do\n\nx(5:5)=' '\n\nwrite(*,*) trim(x)\n!write(*,*) a\n\nend program sample", "language": "Fortran", "metadata": {"date": 1595035988, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03992.html", "problem_id": "p03992", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03992/input.txt", "sample_output_relpath": "derived/input_output/data/p03992/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03992/Fortran/s361767211.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s361767211", "user_id": "u323210830"}, "prompt_components": {"gold_output": "CODE FESTIVAL\n", "input_to_evaluate": "program sample\nimplicit none\ncharacter(len=13) :: x,y\ninteger(8) :: i,j\nreal(8),allocatable :: a(:),b(:)\n\nread(*,*) x\n\ndo i=13,6,-1\nx(i:i)=x(i-1:i-1)\nend do\n\nx(5:5)=' '\n\nwrite(*,*) trim(x)\n!write(*,*) a\n\nend program sample", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["CODE FESTIVAL\n"], "source_document_id": "p03992", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 222, "cpu_time_ms": 8, "memory_kb": 2692}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s466742771", "group_id": "codeNet:p03992", "input_text": "character s*12\nread*, s\nprint '(a4,1x,a8)', s(:4),s(5:)\nend", "language": "Fortran", "metadata": {"date": 1571907162, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03992.html", "problem_id": "p03992", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03992/input.txt", "sample_output_relpath": "derived/input_output/data/p03992/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03992/Fortran/s466742771.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466742771", "user_id": "u244203620"}, "prompt_components": {"gold_output": "CODE FESTIVAL\n", "input_to_evaluate": "character s*12\nread*, s\nprint '(a4,1x,a8)', s(:4),s(5:)\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["CODE FESTIVAL\n"], "source_document_id": "p03992", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 59, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s867203184", "group_id": "codeNet:p03993", "input_text": "program prob3\n implicit none\n integer :: N, i, ans\n integer, allocatable :: a(:)\n read(*,*) N\n allocate(a(N))\n read(*,*) a\n ans = 0\n do i = 1, N\n if(a(a(i)) == i)then\n ans = ans + 1\n end if\n end do\n ans = ans / 2\n write(*,*) ans\n\n\n\n deallocate(a)\n\n stop\ncontains\nend program prob3", "language": "Fortran", "metadata": {"date": 1595639528, "filename_ext": "f", "original_language": "Fortran (GNU Fortran 9.2.1)", "problem_description_relpath": "problem_descriptions/p03993.html", "problem_id": "p03993", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03993/input.txt", "sample_output_relpath": "derived/input_output/data/p03993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03993/Fortran/s867203184.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s867203184", "user_id": "u478462004"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program prob3\n implicit none\n integer :: N, i, ans\n integer, allocatable :: a(:)\n read(*,*) N\n allocate(a(N))\n read(*,*) a\n ans = 0\n do i = 1, N\n if(a(a(i)) == i)then\n ans = ans + 1\n end if\n end do\n ans = ans / 2\n write(*,*) ans\n\n\n\n deallocate(a)\n\n stop\ncontains\nend program prob3", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "sample_input": "4\n2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03993", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 35, "memory_kb": 3468}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s334940925", "group_id": "codeNet:p03994", "input_text": "program codefestival_2016_qualA_c\n use,intrinsic :: iso_fortran_env\n implicit none\n character(1000000):: s\n integer(int64):: k,n,i,cost,nind\n\n read*, s\n n = len_trim(s)\n read*, k\n\n do i=1,n\n if (s(i:i) == 'a') cycle\n cost = 1+ichar('z') - ichar(s(i:i))\n if (cost <= k) then\n s(i:i) = 'a'\n k=k-cost\n end if\n end do\n nind = (ichar(s(n:n)) - ichar('a'))\n \n s(n:n) = char(mod(nind+k, 26_8) + ichar('a'))\n\n print'(a)', trim(s)\nend program codefestival_2016_qualA_c", "language": "Fortran", "metadata": {"date": 1591386229, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03994.html", "problem_id": "p03994", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03994/input.txt", "sample_output_relpath": "derived/input_output/data/p03994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03994/Fortran/s334940925.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334940925", "user_id": "u234636620"}, "prompt_components": {"gold_output": "aya\n", "input_to_evaluate": "program codefestival_2016_qualA_c\n use,intrinsic :: iso_fortran_env\n implicit none\n character(1000000):: s\n integer(int64):: k,n,i,cost,nind\n\n read*, s\n n = len_trim(s)\n read*, k\n\n do i=1,n\n if (s(i:i) == 'a') cycle\n cost = 1+ichar('z') - ichar(s(i:i))\n if (cost <= k) then\n s(i:i) = 'a'\n k=k-cost\n end if\n end do\n nind = (ichar(s(n:n)) - ichar('a'))\n \n s(n:n) = char(mod(nind+k, 26_8) + ichar('a'))\n\n print'(a)', trim(s)\nend program codefestival_2016_qualA_c", "problem_context": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "sample_input": "xyz\n4\n"}, "reference_outputs": ["aya\n"], "source_document_id": "p03994", "source_text": "Score : 400 points\n\nProblem Statement\n\nMr. Takahashi has a string s consisting of lowercase English letters.\nHe repeats the following operation on s exactly K times.\n\nChoose an arbitrary letter on s and change that letter to the next alphabet. Note that the next letter of z is a.\n\nFor example, if you perform an operation for the second letter on aaz, aaz becomes abz.\nIf you then perform an operation for the third letter on abz, abz becomes aba.\n\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.\nFind the such string.\n\nConstraints\n\n1≤|s|≤10^5\n\nAll letters in s are lowercase English letters.\n\n1≤K≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the lexicographically smallest string after performing exactly K operations on s.\n\nSample Input 1\n\nxyz\n4\n\nSample Output 1\n\naya\n\nFor example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.\n\nSample Input 2\n\na\n25\n\nSample Output 2\n\nz\n\nYou have to perform exactly K operations.\n\nSample Input 3\n\ncodefestival\n100\n\nSample Output 3\n\naaaafeaaivap", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 548, "cpu_time_ms": 4, "memory_kb": 1596}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s010772981", "group_id": "codeNet:p03996", "input_text": "program lru_puzzle\n implicit none\n integer :: n, m, q, a(100000) = 0, i, k\n integer :: x = 0, p(100000) = 0, r(100000) = 0, c(0:100000) = 0\n logical :: u(100000) = .false.\n read(*,*) n, m\n read(*,*) q\n read(*,*) a(1:q)\n do i = q, 1, -1\n if (u(a(i))) cycle\n x = x+1\n p(x) = a(i)\n u(a(i)) = .true.\n end do\n do i = 1, m\n if (u(i)) cycle\n x = x+1\n p(x) = i\n end do\n do i = 1, m\n r(p(i)) = i\n end do\n c(0) = n\n do i = q, 1, -1\n k = r(a(i))\n if (c(k-1) > 0) then\n c(k-1) = c(k-1)-1\n c(k) = c(k)+1\n end if\n end do\n k = 0\n do while (c(k) == 0)\n k = k+1\n end do\n do i = k+1, m-1\n if (p(i) > p(i+1)) then\n write(*,'(a)') \"No\"\n stop\n end if\n end do\n write(*,'(a)') \"Yes\"\nend program lru_puzzle", "language": "Fortran", "metadata": {"date": 1568001901, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03996.html", "problem_id": "p03996", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03996/input.txt", "sample_output_relpath": "derived/input_output/data/p03996/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03996/Fortran/s010772981.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010772981", "user_id": "u506403362"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program lru_puzzle\n implicit none\n integer :: n, m, q, a(100000) = 0, i, k\n integer :: x = 0, p(100000) = 0, r(100000) = 0, c(0:100000) = 0\n logical :: u(100000) = .false.\n read(*,*) n, m\n read(*,*) q\n read(*,*) a(1:q)\n do i = q, 1, -1\n if (u(a(i))) cycle\n x = x+1\n p(x) = a(i)\n u(a(i)) = .true.\n end do\n do i = 1, m\n if (u(i)) cycle\n x = x+1\n p(x) = i\n end do\n do i = 1, m\n r(p(i)) = i\n end do\n c(0) = n\n do i = q, 1, -1\n k = r(a(i))\n if (c(k-1) > 0) then\n c(k-1) = c(k-1)-1\n c(k) = c(k)+1\n end if\n end do\n k = 0\n do while (c(k) == 0)\n k = k+1\n end do\n do i = k+1, m-1\n if (p(i) > p(i+1)) then\n write(*,'(a)') \"No\"\n stop\n end if\n end do\n write(*,'(a)') \"Yes\"\nend program lru_puzzle", "problem_context": "Score : 1200 points\n\nProblem Statement\n\nThere are N arrays.\nThe length of each array is M and initially each array contains integers (1，2，...，M) in this order.\n\nMr. Takahashi has decided to perform Q operations on those N arrays.\nFor the i-th (1≤i≤Q) time, he performs the following operation.\n\nChoose an arbitrary array from the N arrays and move the integer a_i (1≤a_i≤M) to the front of that array. For example, after performing the operation on a_i=2 and the array (5，4，3，2，1), this array becomes (2，5，4，3，1).\n\nMr. Takahashi wants to make N arrays exactly the same after performing the Q operations.\nDetermine if it is possible or not.\n\nConstraints\n\n2≤N≤10^5\n\n2≤M≤10^5\n\n1≤Q≤10^5\n\n1≤a_i≤M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nQ\na_1 a_2 ... a_Q\n\nOutput\n\nPrint Yes if it is possible to make N arrays exactly the same after performing the Q operations.\nOtherwise, print No.\n\nSample Input 1\n\n2 2\n3\n2 1 2\n\nSample Output 1\n\nYes\n\nYou can perform the operations as follows.\n\nSample Input 2\n\n3 2\n3\n2 1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 3\n3\n3 2 1\n\nSample Output 3\n\nYes\n\nYou can perform the operations as follows.\n\nSample Input 4\n\n3 3\n6\n1 2 2 3 3 3\n\nSample Output 4\n\nNo", "sample_input": "2 2\n3\n2 1 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03996", "source_text": "Score : 1200 points\n\nProblem Statement\n\nThere are N arrays.\nThe length of each array is M and initially each array contains integers (1，2，...，M) in this order.\n\nMr. Takahashi has decided to perform Q operations on those N arrays.\nFor the i-th (1≤i≤Q) time, he performs the following operation.\n\nChoose an arbitrary array from the N arrays and move the integer a_i (1≤a_i≤M) to the front of that array. For example, after performing the operation on a_i=2 and the array (5，4，3，2，1), this array becomes (2，5，4，3，1).\n\nMr. Takahashi wants to make N arrays exactly the same after performing the Q operations.\nDetermine if it is possible or not.\n\nConstraints\n\n2≤N≤10^5\n\n2≤M≤10^5\n\n1≤Q≤10^5\n\n1≤a_i≤M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nQ\na_1 a_2 ... a_Q\n\nOutput\n\nPrint Yes if it is possible to make N arrays exactly the same after performing the Q operations.\nOtherwise, print No.\n\nSample Input 1\n\n2 2\n3\n2 1 2\n\nSample Output 1\n\nYes\n\nYou can perform the operations as follows.\n\nSample Input 2\n\n3 2\n3\n2 1 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n2 3\n3\n3 2 1\n\nSample Output 3\n\nYes\n\nYou can perform the operations as follows.\n\nSample Input 4\n\n3 3\n6\n1 2 2 3 3 3\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 766, "cpu_time_ms": 26, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s964049507", "group_id": "codeNet:p03997", "input_text": "program ABC045A\n implicit none\n integer(8)::a,b,h\n read(5,*)a,b,h\n print'(i0)',((a+b)*h)/2\nend program ABC045A", "language": "Fortran", "metadata": {"date": 1582422566, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03997/input.txt", "sample_output_relpath": "derived/input_output/data/p03997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03997/Fortran/s964049507.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s964049507", "user_id": "u414699019"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program ABC045A\n implicit none\n integer(8)::a,b,h\n read(5,*)a,b,h\n print'(i0)',((a+b)*h)/2\nend program ABC045A", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 7, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s040559345", "group_id": "codeNet:p03997", "input_text": "program atcoder\nimplicit none\ninteger :: a, b, h\n\nread(*,*) a, b, h\n\nwrite(*,'(i0)') (a+b)*h/2\n\nend program atcoder", "language": "Fortran", "metadata": {"date": 1551768831, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03997/input.txt", "sample_output_relpath": "derived/input_output/data/p03997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03997/Fortran/s040559345.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s040559345", "user_id": "u454557108"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program atcoder\nimplicit none\ninteger :: a, b, h\n\nread(*,*) a, b, h\n\nwrite(*,'(i0)') (a+b)*h/2\n\nend program atcoder", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s220010892", "group_id": "codeNet:p03997", "input_text": "implicit none\ninteger (8):: a,b,h\nread(*,*) a,b,h\nwrite(*,*) int( (a+b)*h/2 )\nend\n", "language": "Fortran", "metadata": {"date": 1525440686, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03997/input.txt", "sample_output_relpath": "derived/input_output/data/p03997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03997/Fortran/s220010892.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s220010892", "user_id": "u909643606"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "implicit none\ninteger (8):: a,b,h\nread(*,*) a,b,h\nwrite(*,*) int( (a+b)*h/2 )\nend\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s858358898", "group_id": "codeNet:p04001", "input_text": "integer,dimension(10,10)::a\ncharacter(11)S\ninteger(16) answer\nread*,S\na=0\ndo i=1,len_trim(S)\n\tdo j=i,len_trim(S)\n \tif(j==i)then\n \ta(i,j)=2**(i-1)\n else\n \ta(i,j)=2**(j-2)\n endif\n end do\nend do\nanswer=0\ndo i=1,len_trim(s)\n\tread(S(i:i),*) aki\n do j=i,len_trim(S)\n \tanswer=answer+aki*10**(len_trim(s)-j)*a(i,j)\n end do\n print\"(I0)\",answer\nend do\nprint\"(I0)\",answer\nend", "language": "Fortran", "metadata": {"date": 1551596453, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04001.html", "problem_id": "p04001", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04001/input.txt", "sample_output_relpath": "derived/input_output/data/p04001/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04001/Fortran/s858358898.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s858358898", "user_id": "u598073939"}, "prompt_components": {"gold_output": "176\n", "input_to_evaluate": "integer,dimension(10,10)::a\ncharacter(11)S\ninteger(16) answer\nread*,S\na=0\ndo i=1,len_trim(S)\n\tdo j=i,len_trim(S)\n \tif(j==i)then\n \ta(i,j)=2**(i-1)\n else\n \ta(i,j)=2**(j-2)\n endif\n end do\nend do\nanswer=0\ndo i=1,len_trim(s)\n\tread(S(i:i),*) aki\n do j=i,len_trim(S)\n \tanswer=answer+aki*10**(len_trim(s)-j)*a(i,j)\n end do\n print\"(I0)\",answer\nend do\nprint\"(I0)\",answer\nend", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of digits between 1 and 9, inclusive.\nYou can insert the letter + into some of the positions (possibly none) between two letters in this string.\nHere, + must not occur consecutively after insertion.\n\nAll strings that can be obtained in this way can be evaluated as formulas.\n\nEvaluate all possible formulas, and print the sum of the results.\n\nConstraints\n\n1 \\leq |S| \\leq 10\n\nAll letters in S are digits between 1 and 9, inclusive.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the evaluated value over all possible formulas.\n\nSample Input 1\n\n125\n\nSample Output 1\n\n176\n\nThere are 4 formulas that can be obtained: 125, 1+25, 12+5 and 1+2+5. When each formula is evaluated,\n\n125\n\n1+25=26\n\n12+5=17\n\n1+2+5=8\n\nThus, the sum is 125+26+17+8=176.\n\nSample Input 2\n\n9999999999\n\nSample Output 2\n\n12656242944", "sample_input": "125\n"}, "reference_outputs": ["176\n"], "source_document_id": "p04001", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S consisting of digits between 1 and 9, inclusive.\nYou can insert the letter + into some of the positions (possibly none) between two letters in this string.\nHere, + must not occur consecutively after insertion.\n\nAll strings that can be obtained in this way can be evaluated as formulas.\n\nEvaluate all possible formulas, and print the sum of the results.\n\nConstraints\n\n1 \\leq |S| \\leq 10\n\nAll letters in S are digits between 1 and 9, inclusive.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the evaluated value over all possible formulas.\n\nSample Input 1\n\n125\n\nSample Output 1\n\n176\n\nThere are 4 formulas that can be obtained: 125, 1+25, 12+5 and 1+2+5. When each formula is evaluated,\n\n125\n\n1+25=26\n\n12+5=17\n\n1+2+5=8\n\nThus, the sum is 125+26+17+8=176.\n\nSample Input 2\n\n9999999999\n\nSample Output 2\n\n12656242944", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 410, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s845883355", "group_id": "codeNet:p04005", "input_text": "program main\n implicit none\n\n integer(8) :: a, b, c\n\n read(*,*) a, b, c\n\n if (mod(a,2) == 0 .or. mod(b,2) == 0 .or. mod(c,2) == 0) then\n write(*,*) 0\n\n else\n write(*,*) min(a*b, b*c, c*a)\n\n end if\n stop\n \nend program main\n", "language": "Fortran", "metadata": {"date": 1590824724, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/Fortran/s845883355.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845883355", "user_id": "u979474608"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program main\n implicit none\n\n integer(8) :: a, b, c\n\n read(*,*) a, b, c\n\n if (mod(a,2) == 0 .or. mod(b,2) == 0 .or. mod(c,2) == 0) then\n write(*,*) 0\n\n else\n write(*,*) min(a*b, b*c, c*a)\n\n end if\n stop\n \nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s714984979", "group_id": "codeNet:p04005", "input_text": "program prob4\n implicit none\n integer(8) A, B, C\n integer(16) ans\n read(*,*) A, B, C\n\n if(mod(A,2)==0 .or. mod(B,2)==0 .or. mod(C,2)==0)then\n write(*,*) 0\n else\n ans = A*B\n if(A*C < ans)then\n ans = A*C\n end if\n if(B*C < ans)then\n ans = B*C\n end if\n\n write(*,*) ans\n end if\n\n stop\nend program prob4", "language": "Fortran", "metadata": {"date": 1590801991, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/Fortran/s714984979.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714984979", "user_id": "u841856382"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program prob4\n implicit none\n integer(8) A, B, C\n integer(16) ans\n read(*,*) A, B, C\n\n if(mod(A,2)==0 .or. mod(B,2)==0 .or. mod(C,2)==0)then\n write(*,*) 0\n else\n ans = A*B\n if(A*C < ans)then\n ans = A*C\n end if\n if(B*C < ans)then\n ans = B*C\n end if\n\n write(*,*) ans\n end if\n\n stop\nend program prob4", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 392, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s641771887", "group_id": "codeNet:p04012", "input_text": "program main\nimplicit none\ninteger :: i, j, k, l, a(26)\ncharacter :: s*100\n\nread(*,*) s\nl = len(s)\na = 0\ndo i = 1, l\n do j = 1, 26\n k = ichar(s(i:i)) -96\n if( j == k ) then\n a(j) = a(j) + 1\n end if\n end do\nend do\ndo j = 1, 26\n if( mod(a(j),2) /= 0 ) then\n write(*,*) 'No'\n stop\n end if\nend do\nwrite(*,*) 'Yes'\n\nend program main\n", "language": "Fortran", "metadata": {"date": 1563375872, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04012.html", "problem_id": "p04012", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04012/input.txt", "sample_output_relpath": "derived/input_output/data/p04012/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04012/Fortran/s641771887.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641771887", "user_id": "u696547932"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main\nimplicit none\ninteger :: i, j, k, l, a(26)\ncharacter :: s*100\n\nread(*,*) s\nl = len(s)\na = 0\ndo i = 1, l\n do j = 1, 26\n k = ichar(s(i:i)) -96\n if( j == k ) then\n a(j) = a(j) + 1\n end if\n end do\nend do\ndo j = 1, 26\n if( mod(a(j),2) /= 0 ) then\n write(*,*) 'No'\n stop\n end if\nend do\nwrite(*,*) 'Yes'\n\nend program main\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "sample_input": "abaccaba\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p04012", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet w be a string consisting of lowercase letters.\nWe will call w beautiful if the following condition is satisfied:\n\nEach lowercase letter of the English alphabet occurs even number of times in w.\n\nYou are given the string w. Determine if w is beautiful.\n\nConstraints\n\n1 \\leq |w| \\leq 100\n\nw consists of lowercase letters (a-z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nw\n\nOutput\n\nPrint Yes if w is beautiful. Print No otherwise.\n\nSample Input 1\n\nabaccaba\n\nSample Output 1\n\nYes\n\na occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.\n\nSample Input 2\n\nhthth\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 369, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s367730824", "group_id": "codeNet:p04016", "input_text": "program main\n implicit none\n integer(8) :: n, s, sqrt_n, b, p\n read(*, *) n\n read(*, *) s\n\n if (n < s) then\n write(*, \"(i0)\") -1\n stop 0\n else if (n == s) then\n write(*, \"(i0)\") n + 1\n stop 0\n end if\n\n sqrt_n = integer_sqrt(n)\n\n do b = 2, sqrt_n\n if (f(b, n) == s) then\n write(*, \"(i0)\") b\n stop 0\n end if\n end do\n\n do p = 1, sqrt_n\n b = (n - s) / p + 1\n if (f(b, n) == s) then\n write(*, \"(i0)\") b\n stop 0\n end if\n end do\n\n write(*, \"(i0)\") -1\n\n contains\n\n function integer_sqrt(n)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: integer_sqrt, i\n if (n < 0) stop 101\n do i = 0, n + 1\n if (i ** 2 > n) then\n integer_sqrt = i - 1\n exit\n end if\n end do\n end function integer_sqrt\n\n recursive function f(b, n) result(res)\n implicit none\n integer(8), intent(in) :: b, n\n integer(8) :: res\n if (n < b) then\n res = n\n else\n res = f(b, n / b) + mod(n, b)\n end if\n end function f\nend program main\n", "language": "Fortran", "metadata": {"date": 1538814876, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04016.html", "problem_id": "p04016", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04016/input.txt", "sample_output_relpath": "derived/input_output/data/p04016/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04016/Fortran/s367730824.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s367730824", "user_id": "u388927326"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program main\n implicit none\n integer(8) :: n, s, sqrt_n, b, p\n read(*, *) n\n read(*, *) s\n\n if (n < s) then\n write(*, \"(i0)\") -1\n stop 0\n else if (n == s) then\n write(*, \"(i0)\") n + 1\n stop 0\n end if\n\n sqrt_n = integer_sqrt(n)\n\n do b = 2, sqrt_n\n if (f(b, n) == s) then\n write(*, \"(i0)\") b\n stop 0\n end if\n end do\n\n do p = 1, sqrt_n\n b = (n - s) / p + 1\n if (f(b, n) == s) then\n write(*, \"(i0)\") b\n stop 0\n end if\n end do\n\n write(*, \"(i0)\") -1\n\n contains\n\n function integer_sqrt(n)\n implicit none\n integer(8), intent(in) :: n\n integer(8) :: integer_sqrt, i\n if (n < 0) stop 101\n do i = 0, n + 1\n if (i ** 2 > n) then\n integer_sqrt = i - 1\n exit\n end if\n end do\n end function integer_sqrt\n\n recursive function f(b, n) result(res)\n implicit none\n integer(8), intent(in) :: b, n\n integer(8) :: res\n if (n < b) then\n res = n\n else\n res = f(b, n / b) + mod(n, b)\n end if\n end function f\nend program main\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor integers b (b \\geq 2) and n (n \\geq 1), let the function f(b,n) be defined as follows:\n\nf(b,n) = n, when n < b\n\nf(b,n) = f(b,\\,{\\rm floor}(n / b)) + (n \\ {\\rm mod} \\ b), when n \\geq b\n\nHere, {\\rm floor}(n / b) denotes the largest integer not exceeding n / b,\nand n \\ {\\rm mod} \\ b denotes the remainder of n divided by b.\n\nLess formally, f(b,n) is equal to the sum of the digits of n written in base b.\nFor example, the following hold:\n\nf(10,\\,87654)=8+7+6+5+4=30\n\nf(100,\\,87654)=8+76+54=138\n\nYou are given integers n and s.\nDetermine if there exists an integer b (b \\geq 2) such that f(b,n)=s.\nIf the answer is positive, also find the smallest such b.\n\nConstraints\n\n1 \\leq n \\leq 10^{11}\n\n1 \\leq s \\leq 10^{11}\n\nn,\\,s are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nn\ns\n\nOutput\n\nIf there exists an integer b (b \\geq 2) such that f(b,n)=s, print the smallest such b.\nIf such b does not exist, print -1 instead.\n\nSample Input 1\n\n87654\n30\n\nSample Output 1\n\n10\n\nSample Input 2\n\n87654\n138\n\nSample Output 2\n\n100\n\nSample Input 3\n\n87654\n45678\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n31415926535\n1\n\nSample Output 4\n\n31415926535\n\nSample Input 5\n\n1\n31415926535\n\nSample Output 5\n\n-1", "sample_input": "87654\n30\n"}, "reference_outputs": ["10\n"], "source_document_id": "p04016", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor integers b (b \\geq 2) and n (n \\geq 1), let the function f(b,n) be defined as follows:\n\nf(b,n) = n, when n < b\n\nf(b,n) = f(b,\\,{\\rm floor}(n / b)) + (n \\ {\\rm mod} \\ b), when n \\geq b\n\nHere, {\\rm floor}(n / b) denotes the largest integer not exceeding n / b,\nand n \\ {\\rm mod} \\ b denotes the remainder of n divided by b.\n\nLess formally, f(b,n) is equal to the sum of the digits of n written in base b.\nFor example, the following hold:\n\nf(10,\\,87654)=8+7+6+5+4=30\n\nf(100,\\,87654)=8+76+54=138\n\nYou are given integers n and s.\nDetermine if there exists an integer b (b \\geq 2) such that f(b,n)=s.\nIf the answer is positive, also find the smallest such b.\n\nConstraints\n\n1 \\leq n \\leq 10^{11}\n\n1 \\leq s \\leq 10^{11}\n\nn,\\,s are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nn\ns\n\nOutput\n\nIf there exists an integer b (b \\geq 2) such that f(b,n)=s, print the smallest such b.\nIf such b does not exist, print -1 instead.\n\nSample Input 1\n\n87654\n30\n\nSample Output 1\n\n10\n\nSample Input 2\n\n87654\n138\n\nSample Output 2\n\n100\n\nSample Input 3\n\n87654\n45678\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n31415926535\n1\n\nSample Output 4\n\n31415926535\n\nSample Input 5\n\n1\n31415926535\n\nSample Output 5\n\n-1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1034, "cpu_time_ms": 331, "memory_kb": 262400}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s098552846", "group_id": "codeNet:p04023", "input_text": "module mod_stack\n implicit none\n type t_node\n private\n integer(8) :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n type t_stack\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: push => push\n procedure :: pop => pop\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n end type t_stack\ncontains\n function new_node(item) result(node)\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n subroutine push(this,item)\n class(t_stack), intent(inout) :: this\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n function pop(this) result(item)\n class(t_stack), intent(inout) :: this\n integer(8) :: item\n type(t_node), pointer :: node\n item = this%tail%item\n node => this%tail%prev\n deallocate(this%tail)\n this%tail => node\n if (associated(node)) then\n node%next => null()\n else\n this%head => null()\n end if\n this%num = this%num-1\n end\n function peek(this) result(item)\n class(t_stack), intent(in) :: this\n integer(8) :: item\n item = this%tail%item\n end\n subroutine clear(this)\n class(t_stack), intent(inout) :: this\n type(t_node), pointer :: node, prev\n if (.not.associated(this%tail)) return\n node => this%tail\n do while (associated(node%prev))\n prev => node%prev\n deallocate(node)\n node => prev\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n integer function size_of(this)\n class(t_stack), intent(in) :: this\n size_of = this%num\n end\nend module mod_stack\nprogram sequential_operations_on_sequence\n use mod_stack\n implicit none\n type(t_stack) :: stack\n integer :: n, q, i, j, x\n integer(8) :: tmp1, tmp2, p(100000) = 0_8, k, l, r, m\n integer(8) :: t(100000) = 0_8, ans(0:100001) = 0_8\n read(*,*) n, q\n call stack%push(int(n,8))\n do i = 1, q\n read(*,*) tmp1\n do while (stack%size() > 0 .and. stack%peek() >= tmp1)\n tmp2 = stack%pop()\n end do\n call stack%push(tmp1)\n end do\n q = stack%size()\n do i = q, 1, -1\n p(i) = stack%pop()\n end do\n t(q) = 1_8\n do i = q, 2, -1\n j = i-1\n t(j) = t(j)+t(i)*(p(i)/p(j))\n k = mod(p(i),p(j))\n do while (k >= p(1))\n r = j\n l = 1\n do while (r-l > 1)\n m = (l+r)/2\n if (p(m) > k) then\n r = m\n else\n l = m\n end if\n end do\n j = l\n t(j) = t(j)+t(i)*(k/p(j))\n k = mod(k,p(j))\n end do\n x = int(k,4)\n ans(x) = ans(x)+t(i)\n end do\n x = int(p(1),4)\n ans(x) = ans(x)+t(1)\n do i = n, 1, -1\n ans(i) = ans(i)+ans(i+1)\n end do\n do i = 1, n\n write(*,'(i0)') ans(i)\n end do\nend program sequential_operations_on_sequence", "language": "Fortran", "metadata": {"date": 1567833478, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04023.html", "problem_id": "p04023", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04023/input.txt", "sample_output_relpath": "derived/input_output/data/p04023/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04023/Fortran/s098552846.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s098552846", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n3\n3\n2\n0\n", "input_to_evaluate": "module mod_stack\n implicit none\n type t_node\n private\n integer(8) :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n type t_stack\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: push => push\n procedure :: pop => pop\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n end type t_stack\ncontains\n function new_node(item) result(node)\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n subroutine push(this,item)\n class(t_stack), intent(inout) :: this\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n function pop(this) result(item)\n class(t_stack), intent(inout) :: this\n integer(8) :: item\n type(t_node), pointer :: node\n item = this%tail%item\n node => this%tail%prev\n deallocate(this%tail)\n this%tail => node\n if (associated(node)) then\n node%next => null()\n else\n this%head => null()\n end if\n this%num = this%num-1\n end\n function peek(this) result(item)\n class(t_stack), intent(in) :: this\n integer(8) :: item\n item = this%tail%item\n end\n subroutine clear(this)\n class(t_stack), intent(inout) :: this\n type(t_node), pointer :: node, prev\n if (.not.associated(this%tail)) return\n node => this%tail\n do while (associated(node%prev))\n prev => node%prev\n deallocate(node)\n node => prev\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n integer function size_of(this)\n class(t_stack), intent(in) :: this\n size_of = this%num\n end\nend module mod_stack\nprogram sequential_operations_on_sequence\n use mod_stack\n implicit none\n type(t_stack) :: stack\n integer :: n, q, i, j, x\n integer(8) :: tmp1, tmp2, p(100000) = 0_8, k, l, r, m\n integer(8) :: t(100000) = 0_8, ans(0:100001) = 0_8\n read(*,*) n, q\n call stack%push(int(n,8))\n do i = 1, q\n read(*,*) tmp1\n do while (stack%size() > 0 .and. stack%peek() >= tmp1)\n tmp2 = stack%pop()\n end do\n call stack%push(tmp1)\n end do\n q = stack%size()\n do i = q, 1, -1\n p(i) = stack%pop()\n end do\n t(q) = 1_8\n do i = q, 2, -1\n j = i-1\n t(j) = t(j)+t(i)*(p(i)/p(j))\n k = mod(p(i),p(j))\n do while (k >= p(1))\n r = j\n l = 1\n do while (r-l > 1)\n m = (l+r)/2\n if (p(m) > k) then\n r = m\n else\n l = m\n end if\n end do\n j = l\n t(j) = t(j)+t(i)*(k/p(j))\n k = mod(k,p(j))\n end do\n x = int(k,4)\n ans(x) = ans(x)+t(i)\n end do\n x = int(p(1),4)\n ans(x) = ans(x)+t(1)\n do i = n, 1, -1\n ans(i) = ans(i)+ans(i+1)\n end do\n do i = 1, n\n write(*,'(i0)') ans(i)\n end do\nend program sequential_operations_on_sequence", "problem_context": "Score : 1400 points\n\nProblem Statement\n\nSnuke got an integer sequence from his mother, as a birthday present. The sequence has N elements, and the i-th of them is i.\nSnuke performs the following Q operations on this sequence. The i-th operation, described by a parameter q_i, is as follows:\n\nTake the first q_i elements from the sequence obtained by concatenating infinitely many copy of the current sequence, then replace the current sequence with those q_i elements.\n\nAfter these Q operations, find how many times each of the integers 1 through N appears in the final sequence.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ Q ≦ 10^5\n\n1 ≦ q_i ≦ 10^{18}\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN Q\nq_1\n:\nq_Q\n\nOutput\n\nPrint N lines. The i-th line (1 ≦ i ≦ N) should contain the number of times integer i appears in the final sequence after the Q operations.\n\nSample Input 1\n\n5 3\n6\n4\n11\n\nSample Output 1\n\n3\n3\n3\n2\n0\n\nAfter the first operation, the sequence becomes: 1,2,3,4,5,1.\n\nAfter the second operation, the sequence becomes: 1,2,3,4.\n\nAfter the third operation, the sequence becomes: 1,2,3,4,1,2,3,4,1,2,3.\n\nIn this sequence, integers 1,2,3,4,5 appear 3,3,3,2,0 times, respectively.\n\nSample Input 2\n\n10 10\n9\n13\n18\n8\n10\n10\n9\n19\n22\n27\n\nSample Output 2\n\n7\n4\n4\n3\n3\n2\n2\n2\n0\n0", "sample_input": "5 3\n6\n4\n11\n"}, "reference_outputs": ["3\n3\n3\n2\n0\n"], "source_document_id": "p04023", "source_text": "Score : 1400 points\n\nProblem Statement\n\nSnuke got an integer sequence from his mother, as a birthday present. The sequence has N elements, and the i-th of them is i.\nSnuke performs the following Q operations on this sequence. The i-th operation, described by a parameter q_i, is as follows:\n\nTake the first q_i elements from the sequence obtained by concatenating infinitely many copy of the current sequence, then replace the current sequence with those q_i elements.\n\nAfter these Q operations, find how many times each of the integers 1 through N appears in the final sequence.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ Q ≦ 10^5\n\n1 ≦ q_i ≦ 10^{18}\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN Q\nq_1\n:\nq_Q\n\nOutput\n\nPrint N lines. The i-th line (1 ≦ i ≦ N) should contain the number of times integer i appears in the final sequence after the Q operations.\n\nSample Input 1\n\n5 3\n6\n4\n11\n\nSample Output 1\n\n3\n3\n3\n2\n0\n\nAfter the first operation, the sequence becomes: 1,2,3,4,5,1.\n\nAfter the second operation, the sequence becomes: 1,2,3,4.\n\nAfter the third operation, the sequence becomes: 1,2,3,4,1,2,3,4,1,2,3.\n\nIn this sequence, integers 1,2,3,4,5 appear 3,3,3,2,0 times, respectively.\n\nSample Input 2\n\n10 10\n9\n13\n18\n8\n10\n10\n9\n19\n22\n27\n\nSample Output 2\n\n7\n4\n4\n3\n3\n2\n2\n2\n0\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3133, "cpu_time_ms": 138, "memory_kb": 7168}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s711162515", "group_id": "codeNet:p04023", "input_text": "module mod_stack\n implicit none\n type t_node\n private\n integer(8) :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n type t_stack\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: push => push\n procedure :: pop => pop\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n end type t_stack\ncontains\n function new_node(item) result(node)\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n subroutine push(this,item)\n class(t_stack), intent(inout) :: this\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n function pop(this) result(item)\n class(t_stack), intent(inout) :: this\n integer(8) :: item\n type(t_node), pointer :: node\n item = this%tail%item\n node => this%tail%prev\n deallocate(this%tail)\n this%tail => node\n if (associated(node)) then\n node%next => null()\n else\n this%head => null()\n end if\n this%num = this%num-1\n end\n function peek(this) result(item)\n class(t_stack), intent(in) :: this\n integer(8) :: item\n item = this%tail%item\n end\n subroutine clear(this)\n class(t_stack), intent(inout) :: this\n type(t_node), pointer :: node, prev\n if (.not.associated(this%tail)) return\n node => this%tail\n do while (associated(node%prev))\n prev => node%prev\n deallocate(node)\n node => prev\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n integer function size_of(this)\n class(t_stack), intent(in) :: this\n size_of = this%num\n end\nend module mod_stack\nprogram sequential_operations_on_sequence\n use mod_stack\n implicit none\n type(t_stack) :: stack\n integer :: n, q, i, j, x\n integer(8) :: tmp1, tmp2, p(100000) = 0_8, k, l, r, m\n integer(8) :: t(100000) = 0_8, ans(100001) = 0_8\n read(*,*) n, q\n call stack%push(int(n,8))\n do i = 1, q\n read(*,*) tmp1\n do while (stack%size() > 0 .and. stack%peek() >= tmp1)\n tmp2 = stack%pop()\n end do\n call stack%push(tmp1)\n end do\n q = stack%size()\n do i = q, 1, -1\n p(i) = stack%pop()\n end do\n t(q) = 1_8\n do i = q, 2, -1\n j = i-1\n t(j) = t(j)+t(i)*(p(i)/p(j))\n k = mod(p(i),p(j))\n do while (k >= p(1))\n r = j\n l = 1\n do while (r-l > 1)\n m = (l+r)/2\n if (p(m) > k) then\n r = m\n else\n l = m\n end if\n end do\n j = l\n t(j) = t(j)+t(i)*(k/p(j))\n k = mod(k,p(j))\n end do\n x = int(k,4)\n ans(x) = ans(x)+t(i)\n end do\n x = int(p(1),4)\n ans(x) = ans(x)+t(1)\n do i = n, 1, -1\n ans(i) = ans(i)+ans(i+1)\n end do\n do i = 1, n\n write(*,'(i0)') ans(i)\n end do\nend program sequential_operations_on_sequence", "language": "Fortran", "metadata": {"date": 1567829371, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04023.html", "problem_id": "p04023", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04023/input.txt", "sample_output_relpath": "derived/input_output/data/p04023/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04023/Fortran/s711162515.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s711162515", "user_id": "u506403362"}, "prompt_components": {"gold_output": "3\n3\n3\n2\n0\n", "input_to_evaluate": "module mod_stack\n implicit none\n type t_node\n private\n integer(8) :: item\n type(t_node), pointer :: prev => null()\n type(t_node), pointer :: next => null()\n end type t_node\n type t_stack\n private\n integer :: num = 0\n type(t_node), pointer :: head => null()\n type(t_node), pointer :: tail => null()\n contains\n procedure :: push => push\n procedure :: pop => pop\n procedure :: peek => peek\n procedure :: clear => clear\n procedure :: size => size_of\n end type t_stack\ncontains\n function new_node(item) result(node)\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n allocate(node)\n node%item = item\n end\n subroutine push(this,item)\n class(t_stack), intent(inout) :: this\n integer(8), intent(in) :: item\n type(t_node), pointer :: node\n node => new_node(item)\n if (associated(this%head)) then\n node%prev => this%tail\n this%tail%next => node\n else\n this%head => node\n end if\n this%tail => node\n this%num = this%num+1\n end\n function pop(this) result(item)\n class(t_stack), intent(inout) :: this\n integer(8) :: item\n type(t_node), pointer :: node\n item = this%tail%item\n node => this%tail%prev\n deallocate(this%tail)\n this%tail => node\n if (associated(node)) then\n node%next => null()\n else\n this%head => null()\n end if\n this%num = this%num-1\n end\n function peek(this) result(item)\n class(t_stack), intent(in) :: this\n integer(8) :: item\n item = this%tail%item\n end\n subroutine clear(this)\n class(t_stack), intent(inout) :: this\n type(t_node), pointer :: node, prev\n if (.not.associated(this%tail)) return\n node => this%tail\n do while (associated(node%prev))\n prev => node%prev\n deallocate(node)\n node => prev\n end do\n this%head => null()\n this%tail => null()\n this%num = 0\n end\n integer function size_of(this)\n class(t_stack), intent(in) :: this\n size_of = this%num\n end\nend module mod_stack\nprogram sequential_operations_on_sequence\n use mod_stack\n implicit none\n type(t_stack) :: stack\n integer :: n, q, i, j, x\n integer(8) :: tmp1, tmp2, p(100000) = 0_8, k, l, r, m\n integer(8) :: t(100000) = 0_8, ans(100001) = 0_8\n read(*,*) n, q\n call stack%push(int(n,8))\n do i = 1, q\n read(*,*) tmp1\n do while (stack%size() > 0 .and. stack%peek() >= tmp1)\n tmp2 = stack%pop()\n end do\n call stack%push(tmp1)\n end do\n q = stack%size()\n do i = q, 1, -1\n p(i) = stack%pop()\n end do\n t(q) = 1_8\n do i = q, 2, -1\n j = i-1\n t(j) = t(j)+t(i)*(p(i)/p(j))\n k = mod(p(i),p(j))\n do while (k >= p(1))\n r = j\n l = 1\n do while (r-l > 1)\n m = (l+r)/2\n if (p(m) > k) then\n r = m\n else\n l = m\n end if\n end do\n j = l\n t(j) = t(j)+t(i)*(k/p(j))\n k = mod(k,p(j))\n end do\n x = int(k,4)\n ans(x) = ans(x)+t(i)\n end do\n x = int(p(1),4)\n ans(x) = ans(x)+t(1)\n do i = n, 1, -1\n ans(i) = ans(i)+ans(i+1)\n end do\n do i = 1, n\n write(*,'(i0)') ans(i)\n end do\nend program sequential_operations_on_sequence", "problem_context": "Score : 1400 points\n\nProblem Statement\n\nSnuke got an integer sequence from his mother, as a birthday present. The sequence has N elements, and the i-th of them is i.\nSnuke performs the following Q operations on this sequence. The i-th operation, described by a parameter q_i, is as follows:\n\nTake the first q_i elements from the sequence obtained by concatenating infinitely many copy of the current sequence, then replace the current sequence with those q_i elements.\n\nAfter these Q operations, find how many times each of the integers 1 through N appears in the final sequence.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ Q ≦ 10^5\n\n1 ≦ q_i ≦ 10^{18}\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN Q\nq_1\n:\nq_Q\n\nOutput\n\nPrint N lines. The i-th line (1 ≦ i ≦ N) should contain the number of times integer i appears in the final sequence after the Q operations.\n\nSample Input 1\n\n5 3\n6\n4\n11\n\nSample Output 1\n\n3\n3\n3\n2\n0\n\nAfter the first operation, the sequence becomes: 1,2,3,4,5,1.\n\nAfter the second operation, the sequence becomes: 1,2,3,4.\n\nAfter the third operation, the sequence becomes: 1,2,3,4,1,2,3,4,1,2,3.\n\nIn this sequence, integers 1,2,3,4,5 appear 3,3,3,2,0 times, respectively.\n\nSample Input 2\n\n10 10\n9\n13\n18\n8\n10\n10\n9\n19\n22\n27\n\nSample Output 2\n\n7\n4\n4\n3\n3\n2\n2\n2\n0\n0", "sample_input": "5 3\n6\n4\n11\n"}, "reference_outputs": ["3\n3\n3\n2\n0\n"], "source_document_id": "p04023", "source_text": "Score : 1400 points\n\nProblem Statement\n\nSnuke got an integer sequence from his mother, as a birthday present. The sequence has N elements, and the i-th of them is i.\nSnuke performs the following Q operations on this sequence. The i-th operation, described by a parameter q_i, is as follows:\n\nTake the first q_i elements from the sequence obtained by concatenating infinitely many copy of the current sequence, then replace the current sequence with those q_i elements.\n\nAfter these Q operations, find how many times each of the integers 1 through N appears in the final sequence.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ Q ≦ 10^5\n\n1 ≦ q_i ≦ 10^{18}\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN Q\nq_1\n:\nq_Q\n\nOutput\n\nPrint N lines. The i-th line (1 ≦ i ≦ N) should contain the number of times integer i appears in the final sequence after the Q operations.\n\nSample Input 1\n\n5 3\n6\n4\n11\n\nSample Output 1\n\n3\n3\n3\n2\n0\n\nAfter the first operation, the sequence becomes: 1,2,3,4,5,1.\n\nAfter the second operation, the sequence becomes: 1,2,3,4.\n\nAfter the third operation, the sequence becomes: 1,2,3,4,1,2,3,4,1,2,3.\n\nIn this sequence, integers 1,2,3,4,5 appear 3,3,3,2,0 times, respectively.\n\nSample Input 2\n\n10 10\n9\n13\n18\n8\n10\n10\n9\n19\n22\n27\n\nSample Output 2\n\n7\n4\n4\n3\n3\n2\n2\n2\n0\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3131, "cpu_time_ms": 137, "memory_kb": 7168}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s773081881", "group_id": "codeNet:p04025", "input_text": "program sample\n\timplicit none\n integer(8) :: N,i,count,average,sum1\n integer(8),allocatable :: x(:),a(:),b(:)\n real(8) :: count2,average2\n \n read(*,*) N\n \n allocate(x(N))\n allocate(b(N))\n \n \n read(*,*) x\n \n !write(*,*) x\n \n count =0\n count2=0\n do i=1,N\n \tb(i) = x(i)-x(1)\n count = count +x(i)\n count2= count2 +real(x(i))\n end do\n \n average = count / N\n average2 = count2 /N\n \n sum1= 0\n if (maxval(b) ==minval(b)) then\n \twrite(*,*) 0\n else if (abs(average2-average) >= abs(average2-average-1) ) then\n \tdo i=1,N\n \tsum1= sum1 + (x(i)-average-1)**2\n end do\n write(*,*) sum1\n else\n \tdo i=1,N\n \tsum1 = sum1 + (x(i)-average) **2\n \tend do\n \twrite(*,*) sum1\n end if\n \n\tdeallocate(x)\n stop\nend program sample", "language": "Fortran", "metadata": {"date": 1592012919, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04025.html", "problem_id": "p04025", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04025/input.txt", "sample_output_relpath": "derived/input_output/data/p04025/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04025/Fortran/s773081881.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773081881", "user_id": "u323210830"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program sample\n\timplicit none\n integer(8) :: N,i,count,average,sum1\n integer(8),allocatable :: x(:),a(:),b(:)\n real(8) :: count2,average2\n \n read(*,*) N\n \n allocate(x(N))\n allocate(b(N))\n \n \n read(*,*) x\n \n !write(*,*) x\n \n count =0\n count2=0\n do i=1,N\n \tb(i) = x(i)-x(1)\n count = count +x(i)\n count2= count2 +real(x(i))\n end do\n \n average = count / N\n average2 = count2 /N\n \n sum1= 0\n if (maxval(b) ==minval(b)) then\n \twrite(*,*) 0\n else if (abs(average2-average) >= abs(average2-average-1) ) then\n \tdo i=1,N\n \tsum1= sum1 + (x(i)-average-1)**2\n end do\n write(*,*) sum1\n else\n \tdo i=1,N\n \tsum1 = sum1 + (x(i)-average) **2\n \tend do\n \twrite(*,*) sum1\n end if\n \n\tdeallocate(x)\n stop\nend program sample", "problem_context": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "sample_input": "2\n4 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p04025", "source_text": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s429839981", "group_id": "codeNet:p04025", "input_text": "integer N\ninteger,allocatable,dimension(:)::a\ninteger ans,kouho\nread*,N\nallocate(a(N))\nread*,a\nans=huge(ans)\ndo i=minval(a),maxval(a)\n kouho=0\n do j=1,N\n kouho=kouho+(i-a(j))**2\n end do\n ans=max(ans,kouho)\nend do\nprint\"(i0)\",ans\nend", "language": "Fortran", "metadata": {"date": 1557366069, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04025.html", "problem_id": "p04025", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04025/input.txt", "sample_output_relpath": "derived/input_output/data/p04025/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04025/Fortran/s429839981.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s429839981", "user_id": "u598073939"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "integer N\ninteger,allocatable,dimension(:)::a\ninteger ans,kouho\nread*,N\nallocate(a(N))\nread*,a\nans=huge(ans)\ndo i=minval(a),maxval(a)\n kouho=0\n do j=1,N\n kouho=kouho+(i-a(j))**2\n end do\n ans=max(ans,kouho)\nend do\nprint\"(i0)\",ans\nend", "problem_context": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "sample_input": "2\n4 8\n"}, "reference_outputs": ["8\n"], "source_document_id": "p04025", "source_text": "Score : 200 points\n\nProblem Statement\n\nEvi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.\n\nHe may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).\n\nFind the minimum total cost to achieve his objective.\n\nConstraints\n\n1≦N≦100\n\n-100≦a_i≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum total cost to achieve Evi's objective.\n\nSample Input 1\n\n2\n4 8\n\nSample Output 1\n\n8\n\nTransforming the both into 6s will cost (4-6)^2+(8-6)^2=8 dollars, which is the minimum.\n\nSample Input 2\n\n3\n1 1 3\n\nSample Output 2\n\n3\n\nTransforming the all into 2s will cost (1-2)^2+(1-2)^2+(3-2)^2=3 dollars. Note that Evi has to pay (1-2)^2 dollar separately for transforming each of the two 1s.\n\nSample Input 3\n\n3\n4 2 5\n\nSample Output 3\n\n5\n\nLeaving the 4 as it is and transforming the 2 and the 5 into 4s will achieve the total cost of (2-4)^2+(5-4)^2=5 dollars, which is the minimum.\n\nSample Input 4\n\n4\n-100 -100 -100 -100\n\nSample Output 4\n\n0\n\nWithout transforming anything, Evi's objective is already achieved. Thus, the necessary cost is 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s899779963", "group_id": "codeNet:p04043", "input_text": "program main\nread*,i,j,k\nif(i*j*k==175)then\nprint*,\"YES\"\nelse\nprint*,\"NO\"\nendif\nend program main", "language": "Fortran", "metadata": {"date": 1575405942, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04043.html", "problem_id": "p04043", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04043/input.txt", "sample_output_relpath": "derived/input_output/data/p04043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04043/Fortran/s899779963.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899779963", "user_id": "u952130512"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program main\nread*,i,j,k\nif(i*j*k==175)then\nprint*,\"YES\"\nelse\nprint*,\"NO\"\nendif\nend program main", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s585452488", "group_id": "codeNet:p04043", "input_text": "integer a, b, c\nread*, a, b, c\nif ((a * b * c) == 175) then\n\tprint*, \"Yes\"\nelse\n\tprint*, \"No\"\nend if\nend", "language": "Fortran", "metadata": {"date": 1571775544, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04043.html", "problem_id": "p04043", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04043/input.txt", "sample_output_relpath": "derived/input_output/data/p04043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04043/Fortran/s585452488.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s585452488", "user_id": "u244203620"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "integer a, b, c\nread*, a, b, c\nif ((a * b * c) == 175) then\n\tprint*, \"Yes\"\nelse\n\tprint*, \"No\"\nend if\nend", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Fortran:s424013739", "group_id": "codeNet:p04049", "input_text": "module mod_t_item\n implicit none\n type :: t_item\n integer :: pos, cost\n end type t_item\n private\n public :: t_item, itemize, compare, swap\ncontains\n function itemize(pos,cost) result(i)\n implicit none\n integer :: pos, cost\n type(t_item) :: i\n i%pos = pos\n i%cost = cost\n return\n end function itemize\n function compare(i1,i2) result(c)\n implicit none\n type(t_item), intent(in) :: i1, i2\n integer :: c\n c = i1%cost-i2%cost\n return\n end function compare\n subroutine swap(i1,i2)\n implicit none\n type(t_item), intent(inout) :: i1, i2\n type(t_item) :: i\n i = i1\n i1 = i2\n i2 = i\n return\n end subroutine swap\nend module mod_t_item\nmodule mod_t_list\n use mod_t_item\n implicit none\n type :: t_list\n integer :: vol\n type(t_item), pointer :: arr(:)\n end type t_list\n private\n public :: t_list, init_list, release_list,push_back\n public :: pop_back, get_at, size_of_list\ncontains\n subroutine init_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n list%vol = 0\n allocate(list%arr(1))\n return\n end subroutine init_list\n subroutine release_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n return\n end subroutine release_list\n subroutine push_back(list,item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item), intent(in) :: item\n type(t_item), allocatable :: tmp(:)\n if (size(list%arr).eq.list%vol) then\n allocate(tmp(list%vol))\n tmp = list%arr\n deallocate(list%arr)\n allocate(list%arr(2*list%vol))\n list%arr(1:list%vol) = tmp\n deallocate(tmp)\n end if\n list%vol = list%vol+1\n list%arr(list%vol) = item\n return\n end subroutine push_back\n function pop_back(list) result(item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item) :: item\n item = list%arr(list%vol)\n list%vol = list%vol-1\n return\n end function pop_back\n function get_at(list,i) result(item)\n implicit none\n type(t_list), intent(in) :: list\n integer, intent(in) :: i\n type(t_item) :: item\n item = list%arr(i)\n return\n end function get_at\n function size_of_list(list) result(s)\n implicit none\n type(t_list), intent(in) :: list\n integer :: s\n s = list%vol\n return\n end function size_of_list\nend module mod_t_list\nmodule mod_t_priority_queue\n use mod_t_item\n use mod_t_list\n implicit none\n type :: t_heap\n type(t_list) :: list\n end type t_heap\n private\n public :: t_heap, init_heap, release_heap, push, pop, size_of_heap\ncontains\n subroutine init_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call init_list(heap%list)\n return\n end subroutine init_heap\n subroutine release_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call release_list(heap%list)\n return\n end subroutine release_heap\n subroutine push(heap,item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item), intent(in) :: item\n integer :: n, i\n call push_back(heap%list,item)\n n = heap%list%vol\n do while (n.gt.1)\n i = n/2\n if (compare(heap%list%arr(n),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(n),heap%list%arr(i))\n end if\n n = i\n end do\n return\n end subroutine push\n function pop(heap) result(item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item) :: item, tmp\n integer :: n, i, j\n n = heap%list%vol\n item = heap%list%arr(1)\n heap%list%arr(1) = heap%list%arr(n)\n tmp = pop_back(heap%list)\n i = 1\n do while (2*i.lt.n)\n j = 2*i\n if ((j.lt.n-1).and.(compare(heap%list%arr(j+1),heap%list%arr(j)).lt.0_8)) then\n j = j+1\n end if\n if (compare(heap%list%arr(j),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(j),heap%list%arr(i))\n end if\n i = j\n end do\n return\n end function pop\n function size_of_heap(heap) result(s)\n implicit none\n type(t_heap), intent(in) :: heap\n integer :: s\n s = size_of_list(heap%list)\n return\n end function size_of_heap\nend module mod_t_priority_queue\nmodule mod_t_graph\n use mod_t_item\n use mod_t_list\n use mod_t_priority_queue\n implicit none\n integer, parameter :: infty = 1000000000\n type :: t_graph\n type(t_list), pointer :: edges(:)\n end type t_graph\n private\n public :: infty\n public :: t_graph, init_graph, release_graph, add_edge, add, dijkstra\ncontains\n subroutine init_graph(graph,n)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: n\n integer :: i\n allocate(graph%edges(n))\n do i = 1, n\n call init_list(graph%edges(i))\n end do\n return\n end subroutine init_graph\n subroutine release_graph(graph)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer :: n, i\n if (.not.associated(graph%edges)) return\n n = size(graph%edges)\n do i = 1, n\n call release_list(graph%edges(i))\n end do\n deallocate(graph%edges)\n return\n end subroutine release_graph\n subroutine add_edge(graph,i,edge)\n implicit none\n type(t_graph), intent(inout) :: graph\n type(t_item), intent(in) :: edge\n integer, intent(in) :: i\n call push_back(graph%edges(i),edge)\n return\n end subroutine add_edge\n subroutine add(graph,i,pos,cost)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: i, pos, cost\n call push_back(graph%edges(i),itemize(pos,cost))\n return\n end subroutine add\n function dijkstra(graph,start) result(c)\n implicit none\n type(t_graph), intent(in) :: graph\n integer, intent(in) :: start\n type(t_heap) :: pq\n type(t_item) :: now, next\n integer :: n, i, c(size(graph%edges))\n n = size(graph%edges)\n c = infty\n call init_heap(pq)\n c(start) = 0\n call push(pq,itemize(start,c(start)))\n do while (size_of_heap(pq).gt.0)\n now = pop(pq)\n if (now%cost.gt.c(now%pos)) cycle\n do i = 1, size_of_list(graph%edges(now%pos))\n next = get_at(graph%edges(now%pos),i)\n if (c(next%pos).gt.c(now%pos)+next%cost) then\n c(next%pos) = c(now%pos)+next%cost\n call push(pq,itemize(next%pos,c(next%pos)))\n end if\n end do\n end do\n call release_heap(pq)\n return\n end function dijkstra\nend module mod_t_graph\nprogram shorten_diameter\n use mod_t_graph\n implicit none\n type(t_graph) :: tree\n integer :: n, k, a(2000), b(2000), d(2000,2000), m, i, j, s\n a = 0\n b = 0\n d = 0\n read(*,*) n, k\n call init_graph(tree,n)\n do i = 1, n-1\n read(*,*) a(i), b(i)\n call add(tree,a(i),b(i),1)\n call add(tree,b(i),a(i),1)\n end do\n do i = 1, n\n d(i,1:n) = dijkstra(tree,i)\n end do\n m = 1000000000\n if (mod(k,2).eq.0) then\n do i = 1, n\n s = 0\n do j = 1, n\n if (d(i,j).gt.k/2) s = s+1\n end do\n m = min(m,s)\n end do\n else\n do i = 1, n-1\n s = 0\n do j = 1, n\n if (d(a(i),j)+d(b(i),j).gt.k) s = s+1\n end do\n m = min(m,s)\n end do\n end if\n write(*,'(i0)') m\n call release_graph(tree)\n stop\nend program shorten_diameter", "language": "Fortran", "metadata": {"date": 1561837981, "filename_ext": "f", "original_language": "Fortran (gfortran v4.8.4)", "problem_description_relpath": "problem_descriptions/p04049.html", "problem_id": "p04049", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04049/input.txt", "sample_output_relpath": "derived/input_output/data/p04049/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04049/Fortran/s424013739.f", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424013739", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module mod_t_item\n implicit none\n type :: t_item\n integer :: pos, cost\n end type t_item\n private\n public :: t_item, itemize, compare, swap\ncontains\n function itemize(pos,cost) result(i)\n implicit none\n integer :: pos, cost\n type(t_item) :: i\n i%pos = pos\n i%cost = cost\n return\n end function itemize\n function compare(i1,i2) result(c)\n implicit none\n type(t_item), intent(in) :: i1, i2\n integer :: c\n c = i1%cost-i2%cost\n return\n end function compare\n subroutine swap(i1,i2)\n implicit none\n type(t_item), intent(inout) :: i1, i2\n type(t_item) :: i\n i = i1\n i1 = i2\n i2 = i\n return\n end subroutine swap\nend module mod_t_item\nmodule mod_t_list\n use mod_t_item\n implicit none\n type :: t_list\n integer :: vol\n type(t_item), pointer :: arr(:)\n end type t_list\n private\n public :: t_list, init_list, release_list,push_back\n public :: pop_back, get_at, size_of_list\ncontains\n subroutine init_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n list%vol = 0\n allocate(list%arr(1))\n return\n end subroutine init_list\n subroutine release_list(list)\n implicit none\n type(t_list), intent(inout) :: list\n if (associated(list%arr)) deallocate(list%arr)\n return\n end subroutine release_list\n subroutine push_back(list,item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item), intent(in) :: item\n type(t_item), allocatable :: tmp(:)\n if (size(list%arr).eq.list%vol) then\n allocate(tmp(list%vol))\n tmp = list%arr\n deallocate(list%arr)\n allocate(list%arr(2*list%vol))\n list%arr(1:list%vol) = tmp\n deallocate(tmp)\n end if\n list%vol = list%vol+1\n list%arr(list%vol) = item\n return\n end subroutine push_back\n function pop_back(list) result(item)\n implicit none\n type(t_list), intent(inout) :: list\n type(t_item) :: item\n item = list%arr(list%vol)\n list%vol = list%vol-1\n return\n end function pop_back\n function get_at(list,i) result(item)\n implicit none\n type(t_list), intent(in) :: list\n integer, intent(in) :: i\n type(t_item) :: item\n item = list%arr(i)\n return\n end function get_at\n function size_of_list(list) result(s)\n implicit none\n type(t_list), intent(in) :: list\n integer :: s\n s = list%vol\n return\n end function size_of_list\nend module mod_t_list\nmodule mod_t_priority_queue\n use mod_t_item\n use mod_t_list\n implicit none\n type :: t_heap\n type(t_list) :: list\n end type t_heap\n private\n public :: t_heap, init_heap, release_heap, push, pop, size_of_heap\ncontains\n subroutine init_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call init_list(heap%list)\n return\n end subroutine init_heap\n subroutine release_heap(heap)\n implicit none\n type(t_heap), intent(inout) :: heap\n call release_list(heap%list)\n return\n end subroutine release_heap\n subroutine push(heap,item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item), intent(in) :: item\n integer :: n, i\n call push_back(heap%list,item)\n n = heap%list%vol\n do while (n.gt.1)\n i = n/2\n if (compare(heap%list%arr(n),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(n),heap%list%arr(i))\n end if\n n = i\n end do\n return\n end subroutine push\n function pop(heap) result(item)\n implicit none\n type(t_heap), intent(inout) :: heap\n type(t_item) :: item, tmp\n integer :: n, i, j\n n = heap%list%vol\n item = heap%list%arr(1)\n heap%list%arr(1) = heap%list%arr(n)\n tmp = pop_back(heap%list)\n i = 1\n do while (2*i.lt.n)\n j = 2*i\n if ((j.lt.n-1).and.(compare(heap%list%arr(j+1),heap%list%arr(j)).lt.0_8)) then\n j = j+1\n end if\n if (compare(heap%list%arr(j),heap%list%arr(i)).lt.0_8) then\n call swap(heap%list%arr(j),heap%list%arr(i))\n end if\n i = j\n end do\n return\n end function pop\n function size_of_heap(heap) result(s)\n implicit none\n type(t_heap), intent(in) :: heap\n integer :: s\n s = size_of_list(heap%list)\n return\n end function size_of_heap\nend module mod_t_priority_queue\nmodule mod_t_graph\n use mod_t_item\n use mod_t_list\n use mod_t_priority_queue\n implicit none\n integer, parameter :: infty = 1000000000\n type :: t_graph\n type(t_list), pointer :: edges(:)\n end type t_graph\n private\n public :: infty\n public :: t_graph, init_graph, release_graph, add_edge, add, dijkstra\ncontains\n subroutine init_graph(graph,n)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: n\n integer :: i\n allocate(graph%edges(n))\n do i = 1, n\n call init_list(graph%edges(i))\n end do\n return\n end subroutine init_graph\n subroutine release_graph(graph)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer :: n, i\n if (.not.associated(graph%edges)) return\n n = size(graph%edges)\n do i = 1, n\n call release_list(graph%edges(i))\n end do\n deallocate(graph%edges)\n return\n end subroutine release_graph\n subroutine add_edge(graph,i,edge)\n implicit none\n type(t_graph), intent(inout) :: graph\n type(t_item), intent(in) :: edge\n integer, intent(in) :: i\n call push_back(graph%edges(i),edge)\n return\n end subroutine add_edge\n subroutine add(graph,i,pos,cost)\n implicit none\n type(t_graph), intent(inout) :: graph\n integer, intent(in) :: i, pos, cost\n call push_back(graph%edges(i),itemize(pos,cost))\n return\n end subroutine add\n function dijkstra(graph,start) result(c)\n implicit none\n type(t_graph), intent(in) :: graph\n integer, intent(in) :: start\n type(t_heap) :: pq\n type(t_item) :: now, next\n integer :: n, i, c(size(graph%edges))\n n = size(graph%edges)\n c = infty\n call init_heap(pq)\n c(start) = 0\n call push(pq,itemize(start,c(start)))\n do while (size_of_heap(pq).gt.0)\n now = pop(pq)\n if (now%cost.gt.c(now%pos)) cycle\n do i = 1, size_of_list(graph%edges(now%pos))\n next = get_at(graph%edges(now%pos),i)\n if (c(next%pos).gt.c(now%pos)+next%cost) then\n c(next%pos) = c(now%pos)+next%cost\n call push(pq,itemize(next%pos,c(next%pos)))\n end if\n end do\n end do\n call release_heap(pq)\n return\n end function dijkstra\nend module mod_t_graph\nprogram shorten_diameter\n use mod_t_graph\n implicit none\n type(t_graph) :: tree\n integer :: n, k, a(2000), b(2000), d(2000,2000), m, i, j, s\n a = 0\n b = 0\n d = 0\n read(*,*) n, k\n call init_graph(tree,n)\n do i = 1, n-1\n read(*,*) a(i), b(i)\n call add(tree,a(i),b(i),1)\n call add(tree,b(i),a(i),1)\n end do\n do i = 1, n\n d(i,1:n) = dijkstra(tree,i)\n end do\n m = 1000000000\n if (mod(k,2).eq.0) then\n do i = 1, n\n s = 0\n do j = 1, n\n if (d(i,j).gt.k/2) s = s+1\n end do\n m = min(m,s)\n end do\n else\n do i = 1, n-1\n s = 0\n do j = 1, n\n if (d(a(i),j)+d(b(i),j).gt.k) s = s+1\n end do\n m = min(m,s)\n end do\n end if\n write(*,'(i0)') m\n call release_graph(tree)\n stop\nend program shorten_diameter", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven an undirected tree, let the distance between vertices u and v be the\nnumber of edges on the simple path from u to v.\nThe diameter of a tree is the maximum among the distances between any two vertices.\nWe will call a tree good if and only if its diameter is at most K.\n\nYou are given an undirected tree with N vertices numbered 1 through N.\nFor each i (1≦i≦N-1), there is an edge connecting vertices A_i and B_i.\n\nYou want to remove zero or more vertices from the tree, so that the resulting tree is good.\nWhen a vertex is removed, all incident edges will also be removed.\nThe resulting graph must be connected.\n\nFind the minimum number of vertices that you need to remove in order to produce a good tree.\n\nConstraints\n\n2≦N≦2000\n\n1≦K≦N-1\n\n1≦A_i≦N, 1≦B_i≦N\n\nThe graph defined by A_i and B_i is a tree.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nA_1 B_1\nA_2 B_2\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the minimum number of vertices that you need to remove in order to produce a good tree.\n\nSample Input 1\n\n6 2\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 1\n\n2\n\nThe tree is shown below. Removing vertices 5 and 6 will result in a good tree with the diameter of 2.\n\nSample Input 2\n\n6 5\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 2\n\n0\n\nSince the given tree is already good, you do not need to remove any vertex.", "sample_input": "6 2\n1 2\n3 2\n4 2\n1 6\n5 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04049", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven an undirected tree, let the distance between vertices u and v be the\nnumber of edges on the simple path from u to v.\nThe diameter of a tree is the maximum among the distances between any two vertices.\nWe will call a tree good if and only if its diameter is at most K.\n\nYou are given an undirected tree with N vertices numbered 1 through N.\nFor each i (1≦i≦N-1), there is an edge connecting vertices A_i and B_i.\n\nYou want to remove zero or more vertices from the tree, so that the resulting tree is good.\nWhen a vertex is removed, all incident edges will also be removed.\nThe resulting graph must be connected.\n\nFind the minimum number of vertices that you need to remove in order to produce a good tree.\n\nConstraints\n\n2≦N≦2000\n\n1≦K≦N-1\n\n1≦A_i≦N, 1≦B_i≦N\n\nThe graph defined by A_i and B_i is a tree.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nA_1 B_1\nA_2 B_2\n:\nA_{N-1} B_{N-1}\n\nOutput\n\nPrint the minimum number of vertices that you need to remove in order to produce a good tree.\n\nSample Input 1\n\n6 2\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 1\n\n2\n\nThe tree is shown below. Removing vertices 5 and 6 will result in a good tree with the diameter of 2.\n\nSample Input 2\n\n6 5\n1 2\n3 2\n4 2\n1 6\n5 6\n\nSample Output 2\n\n0\n\nSince the given tree is already good, you do not need to remove any vertex.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7164, "cpu_time_ms": 440, "memory_kb": 16256}, "variant": "low_resource"}